TSTP Solution File: COM003+2 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Fri Jul 15 01:26:58 EDT 2022
% Result : Theorem 193.86s 25.37s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : COM003+2 : TPTP v8.1.0. Bugfixed v2.2.0.
% 0.08/0.14 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop
% 0.15/0.36 % Computer : n021.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Thu Jun 16 20:05:15 EDT 2022
% 0.15/0.36 % CPUTime :
% 193.86/25.37 % SZS status Theorem
% 193.86/25.37 % SZS output begin IncompleteProof
% 193.86/25.37 cnf(c0, axiom,
% 193.86/25.37 algorithm_program_decides(sK9)).
% 193.86/25.37 cnf(c1, plain,
% 193.86/25.37 algorithm_program_decides(sK9),
% 193.86/25.37 inference(start, [], [c0])).
% 193.86/25.37
% 193.86/25.37 cnf(c2, axiom,
% 193.86/25.37 program_program_decides(sK4) | ~algorithm_program_decides(X0)).
% 193.86/25.37 cnf(a0, assumption,
% 193.86/25.37 sK9 = X0).
% 193.86/25.37 cnf(c3, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 193.86/25.37 cnf(c4, plain,
% 193.86/25.37 program_program_decides(sK4),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 193.86/25.37
% 193.86/25.37 cnf(c5, axiom,
% 193.86/25.37 program_not_halts2_halts3_outputs(X1,X2,X3,bad) | ~program_program_decides(X1)).
% 193.86/25.37 cnf(a1, assumption,
% 193.86/25.37 sK4 = X1).
% 193.86/25.37 cnf(c6, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 193.86/25.37 cnf(c7, plain,
% 193.86/25.37 program_not_halts2_halts3_outputs(X1,X2,X3,bad),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 193.86/25.37
% 193.86/25.37 cnf(c8, axiom,
% 193.86/25.37 program(sK5) | ~program_not_halts2_halts3_outputs(X4,sK6(X4),sK6(X4),bad) | ~program_halts2_halts3_outputs(X4,sK6(X4),sK6(X4),good) | ~program(X4)).
% 193.86/25.37 cnf(a2, assumption,
% 193.86/25.37 X1 = X4).
% 193.86/25.37 cnf(a3, assumption,
% 193.86/25.37 X2 = sK6(X4)).
% 193.86/25.37 cnf(a4, assumption,
% 193.86/25.37 X3 = sK6(X4)).
% 193.86/25.37 cnf(a5, assumption,
% 193.86/25.37 bad = bad).
% 193.86/25.37 cnf(c9, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a2, a3, a4, a5])], [c7, c8])).
% 193.86/25.37 cnf(c10, plain,
% 193.86/25.37 program(sK5) | ~program_halts2_halts3_outputs(X4,sK6(X4),sK6(X4),good) | ~program(X4),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a2, a3, a4, a5])], [c7, c8])).
% 193.86/25.37
% 193.86/25.37 cnf(c11, axiom,
% 193.86/25.37 program(sK7) | ~program_not_halts2_halts2_outputs(X5,sK8(X5),bad) | ~program_halts2_halts2_outputs(X5,sK8(X5),good) | ~program(X5)).
% 193.86/25.37 cnf(a6, assumption,
% 193.86/25.37 sK5 = X5).
% 193.86/25.37 cnf(c12, plain,
% 193.86/25.37 ~program_halts2_halts3_outputs(X4,sK6(X4),sK6(X4),good) | ~program(X4),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 193.86/25.37 cnf(c13, plain,
% 193.86/25.37 program(sK7) | ~program_not_halts2_halts2_outputs(X5,sK8(X5),bad) | ~program_halts2_halts2_outputs(X5,sK8(X5),good),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a6])], [c10, c11])).
% 193.86/25.37
% 193.86/25.37 cnf(c14, axiom,
% 193.86/25.37 program_not_halts2(X6,X7) | halts2(X6,X7) | ~program(X6)).
% 193.86/25.37 cnf(a7, assumption,
% 193.86/25.37 sK7 = X6).
% 193.86/25.37 cnf(c15, plain,
% 193.86/25.37 ~program_not_halts2_halts2_outputs(X5,sK8(X5),bad) | ~program_halts2_halts2_outputs(X5,sK8(X5),good),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])).
% 193.86/25.37 cnf(c16, plain,
% 193.86/25.37 program_not_halts2(X6,X7) | halts2(X6,X7),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a7])], [c13, c14])).
% 193.86/25.37
% 193.86/25.37 cnf(c17, axiom,
% 193.86/25.37 halts2_outputs(X8,X9,X10) | ~program_not_halts2(X9,X9) | ~program_not_halts2_halts2_outputs(X8,X9,X10)).
% 193.86/25.37 cnf(a8, assumption,
% 193.86/25.37 X6 = X9).
% 193.86/25.37 cnf(a9, assumption,
% 193.86/25.37 X7 = X9).
% 193.86/25.37 cnf(c18, plain,
% 193.86/25.37 halts2(X6,X7),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])).
% 193.86/25.37 cnf(c19, plain,
% 193.86/25.37 halts2_outputs(X8,X9,X10) | ~program_not_halts2_halts2_outputs(X8,X9,X10),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a8, a9])], [c16, c17])).
% 193.86/25.37
% 193.86/25.37 cnf(c20, axiom,
% 193.86/25.37 halts2(X11,X12) | ~halts2_outputs(X11,X12,X13)).
% 193.86/25.37 cnf(a10, assumption,
% 193.86/25.37 X8 = X11).
% 193.86/25.37 cnf(a11, assumption,
% 193.86/25.37 X9 = X12).
% 193.86/25.37 cnf(a12, assumption,
% 193.86/25.37 X10 = X13).
% 193.86/25.37 cnf(c21, plain,
% 193.86/25.37 ~program_not_halts2_halts2_outputs(X8,X9,X10),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c19, c20])).
% 193.86/25.37 cnf(c22, plain,
% 193.86/25.37 halts2(X11,X12),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a10, a11, a12])], [c19, c20])).
% 193.86/25.37
% 193.86/25.37 cnf(c23, axiom,
% 193.86/25.37 program_halts2(X14,X15) | ~halts2(X14,X15) | ~program(X14)).
% 193.86/25.37 cnf(a13, assumption,
% 193.86/25.37 X11 = X14).
% 193.86/25.37 cnf(a14, assumption,
% 193.86/25.37 X12 = X15).
% 193.86/25.37 cnf(c24, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a13, a14])], [c22, c23])).
% 193.86/25.37 cnf(c25, plain,
% 193.86/25.37 program_halts2(X14,X15) | ~program(X14),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a13, a14])], [c22, c23])).
% 193.86/25.37
% 193.86/25.37 cnf(c26, axiom,
% 193.86/25.37 ~halts2(X16,X17) | ~program_halts2(X17,X17) | ~sP1(X16)).
% 193.86/25.37 cnf(a15, assumption,
% 193.86/25.37 X14 = X17).
% 193.86/25.37 cnf(a16, assumption,
% 193.86/25.37 X15 = X17).
% 193.86/25.37 cnf(c27, plain,
% 193.86/25.37 ~program(X14),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])).
% 193.86/25.37 cnf(c28, plain,
% 193.86/25.37 ~halts2(X16,X17) | ~sP1(X16),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a15, a16])], [c25, c26])).
% 193.86/25.37
% 193.86/25.37 cnf(c29, plain,
% 193.86/25.37 halts2(X11,X12)).
% 193.86/25.37 cnf(a17, assumption,
% 193.86/25.37 X16 = X11).
% 193.86/25.37 cnf(a18, assumption,
% 193.86/25.37 X17 = X12).
% 193.86/25.37 cnf(c30, plain,
% 193.86/25.37 ~sP1(X16),
% 193.86/25.37 inference(predicate_reduction, [assumptions([a17, a18])], [c28, c29])).
% 193.86/25.37
% 193.86/25.37 cnf(c31, axiom,
% 193.86/25.37 sP1(sK7) | ~program_not_halts2_halts2_outputs(X18,sK8(X18),bad) | ~program_halts2_halts2_outputs(X18,sK8(X18),good) | ~program(X18)).
% 193.86/25.37 cnf(a19, assumption,
% 193.86/25.37 X16 = sK7).
% 193.86/25.37 cnf(c32, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a19])], [c30, c31])).
% 193.86/25.37 cnf(c33, plain,
% 193.86/25.37 ~program_not_halts2_halts2_outputs(X18,sK8(X18),bad) | ~program_halts2_halts2_outputs(X18,sK8(X18),good) | ~program(X18),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a19])], [c30, c31])).
% 193.86/25.37
% 193.86/25.37 cnf(c34, axiom,
% 193.86/25.37 program_not_halts2_halts2_outputs(X19,X20,bad) | ~sP0(X19)).
% 193.86/25.37 cnf(a20, assumption,
% 193.86/25.37 X18 = X19).
% 193.86/25.37 cnf(a21, assumption,
% 193.86/25.37 sK8(X18) = X20).
% 193.86/25.37 cnf(a22, assumption,
% 193.86/25.37 bad = bad).
% 193.86/25.37 cnf(c35, plain,
% 193.86/25.37 ~program_halts2_halts2_outputs(X18,sK8(X18),good) | ~program(X18),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a20, a21, a22])], [c33, c34])).
% 193.86/25.37 cnf(c36, plain,
% 193.86/25.37 ~sP0(X19),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a20, a21, a22])], [c33, c34])).
% 193.86/25.37
% 193.86/25.37 cnf(c37, axiom,
% 193.86/25.37 sP0(sK5) | ~program_not_halts2_halts3_outputs(X21,sK6(X21),sK6(X21),bad) | ~program_halts2_halts3_outputs(X21,sK6(X21),sK6(X21),good) | ~program(X21)).
% 193.86/25.37 cnf(a23, assumption,
% 193.86/25.37 X19 = sK5).
% 193.86/25.37 cnf(c38, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a23])], [c36, c37])).
% 193.86/25.37 cnf(c39, plain,
% 193.86/25.37 ~program_not_halts2_halts3_outputs(X21,sK6(X21),sK6(X21),bad) | ~program_halts2_halts3_outputs(X21,sK6(X21),sK6(X21),good) | ~program(X21),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a23])], [c36, c37])).
% 193.86/25.37
% 193.86/25.37 cnf(c40, plain,
% 193.86/25.37 program_not_halts2_halts3_outputs(X1,X2,X3,bad)).
% 193.86/25.37 cnf(a24, assumption,
% 193.86/25.37 X21 = X1).
% 193.86/25.37 cnf(a25, assumption,
% 193.86/25.37 sK6(X21) = X2).
% 193.86/25.37 cnf(a26, assumption,
% 193.86/25.37 sK6(X21) = X3).
% 193.86/25.37 cnf(a27, assumption,
% 193.86/25.37 bad = bad).
% 193.86/25.37 cnf(c41, plain,
% 193.86/25.37 ~program_halts2_halts3_outputs(X21,sK6(X21),sK6(X21),good) | ~program(X21),
% 193.86/25.37 inference(predicate_reduction, [assumptions([a24, a25, a26, a27])], [c39, c40])).
% 193.86/25.37
% 193.86/25.37 cnf(c42, axiom,
% 193.86/25.37 program_halts2_halts3_outputs(X22,X23,X24,good) | ~program_program_decides(X22)).
% 193.86/25.37 cnf(a28, assumption,
% 193.86/25.37 X21 = X22).
% 193.86/25.37 cnf(a29, assumption,
% 193.86/25.37 sK6(X21) = X23).
% 193.86/25.37 cnf(a30, assumption,
% 193.86/25.37 sK6(X21) = X24).
% 193.86/25.37 cnf(a31, assumption,
% 193.86/25.37 good = good).
% 193.86/25.37 cnf(c43, plain,
% 193.86/25.37 ~program(X21),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a28, a29, a30, a31])], [c41, c42])).
% 193.86/25.37 cnf(c44, plain,
% 193.86/25.37 ~program_program_decides(X22),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a28, a29, a30, a31])], [c41, c42])).
% 193.86/25.37
% 193.86/25.37 cnf(c45, plain,
% 193.86/25.37 program_program_decides(sK4)).
% 193.86/25.37 cnf(a32, assumption,
% 193.86/25.37 X22 = sK4).
% 193.86/25.37 cnf(c46, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a32])], [c44, c45])).
% 193.86/25.37
% 193.86/25.37 cnf(c47, axiom,
% 193.86/25.37 program(X25) | ~program_program_decides(X25)).
% 193.86/25.37 cnf(a33, assumption,
% 193.86/25.37 X21 = X25).
% 193.86/25.37 cnf(c48, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a33])], [c43, c47])).
% 193.86/25.37 cnf(c49, plain,
% 193.86/25.37 ~program_program_decides(X25),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a33])], [c43, c47])).
% 193.86/25.37
% 193.86/25.37 cnf(c50, plain,
% 193.86/25.37 program_program_decides(sK4)).
% 193.86/25.37 cnf(a34, assumption,
% 193.86/25.37 X25 = sK4).
% 193.86/25.37 cnf(c51, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a34])], [c49, c50])).
% 193.86/25.37
% 193.86/25.37 cnf(c52, axiom,
% 193.86/25.37 program_halts2_halts2_outputs(X26,X27,good) | ~sP0(X26)).
% 193.86/25.37 cnf(a35, assumption,
% 193.86/25.37 X18 = X26).
% 193.86/25.37 cnf(a36, assumption,
% 193.86/25.37 sK8(X18) = X27).
% 193.86/25.37 cnf(a37, assumption,
% 193.86/25.37 good = good).
% 193.86/25.37 cnf(c53, plain,
% 193.86/25.37 ~program(X18),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a35, a36, a37])], [c35, c52])).
% 193.86/25.37 cnf(c54, plain,
% 193.86/25.37 ~sP0(X26),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a35, a36, a37])], [c35, c52])).
% 193.86/25.37
% 193.86/25.37 cnf(c55, plain,
% 193.86/25.37 sP0(X19)).
% 193.86/25.37 cnf(a38, assumption,
% 193.86/25.37 X26 = X19).
% 193.86/25.37 cnf(c56, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a38])], [c54, c55])).
% 193.86/25.37
% 193.86/25.37 cnf(c57, plain,
% 193.86/25.37 program(sK5)).
% 193.86/25.37 cnf(a39, assumption,
% 193.86/25.37 X18 = sK5).
% 193.86/25.37 cnf(c58, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a39])], [c53, c57])).
% 193.86/25.37
% 193.86/25.37 cnf(c59, plain,
% 193.86/25.37 program(sK7)).
% 193.86/25.37 cnf(a40, assumption,
% 193.86/25.37 X14 = sK7).
% 193.86/25.37 cnf(c60, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a40])], [c27, c59])).
% 193.86/25.37
% 193.86/25.37 cnf(c61, axiom,
% 193.86/25.37 program_not_halts2_halts2_outputs(X28,X29,good) | ~sP1(X28)).
% 193.86/25.37 cnf(a41, assumption,
% 193.86/25.37 X8 = X28).
% 193.86/25.37 cnf(a42, assumption,
% 193.86/25.37 X9 = X29).
% 193.86/25.37 cnf(a43, assumption,
% 193.86/25.37 X10 = good).
% 193.86/25.37 cnf(c62, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a41, a42, a43])], [c21, c61])).
% 193.86/25.37 cnf(c63, plain,
% 193.86/25.37 ~sP1(X28),
% 193.86/25.37 inference(strict_predicate_extension, [assumptions([a41, a42, a43])], [c21, c61])).
% 193.86/25.37
% 193.86/25.37 cnf(c64, plain,
% 193.86/25.37 sP1(X16)).
% 193.86/25.37 cnf(a44, assumption,
% 193.86/25.37 X28 = X16).
% 193.86/25.37 cnf(c65, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a44])], [c63, c64])).
% 193.86/25.37
% 193.86/25.37 cnf(c66, plain,
% 193.86/25.37 ~halts2(X11,X12)).
% 193.86/25.37 cnf(a45, assumption,
% 193.86/25.37 X6 = X11).
% 193.86/25.37 cnf(a46, assumption,
% 193.86/25.37 X7 = X12).
% 193.86/25.37 cnf(c67, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a45, a46])], [c18, c66])).
% 193.86/25.37
% 193.86/25.37 cnf(c68, plain,
% 193.86/25.37 program_not_halts2_halts2_outputs(X18,sK8(X18),bad)).
% 193.86/25.37 cnf(a47, assumption,
% 193.86/25.37 X5 = X18).
% 193.86/25.37 cnf(a48, assumption,
% 193.86/25.37 sK8(X5) = sK8(X18)).
% 193.86/25.37 cnf(a49, assumption,
% 193.86/25.37 bad = bad).
% 193.86/25.37 cnf(c69, plain,
% 193.86/25.37 ~program_halts2_halts2_outputs(X5,sK8(X5),good),
% 193.86/25.37 inference(predicate_reduction, [assumptions([a47, a48, a49])], [c15, c68])).
% 193.86/25.37
% 193.86/25.37 cnf(c70, plain,
% 193.86/25.37 program_halts2_halts2_outputs(X18,sK8(X18),good)).
% 193.86/25.37 cnf(a50, assumption,
% 193.86/25.37 X5 = X18).
% 193.86/25.37 cnf(a51, assumption,
% 193.86/25.37 sK8(X5) = sK8(X18)).
% 193.86/25.37 cnf(a52, assumption,
% 193.86/25.37 good = good).
% 193.86/25.37 cnf(c71, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a50, a51, a52])], [c69, c70])).
% 193.86/25.37
% 193.86/25.37 cnf(c72, plain,
% 193.86/25.37 program_halts2_halts3_outputs(X21,sK6(X21),sK6(X21),good)).
% 193.86/25.37 cnf(a53, assumption,
% 193.86/25.37 X4 = X21).
% 193.86/25.37 cnf(a54, assumption,
% 193.86/25.37 sK6(X4) = sK6(X21)).
% 193.86/25.37 cnf(a55, assumption,
% 193.86/25.37 sK6(X4) = sK6(X21)).
% 193.86/25.37 cnf(a56, assumption,
% 193.86/25.37 good = good).
% 193.86/25.37 cnf(c73, plain,
% 193.86/25.37 ~program(X4),
% 193.86/25.37 inference(predicate_reduction, [assumptions([a53, a54, a55, a56])], [c12, c72])).
% 193.86/25.37
% 193.86/25.37 cnf(c74, plain,
% 193.86/25.37 program(X21)).
% 193.86/25.37 cnf(a57, assumption,
% 193.86/25.37 X4 = X21).
% 193.86/25.37 cnf(c75, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(predicate_reduction, [assumptions([a57])], [c73, c74])).
% 193.86/25.37
% 193.86/25.37 cnf(c76, plain,
% 193.86/25.37 $false,
% 193.86/25.37 inference(constraint_solving, [
% 193.86/25.37 bind(X0, sK9),
% 193.86/25.37 bind(X1, sK4),
% 193.86/25.37 bind(X2, sK6(X4)),
% 193.86/25.37 bind(X3, sK6(X4)),
% 193.86/25.37 bind(X4, sK4),
% 193.86/25.37 bind(X5, sK5),
% 193.86/25.37 bind(X6, sK7),
% 193.86/25.37 bind(X7, sK7),
% 193.86/25.37 bind(X8, sK7),
% 193.86/25.37 bind(X9, sK7),
% 193.86/25.37 bind(X10, good),
% 193.86/25.37 bind(X11, sK7),
% 193.86/25.37 bind(X12, sK7),
% 193.86/25.37 bind(X13, good),
% 193.86/25.37 bind(X14, sK7),
% 193.86/25.37 bind(X15, sK7),
% 193.86/25.37 bind(X16, sK7),
% 193.86/25.37 bind(X17, sK7),
% 193.86/25.37 bind(X18, sK5),
% 193.86/25.37 bind(X19, sK5),
% 193.86/25.37 bind(X20, sK8(X18)),
% 193.86/25.37 bind(X21, sK4),
% 193.86/25.37 bind(X22, sK4),
% 193.86/25.37 bind(X23, sK6(X21)),
% 193.86/25.37 bind(X24, sK6(X21)),
% 193.86/25.37 bind(X25, sK4),
% 193.86/25.37 bind(X26, sK5),
% 193.86/25.37 bind(X27, sK8(X18)),
% 193.86/25.37 bind(X28, sK7),
% 193.86/25.37 bind(X29, sK7)
% 193.86/25.37 ],
% 193.86/25.37 [a0, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20, a21, a22, a23, a24, a25, a26, a27, a28, a29, a30, a31, a32, a33, a34, a35, a36, a37, a38, a39, a40, a41, a42, a43, a44, a45, a46, a47, a48, a49, a50, a51, a52, a53, a54, a55, a56, a57])).
% 193.86/25.37
% 193.86/25.37 % SZS output end IncompleteProof
%------------------------------------------------------------------------------