Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920206
details
property
value
status
complete
benchmark
mul1.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.97217607498 seconds
cpu usage
4.886670427
max memory
3.93388032E8
stage attributes
key
value
output-size
49387
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 mul(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, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES ---------------------------------------- (0) Obligation: Clauses: mul(X1, 0, Z) :- ','(!, eq(Z, 0)). mul(X, Y, Z) :- ','(p(Y, P), ','(mul(X, P, V), add(X, V, Z))). add(X, 0, Z) :- ','(!, eq(Z, X)). add(X, Y, Z) :- ','(p(Y, V), ','(add(X, V, W), p(Z, W))). p(0, 0). p(s(X), X). eq(X, X). Query: mul(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 19, "program": { "directives": [], "clauses": [ [ "(mul X1 (0) Z)", "(',' (!) (eq Z (0)))" ], [ "(mul X Y Z)", "(',' (p Y P) (',' (mul X P V) (add X V Z)))" ], [ "(add X (0) Z)", "(',' (!) (eq Z X))" ], [ "(add X Y Z)", "(',' (p Y V) (',' (add X V W) (p Z W)))" ], [ "(p (0) (0))", null ], [ "(p (s X) X)", null ], [ "(eq X X)", null ] ] }, "graph": { "nodes": { "type": "Nodes", "350": {
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030