Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920105
details
property
value
status
complete
benchmark
parts-true-c.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
AProVE_numeric
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.05589795113 seconds
cpu usage
5.038716036
max memory
3.99331328E8
stage attributes
key
value
output-size
18798
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 parts(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 25 ms] (2) TRUE ---------------------------------------- (0) Obligation: Clauses: parts(P, Q, Ret) :- ','(=<(P, 0), ','(!, is(Ret, 1))). parts(P, Q, Ret) :- ','(=<(Q, 0), ','(!, is(Ret, 0))). parts(P, Q, Ret) :- ','(>(Q, P), ','(!, ','(parts(P, P, Ret1), is(Ret, Ret1)))). parts(P, Q, Ret) :- ','(!, ','(is(P1, -(P, 1)), ','(parts(P1, Q, Ret1), ','(is(Q2, -(Q, 1)), ','(parts(P, Q2, Ret2), is(Ret, +(Ret1, Ret2))))))). Query: parts(g,g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(parts P Q Ret)", "(',' (=< P (0)) (',' (!) (is Ret (1))))" ], [ "(parts P Q Ret)", "(',' (=< Q (0)) (',' (!) (is Ret (0))))" ], [ "(parts P Q Ret)", "(',' (> Q P) (',' (!) (',' (parts P P Ret1) (is Ret Ret1))))" ], [ "(parts P Q Ret)", "(',' (!) (',' (is P1 (- P (1))) (',' (parts P1 Q Ret1) (',' (is Q2 (- Q (1))) (',' (parts P Q2 Ret2) (is Ret (+ Ret1 Ret2)))))))" ] ] }, "graph": { "nodes": { "type": "Nodes", "2801": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "name": "T15", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "type": "PlainIntegerConstant", "value": "1" }, "operation": "=" }, { "lhs": { "name": "T11", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "type": "PlainIntegerConstant", "value": "0" },
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030