Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529611
details
property
value
status
complete
benchmark
perm.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
talp_talp
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.18217206001 seconds
cpu usage
5.067412017
max memory
4.54283264E8
stage attributes
key
value
output-size
23546
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: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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, 5 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 [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: ap1(nil, X, X). ap1(cons(H, X), Y, cons(H, Z)) :- ap1(X, Y, Z). ap2(nil, X, X). ap2(cons(H, X), Y, cons(H, Z)) :- ap2(X, Y, Z). perm(nil, nil). perm(Xs, cons(X, Ys)) :- ','(ap1(X1s, cons(X, X2s), Xs), ','(ap2(X1s, X2s, Zs), perm(Zs, Ys))). 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) ap1_in_3: (f,f,b) ap2_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(nil, nil) -> perm_out_ga(nil, nil) perm_in_ga(Xs, cons(X, Ys)) -> U3_ga(Xs, X, Ys, ap1_in_aag(X1s, cons(X, X2s), Xs)) ap1_in_aag(nil, X, X) -> ap1_out_aag(nil, X, X) ap1_in_aag(cons(H, X), Y, cons(H, Z)) -> U1_aag(H, X, Y, Z, ap1_in_aag(X, Y, Z)) U1_aag(H, X, Y, Z, ap1_out_aag(X, Y, Z)) -> ap1_out_aag(cons(H, X), Y, cons(H, Z)) U3_ga(Xs, X, Ys, ap1_out_aag(X1s, cons(X, X2s), Xs)) -> U4_ga(Xs, X, Ys, X1s, X2s, ap2_in_gga(X1s, X2s, Zs)) ap2_in_gga(nil, X, X) -> ap2_out_gga(nil, X, X) ap2_in_gga(cons(H, X), Y, cons(H, Z)) -> U2_gga(H, X, Y, Z, ap2_in_gga(X, Y, Z)) U2_gga(H, X, Y, Z, ap2_out_gga(X, Y, Z)) -> ap2_out_gga(cons(H, X), Y, cons(H, Z)) U4_ga(Xs, X, Ys, X1s, X2s, ap2_out_gga(X1s, X2s, Zs)) -> U5_ga(Xs, X, Ys, perm_in_ga(Zs, Ys)) U5_ga(Xs, X, Ys, perm_out_ga(Zs, Ys)) -> perm_out_ga(Xs, cons(X, Ys)) The argument filtering Pi contains the following mapping: perm_in_ga(x1, x2) = perm_in_ga(x1) nil = nil perm_out_ga(x1, x2) = perm_out_ga(x2) U3_ga(x1, x2, x3, x4) = U3_ga(x4)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming