Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919686
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
n038.star.cs.uiowa.edu
space
talp_apt
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
3.18181610107 seconds
cpu usage
8.984870685
max memory
5.75647744E8
stage attributes
key
value
output-size
49914
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/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) PrologToPiTRSProof [SOUND, 28 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 22 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 7 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) UsableRulesProof [EQUIVALENT, 0 ms] (23) PiDP (24) PiDPToQDPProof [EQUIVALENT, 0 ms] (25) QDP (26) QDPSizeChangeProof [EQUIVALENT, 0 ms] (27) YES (28) PiDP (29) UsableRulesProof [EQUIVALENT, 0 ms] (30) PiDP (31) PiDPToQDPProof [SOUND, 0 ms] (32) QDP (33) QDPSizeChangeProof [EQUIVALENT, 0 ms] (34) YES (35) PiDP (36) PiDPToQDPProof [SOUND, 7 ms] (37) QDP (38) QDPOrderProof [EQUIVALENT, 64 ms] (39) QDP (40) DependencyGraphProof [EQUIVALENT, 0 ms] (41) 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) :- ','(gt(X, Y), part(X, Xs, Ls, Bs)). part(X, .(Y, Xs), Ls, .(Y, Bs)) :- ','(le(X, Y), part(X, Xs, Ls, Bs)). part(X, [], [], []). app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs). app([], Ys, Ys). gt(s(X), s(Y)) :- gt(X, Y). gt(s(0), 0). le(s(X), s(Y)) :- le(X, Y). le(0, s(X)). le(0, 0). Query: qs(g,a) ---------------------------------------- (1) 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) gt_in_2: (b,b) le_in_2: (b,b) app_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030