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