details

property	value
status	complete
benchmark	svcomp-b-13-c.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n030.star.cs.uiowa.edu
space	AProVE_numeric

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.85416793823 seconds
cpu usage	12.056570732
max memory	1.539497984E9

stage attributes

key	value
output-size	505005
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 test_fun(g,g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 165 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y, Z) :- loop(X, Y, Z, 0). loop(X, Y, Z, C) :- ','(>(X, Z), loop_body(X, Y, Z, C)). loop(X, Y, Z, C) :- ','(>(Y, Z), loop_body(X, Y, Z, C)). loop(X, Y, Z, C) :- ','(=<(X, Z), =<(Y, Z)). loop_body(X, Y, Z, C) :- ','(>(X, Z), ','(is(X1, -(X, 1)), ','(is(C1, +(C, 1)), loop(X1, Y, Z, C1)))). loop_body(X, Y, Z, C) :- ','(=<(X, Z), ','(>(Y, Z), ','(is(Y1, -(Y, 1)), ','(is(C1, +(C, 1)), loop(X, Y1, Z, C1))))). loop_body(X, Y, Z, C) :- ','(=<(X, Z), ','(=<(Y, Z), ','(is(C1, +(C, 1)), loop(X, Y, Z, C1)))). Query: test_fun(g,g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(test_fun X Y Z)", "(loop X Y Z (0))" ], [ "(loop X Y Z C)", "(',' (> X Z) (loop_body X Y Z C))" ], [ "(loop X Y Z C)", "(',' (> Y Z) (loop_body X Y Z C))" ], [ "(loop X Y Z C)", "(',' (=< X Z) (=< Y Z))" ], [ "(loop_body X Y Z C)", "(',' (> X Z) (',' (is X1 (- X (1))) (',' (is C1 (+ C (1))) (loop X1 Y Z C1))))" ], [ "(loop_body X Y Z C)", "(',' (=< X Z) (',' (> Y Z) (',' (is Y1 (- Y (1))) (',' (is C1 (+ C (1))) (loop X Y1 Z C1)))))" ], [ "(loop_body X Y Z C)", "(',' (=< X Z) (',' (=< Y Z) (',' (is C1 (+ C (1))) (loop X Y Z C1))))" ] ] }, "graph": { "nodes": { "5140": { "goal": [{ "clause": 6, "scope": 3, "term": "(loop_body T31 T32 T33 (0))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [{ "lhs": { "name": "T33", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "name": "T31", "type": "PlainIntegerVariable" popout

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

job log

popout

actions

all output return to Logic Progr 19030