Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919887
details
property
value
status
complete
benchmark
btree2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.26671791077 seconds
cpu usage
4.874381451
max memory
3.83479808E8
stage attributes
key
value
output-size
278199
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern goal(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 129 ms] (2) TRIPLES (3) UndefinedPredicateInTriplesTransformerProof [SOUND, 0 ms] (4) TRIPLES (5) TriplesToPiDPProof [SOUND, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) PiDP (9) PiDPToQDPProof [SOUND, 2 ms] (10) QDP (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] (12) YES ---------------------------------------- (0) Obligation: Clauses: goal(X) :- ','(s2t(X, T), tree(T)). tree(nil). tree(X) :- ','(no(empty(X)), ','(left(T, L), ','(right(T, R), ','(tree(L), tree(R))))). s2t(0, nil). s2t(X, node(T, X1, T)) :- ','(no(zero(X)), ','(p(X, P), s2t(P, T))). s2t(X, node(nil, X2, T)) :- ','(no(zero(X)), ','(p(X, P), s2t(P, T))). s2t(X, node(T, X3, nil)) :- ','(no(zero(X)), ','(p(X, P), s2t(P, T))). s2t(X, node(nil, X4, nil)) :- no(zero(X)). left(nil, nil). left(node(L, X5, X6), L). right(nil, nil). right(node(X7, X8, R), R). p(0, 0). p(s(X), X). empty(nil). zero(0). no(X) :- ','(X, ','(!, failure(a))). no(X9). failure(b). Query: goal(g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 7, "program": { "directives": [], "clauses": [ [ "(goal X)", "(',' (s2t X T) (tree T))" ], [ "(tree (nil))", null ], [ "(tree X)", "(',' (no (empty X)) (',' (left T L) (',' (right T R) (',' (tree L) (tree R)))))" ], [ "(s2t (0) (nil))", null ], [ "(s2t X (node T X1 T))", "(',' (no (zero X)) (',' (p X P) (s2t P T)))" ], [ "(s2t X (node (nil) X2 T))", "(',' (no (zero X)) (',' (p X P) (s2t P T)))" ], [ "(s2t X (node T X3 (nil)))", "(',' (no (zero X)) (',' (p X P) (s2t P T)))" ], [ "(s2t X (node (nil) X4 (nil)))",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030