Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919680
details
property
value
status
complete
benchmark
quicksort.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
prolog_mixed
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.35155701637 seconds
cpu usage
10.226096882
max memory
9.5031296E8
stage attributes
key
value
output-size
36683
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 qs(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) UndefinedPredicateHandlerProof [SOUND, 0 ms] (2) Prolog (3) PrologToPiTRSProof [SOUND, 16 ms] (4) PiTRS (5) DependencyPairsProof [EQUIVALENT, 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 (23) PiDP (24) PiDPToQDPProof [SOUND, 0 ms] (25) QDP (26) QDPOrderProof [EQUIVALENT, 88 ms] (27) QDP (28) DependencyGraphProof [EQUIVALENT, 0 ms] (29) TRUE ---------------------------------------- (0) Obligation: Clauses: qs(.(X, Xs), Ys) :- ','(part(X, Xs, Littles, Bigs), ','(qs(Littles, Ls), ','(qs(Bigs, Bs), app(Ls, .(X, Bs), Ys)))). qs([], []). part(X, .(Y, Xs), .(Y, Ls), Bs) :- ','(>(X, Y), part(X, Xs, Ls, Bs)). part(X, .(Y, Xs), Ls, .(Y, Bs)) :- ','(=<(X, Y), part(X, Xs, Ls, Bs)). part(X, [], [], []). app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs). app([], Ys, Ys). Query: qs(g,a) ---------------------------------------- (1) UndefinedPredicateHandlerProof (SOUND) Added facts for all undefined predicates [PROLOG]. ---------------------------------------- (2) Obligation: Clauses: qs(.(X, Xs), Ys) :- ','(part(X, Xs, Littles, Bigs), ','(qs(Littles, Ls), ','(qs(Bigs, Bs), app(Ls, .(X, Bs), Ys)))). qs([], []). part(X, .(Y, Xs), .(Y, Ls), Bs) :- ','(>(X, Y), part(X, Xs, Ls, Bs)). part(X, .(Y, Xs), Ls, .(Y, Bs)) :- ','(=<(X, Y), part(X, Xs, Ls, Bs)). part(X, [], [], []). app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs). app([], Ys, Ys). >(X0, X1). =<(X0, X1). Query: qs(g,a) ---------------------------------------- (3) PrologToPiTRSProof (SOUND) We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: qs_in_2: (b,f) part_in_4: (b,b,f,f) app_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030