Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919616
details
property
value
status
complete
benchmark
ackermann.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n054.star.cs.uiowa.edu
space
Weinert_15
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.86990809441 seconds
cpu usage
8.12401897
max memory
6.7483648E8
stage attributes
key
value
output-size
51646
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 ackermann(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 62 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 51 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 54 ms] (10) IRSwT (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IRSwT (13) TempFilterProof [SOUND, 51 ms] (14) IntTRS (15) PolynomialOrderProcessor [EQUIVALENT, 6 ms] (16) IntTRS (17) RankingReductionPairProof [EQUIVALENT, 4 ms] (18) 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) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 4, "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": { "2273": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "2295": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030