Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919672
details
property
value
status
complete
benchmark
pl1.2.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n073.star.cs.uiowa.edu
space
talp_plumer
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.2910130024 seconds
cpu usage
5.982886259
max memory
5.01465088E8
stage attributes
key
value
output-size
23774
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 perm(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToPiTRSProof [SOUND, 0 ms] (2) PiTRS (3) DependencyPairsProof [EQUIVALENT, 4 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 1 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) UsableRulesProof [EQUIVALENT, 0 ms] (16) PiDP (17) PiDPToQDPProof [SOUND, 0 ms] (18) QDP (19) QDPSizeChangeProof [EQUIVALENT, 0 ms] (20) YES (21) PiDP (22) UsableRulesProof [EQUIVALENT, 0 ms] (23) PiDP (24) PiDPToQDPProof [SOUND, 0 ms] (25) QDP (26) MRRProof [EQUIVALENT, 2 ms] (27) QDP (28) PisEmptyProof [EQUIVALENT, 0 ms] (29) YES ---------------------------------------- (0) Obligation: Clauses: perm([], []). perm(L, .(H, T)) :- ','(append2(V, .(H, U), L), ','(append1(V, U, W), perm(W, T))). append1([], L, L). append1(.(H, L1), L2, .(H, L3)) :- append1(L1, L2, L3). append2([], L, L). append2(.(H, L1), L2, .(H, L3)) :- append2(L1, L2, L3). Query: perm(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: perm_in_2: (b,f) append2_in_3: (f,f,b) append1_in_3: (b,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: perm_in_ga([], []) -> perm_out_ga([], []) perm_in_ga(L, .(H, T)) -> U1_ga(L, H, T, append2_in_aag(V, .(H, U), L)) append2_in_aag([], L, L) -> append2_out_aag([], L, L) append2_in_aag(.(H, L1), L2, .(H, L3)) -> U5_aag(H, L1, L2, L3, append2_in_aag(L1, L2, L3)) U5_aag(H, L1, L2, L3, append2_out_aag(L1, L2, L3)) -> append2_out_aag(.(H, L1), L2, .(H, L3)) U1_ga(L, H, T, append2_out_aag(V, .(H, U), L)) -> U2_ga(L, H, T, append1_in_gga(V, U, W)) append1_in_gga([], L, L) -> append1_out_gga([], L, L) append1_in_gga(.(H, L1), L2, .(H, L3)) -> U4_gga(H, L1, L2, L3, append1_in_gga(L1, L2, L3)) U4_gga(H, L1, L2, L3, append1_out_gga(L1, L2, L3)) -> append1_out_gga(.(H, L1), L2, .(H, L3)) U2_ga(L, H, T, append1_out_gga(V, U, W)) -> U3_ga(L, H, T, perm_in_ga(W, T)) U3_ga(L, H, T, perm_out_ga(W, T)) -> perm_out_ga(L, .(H, T)) The argument filtering Pi contains the following mapping: perm_in_ga(x1, x2) = perm_in_ga(x1) [] = [] perm_out_ga(x1, x2) = perm_out_ga(x2) U1_ga(x1, x2, x3, x4) = U1_ga(x4)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030