Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Progr 19030 pair #381919777
details
property
value
status
complete
benchmark
transpose.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n072.star.cs.uiowa.edu
space
terminweb_new
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.93876504898 seconds
cpu usage
4.789327572
max memory
3.93179136E8
stage attributes
key
value
output-size
20608
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 transpose(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, 14 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) AND (7) PiDP (8) UsableRulesProof [EQUIVALENT, 0 ms] (9) PiDP (10) PiDPToQDPProof [SOUND, 8 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 ---------------------------------------- (0) Obligation: Clauses: transpose(A, B) :- transpose_aux(A, [], B). transpose_aux(.(R, Rs), X1, .(C, Cs)) :- ','(row2col(R, .(C, Cs), Cols1, [], Accm), transpose_aux(Rs, Accm, Cols1)). transpose_aux([], X, X). row2col(.(X, Xs), .(.(X, Ys), Cols), .(Ys, Cols1), A, B) :- row2col(Xs, Cols, Cols1, .([], A), B). row2col([], [], [], A, A). Query: transpose(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: transpose_in_2: (b,f) transpose_aux_in_3: (b,b,f) row2col_in_5: (b,f,f,b,f) Transforming Prolog into the following Term Rewriting System: Pi-finite rewrite system: The TRS R consists of the following rules: transpose_in_ga(A, B) -> U1_ga(A, B, transpose_aux_in_gga(A, [], B)) transpose_aux_in_gga(.(R, Rs), X1, .(C, Cs)) -> U2_gga(R, Rs, X1, C, Cs, row2col_in_gaaga(R, .(C, Cs), Cols1, [], Accm)) row2col_in_gaaga(.(X, Xs), .(.(X, Ys), Cols), .(Ys, Cols1), A, B) -> U4_gaaga(X, Xs, Ys, Cols, Cols1, A, B, row2col_in_gaaga(Xs, Cols, Cols1, .([], A), B)) row2col_in_gaaga([], [], [], A, A) -> row2col_out_gaaga([], [], [], A, A) U4_gaaga(X, Xs, Ys, Cols, Cols1, A, B, row2col_out_gaaga(Xs, Cols, Cols1, .([], A), B)) -> row2col_out_gaaga(.(X, Xs), .(.(X, Ys), Cols), .(Ys, Cols1), A, B) U2_gga(R, Rs, X1, C, Cs, row2col_out_gaaga(R, .(C, Cs), Cols1, [], Accm)) -> U3_gga(R, Rs, X1, C, Cs, transpose_aux_in_gga(Rs, Accm, Cols1)) transpose_aux_in_gga([], X, X) -> transpose_aux_out_gga([], X, X) U3_gga(R, Rs, X1, C, Cs, transpose_aux_out_gga(Rs, Accm, Cols1)) -> transpose_aux_out_gga(.(R, Rs), X1, .(C, Cs)) U1_ga(A, B, transpose_aux_out_gga(A, [], B)) -> transpose_out_ga(A, B) The argument filtering Pi contains the following mapping: transpose_in_ga(x1, x2) = transpose_in_ga(x1) U1_ga(x1, x2, x3) = U1_ga(x3) transpose_aux_in_gga(x1, x2, x3) = transpose_aux_in_gga(x1, x2) .(x1, x2) = .(x1, x2) U2_gga(x1, x2, x3, x4, x5, x6) = U2_gga(x2, x6) row2col_in_gaaga(x1, x2, x3, x4, x5) = row2col_in_gaaga(x1, x4) U4_gaaga(x1, x2, x3, x4, x5, x6, x7, x8) = U4_gaaga(x8) [] = [] row2col_out_gaaga(x1, x2, x3, x4, x5) = row2col_out_gaaga(x5) U3_gga(x1, x2, x3, x4, x5, x6) = U3_gga(x6)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Progr 19030