Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919783
details
property
value
status
complete
benchmark
svcomp-twisted-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.31082510948 seconds
cpu usage
6.2029244
max memory
9.12666624E8
stage attributes
key
value
output-size
176032
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 f(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 78 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: f(K, L) :- l1(K, L, 0, 0). l1(K, L, I, J) :- ','(<(I, K), l1body(K, L, I, J)). l1(K, L, I, J) :- ','(>=(I, K), l2(K, L, I, J)). l1body(K, L, I, J) :- ','(is(I1, +(I, 1)), ','(=:=(mod(I1, 2), 1), l1(K, L, I1, J))). l1body(K, L, I, J) :- ','(is(I1, +(I, 1)), ','(=\=(mod(I1, 2), 1), l2(K, L, I1, J))). l2(K, L, I, J) :- ','(<(J, L), l2body(K, L, I, J)). l2(K, L, I, J) :- >=(J, L). l2body(K, L, I, J) :- ','(is(J1, +(J, 1)), ','(=:=(mod(J1, 2), 1), l2(K, L, I, J1))). l2body(K, L, I, J) :- ','(is(J1, +(J, 1)), ','(=\=(mod(J1, 2), 1), l1(K, L, I, J1))). Query: f(g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(f K L)", "(l1 K L (0) (0))" ], [ "(l1 K L I J)", "(',' (< I K) (l1body K L I J))" ], [ "(l1 K L I J)", "(',' (>= I K) (l2 K L I J))" ], [ "(l1body K L I J)", "(',' (is I1 (+ I (1))) (',' (=:= (mod I1 (2)) (1)) (l1 K L I1 J)))" ], [ "(l1body K L I J)", "(',' (is I1 (+ I (1))) (',' (=\\= (mod I1 (2)) (1)) (l2 K L I1 J)))" ], [ "(l2 K L I J)", "(',' (< J L) (l2body K L I J))" ], [ "(l2 K L I J)", "(>= J L)" ], [ "(l2body K L I J)", "(',' (is J1 (+ J (1))) (',' (=:= (mod J1 (2)) (1)) (l2 K L I J1)))" ], [ "(l2body K L I J)", "(',' (is J1 (+ J (1))) (',' (=\\= (mod J1 (2)) (1)) (l1 K L I J1)))" ] ] }, "graph": { "nodes": { "4370": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (=:= (mod T100 (2)) (1)) (l2 T98 T99 (0) T100))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030