Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920114
details
property
value
status
complete
benchmark
blist2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n041.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.73176598549 seconds
cpu usage
4.084414147
max memory
2.38764032E8
stage attributes
key
value
output-size
108382
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 goal(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 69 ms] (2) TRIPLES (3) UndefinedPredicateInTriplesTransformerProof [SOUND, 0 ms] (4) TRIPLES (5) TriplesToPiDPProof [SOUND, 0 ms] (6) PiDP (7) DependencyGraphProof [EQUIVALENT, 0 ms] (8) AND (9) PiDP (10) UsableRulesProof [EQUIVALENT, 0 ms] (11) PiDP (12) PiDPToQDPProof [SOUND, 0 ms] (13) QDP (14) QDPSizeChangeProof [EQUIVALENT, 0 ms] (15) YES (16) PiDP (17) UsableRulesProof [EQUIVALENT, 0 ms] (18) PiDP (19) PiDPToQDPProof [SOUND, 0 ms] (20) QDP (21) QDPSizeChangeProof [EQUIVALENT, 0 ms] (22) YES ---------------------------------------- (0) Obligation: Clauses: goal(X) :- ','(s2l(X, Xs), list(Xs)). list([]). list(X) :- ','(no(empty(X)), ','(tail(X, T), list(T))). s2l(0, []). s2l(X, .(X1, Xs)) :- ','(no(zero(X)), ','(p(X, P), s2l(P, Xs))). tail([], []). tail(.(X2, Xs), Xs). p(0, 0). p(s(X), X). empty([]). zero(0). no(X) :- ','(X, ','(!, failure(a))). no(X3). failure(b). Query: goal(g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(goal X)", "(',' (s2l X Xs) (list Xs))" ], [ "(list ([]))", null ], [ "(list X)", "(',' (no (empty X)) (',' (tail X T) (list T)))" ], [ "(s2l (0) ([]))", null ], [ "(s2l X (. X1 Xs))", "(',' (no (zero X)) (',' (p X P) (s2l P Xs)))" ], [ "(tail ([]) ([]))", null ], [
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030