Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920202
details
property
value
status
complete
benchmark
svcomp-b-15-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.6300971508 seconds
cpu usage
7.052007277
max memory
4.9444864E8
stage attributes
key
value
output-size
134483
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, 89 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 26 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y, Z) :- loop1(X, Y, Z, 0). loop1(X, Y, Z, C) :- ','(=:=(X, Y), ','(>(X, Z), loop2(X, Y, Z, C))). loop1(X, Y, Z, C) :- =\=(X, Y). loop1(X, Y, Z, C) :- =<(X, Z). loop2(X, Y, Z, C) :- ','(>(Y, Z), ','(is(X1, -(X, 1)), ','(is(Y1, -(Y, 1)), ','(is(C1, +(C, 1)), loop2(X1, Y1, Z, C1))))). loop2(X, Y, Z, C) :- ','(=<(Y, Z), loop1(X, Y, Z, C)). 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)", "(loop1 X Y Z (0))" ], [ "(loop1 X Y Z C)", "(',' (=:= X Y) (',' (> X Z) (loop2 X Y Z C)))" ], [ "(loop1 X Y Z C)", "(=\\= X Y)" ], [ "(loop1 X Y Z C)", "(=< X Z)" ], [ "(loop2 X Y Z C)", "(',' (> Y Z) (',' (is X1 (- X (1))) (',' (is Y1 (- Y (1))) (',' (is C1 (+ C (1))) (loop2 X1 Y1 Z C1)))))" ], [ "(loop2 X Y Z C)", "(',' (=< Y Z) (loop1 X Y Z C))" ] ] }, "graph": { "nodes": { "22": { "goal": [ { "clause": 2, "scope": 2, "term": "(loop1 T13 T14 T15 (0))" }, { "clause": 3, "scope": 2, "term": "(loop1 T13 T14 T15 (0))" } ], "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