Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919673
details
property
value
status
complete
benchmark
svcomp-c-03-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.25159478188 seconds
cpu usage
5.760247179
max memory
4.19016704E8
stage attributes
key
value
output-size
127604
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) PrologToIRSwTTransformerProof [SOUND, 91 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y, Z) :- loop(X, Y, Z, 0). loop(X, Y, Z, C) :- ','(<(X, Y), loop_body(X, Y, Z, C)). loop(X, Y, Z, C) :- >=(X, Y). 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), ','(is(Z1, +(Z, 1)), ','(is(C1, +(C, 1)), loop(X, Y, Z1, 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": 1, "program": { "directives": [], "clauses": [ [ "(test_fun X Y Z)", "(loop X Y Z (0))" ], [ "(loop X Y Z C)", "(',' (< X Y) (loop_body X Y Z C))" ], [ "(loop X Y Z C)", "(>= X Y)" ], [ "(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) (',' (is Z1 (+ Z (1))) (',' (is C1 (+ C (1))) (loop X Y Z1 C1))))" ] ] }, "graph": { "nodes": { "3280": { "goal": [{ "clause": -1, "scope": -1, "term": "(>= T143 T144)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T143", "T144" ], "free": [], "exprvars": [] } }, "3263": { "goal": [{ "clause": -1, "scope": -1, "term": "(>= T133 T134)" }], "kb": { "nonunifying": [], "intvars": {},
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030