Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919804
details
property
value
status
complete
benchmark
svcomp-b-16-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.12333011627 seconds
cpu usage
5.336285689
max memory
3.97430784E8
stage attributes
key
value
output-size
124155
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) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 39 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y) :- loop1(X, Y, 0). loop1(X, Y, C) :- ','(>(X, 0), loop2(X, Y, C)). loop1(X, Y, C) :- =<(X, 0). loop2(X, Y, C) :- ','(>(Y, 0), ','(is(Y1, -(Y, 1)), ','(is(C1, +(C, 1)), loop2(X, Y1, C1)))). loop2(X, Y, C) :- ','(=<(Y, 0), ','(is(X1, -(X, 1)), ','(is(C1, +(C, 1)), loop1(X1, Y, C1)))). Query: test_fun(g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(test_fun X Y)", "(loop1 X Y (0))" ], [ "(loop1 X Y C)", "(',' (> X (0)) (loop2 X Y C))" ], [ "(loop1 X Y C)", "(=< X (0))" ], [ "(loop2 X Y C)", "(',' (> Y (0)) (',' (is Y1 (- Y (1))) (',' (is C1 (+ C (1))) (loop2 X Y1 C1))))" ], [ "(loop2 X Y C)", "(',' (=< Y (0)) (',' (is X1 (- X (1))) (',' (is C1 (+ C (1))) (loop1 X1 Y C1))))" ] ] }, "graph": { "nodes": { "22": { "goal": [{ "clause": 2, "scope": 2, "term": "(loop1 T9 T10 (0))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T9", "T10" ], "free": [], "exprvars": [] } }, "3060": { "goal": [{ "clause": -1, "scope": -1, "term": "(=< T103 (0))" }], "kb": { "nonunifying": [], "intvars": {},
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030