Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920189
details
property
value
status
complete
benchmark
svcomp-b-17-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n048.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.18371105194 seconds
cpu usage
5.469251874
max memory
4.12147712E8
stage attributes
key
value
output-size
128275
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 test_fun(g,g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 99 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y, Z) :- loop1(X, Y, Z, 0). loop1(X, Y, Z, C) :- ','(>(X, Z), loop2(X, Y, Z, C)). loop1(X, Y, Z, C) :- =<(X, Z). loop2(X, Y, Z, C) :- ','(>(Y, Z), ','(is(Y1, -(Y, 1)), ','(is(C1, +(C, 1)), loop2(X, Y1, Z, C1)))). loop2(X, Y, Z, C) :- ','(=<(Y, Z), ','(is(X1, -(X, 1)), ','(is(C1, +(C, 1)), loop1(X1, Y, Z, C1)))). Query: test_fun(g,g,g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(test_fun X Y Z)", "(loop1 X Y Z (0))" ], [ "(loop1 X Y Z C)", "(',' (> X Z) (loop2 X Y Z C))" ], [ "(loop1 X Y Z C)", "(=< X Z)" ], [ "(loop2 X Y Z C)", "(',' (> Y Z) (',' (is Y1 (- Y (1))) (',' (is C1 (+ C (1))) (loop2 X Y1 Z C1))))" ], [ "(loop2 X Y Z C)", "(',' (=< Y Z) (',' (is X1 (- X (1))) (',' (is C1 (+ C (1))) (loop1 X1 Y Z C1))))" ] ] }, "graph": { "nodes": { "3244": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "name": "T24", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "name": "T22", "type": "PlainIntegerVariable" }, "operation": "<" }, { "lhs": { "name": "T87", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "name": "T22",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030