Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529585
details
property
value
status
complete
benchmark
hanoiapp.suc.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n103.star.cs.uiowa.edu
space
talp_mixed
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
2.80619502068 seconds
cpu usage
7.455587663
max memory
6.87030272E8
stage attributes
key
value
output-size
24863
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 shanoi(g,g,g,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, 3 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 0 ms] (11) QDP (12) QDPSizeChangeProof [EQUIVALENT, 0 ms] (13) YES (14) PiDP (15) PiDPToQDPProof [SOUND, 1 ms] (16) QDP (17) QDPOrderProof [EQUIVALENT, 90 ms] (18) QDP (19) DependencyGraphProof [EQUIVALENT, 0 ms] (20) TRUE ---------------------------------------- (0) Obligation: Clauses: shanoi(s(0), A, B, C, .(mv(A, C), [])). shanoi(s(s(X)), A, B, C, M) :- ','(eq(N1, s(X)), ','(shanoi(N1, A, C, B, M1), ','(shanoi(N1, B, A, C, M2), ','(append(M1, .(mv(A, C), []), T), append(T, M2, M))))). append([], L, L). append(.(H, L), L1, .(H, R)) :- append(L, L1, R). eq(X, X). Query: shanoi(g,g,g,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: shanoi_in_5: (b,b,b,b,f) append_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: shanoi_in_gggga(s(0), A, B, C, .(mv(A, C), [])) -> shanoi_out_gggga(s(0), A, B, C, .(mv(A, C), [])) shanoi_in_gggga(s(s(X)), A, B, C, M) -> U1_gggga(X, A, B, C, M, eq_in_ag(N1, s(X))) eq_in_ag(X, X) -> eq_out_ag(X, X) U1_gggga(X, A, B, C, M, eq_out_ag(N1, s(X))) -> U2_gggga(X, A, B, C, M, N1, shanoi_in_gggga(N1, A, C, B, M1)) U2_gggga(X, A, B, C, M, N1, shanoi_out_gggga(N1, A, C, B, M1)) -> U3_gggga(X, A, B, C, M, M1, shanoi_in_gggga(N1, B, A, C, M2)) U3_gggga(X, A, B, C, M, M1, shanoi_out_gggga(N1, B, A, C, M2)) -> U4_gggga(X, A, B, C, M, M2, append_in_gga(M1, .(mv(A, C), []), T)) append_in_gga([], L, L) -> append_out_gga([], L, L) append_in_gga(.(H, L), L1, .(H, R)) -> U6_gga(H, L, L1, R, append_in_gga(L, L1, R)) U6_gga(H, L, L1, R, append_out_gga(L, L1, R)) -> append_out_gga(.(H, L), L1, .(H, R)) U4_gggga(X, A, B, C, M, M2, append_out_gga(M1, .(mv(A, C), []), T)) -> U5_gggga(X, A, B, C, M, append_in_gga(T, M2, M)) U5_gggga(X, A, B, C, M, append_out_gga(T, M2, M)) -> shanoi_out_gggga(s(s(X)), A, B, C, M) The argument filtering Pi contains the following mapping: shanoi_in_gggga(x1, x2, x3, x4, x5) = shanoi_in_gggga(x1, x2, x3, x4) s(x1) = s(x1) 0 = 0 shanoi_out_gggga(x1, x2, x3, x4, x5) = shanoi_out_gggga(x5) U1_gggga(x1, x2, x3, x4, x5, x6) = U1_gggga(x2, x3, x4, x6) eq_in_ag(x1, x2) = eq_in_ag(x2) eq_out_ag(x1, x2) = eq_out_ag(x1) U2_gggga(x1, x2, x3, x4, x5, x6, x7) = U2_gggga(x2, x3, x4, x6, x7) U3_gggga(x1, x2, x3, x4, x5, x6, x7) = U3_gggga(x2, x4, x6, x7) U4_gggga(x1, x2, x3, x4, x5, x6, x7) = U4_gggga(x6, x7)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming