%------------------------------------------------------------------------------
% File : ConnectPP---0.7.2
% Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.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 : n002.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:50:34 AM UTC 2026
% Result : Theorem 30.16s 30.41s
% Output : Proof 30.16s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(mp6_1,axiom,
! [X,Y] :
~ ( X = Y
& greater(X,Y) ),
file('theBenchmark.p',mp6_1) ).
fof(mp6_2,axiom,
! [X,Y] :
~ ( greater(Y,X)
& greater(X,Y) ),
file('theBenchmark.p',mp6_2) ).
fof(mp15,axiom,
! [X,T] :
( organization(X,T)
=> time(T) ),
file('theBenchmark.p',mp15) ).
fof(mp16,axiom,
! [T1,T2] :
( ( time(T2)
& time(T1) )
=> ( greater(T2,T1)
| T1 = T2
| greater(T1,T2) ) ),
file('theBenchmark.p',mp16) ).
fof(mp17,axiom,
! [X,T1,T2] :
( reorganization_free(X,T1,T2)
=> reorganization_free(X,T2,T1) ),
file('theBenchmark.p',mp17) ).
fof(mp18,axiom,
! [X,C1,C2,T1,T2] :
( ( T1 = T2
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& organization(X,T2)
& organization(X,T1) )
=> C1 = C2 ),
file('theBenchmark.p',mp18) ).
fof(t11_FOL,hypothesis,
! [X,S1,S2,T1,T2] :
( ( greater(T2,T1)
& size(X,S2,T2)
& size(X,S1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(S1,S2) ),
file('theBenchmark.p',t11_FOL) ).
fof(t12_FOL,hypothesis,
! [X,C1,C2,T1,T2] :
( ( greater(T2,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(C1,C2) ),
file('theBenchmark.p',t12_FOL) ).
fof(t13_FOL,conjecture,
! [X,C1,C2,S1,S2,T1,T2] :
( ( greater(C2,C1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(S1,S2) ),
file('theBenchmark.p',t13_FOL) ).
fof(f_1_1,plain,
! [X,Y] :
( X != Y
| ~ greater(X,Y) ),
inference(fof_nnf,[status(thm)],[mp6_1]) ).
fof(f_1_2,plain,
! [U_1,U_0] :
( U_1 != U_0
| ~ greater(U_1,U_0) ),
inference(variable_rename,[status(thm)],[f_1_1]) ).
fof(f_1_3,plain,
! [U_0,U_1] :
( U_1 != U_0
| ~ greater(U_1,U_0) ),
inference(definitional_conversion,[status(esa)],[f_1_2]) ).
cnf(f_1_4,plain,
( U_1 != U_0
| ~ greater(U_1,U_0) ),
inference(clausify,[status(thm)],[f_1_3]) ).
fof(f_2_1,plain,
! [X,Y] :
( ~ greater(Y,X)
| ~ greater(X,Y) ),
inference(fof_nnf,[status(thm)],[mp6_2]) ).
fof(f_2_2,plain,
! [U_3,U_2] :
( ~ greater(U_2,U_3)
| ~ greater(U_3,U_2) ),
inference(variable_rename,[status(thm)],[f_2_1]) ).
fof(f_2_3,plain,
! [U_3,U_2] :
( ~ greater(U_2,U_3)
| ~ greater(U_3,U_2) ),
inference(definitional_conversion,[status(esa)],[f_2_2]) ).
cnf(f_2_4,plain,
( ~ greater(U_2,U_3)
| ~ greater(U_3,U_2) ),
inference(clausify,[status(thm)],[f_2_3]) ).
fof(f_3_1,plain,
! [X,T] :
( time(T)
| ~ organization(X,T) ),
inference(fof_nnf,[status(thm)],[mp15]) ).
fof(f_3_2,plain,
! [U_5,U_4] :
( time(U_4)
| ~ organization(U_5,U_4) ),
inference(variable_rename,[status(thm)],[f_3_1]) ).
fof(f_3_3,plain,
! [U_5,U_4] :
( time(U_4)
| ~ organization(U_5,U_4) ),
inference(definitional_conversion,[status(esa)],[f_3_2]) ).
cnf(f_3_4,plain,
( time(U_4)
| ~ organization(U_5,U_4) ),
inference(clausify,[status(thm)],[f_3_3]) ).
fof(f_4_1,plain,
! [T1,T2] :
( greater(T2,T1)
| T1 = T2
| greater(T1,T2)
| ~ time(T2)
| ~ time(T1) ),
inference(fof_nnf,[status(thm)],[mp16]) ).
fof(f_4_2,plain,
! [U_7,U_6] :
( greater(U_6,U_7)
| U_7 = U_6
| greater(U_7,U_6)
| ~ time(U_6)
| ~ time(U_7) ),
inference(variable_rename,[status(thm)],[f_4_1]) ).
fof(f_4_3,plain,
! [U_6,U_7] :
( greater(U_6,U_7)
| U_7 = U_6
| greater(U_7,U_6)
| ~ time(U_6)
| ~ time(U_7) ),
inference(definitional_conversion,[status(esa)],[f_4_2]) ).
cnf(f_4_4,plain,
( greater(U_6,U_7)
| U_7 = U_6
| greater(U_7,U_6)
| ~ time(U_6)
| ~ time(U_7) ),
inference(clausify,[status(thm)],[f_4_3]) ).
fof(f_5_1,plain,
! [X,T1,T2] :
( reorganization_free(X,T2,T1)
| ~ reorganization_free(X,T1,T2) ),
inference(fof_nnf,[status(thm)],[mp17]) ).
fof(f_5_2,plain,
! [U_10,U_9,U_8] :
( reorganization_free(U_10,U_8,U_9)
| ~ reorganization_free(U_10,U_9,U_8) ),
inference(variable_rename,[status(thm)],[f_5_1]) ).
fof(f_5_3,plain,
! [U_8,U_10,U_9] :
( reorganization_free(U_10,U_8,U_9)
| ~ reorganization_free(U_10,U_9,U_8) ),
inference(definitional_conversion,[status(esa)],[f_5_2]) ).
cnf(f_5_4,plain,
( reorganization_free(U_10,U_8,U_9)
| ~ reorganization_free(U_10,U_9,U_8) ),
inference(clausify,[status(thm)],[f_5_3]) ).
fof(f_6_1,plain,
! [X,C1,C2,T1,T2] :
( C1 = C2
| T1 != T2
| ~ complexity(X,C2,T2)
| ~ complexity(X,C1,T1)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(fof_nnf,[status(thm)],[mp18]) ).
fof(f_6_2,plain,
! [U_15,U_14,U_13,U_12,U_11] :
( U_14 = U_13
| U_12 != U_11
| ~ complexity(U_15,U_13,U_11)
| ~ complexity(U_15,U_14,U_12)
| ~ organization(U_15,U_11)
| ~ organization(U_15,U_12) ),
inference(variable_rename,[status(thm)],[f_6_1]) ).
fof(f_6_3,plain,
! [U_15,U_14,U_13] :
( ! [U_12] :
( ! [U_11] :
( U_12 != U_11
| ~ complexity(U_15,U_13,U_11)
| ~ organization(U_15,U_11) )
| ~ complexity(U_15,U_14,U_12)
| ~ organization(U_15,U_12) )
| U_14 = U_13 ),
inference(miniscope,[status(thm)],[f_6_2]) ).
fof(f_6_4,plain,
! [U_11,U_12,U_13,U_14,U_15] :
( U_12 != U_11
| ~ complexity(U_15,U_13,U_11)
| ~ organization(U_15,U_11)
| ~ complexity(U_15,U_14,U_12)
| ~ organization(U_15,U_12)
| U_14 = U_13 ),
inference(definitional_conversion,[status(esa)],[f_6_3]) ).
cnf(f_6_5,plain,
( U_12 != U_11
| ~ complexity(U_15,U_13,U_11)
| ~ organization(U_15,U_11)
| ~ complexity(U_15,U_14,U_12)
| ~ organization(U_15,U_12)
| U_14 = U_13 ),
inference(clausify,[status(thm)],[f_6_4]) ).
fof(f_7_1,plain,
! [X,S1,S2,T1,T2] :
( ~ greater(S1,S2)
| ~ greater(T2,T1)
| ~ size(X,S2,T2)
| ~ size(X,S1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t11_FOL]) ).
fof(f_7_2,plain,
! [U_20,U_19,U_18,U_17,U_16] :
( ~ greater(U_19,U_18)
| ~ greater(U_16,U_17)
| ~ size(U_20,U_18,U_16)
| ~ size(U_20,U_19,U_17)
| ~ reorganization_free(U_20,U_17,U_16)
| ~ organization(U_20,U_16)
| ~ organization(U_20,U_17) ),
inference(variable_rename,[status(thm)],[f_7_1]) ).
fof(f_7_3,plain,
! [U_20,U_19,U_18] :
( ! [U_17] :
( ! [U_16] :
( ~ greater(U_16,U_17)
| ~ size(U_20,U_18,U_16)
| ~ reorganization_free(U_20,U_17,U_16)
| ~ organization(U_20,U_16) )
| ~ size(U_20,U_19,U_17)
| ~ organization(U_20,U_17) )
| ~ greater(U_19,U_18) ),
inference(miniscope,[status(thm)],[f_7_2]) ).
fof(f_7_4,plain,
! [U_19,U_20,U_16,U_18,U_17] :
( ~ greater(U_16,U_17)
| ~ size(U_20,U_18,U_16)
| ~ reorganization_free(U_20,U_17,U_16)
| ~ organization(U_20,U_16)
| ~ size(U_20,U_19,U_17)
| ~ organization(U_20,U_17)
| ~ greater(U_19,U_18) ),
inference(definitional_conversion,[status(esa)],[f_7_3]) ).
cnf(f_7_5,plain,
( ~ greater(U_16,U_17)
| ~ size(U_20,U_18,U_16)
| ~ reorganization_free(U_20,U_17,U_16)
| ~ organization(U_20,U_16)
| ~ size(U_20,U_19,U_17)
| ~ organization(U_20,U_17)
| ~ greater(U_19,U_18) ),
inference(clausify,[status(thm)],[f_7_4]) ).
fof(f_8_1,plain,
! [X,C1,C2,T1,T2] :
( ~ greater(C1,C2)
| ~ greater(T2,T1)
| ~ complexity(X,C2,T2)
| ~ complexity(X,C1,T1)
| ~ reorganization_free(X,T1,T2)
| ~ organization(X,T2)
| ~ organization(X,T1) ),
inference(fof_nnf,[status(thm)],[t12_FOL]) ).
fof(f_8_2,plain,
! [U_25,U_24,U_23,U_22,U_21] :
( ~ greater(U_24,U_23)
| ~ greater(U_21,U_22)
| ~ complexity(U_25,U_23,U_21)
| ~ complexity(U_25,U_24,U_22)
| ~ reorganization_free(U_25,U_22,U_21)
| ~ organization(U_25,U_21)
| ~ organization(U_25,U_22) ),
inference(variable_rename,[status(thm)],[f_8_1]) ).
fof(f_8_3,plain,
! [U_25,U_24,U_23] :
( ! [U_22] :
( ! [U_21] :
( ~ greater(U_21,U_22)
| ~ complexity(U_25,U_23,U_21)
| ~ reorganization_free(U_25,U_22,U_21)
| ~ organization(U_25,U_21) )
| ~ complexity(U_25,U_24,U_22)
| ~ organization(U_25,U_22) )
| ~ greater(U_24,U_23) ),
inference(miniscope,[status(thm)],[f_8_2]) ).
fof(f_8_4,plain,
! [U_21,U_22,U_24,U_25,U_23] :
( ~ greater(U_21,U_22)
| ~ complexity(U_25,U_23,U_21)
| ~ reorganization_free(U_25,U_22,U_21)
| ~ organization(U_25,U_21)
| ~ complexity(U_25,U_24,U_22)
| ~ organization(U_25,U_22)
| ~ greater(U_24,U_23) ),
inference(definitional_conversion,[status(esa)],[f_8_3]) ).
cnf(f_8_5,plain,
( ~ greater(U_21,U_22)
| ~ complexity(U_25,U_23,U_21)
| ~ reorganization_free(U_25,U_22,U_21)
| ~ organization(U_25,U_21)
| ~ complexity(U_25,U_24,U_22)
| ~ organization(U_25,U_22)
| ~ greater(U_24,U_23) ),
inference(clausify,[status(thm)],[f_8_4]) ).
fof(f_9_1,negated_conjecture,
~ ! [X,C1,C2,S1,S2,T1,T2] :
( ( greater(C2,C1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) )
=> ~ greater(S1,S2) ),
inference(negate,[status(cth)],[t13_FOL]) ).
fof(f_9_2,negated_conjecture,
? [X,C1,C2,S1,S2,T1,T2] :
( greater(S1,S2)
& greater(C2,C1)
& size(X,S2,T2)
& size(X,S1,T1)
& complexity(X,C2,T2)
& complexity(X,C1,T1)
& reorganization_free(X,T1,T2)
& organization(X,T2)
& organization(X,T1) ),
inference(fof_nnf,[status(thm)],[f_9_1]) ).
fof(f_9_3,negated_conjecture,
? [U_32,U_31,U_30,U_29,U_28,U_27,U_26] :
( greater(U_29,U_28)
& greater(U_30,U_31)
& size(U_32,U_28,U_26)
& size(U_32,U_29,U_27)
& complexity(U_32,U_30,U_26)
& complexity(U_32,U_31,U_27)
& reorganization_free(U_32,U_27,U_26)
& organization(U_32,U_26)
& organization(U_32,U_27) ),
inference(variable_rename,[status(thm)],[f_9_2]) ).
fof(f_9_4,negated_conjecture,
? [U_32,U_31,U_30,U_29,U_28] :
( ? [U_27] :
( ? [U_26] :
( size(U_32,U_28,U_26)
& complexity(U_32,U_30,U_26)
& reorganization_free(U_32,U_27,U_26)
& organization(U_32,U_26) )
& size(U_32,U_29,U_27)
& complexity(U_32,U_31,U_27)
& organization(U_32,U_27) )
& greater(U_30,U_31)
& greater(U_29,U_28) ),
inference(miniscope,[status(thm)],[f_9_3]) ).
fof(f_9_5,negated_conjecture,
? [U_31,U_30,U_29,U_28] :
( ? [U_27] :
( ? [U_26] :
( size(sK1,U_28,U_26)
& complexity(sK1,U_30,U_26)
& reorganization_free(sK1,U_27,U_26)
& organization(sK1,U_26) )
& size(sK1,U_29,U_27)
& complexity(sK1,U_31,U_27)
& organization(sK1,U_27) )
& greater(U_30,U_31)
& greater(U_29,U_28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(U_32,sK1)],[f_9_4]) ).
fof(f_9_6,negated_conjecture,
? [U_30,U_29,U_28] :
( ? [U_27] :
( ? [U_26] :
( size(sK1,U_28,U_26)
& complexity(sK1,U_30,U_26)
& reorganization_free(sK1,U_27,U_26)
& organization(sK1,U_26) )
& size(sK1,U_29,U_27)
& complexity(sK1,sK2,U_27)
& organization(sK1,U_27) )
& greater(U_30,sK2)
& greater(U_29,U_28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_31,sK2)],[f_9_5]) ).
fof(f_9_7,negated_conjecture,
? [U_29,U_28] :
( ? [U_27] :
( ? [U_26] :
( size(sK1,U_28,U_26)
& complexity(sK1,sK3,U_26)
& reorganization_free(sK1,U_27,U_26)
& organization(sK1,U_26) )
& size(sK1,U_29,U_27)
& complexity(sK1,sK2,U_27)
& organization(sK1,U_27) )
& greater(sK3,sK2)
& greater(U_29,U_28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(U_30,sK3)],[f_9_6]) ).
fof(f_9_8,negated_conjecture,
? [U_28] :
( ? [U_27] :
( ? [U_26] :
( size(sK1,U_28,U_26)
& complexity(sK1,sK3,U_26)
& reorganization_free(sK1,U_27,U_26)
& organization(sK1,U_26) )
& size(sK1,sK4,U_27)
& complexity(sK1,sK2,U_27)
& organization(sK1,U_27) )
& greater(sK3,sK2)
& greater(sK4,U_28) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4]),skolemize(U_29,sK4)],[f_9_7]) ).
fof(f_9_9,negated_conjecture,
( ? [U_27] :
( ? [U_26] :
( size(sK1,sK5,U_26)
& complexity(sK1,sK3,U_26)
& reorganization_free(sK1,U_27,U_26)
& organization(sK1,U_26) )
& size(sK1,sK4,U_27)
& complexity(sK1,sK2,U_27)
& organization(sK1,U_27) )
& greater(sK3,sK2)
& greater(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(U_28,sK5)],[f_9_8]) ).
fof(f_9_10,negated_conjecture,
( ? [U_26] :
( size(sK1,sK5,U_26)
& complexity(sK1,sK3,U_26)
& reorganization_free(sK1,sK6,U_26)
& organization(sK1,U_26) )
& size(sK1,sK4,sK6)
& complexity(sK1,sK2,sK6)
& organization(sK1,sK6)
& greater(sK3,sK2)
& greater(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6]),skolemize(U_27,sK6)],[f_9_9]) ).
fof(f_9_11,negated_conjecture,
( size(sK1,sK5,sK7)
& complexity(sK1,sK3,sK7)
& reorganization_free(sK1,sK6,sK7)
& organization(sK1,sK7)
& size(sK1,sK4,sK6)
& complexity(sK1,sK2,sK6)
& organization(sK1,sK6)
& greater(sK3,sK2)
& greater(sK4,sK5) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7]),skolemize(U_26,sK7)],[f_9_10]) ).
fof(f_9_12,negated_conjecture,
( size(sK1,sK5,sK7)
& complexity(sK1,sK3,sK7)
& reorganization_free(sK1,sK6,sK7)
& organization(sK1,sK7)
& size(sK1,sK4,sK6)
& complexity(sK1,sK2,sK6)
& organization(sK1,sK6)
& greater(sK3,sK2)
& greater(sK4,sK5) ),
inference(definitional_conversion,[status(esa)],[f_9_11]) ).
cnf(f_9_13,negated_conjecture,
greater(sK4,sK5),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_14,negated_conjecture,
greater(sK3,sK2),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_15,negated_conjecture,
organization(sK1,sK6),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_16,negated_conjecture,
complexity(sK1,sK2,sK6),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_17,negated_conjecture,
size(sK1,sK4,sK6),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_18,negated_conjecture,
organization(sK1,sK7),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_19,negated_conjecture,
reorganization_free(sK1,sK6,sK7),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_20,negated_conjecture,
complexity(sK1,sK3,sK7),
inference(clausify,[status(thm)],[f_9_12]) ).
cnf(f_9_21,negated_conjecture,
size(sK1,sK5,sK7),
inference(clausify,[status(thm)],[f_9_12]) ).
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,
( greater(Eq_y_0,Eq_y_1)
| ~ greater(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_5,axiom,
( organization(Eq_y_0,Eq_y_1)
| ~ organization(Eq_x_0,Eq_x_1)
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_6,axiom,
( time(Eq_y_0)
| ~ time(Eq_x_0)
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_7,axiom,
( reorganization_free(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ reorganization_free(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_8,axiom,
( complexity(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ complexity(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| Eq_x_0 != Eq_y_0 ),
theory(equality,[substitution_predicates]) ).
cnf(equality_9,axiom,
( size(Eq_y_0,Eq_y_1,Eq_y_2)
| ~ size(Eq_x_0,Eq_x_1,Eq_x_2)
| Eq_x_2 != Eq_y_2
| Eq_x_1 != Eq_y_1
| 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.02 % Problem : MGT013+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.03 This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03 % 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.34 % Computer : n002.cluster.edu
% 0.09/0.34 % Model : x86_64 x86_64
% 0.09/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34 % Memory : 8046.5625MB
% 0.09/0.34 % OS : Linux 6.8.0-71-generic
% 0.09/0.34 % CPULimit : 300
% 0.09/0.34 % WCLimit : 300
% 0.09/0.34 % DateTime : Sat Sep 19 16:13:45 UTC 2026
% 0.09/0.34 % CPUTime :
% 30.16/30.41 % SZS status Theorem for theBenchmark
% 30.16/30.41 % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------