Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919934
details
property
value
status
complete
benchmark
svcomp-a-06-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.79626297951 seconds
cpu usage
7.905054071
max memory
4.7900672E8
stage attributes
key
value
output-size
184796
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, 55 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 37 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 36 ms] (10) IRSwT (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IRSwT (13) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms] (14) IRSwT (15) TempFilterProof [SOUND, 44 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 16 ms] (18) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y, Z) :- loop(X, Y, Z, 0). loop(X, Y, Z, C) :- ','(>(X, +(Y, Z)), ','(is(Y1, +(Y, 1)), ','(is(Z1, +(Z, 1)), ','(is(C1, +(C, 1)), loop(X, Y1, Z1, C1))))). loop(X, Y, Z, C) :- =<(X, +(Y, Z)). Query: test_fun(g,g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 2, "program": { "directives": [], "clauses": [ [ "(test_fun X Y Z)", "(loop X Y Z (0))" ], [ "(loop X Y Z C)", "(',' (> X (+ Y Z)) (',' (is Y1 (+ Y (1))) (',' (is Z1 (+ Z (1))) (',' (is C1 (+ C (1))) (loop X Y1 Z1 C1)))))" ], [ "(loop X Y Z C)", "(=< X (+ Y Z))" ] ] }, "graph": { "nodes": { "2210": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (> T57 (+ T58 T59)) (',' (is X86 (+ T58 (1))) (',' (is X87 (+ T59 (1))) (',' (is X88 (+ T60 (1))) (loop T57 X86 X87 X88)))))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "name": "T34", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "arguments": [ { "name": "T32", "type": "PlainIntegerVariable" },
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030