Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919991
details
property
value
status
complete
benchmark
reminder.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
talp_talp
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.46520709991 seconds
cpu usage
6.561069469
max memory
5.49863424E8
stage attributes
key
value
output-size
52661
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 rem(g,g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 37 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 [EQUIVALENT, 14 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 (21) PiDP (22) PiDPToQDPProof [SOUND, 0 ms] (23) QDP (24) QDPQMonotonicMRRProof [EQUIVALENT, 23 ms] (25) QDP (26) PisEmptyProof [EQUIVALENT, 0 ms] (27) YES ---------------------------------------- (0) Obligation: Clauses: rem(X, Y, R) :- ','(notZero(Y), ','(sub(X, Y, Z), rem(Z, Y, R))). rem(X, Y, X) :- ','(notZero(Y), geq(X, Y)). sub(s(X), s(Y), Z) :- sub(X, Y, Z). sub(X, 0, X). notZero(s(X)). geq(s(X), s(Y)) :- geq(X, Y). geq(X, 0). Query: rem(g,g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 2, "program": { "directives": [], "clauses": [ [ "(rem X Y R)", "(',' (notZero Y) (',' (sub X Y Z) (rem Z Y R)))" ], [ "(rem X Y X)", "(',' (notZero Y) (geq X Y))" ], [ "(sub (s X) (s Y) Z)", "(sub X Y Z)" ], [ "(sub X (0) X)", null ], [ "(notZero (s X))", null ], [ "(geq (s X) (s Y))", "(geq X Y)" ], [ "(geq X (0))", null
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030