Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920056
details
property
value
status
complete
benchmark
svcomp-flag-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n047.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.99055099487 seconds
cpu usage
11.793200866
max memory
7.54479104E8
stage attributes
key
value
output-size
371188
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 f(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 99 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 56 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 72 ms] (10) IRSwT (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 37 ms] (16) IntTRS (17) PolynomialOrderProcessor [EQUIVALENT, 12 ms] (18) YES ---------------------------------------- (0) Obligation: Clauses: f(X, Y) :- loop(X, Y, 1, 0). loop(X, Y, Flag, C) :- ','(=:=(Flag, 1), ','(<(X, Y), ','(is(Flag1, 1), ','(is(X1, +(X, 1)), ','(is(C1, +(C, 1)), loop(X1, Y, Flag1, C1)))))). loop(X, Y, Flag, C) :- ','(=:=(Flag, 1), ','(>(X, Y), ','(is(Flag1, 0), ','(is(X1, +(X, 1)), ','(is(C1, +(C, 1)), loop(X1, Y, Flag1, C1)))))). loop(X, Y, Flag, C) :- =\=(Flag, 1). 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 X Y)", "(loop X Y (1) (0))" ], [ "(loop X Y Flag C)", "(',' (=:= Flag (1)) (',' (< X Y) (',' (is Flag1 (1)) (',' (is X1 (+ X (1))) (',' (is C1 (+ C (1))) (loop X1 Y Flag1 C1))))))" ], [ "(loop X Y Flag C)", "(',' (=:= Flag (1)) (',' (> X Y) (',' (is Flag1 (0)) (',' (is X1 (+ X (1))) (',' (is C1 (+ C (1))) (loop X1 Y Flag1 C1))))))" ], [ "(loop X Y Flag C)", "(=\\= Flag (1))" ] ] }, "graph": { "nodes": { "3081": { "goal": [{ "clause": -1, "scope": -1, "term": "(loop T78 T74 T77 T79)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "type": "PlainIntegerConstant", "value": "1" }, "type": "PlainIntegerRelation", "rhs": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030