details

property	value
status	complete
benchmark	sum.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	talp_dds

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.81180286407 seconds
cpu usage	3.923017897
max memory	2.80354816E8

stage attributes

key	value
output-size	20189
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern sum(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, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: sum([], [], []). sum(.(X1, Y1), .(X2, Y2), .(X3, Y3)) :- ','(add(X1, X2, X3), sum(Y1, Y2, Y3)). add(0, X, X). add(s(X), Y, s(Z)) :- add(X, Y, Z). Query: sum(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 5, "program": { "directives": [], "clauses": [ [ "(sum ([]) ([]) ([]))", null ], [ "(sum (. X1 Y1) (. X2 Y2) (. X3 Y3))", "(',' (add X1 X2 X3) (sum Y1 Y2 Y3))" ], [ "(add (0) X X)", null ], [ "(add (s X) Y (s Z))", "(add X Y Z)" ] ] }, "graph": { "nodes": { "22": { "goal": [ { "clause": 0, "scope": 1, "term": "(sum T1 T2 T3)" }, { "clause": 1, "scope": 1, "term": "(sum T1 T2 T3)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T1", "T2" ], "free": [], "exprvars": [] } popout

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

job log

popout

actions

all output return to Logic Programming