Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic_Programming 2019-04-02 08.22 pair #434324625
details
property
value
status
complete
benchmark
lessleaves.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n081.star.cs.uiowa.edu
space
SGST06
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.95737 seconds
cpu usage
5.8372
user time
5.53248
system time
0.304721
max virtual memory
1.9010164E7
max residence set size
488716.0
stage attributes
key
value
starexec-result
YES
output
5.41/2.87 YES 5.41/2.89 proof of /export/starexec/sandbox/benchmark/theBenchmark.pl 5.41/2.89 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 5.41/2.89 5.41/2.89 5.41/2.89 Left Termination of the query pattern 5.41/2.89 5.41/2.89 lessleaves(g,g) 5.41/2.89 5.41/2.89 w.r.t. the given Prolog program could successfully be proven: 5.41/2.89 5.41/2.89 (0) Prolog 5.41/2.89 (1) PrologToPiTRSProof [SOUND, 0 ms] 5.41/2.89 (2) PiTRS 5.41/2.89 (3) DependencyPairsProof [EQUIVALENT, 12 ms] 5.41/2.89 (4) PiDP 5.41/2.89 (5) DependencyGraphProof [EQUIVALENT, 0 ms] 5.41/2.89 (6) AND 5.41/2.89 (7) PiDP 5.41/2.89 (8) UsableRulesProof [EQUIVALENT, 0 ms] 5.41/2.89 (9) PiDP 5.41/2.89 (10) PiDPToQDPProof [SOUND, 0 ms] 5.41/2.89 (11) QDP 5.41/2.89 (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] 5.41/2.89 (13) YES 5.41/2.89 (14) PiDP 5.41/2.89 (15) UsableRulesProof [EQUIVALENT, 0 ms] 5.41/2.89 (16) PiDP 5.41/2.89 (17) PiDPToQDPProof [SOUND, 0 ms] 5.41/2.89 (18) QDP 5.41/2.89 (19) UsableRulesReductionPairsProof [EQUIVALENT, 12 ms] 5.41/2.89 (20) QDP 5.41/2.89 (21) MRRProof [EQUIVALENT, 2 ms] 5.41/2.89 (22) QDP 5.41/2.89 (23) PisEmptyProof [EQUIVALENT, 0 ms] 5.41/2.89 (24) YES 5.41/2.89 5.41/2.89 5.41/2.89 ---------------------------------------- 5.41/2.89 5.41/2.89 (0) 5.41/2.89 Obligation: 5.41/2.89 Clauses: 5.41/2.89 5.41/2.89 append(nil, Y, Y). 5.41/2.89 append(cons(U, V), Y, cons(U, Z)) :- append(V, Y, Z). 5.41/2.89 lessleaves(nil, cons(W, Z)). 5.41/2.89 lessleaves(cons(U, V), cons(W, Z)) :- ','(append(U, V, U1), ','(append(W, Z, W1), lessleaves(U1, W1))). 5.41/2.89 5.41/2.89 5.41/2.89 Query: lessleaves(g,g) 5.41/2.89 ---------------------------------------- 5.41/2.89 5.41/2.89 (1) PrologToPiTRSProof (SOUND) 5.41/2.89 We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes: 5.41/2.89 5.41/2.89 lessleaves_in_2: (b,b) 5.41/2.89 5.41/2.89 append_in_3: (b,b,f) 5.41/2.89 5.41/2.89 Transforming Prolog into the following Term Rewriting System: 5.41/2.89 5.41/2.89 Pi-finite rewrite system: 5.41/2.89 The TRS R consists of the following rules: 5.41/2.89 5.41/2.89 lessleaves_in_gg(nil, cons(W, Z)) -> lessleaves_out_gg(nil, cons(W, Z)) 5.41/2.89 lessleaves_in_gg(cons(U, V), cons(W, Z)) -> U2_gg(U, V, W, Z, append_in_gga(U, V, U1)) 5.41/2.89 append_in_gga(nil, Y, Y) -> append_out_gga(nil, Y, Y) 5.41/2.89 append_in_gga(cons(U, V), Y, cons(U, Z)) -> U1_gga(U, V, Y, Z, append_in_gga(V, Y, Z)) 5.41/2.89 U1_gga(U, V, Y, Z, append_out_gga(V, Y, Z)) -> append_out_gga(cons(U, V), Y, cons(U, Z)) 5.41/2.89 U2_gg(U, V, W, Z, append_out_gga(U, V, U1)) -> U3_gg(U, V, W, Z, U1, append_in_gga(W, Z, W1)) 5.41/2.89 U3_gg(U, V, W, Z, U1, append_out_gga(W, Z, W1)) -> U4_gg(U, V, W, Z, lessleaves_in_gg(U1, W1)) 5.41/2.89 U4_gg(U, V, W, Z, lessleaves_out_gg(U1, W1)) -> lessleaves_out_gg(cons(U, V), cons(W, Z)) 5.41/2.89 5.41/2.89 The argument filtering Pi contains the following mapping: 5.41/2.89 lessleaves_in_gg(x1, x2) = lessleaves_in_gg(x1, x2) 5.41/2.89 5.41/2.89 nil = nil 5.41/2.89 5.41/2.89 cons(x1, x2) = cons(x1, x2) 5.41/2.89 5.41/2.89 lessleaves_out_gg(x1, x2) = lessleaves_out_gg 5.41/2.89 5.41/2.89 U2_gg(x1, x2, x3, x4, x5) = U2_gg(x3, x4, x5) 5.41/2.89 5.41/2.89 append_in_gga(x1, x2, x3) = append_in_gga(x1, x2) 5.41/2.89 5.41/2.89 append_out_gga(x1, x2, x3) = append_out_gga(x3) 5.41/2.89 5.41/2.89 U1_gga(x1, x2, x3, x4, x5) = U1_gga(x1, x5) 5.41/2.89 5.41/2.89 U3_gg(x1, x2, x3, x4, x5, x6) = U3_gg(x5, x6) 5.41/2.89 5.41/2.89 U4_gg(x1, x2, x3, x4, x5) = U4_gg(x5) 5.41/2.89 5.41/2.89 5.41/2.89 5.41/2.89 5.41/2.89 5.41/2.89 Infinitary Constructor Rewriting Termination of PiTRS implies Termination of Prolog
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic_Programming 2019-04-02 08.22