details

property	value
status	complete
benchmark	boyer.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n040.star.cs.uiowa.edu
space	talp_maria

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.99863481522 seconds
cpu usage	4.67033124
max memory	2.95145472E8

stage attributes

key	value
output-size	180253
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Graph construction failed Graph construction failed Graph construction failed MAYBE proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern tautology(g) w.r.t. the given Prolog program could not be shown: (0) Prolog (1) CutEliminatorProof [SOUND, 0 ms] (2) Prolog (3) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (4) Prolog (5) CallTransformerProof [EQUIVALENT, 0 ms] (6) Prolog (7) CutEliminatorProof [SOUND, 0 ms] (8) Prolog (9) FailTransformerProof [EQUIVALENT, 0 ms] (10) Prolog (11) UnifyTransformerProof [EQUIVALENT, 0 ms] (12) Prolog (13) OrTransformerProof [EQUIVALENT, 0 ms] (14) Prolog (15) UndefinedPredicateHandlerProof [SOUND, 0 ms] (16) Prolog (17) IntegerArithmeticTransformerProof [SOUND, 0 ms] (18) Prolog (19) CutEliminatorProof [SOUND, 0 ms] (20) Prolog (21) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (22) Prolog (23) CallTransformerProof [EQUIVALENT, 0 ms] (24) Prolog (25) CutEliminatorProof [SOUND, 0 ms] (26) Prolog (27) FailTransformerProof [EQUIVALENT, 0 ms] (28) Prolog (29) UnifyTransformerProof [EQUIVALENT, 0 ms] (30) Prolog (31) OrTransformerProof [EQUIVALENT, 0 ms] (32) Prolog (33) UndefinedPredicateHandlerProof [SOUND, 0 ms] (34) Prolog ---------------------------------------- (0) Obligation: Clauses: tautology(Wff) :- ','(write('rewriting...'), ','(nl, ','(rewrite(Wff, NewWff), ','(write('proving...'), ','(nl, tautology(NewWff, [], [])))))). tautology(Wff, Tlist, Flist) :- ','(;(;(->(truep(Wff, Tlist), true), ->(falsep(Wff, Flist), fail)), ->(=(Wff, if(If, Then, Else)), ;(;(->(truep(If, Tlist), tautology(Then, Tlist, Flist)), ->(falsep(If, Flist), tautology(Else, Tlist, Flist))), ','(tautology(Then, .(If, Tlist), Flist), tautology(Else, Tlist, .(If, Flist)))))), !). rewrite(Atom, Atom) :- ','(atomic(Atom), !). rewrite(Old, New) :- ','(functor(Old, F, N), ','(functor(Mid, F, N), ','(rewrite_args(N, Old, Mid), ','(;(->(equal(Mid, Next), rewrite(Next, New)), =(New, Mid)), !)))). rewrite_args(0, X1, X2) :- !. rewrite_args(N, Old, Mid) :- ','(arg(N, Old, OldArg), ','(arg(N, Mid, MidArg), ','(rewrite(OldArg, MidArg), ','(is(N1, -(N, 1)), rewrite_args(N1, Old, Mid))))). truep(t, X3) :- !. truep(Wff, Tlist) :- member(Wff, Tlist). falsep(f, X4) :- !. falsep(Wff, Flist) :- member(Wff, Flist). member(X, .(X, X5)) :- !. member(X, .(X6, T)) :- member(X, T). equal(and(P, Q), if(P, if(Q, t, f), f)). equal(append(append(X, Y), Z), append(X, append(Y, Z))). equal(assignment(X, append(A, B)), if(assignedp(X, A), assignment(X, A), assignment(X, B))). equal(assume_false(Var, Alist), cons(cons(Var, f), Alist)). equal(assume_true(Var, Alist), cons(cons(Var, t), Alist)). equal(boolean(X), or(equal(X, t), equal(X, f))). equal(car(gopher(X)), if(listp(X), car(flatten(X)), zero)). equal(compile(Form), reverse(codegen(optimize(Form), []))). equal(count_list(Z, sort_lp(X, Y)), plus(count_list(Z, X), count_list(Z, Y))). equal(countps_(L, Pred), countps_loop(L, Pred, zero)). equal(difference(A, B), C) :- difference(A, B, C). equal(divides(X, Y), zerop(remainder(Y, X))). equal(dsort(X), sort2(X)). equal(eqp(X, Y), equal(fix(X), fix(Y))). equal(equal(A, B), C) :- eq(A, B, C). equal(even1(X), if(zerop(X), t, odd(decr(X)))). equal(exec(append(X, Y), Pds, Envrn), exec(Y, exec(X, Pds, Envrn), Envrn)). equal(exp(A, B), C) :- exp(A, B, C). equal(fact_(I), fact_loop(I, 1)). equal(falsify(X), falsify1(normalize(X), [])). equal(fix(X), if(numberp(X), X, zero)). equal(flatten(cdr(gopher(X))), if(listp(X), cdr(flatten(X)), cons(zero, []))). equal(gcd(A, B), C) :- gcd(A, B, C). equal(get(J, set(I, Val, Mem)), if(eqp(J, I), Val, get(J, Mem))). equal(greatereqp(X, Y), not(lessp(X, Y))). popout

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

job log

popout

actions

all output return to Logic Progr 19030