Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381920178
details
property
value
status
complete
benchmark
ordered.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Stroeder_09
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.09710502625 seconds
cpu usage
5.412857795
max memory
4.64830464E8
stage attributes
key
value
output-size
73130
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 ordered(g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 62 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, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [EQUIVALENT, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) PiDP (22) PiDPToQDPProof [EQUIVALENT, 0 ms] (23) QDP (24) MRRProof [EQUIVALENT, 0 ms] (25) QDP (26) DependencyGraphProof [EQUIVALENT, 0 ms] (27) TRUE ---------------------------------------- (0) Obligation: Clauses: ordered([]) :- !. ordered(.(X1, [])) :- !. ordered(Xs) :- ','(head(Xs, X), ','(tail(Xs, Ys), ','(head(Ys, Y), ','(tail(Ys, Zs), ','(less(X, s(Y)), ordered(.(Y, Zs))))))). head([], X2). head(.(X, X3), X). tail([], []). tail(.(X4, Xs), Xs). less(0, Y) :- ','(!, eq(Y, s(X5))). less(X, Y) :- ','(p(X, Px), ','(p(Y, Py), less(Px, Py))). p(0, 0). p(s(X), X). eq(X, X). Query: ordered(g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(ordered ([]))", "(!)" ], [ "(ordered (. X1 ([])))", "(!)" ], [ "(ordered Xs)", "(',' (head Xs X) (',' (tail Xs Ys) (',' (head Ys Y) (',' (tail Ys Zs) (',' (less X (s Y)) (ordered (. Y Zs)))))))" ], [ "(head ([]) X2)", null ], [ "(head (. X X3) X)", null ], [ "(tail ([]) ([]))",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030