%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : SET885+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 08:57:44 AM UTC 2026
% Result : Theorem 0.32s 0.59s
% Output : Proof 0.32s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('theBenchmark.p',antisymmetry_r2_hidden) ).
fof(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('theBenchmark.p',commutativity_k2_tarski) ).
fof(d1_tarski,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('theBenchmark.p',d1_tarski) ).
fof(d2_tarski,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('theBenchmark.p',d2_tarski) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(rc1_xboole_0,axiom,
? [A] : empty(A),
file('theBenchmark.p',rc1_xboole_0) ).
fof(rc2_xboole_0,axiom,
? [A] : ~ empty(A),
file('theBenchmark.p',rc2_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t26_zfmisc_1,conjecture,
! [A,B,C] :
( subset(unordered_pair(A,B),singleton(C))
=> A = C ),
file('theBenchmark.p',t26_zfmisc_1) ).
fof(f_1_1,plain,
! [A,B] :
( ~ in(B,A)
| ~ in(A,B) ),
inference(fof_nnf,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
cnf(f_1_3,plain,
( ~ in(U_0,U_1)
| ~ in(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_2]) ).
fof(f_2_1,plain,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
inference(fof_nnf,[status(thm)],[commutativity_k2_tarski]) ).
fof(f_2_2,plain,
! [U_3,U_2] : unordered_pair(U_3,U_2) = unordered_pair(U_2,U_3),
inference(variable_rename,[status(thm)],[f_2_1]) ).
cnf(f_2_3,plain,
unordered_pair(U_3,U_2) = unordered_pair(U_2,U_3),
inference(clausify,[status(thm)],[f_2_2]) ).
fof(f_3_1,plain,
! [A,B] :
( ( B = singleton(A)
| ? [C] :
( ( ~ in(C,B)
& C = A )
| ( C != A
& in(C,B) ) ) )
& ( ! [C] :
( ( in(C,B)
| C != A )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(fof_nnf,[status(thm)],[d1_tarski]) ).
fof(f_3_2,plain,
! [U_7,U_6] :
( ( U_6 = singleton(U_7)
| ? [U_5] :
( ( ~ in(U_5,U_6)
& U_5 = U_7 )
| ( U_5 != U_7
& in(U_5,U_6) ) ) )
& ( ! [U_4] :
( ( in(U_4,U_6)
| U_4 != U_7 )
& ( U_4 = U_7
| ~ in(U_4,U_6) ) )
| U_6 != singleton(U_7) ) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
( ! [U_15,U_13] :
( U_13 = singleton(U_15)
| ? [U_11] :
( ~ in(U_11,U_13)
& U_11 = U_15 )
| ? [U_10] :
( U_10 != U_15
& in(U_10,U_13) ) )
& ! [U_14,U_12] :
( ( ! [U_9] :
( in(U_9,U_12)
| U_9 != U_14 )
& ! [U_8] :
( U_8 = U_14
| ~ in(U_8,U_12) ) )
| U_12 != singleton(U_14) ) ),
inference(miniscope,[status(thm)],[f_3_2]) ).
fof(f_3_4,plain,
( ! [U_15,U_13] :
( U_13 = singleton(U_15)
| ? [U_11] :
( ~ in(U_11,U_13)
& U_11 = U_15 )
| ( sK1(U_15,U_13) != U_15
& in(sK1(U_15,U_13),U_13) ) )
& ! [U_14,U_12] :
( ( ! [U_9] :
( in(U_9,U_12)
| U_9 != U_14 )
& ! [U_8] :
( U_8 = U_14
| ~ in(U_8,U_12) ) )
| U_12 != singleton(U_14) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_10,sK1(U_15,U_13))],[f_3_3]) ).
fof(f_3_5,plain,
( ! [U_15,U_13] :
( U_13 = singleton(U_15)
| ( ~ in(sK2(U_15,U_13),U_13)
& sK2(U_15,U_13) = U_15 )
| ( sK1(U_15,U_13) != U_15
& in(sK1(U_15,U_13),U_13) ) )
& ! [U_14,U_12] :
( ( ! [U_9] :
( in(U_9,U_12)
| U_9 != U_14 )
& ! [U_8] :
( U_8 = U_14
| ~ in(U_8,U_12) ) )
| U_12 != singleton(U_14) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_11,sK2(U_15,U_13))],[f_3_4]) ).
cnf(f_3_6,plain,
( U_8 = U_14
| ~ in(U_8,U_12)
| U_12 != singleton(U_14) ),
inference(clausify,[status(thm)],[f_3_5]) ).
cnf(f_3_7,plain,
( in(U_9,U_12)
| U_9 != U_14
| U_12 != singleton(U_14) ),
inference(clausify,[status(thm)],[f_3_5]) ).
cnf(f_3_8,plain,
( sK2(U_15,U_13) = U_15
| in(sK1(U_15,U_13),U_13)
| U_13 = singleton(U_15) ),
inference(clausify,[status(thm)],[f_3_5]) ).
cnf(f_3_9,plain,
( ~ in(sK2(U_15,U_13),U_13)
| in(sK1(U_15,U_13),U_13)
| U_13 = singleton(U_15) ),
inference(clausify,[status(thm)],[f_3_5]) ).
cnf(f_3_10,plain,
( sK2(U_15,U_13) = U_15
| sK1(U_15,U_13) != U_15
| U_13 = singleton(U_15) ),
inference(clausify,[status(thm)],[f_3_5]) ).
cnf(f_3_11,plain,
( ~ in(sK2(U_15,U_13),U_13)
| sK1(U_15,U_13) != U_15
| U_13 = singleton(U_15) ),
inference(clausify,[status(thm)],[f_3_5]) ).
fof(f_4_1,plain,
! [A,B,C] :
( ( C = unordered_pair(A,B)
| ? [D] :
( ( ~ in(D,C)
& ( D = B
| D = A ) )
| ( D != B
& D != A
& in(D,C) ) ) )
& ( ! [D] :
( ( in(D,C)
| ( D != B
& D != A ) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(fof_nnf,[status(thm)],[d2_tarski]) ).
fof(f_4_2,plain,
! [U_20,U_19,U_18] :
( ( U_18 = unordered_pair(U_20,U_19)
| ? [U_17] :
( ( ~ in(U_17,U_18)
& ( U_17 = U_19
| U_17 = U_20 ) )
| ( U_17 != U_19
& U_17 != U_20
& in(U_17,U_18) ) ) )
& ( ! [U_16] :
( ( in(U_16,U_18)
| ( U_16 != U_19
& U_16 != U_20 ) )
& ( U_16 = U_19
| U_16 = U_20
| ~ in(U_16,U_18) ) )
| U_18 != unordered_pair(U_20,U_19) ) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
( ! [U_30,U_28,U_26] :
( U_26 = unordered_pair(U_30,U_28)
| ? [U_24] :
( ~ in(U_24,U_26)
& ( U_24 = U_28
| U_24 = U_30 ) )
| ? [U_23] :
( U_23 != U_28
& U_23 != U_30
& in(U_23,U_26) ) )
& ! [U_29,U_27,U_25] :
( ( ! [U_22] :
( in(U_22,U_25)
| ( U_22 != U_27
& U_22 != U_29 ) )
& ! [U_21] :
( U_21 = U_27
| U_21 = U_29
| ~ in(U_21,U_25) ) )
| U_25 != unordered_pair(U_29,U_27) ) ),
inference(miniscope,[status(thm)],[f_4_2]) ).
fof(f_4_4,plain,
( ! [U_30,U_28,U_26] :
( U_26 = unordered_pair(U_30,U_28)
| ? [U_24] :
( ~ in(U_24,U_26)
& ( U_24 = U_28
| U_24 = U_30 ) )
| ( sK3(U_30,U_28,U_26) != U_28
& sK3(U_30,U_28,U_26) != U_30
& in(sK3(U_30,U_28,U_26),U_26) ) )
& ! [U_29,U_27,U_25] :
( ( ! [U_22] :
( in(U_22,U_25)
| ( U_22 != U_27
& U_22 != U_29 ) )
& ! [U_21] :
( U_21 = U_27
| U_21 = U_29
| ~ in(U_21,U_25) ) )
| U_25 != unordered_pair(U_29,U_27) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_23,sK3(U_30,U_28,U_26))],[f_4_3]) ).
fof(f_4_5,plain,
( ! [U_30,U_28,U_26] :
( U_26 = unordered_pair(U_30,U_28)
| ( ~ in(sK4(U_30,U_28,U_26),U_26)
& ( sK4(U_30,U_28,U_26) = U_28
| sK4(U_30,U_28,U_26) = U_30 ) )
| ( sK3(U_30,U_28,U_26) != U_28
& sK3(U_30,U_28,U_26) != U_30
& in(sK3(U_30,U_28,U_26),U_26) ) )
& ! [U_29,U_27,U_25] :
( ( ! [U_22] :
( in(U_22,U_25)
| ( U_22 != U_27
& U_22 != U_29 ) )
& ! [U_21] :
( U_21 = U_27
| U_21 = U_29
| ~ in(U_21,U_25) ) )
| U_25 != unordered_pair(U_29,U_27) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_24,sK4(U_30,U_28,U_26))],[f_4_4]) ).
cnf(f_4_6,plain,
( U_21 = U_27
| U_21 = U_29
| ~ in(U_21,U_25)
| U_25 != unordered_pair(U_29,U_27) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_7,plain,
( U_22 != U_29
| in(U_22,U_25)
| U_25 != unordered_pair(U_29,U_27) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_8,plain,
( U_22 != U_27
| in(U_22,U_25)
| U_25 != unordered_pair(U_29,U_27) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_9,plain,
( sK4(U_30,U_28,U_26) = U_28
| sK4(U_30,U_28,U_26) = U_30
| in(sK3(U_30,U_28,U_26),U_26)
| U_26 = unordered_pair(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_10,plain,
( ~ in(sK4(U_30,U_28,U_26),U_26)
| in(sK3(U_30,U_28,U_26),U_26)
| U_26 = unordered_pair(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_11,plain,
( sK3(U_30,U_28,U_26) != U_30
| sK4(U_30,U_28,U_26) = U_28
| sK4(U_30,U_28,U_26) = U_30
| U_26 = unordered_pair(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_12,plain,
( sK3(U_30,U_28,U_26) != U_28
| sK4(U_30,U_28,U_26) = U_28
| sK4(U_30,U_28,U_26) = U_30
| U_26 = unordered_pair(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_13,plain,
( sK3(U_30,U_28,U_26) != U_30
| ~ in(sK4(U_30,U_28,U_26),U_26)
| U_26 = unordered_pair(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_5]) ).
cnf(f_4_14,plain,
( sK3(U_30,U_28,U_26) != U_28
| ~ in(sK4(U_30,U_28,U_26),U_26)
| U_26 = unordered_pair(U_30,U_28) ),
inference(clausify,[status(thm)],[f_4_5]) ).
fof(f_5_1,plain,
! [A,B] :
( ( subset(A,B)
| ? [C] :
( ~ in(C,B)
& in(C,A) ) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_tarski]) ).
fof(f_5_2,plain,
! [U_34,U_33] :
( ( subset(U_34,U_33)
| ? [U_32] :
( ~ in(U_32,U_33)
& in(U_32,U_34) ) )
& ( ! [U_31] :
( in(U_31,U_33)
| ~ in(U_31,U_34) )
| ~ subset(U_34,U_33) ) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
( ! [U_38,U_36] :
( subset(U_38,U_36)
| ? [U_32] :
( ~ in(U_32,U_36)
& in(U_32,U_38) ) )
& ! [U_37,U_35] :
( ! [U_31] :
( in(U_31,U_35)
| ~ in(U_31,U_37) )
| ~ subset(U_37,U_35) ) ),
inference(miniscope,[status(thm)],[f_5_2]) ).
fof(f_5_4,plain,
( ! [U_38,U_36] :
( subset(U_38,U_36)
| ( ~ in(sK5(U_38,U_36),U_36)
& in(sK5(U_38,U_36),U_38) ) )
& ! [U_37,U_35] :
( ! [U_31] :
( in(U_31,U_35)
| ~ in(U_31,U_37) )
| ~ subset(U_37,U_35) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_32,sK5(U_38,U_36))],[f_5_3]) ).
cnf(f_5_5,plain,
( in(U_31,U_35)
| ~ in(U_31,U_37)
| ~ subset(U_37,U_35) ),
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(f_5_6,plain,
( in(sK5(U_38,U_36),U_38)
| subset(U_38,U_36) ),
inference(clausify,[status(thm)],[f_5_4]) ).
cnf(f_5_7,plain,
( ~ in(sK5(U_38,U_36),U_36)
| subset(U_38,U_36) ),
inference(clausify,[status(thm)],[f_5_4]) ).
fof(f_6_1,plain,
? [A] : empty(A),
inference(fof_nnf,[status(thm)],[rc1_xboole_0]) ).
fof(f_6_2,plain,
? [U_39] : empty(U_39),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
empty(sK6),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_39,sK6)],[f_6_2]) ).
cnf(f_6_4,plain,
empty(sK6),
inference(clausify,[status(thm)],[f_6_3]) ).
fof(f_7_1,plain,
? [A] : ~ empty(A),
inference(fof_nnf,[status(thm)],[rc2_xboole_0]) ).
fof(f_7_2,plain,
? [U_40] : ~ empty(U_40),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
~ empty(sK7),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_40,sK7)],[f_7_2]) ).
cnf(f_7_4,plain,
~ empty(sK7),
inference(clausify,[status(thm)],[f_7_3]) ).
fof(f_8_1,plain,
! [A,B] : subset(A,A),
inference(fof_nnf,[status(thm)],[reflexivity_r1_tarski]) ).
fof(f_8_2,plain,
! [U_42,U_41] : subset(U_42,U_42),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
! [U_42] : subset(U_42,U_42),
inference(miniscope,[status(thm)],[f_8_2]) ).
cnf(f_8_4,plain,
subset(U_42,U_42),
inference(clausify,[status(thm)],[f_8_3]) ).
fof(f_9_1,negated_conjecture,
~ ! [A,B,C] :
( subset(unordered_pair(A,B),singleton(C))
=> A = C ),
inference(negate,[status(cth)],[t26_zfmisc_1]) ).
fof(f_9_2,negated_conjecture,
? [A,B,C] :
( A != C
& subset(unordered_pair(A,B),singleton(C)) ),
inference(fof_nnf,[status(thm)],[f_9_1]) ).
fof(f_9_3,negated_conjecture,
? [U_45,U_44,U_43] :
( U_45 != U_43
& subset(unordered_pair(U_45,U_44),singleton(U_43)) ),
inference(variable_rename,[status(thm)],[f_9_2]) ).
fof(f_9_4,negated_conjecture,
? [U_44,U_43] :
( sK8 != U_43
& subset(unordered_pair(sK8,U_44),singleton(U_43)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(U_45,sK8)],[f_9_3]) ).
fof(f_9_5,negated_conjecture,
? [U_43] :
( sK8 != U_43
& subset(unordered_pair(sK8,sK9),singleton(U_43)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(U_44,sK9)],[f_9_4]) ).
fof(f_9_6,negated_conjecture,
( sK8 != sK10
& subset(unordered_pair(sK8,sK9),singleton(sK10)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(U_43,sK10)],[f_9_5]) ).
fof(f_9_7,negated_conjecture,
( sK8 != sK10
& subset(unordered_pair(sK8,sK9),singleton(sK10)) ),
inference(definitional_conversion,[status(esa)],[f_9_6]) ).
cnf(f_9_8,negated_conjecture,
subset(unordered_pair(sK8,sK9),singleton(sK10)),
inference(clausify,[status(thm)],[f_9_7]) ).
cnf(f_9_9,negated_conjecture,
sK8 != sK10,
inference(clausify,[status(thm)],[f_9_7]) ).
cnf(equality_1,axiom,
Eq_x_0 = Eq_x_0,
theory(equality,[reflexivity]) ).
cnf(equality_2,axiom,
( Eq_x_1 = Eq_x_0
| Eq_x_0 != Eq_x_1 ),
theory(equality,[symmetry]) ).
cnf(equality_3,axiom,
( Eq_x_0 = Eq_x_2
| Eq_x_1 != Eq_x_2
| Eq_x_0 != Eq_x_1 ),
theory(equality,[transitivity]) ).
cnf(equality_4,axiom,
( unordered_pair(Eq_x_0,Eq_x_1) = unordered_pair(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_5,axiom,
( singleton(Eq_x_0) = singleton(Eq_y_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_6,axiom,
( sK1(Eq_x_0,Eq_x_1) = sK1(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_7,axiom,
( sK2(Eq_x_0,Eq_x_1) = sK2(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_8,axiom,
( sK3(Eq_x_0,Eq_x_1,Eq_x_2) = sK3(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_9,axiom,
( sK4(Eq_x_0,Eq_x_1,Eq_x_2) = sK4(Eq_y_0,Eq_y_1,Eq_y_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_10,axiom,
( sK5(Eq_x_0,Eq_x_1) = sK5(Eq_y_0,Eq_y_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_functions]) ).
cnf(equality_11,axiom,
( in(Eq_y_0,Eq_y_1)
| ~ in(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_12,axiom,
( subset(Eq_y_0,Eq_y_1)
| ~ subset(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_13,axiom,
( empty(Eq_y_0)
| ~ empty(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(sat_proved,plain,
$false,
inference(cadical,[status(thm)],[]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET885+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04 % Command : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sat Sep 19 23:08:42 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.32/0.59 % SZS status Theorem for theBenchmark
% 0.32/0.59 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------