Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529357
details
property
value
status
complete
benchmark
NJ5.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
terminweb_new
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.77454900742 seconds
cpu usage
4.127777532
max memory
2.76393984E8
stage attributes
key
value
output-size
47881
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern f(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 9 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: f(RES, [], RES). f([], .(Head, Tail), RES) :- f(.(Head, Tail), Tail, RES). f(.(Head, Tail), Y, RES) :- f(Y, Tail, RES). Query: f(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 2, "program": { "directives": [], "clauses": [ [ "(f RES ([]) RES)", null ], [ "(f ([]) (. Head Tail) RES)", "(f (. Head Tail) Tail RES)" ], [ "(f (. Head Tail) Y RES)", "(f Y Tail RES)" ] ] }, "graph": { "nodes": { "68": { "goal": [ { "clause": 1, "scope": 1, "term": "(f T5 ([]) T3)" }, { "clause": 2, "scope": 1, "term": "(f T5 ([]) T3)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T5"], "free": [], "exprvars": [] } }, "170": { "goal": [{ "clause": 0, "scope": 4, "term": "(f T80 T79 T82)" }], "kb": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming