Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919909
details
property
value
status
complete
benchmark
occur.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n056.star.cs.uiowa.edu
space
talp_maria
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.91081809998 seconds
cpu usage
4.62990093
max memory
3.34647296E8
stage attributes
key
value
output-size
69696
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- Graph construction failed Graph construction failed Graph construction failed YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern occurall(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) IfThenElseTransformerProof [EQUIVALENT, 0 ms] (2) Prolog (3) CallTransformerProof [EQUIVALENT, 0 ms] (4) Prolog (5) CutEliminatorProof [SOUND, 0 ms] (6) Prolog (7) UnifyTransformerProof [EQUIVALENT, 0 ms] (8) Prolog (9) UndefinedPredicateHandlerProof [SOUND, 0 ms] (10) Prolog (11) PrologToPiTRSProof [SOUND, 21 ms] (12) PiTRS (13) DependencyPairsProof [EQUIVALENT, 16 ms] (14) PiDP (15) DependencyGraphProof [EQUIVALENT, 0 ms] (16) AND (17) PiDP (18) UsableRulesProof [EQUIVALENT, 0 ms] (19) PiDP (20) PiDPToQDPProof [SOUND, 0 ms] (21) QDP (22) QDPSizeChangeProof [EQUIVALENT, 0 ms] (23) YES (24) PiDP (25) UsableRulesProof [EQUIVALENT, 0 ms] (26) PiDP (27) PiDPToQDPProof [SOUND, 0 ms] (28) QDP (29) QDPSizeChangeProof [EQUIVALENT, 0 ms] (30) YES (31) PiDP (32) UsableRulesProof [EQUIVALENT, 0 ms] (33) PiDP (34) PiDPToQDPProof [SOUND, 5 ms] (35) QDP (36) QDPSizeChangeProof [EQUIVALENT, 0 ms] (37) YES ---------------------------------------- (0) Obligation: Clauses: occur(X, [], 0). occur(X, .(Y, Z), W) :- ->(','(count(X, Y, A), occur(X, Z, B)), is(W, +(A, B))). count(X, [], 0). count(X, .(Y, Z), W) :- ->(count(X, Z, W1), addx(X, Y, W1, W)). addx(X, X, W1, W) :- is(W, +(W1, 1)). addx(X, Y, W1, W1) :- =\=(X, Y). occurall([], X, []). occurall(.(X, Y), Z, .(.(X, .(W, [])), V)) :- ','(occur(X, Z, W), occurall(Y, Z, V)). get_query(X, Y) :- ','(=(X, .(5, .(3, .(6, .(7, .(2, .(1, .(4, .(11, .(8, [])))))))))), =(Y, .(.(3, .(4, .(5, .(6, .(7, .(6, .(5, .(4, .(5, .(6, .(5, .(4, .(3, .(5, .(6, .(2, .(3, .(4, .(5, []))))))))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(13, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, .(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, [])))))))))))))))))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, .(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, [])))))))))))))))))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, []))))))))))))))))), .(.(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, []))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .([], .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, []))))))))))))))))), .(.(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, []))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, []))))))))))))))))), .(.(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, []))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(5, []), .(.(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, []))))))))))))))))))))))))), []))))))))))))))))))))))))))))). Query: occurall(g,g,a) ---------------------------------------- (1) IfThenElseTransformerProof (EQUIVALENT) Transformed all if-then-else-constructs [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: occur(X, [], 0). occur(X, .(Y, Z), W) :- if(X, Y, A, Z, B, W). count(X, [], 0). count(X, .(Y, Z), W) :- if1(X, Z, W1, Y, W). addx(X, X, W1, W) :- is(W, +(W1, 1)). addx(X, Y, W1, W1) :- =\=(X, Y). occurall([], X, []). occurall(.(X, Y), Z, .(.(X, .(W, [])), V)) :- ','(occur(X, Z, W), occurall(Y, Z, V)). get_query(X, Y) :- ','(=(X, .(5, .(3, .(6, .(7, .(2, .(1, .(4, .(11, .(8, [])))))))))), =(Y, .(.(3, .(4, .(5, .(6, .(7, .(6, .(5, .(4, .(5, .(6, .(5, .(4, .(3, .(5, .(6, .(2, .(3, .(4, .(5, []))))))))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(13, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, .(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, [])))))))))))))))))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, .(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, [])))))))))))))))))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, []))))))))))))))))), .(.(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, []))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .([], .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, []))))))))))))))))), .(.(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, []))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(3, .(4, [])), .(.(4, .(5, .(5, .(5, .(5, []))))), .(.(1, .(2, .(3, .(4, .(5, .(6, .(7, .(8, .(7, .(6, .(5, .(4, .(5, .(6, .(7, .(6, .(5, []))))))))))))))))), .(.(5, .(5, .(5, .(4, .(5, .(5, .(5, .(6, .(6, .(6, .(5, .(5, .(4, []))))))))))))), .(.(1, .(2, .(2, .(2, .(1, .(1, .(3, .(2, .(3, .(2, .(3, .(3, .(3, []))))))))))))), .(.(5, []), .(.(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, .(1, []))))))))))))))))))))))))), []))))))))))))))))))))))))))))). if(X, Y, A, Z, B, W) :- ','(call(','(count(X, Y, A), occur(X, Z, B))), ','(!, is(W, +(A, B)))). if1(X, Z, W1, Y, W) :- ','(call(count(X, Z, W1)), ','(!, addx(X, Y, W1, W))).
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030