Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919726
details
property
value
status
complete
benchmark
ackermann-cut.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Weinert_15
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.98198699951 seconds
cpu usage
5.055951279
max memory
3.99409152E8
stage attributes
key
value
output-size
79364
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 ackermann(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 56 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: ackermann(X, Y, Z) :- ','(=:=(X, 0), ','(>=(Y, 0), ','(!, is(Z, +(Y, 1))))). ackermann(X, Y, Z) :- ','(>(X, 0), ','(=:=(Y, 0), ','(!, ackermann(-(X, 1), 1, Z)))). ackermann(X, Y, Z) :- ','(>(X, 0), ','(>(Y, 0), ','(!, ','(ackermann(X, -(Y, 1), W), ackermann(-(X, 1), W, Z))))). Query: ackermann(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 2, "program": { "directives": [], "clauses": [ [ "(ackermann X Y Z)", "(',' (=:= X (0)) (',' (>= Y (0)) (',' (!) (is Z (+ Y (1))))))" ], [ "(ackermann X Y Z)", "(',' (> X (0)) (',' (=:= Y (0)) (',' (!) (ackermann (- X (1)) (1) Z))))" ], [ "(ackermann X Y Z)", "(',' (> X (0)) (',' (> Y (0)) (',' (!) (',' (ackermann X (- Y (1)) W) (ackermann (- X (1)) W Z)))))" ] ] }, "graph": { "nodes": { "2099": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "name": "T7", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "type": "PlainIntegerConstant", "value": "0" }, "operation": "=" }, { "lhs": { "name": "T11", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "arguments": [ { "name": "T8", "type": "PlainIntegerVariable" }, { "type": "PlainIntegerConstant", "value": "1" } ], "type": "PlainIntegerOperation",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030