details

property	value
status	complete
benchmark	sat.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n070.star.cs.uiowa.edu
space	TCT_12

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.81489 seconds
cpu usage	4.13399
user time	3.96368
system time	0.170304
max virtual memory	1.8408912E7
max residence set size	258580.0

stage attributes

key	value
starexec-result	YES

output

YES proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Termination w.r.t. Q of the given QTRS could be proven: (0) QTRS (1) QTRSRRRProof [EQUIVALENT, 139 ms] (2) QTRS (3) QTRSRRRProof [EQUIVALENT, 0 ms] (4) QTRS (5) RisEmptyProof [EQUIVALENT, 0 ms] (6) YES ---------------------------------------- (0) Obligation: Q restricted rewrite system: The TRS R consists of the following rules: if(true, t, e) -> t if(false, t, e) -> e member(x, nil) -> false member(x, cons(y, ys)) -> if(eq(x, y), true, member(x, ys)) eq(nil, nil) -> true eq(O(x), 0(y)) -> eq(x, y) eq(0(x), 1(y)) -> false eq(1(x), 0(y)) -> false eq(1(x), 1(y)) -> eq(x, y) negate(0(x)) -> 1(x) negate(1(x)) -> 0(x) choice(cons(x, xs)) -> x choice(cons(x, xs)) -> choice(xs) guess(nil) -> nil guess(cons(clause, cnf)) -> cons(choice(clause), guess(cnf)) verify(nil) -> true verify(cons(l, ls)) -> if(member(negate(l), ls), false, verify(ls)) sat(cnf) -> satck(cnf, guess(cnf)) satck(cnf, assign) -> if(verify(assign), assign, unsat) Q is empty. ---------------------------------------- (1) QTRSRRRProof (EQUIVALENT) Used ordering: if/3(YES,YES,YES) true/0) false/0) member/2(YES,YES) nil/0) cons/2(YES,YES) eq/2(YES,YES) O/1)YES( 0/1(YES) 1/1)YES( negate/1(YES) choice/1)YES( guess/1)YES( verify/1)YES( sat/1(YES) satck/2(YES,YES) unsat/0) Quasi precedence: [true, false, nil, cons_2, 0_1, negate_1] > member_2 > eq_2 > if_3 sat_1 > [satck_2, unsat] > if_3 Status: if_3: multiset status true: multiset status false: multiset status member_2: [1,2] nil: multiset status cons_2: [1,2] eq_2: [2,1] 0_1: [1] negate_1: [1] sat_1: [1] satck_2: [2,1] unsat: multiset status With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly: if(true, t, e) -> t if(false, t, e) -> e member(x, nil) -> false member(x, cons(y, ys)) -> if(eq(x, y), true, member(x, ys)) eq(nil, nil) -> true eq(O(x), 0(y)) -> eq(x, y) eq(0(x), 1(y)) -> false eq(1(x), 0(y)) -> false negate(0(x)) -> 1(x) choice(cons(x, xs)) -> x choice(cons(x, xs)) -> choice(xs) verify(cons(l, ls)) -> if(member(negate(l), ls), false, verify(ls)) popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard