Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920154
details
property
value
status
complete
benchmark
quot2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n039.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.32635498047 seconds
cpu usage
6.216372286
max memory
6.15559168E8
stage attributes
key
value
output-size
460223
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 div(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 321 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 54 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) PiDPToQDPProof [SOUND, 0 ms] (9) QDP (10) QDPSizeChangeProof [EQUIVALENT, 0 ms] (11) YES (12) PiDP (13) PiDPToQDPProof [SOUND, 0 ms] (14) QDP (15) QDPSizeChangeProof [EQUIVALENT, 0 ms] (16) YES (17) PiDP (18) PiDPToQDPProof [SOUND, 0 ms] (19) QDP (20) QDPSizeChangeProof [EQUIVALENT, 0 ms] (21) YES (22) PiDP (23) PiDPToQDPProof [SOUND, 0 ms] (24) QDP (25) QDPSizeChangeProof [EQUIVALENT, 0 ms] (26) YES (27) PiDP (28) PiDPToQDPProof [SOUND, 0 ms] (29) QDP (30) QDPSizeChangeProof [EQUIVALENT, 0 ms] (31) YES (32) PiDP (33) PiDPToQDPProof [SOUND, 0 ms] (34) QDP (35) QDPSizeChangeProof [EQUIVALENT, 0 ms] (36) YES (37) PiDP (38) PiDPToQDPProof [SOUND, 0 ms] (39) QDP (40) QDPSizeChangeProof [EQUIVALENT, 0 ms] (41) YES (42) PiDP (43) PiDPToQDPProof [SOUND, 0 ms] (44) QDP (45) QDPSizeChangeProof [EQUIVALENT, 0 ms] (46) YES ---------------------------------------- (0) Obligation: Clauses: div(X, Y, Z) :- quot(X, Y, Y, Z). quot(0, s(Y), s(Z), 0). quot(X, 0, s(Z), s(U)) :- quot(X, s(Z), s(Z), U). quot(X, Y, Z, U) :- ','(no(zero(X)), ','(no(zero(Y)), ','(p(X, Px), ','(p(Y, Py), quot(Px, Py, Z, U))))). p(0, 0). p(s(X), X). zero(0). no(X) :- ','(X, ','(!, failure(a))). no(X1). failure(b). Query: div(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(div X Y Z)", "(quot X Y Y Z)" ], [
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030