Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920174
details
property
value
status
complete
benchmark
btapplast.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
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.32634115219 seconds
cpu usage
9.662644352
max memory
8.59295744E8
stage attributes
key
value
output-size
272507
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,a,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 218 ms] (2) AND (3) IRSwT (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (5) TRUE (6) IRSwT (7) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (8) TRUE (9) IRSwT (10) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (11) TRUE (12) IRSwT (13) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (14) IRSwT (15) IntTRSCompressionProof [EQUIVALENT, 32 ms] (16) IRSwT (17) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (18) IRSwT (19) IRSwTTerminationDigraphProof [EQUIVALENT, 6 ms] (20) IRSwT (21) TempFilterProof [SOUND, 4 ms] (22) IRSwT (23) IRSwTToQDPProof [SOUND, 0 ms] (24) QDP (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] (26) YES ---------------------------------------- (0) Obligation: Clauses: goal(A, B, C) :- ','(s2t(A, T), tapplast(T, B, C)). tapplast(L, X, Last) :- ','(tappend(L, node(nil, X, nil), LX), tlast(Last, LX)). tlast(X, node(nil, X, nil)). tlast(X, node(L, X1, X2)) :- tlast(X, L). tlast(X, node(X3, X4, R)) :- tlast(X, R). tappend(nil, Y, Z) :- ','(!, eq(Y, Z)). tappend(T, T1, node(T1, X, T2)) :- ','(left(T, nil), ','(right(T, T2), value(T, X))). tappend(T, T2, node(T1, X, T2)) :- ','(left(T, T1), ','(right(T, nil), value(T, X))). tappend(T, T3, node(U, X, T2)) :- ','(left(T, T1), ','(right(T, T2), ','(value(T, X), tappend(T1, T3, U)))). tappend(T, T1, node(T1, X, U)) :- ','(left(T, T1), ','(right(T, T2), ','(value(T, X), tappend(T2, T3, U)))). s2t(0, L) :- ','(!, eq(L, nil)). s2t(X, node(T, X5, T)) :- ','(p(X, P), s2t(P, T)). s2t(X, node(nil, X6, T)) :- ','(p(X, P), s2t(P, T)). s2t(X, node(T, X7, nil)) :- ','(p(X, P), s2t(P, T)). s2t(X, node(nil, X8, nil)). left(nil, nil). left(node(L, X9, X10), L). right(nil, nil). right(node(X11, X12, R), R). value(nil, nil). value(node(X13, X, X14), X). p(0, 0). p(s(X), X). eq(X, X). Query: goal(g,a,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(goal A B C)", "(',' (s2t A T) (tapplast T B C))" ], [ "(tapplast L X Last)", "(',' (tappend L (node (nil) X (nil)) LX) (tlast Last LX))" ], [ "(tlast X (node (nil) X (nil)))", null
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030