Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919647
details
property
value
status
complete
benchmark
hanoiapp.suc.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
talp_mixed
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.93281507492 seconds
cpu usage
8.592436114
max memory
7.34302208E8
stage attributes
key
value
output-size
46754
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 shanoi(g,g,g,g,a) 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) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) PiDPToQDPProof [SOUND, 0 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 88 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) TRUE ---------------------------------------- (0) Obligation: Clauses: shanoi(s(0), A, B, C, .(mv(A, C), [])). shanoi(s(s(X)), A, B, C, M) :- ','(eq(N1, s(X)), ','(shanoi(N1, A, C, B, M1), ','(shanoi(N1, B, A, C, M2), ','(append(M1, .(mv(A, C), []), T), append(T, M2, M))))). append([], L, L). append(.(H, L), L1, .(H, R)) :- append(L, L1, R). eq(X, X). Query: shanoi(g,g,g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(shanoi (s (0)) A B C (. (mv A C) ([])))", null ], [ "(shanoi (s (s X)) A B C M)", "(',' (eq N1 (s X)) (',' (shanoi N1 A C B M1) (',' (shanoi N1 B A C M2) (',' (append M1 (. (mv A C) ([])) T) (append T M2 M)))))" ], [ "(append ([]) L L)", null ], [ "(append (. H L) L1 (. H R))", "(append L L1 R)" ], [ "(eq X X)", null ] ] }, "graph": { "nodes": { "29": { "goal": [ { "clause": 0, "scope": 1, "term": "(shanoi T1 T2 T3 T4 T5)" }, { "clause": 1, "scope": 1, "term": "(shanoi T1 T2 T3 T4 T5)" }
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030