details

property	value
status	complete
benchmark	append3-bis.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	terminweb_old

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.81637 seconds
cpu usage	3.92854
user time	3.74927
system time	0.179269
max virtual memory	1.8481808E7
max residence set size	290352.0

stage attributes

key	value
starexec-result	YES

output

3.80/1.78 YES 3.80/1.80 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 3.80/1.80 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 3.80/1.80 3.80/1.80 3.80/1.80 Left Termination of the query pattern 3.80/1.80 3.80/1.80 app3_b(g,g,g,a) 3.80/1.80 3.80/1.80 w.r.t. the given Prolog program could successfully be proven: 3.80/1.80 3.80/1.80 (0) Prolog 3.80/1.80 (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] 3.80/1.80 (2) TRIPLES 3.80/1.80 (3) TriplesToPiDPProof [SOUND, 0 ms] 3.80/1.80 (4) PiDP 3.80/1.80 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 3.80/1.80 (6) PiDP 3.80/1.80 (7) UsableRulesProof [EQUIVALENT, 0 ms] 3.80/1.80 (8) PiDP 3.80/1.80 (9) PiDPToQDPProof [SOUND, 0 ms] 3.80/1.80 (10) QDP 3.80/1.80 (11) QDPSizeChangeProof [EQUIVALENT, 0 ms] 3.80/1.80 (12) YES 3.80/1.80 3.80/1.80 3.80/1.80 ---------------------------------------- 3.80/1.80 3.80/1.80 (0) 3.80/1.80 Obligation: 3.80/1.80 Clauses: 3.80/1.80 3.80/1.80 app3_a(Xs, Ys, Zs, Us) :- ','(app(Xs, Ys, Vs), app(Vs, Zs, Us)). 3.80/1.80 app3_b(Xs, Ys, Zs, Us) :- ','(app(Ys, Zs, Vs), app(Xs, Vs, Us)). 3.80/1.80 app([], Ys, Ys). 3.80/1.80 app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs). 3.80/1.80 3.80/1.80 3.80/1.80 Query: app3_b(g,g,g,a) 3.80/1.80 ---------------------------------------- 3.80/1.80 3.80/1.80 (1) PrologToDTProblemTransformerProof (SOUND) 3.80/1.80 Built DT problem from termination graph DT10. 3.80/1.80 3.80/1.80 { 3.80/1.80 "root": 1, 3.80/1.80 "program": { 3.80/1.80 "directives": [], 3.80/1.80 "clauses": [ 3.80/1.80 [ 3.80/1.80 "(app3_a Xs Ys Zs Us)", 3.80/1.80 "(',' (app Xs Ys Vs) (app Vs Zs Us))" 3.80/1.80 ], 3.80/1.80 [ 3.80/1.80 "(app3_b Xs Ys Zs Us)", 3.80/1.80 "(',' (app Ys Zs Vs) (app Xs Vs Us))" 3.80/1.80 ], 3.80/1.80 [ 3.80/1.80 "(app ([]) Ys Ys)", 3.80/1.80 null 3.80/1.80 ], 3.80/1.80 [ 3.80/1.80 "(app (. X Xs) Ys (. X Zs))", 3.80/1.80 "(app Xs Ys Zs)" 3.80/1.80 ] 3.80/1.80 ] 3.80/1.80 }, 3.80/1.80 "graph": { 3.80/1.80 "nodes": { 3.80/1.80 "160": { 3.80/1.80 "goal": [{ 3.80/1.80 "clause": 2, 3.80/1.80 "scope": 2, 3.80/1.80 "term": "(',' (app T10 T11 X9) (app T9 X9 T13))" 3.80/1.80 }], 3.80/1.80 "kb": { 3.80/1.80 "nonunifying": [], 3.80/1.80 "intvars": {}, 3.80/1.80 "arithmetic": { 3.80/1.80 "type": "PlainIntegerRelationState", 3.80/1.80 "relations": [] 3.80/1.80 }, 3.80/1.80 "ground": [ 3.80/1.80 "T9", 3.80/1.80 "T10", 3.80/1.80 "T11" 3.80/1.80 ], 3.80/1.80 "free": ["X9"], 3.80/1.80 "exprvars": [] 3.80/1.80 } 3.80/1.80 }, 3.80/1.80 "type": "Nodes", 3.80/1.80 "162": { 3.80/1.80 "goal": [{ 3.80/1.80 "clause": 3, 3.80/1.80 "scope": 2, 3.80/1.80 "term": "(',' (app T10 T11 X9) (app T9 X9 T13))" 3.80/1.80 }], 3.80/1.80 "kb": { 3.80/1.80 "nonunifying": [], popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic_Programming 2019-04-02 08.22