%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM924+6 : TPTP v9.2.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.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 : 300s
% DateTime : Tue May 5 04:58:52 PM UTC 2026
% Result : Theorem 1.30s 1.75s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 15
% Syntax : Number of formulae : 57 ( 57 unt; 0 def)
% Number of atoms : 57 ( 46 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 6 ( 6 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 15 ( 15 usr; 6 con; 0-3 aty)
% Number of variables : 49 ( 2 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_130_Bit0__def,axiom,
! [X14] : bit0(X14) = plus_plus(int,X14,X14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_130_Bit0__def) ).
fof(fact_162_Bit1__def,axiom,
! [X14] : bit1(X14) = plus_plus(int,plus_plus(int,one_one(int),X14),X14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_162_Bit1__def) ).
fof(fact_61_nat__1__add__1,axiom,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_61_nat__1__add__1) ).
fof(fact_127_add__Pls__right,axiom,
! [X14] : plus_plus(int,X14,pls) = ti(int,X14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_127_add__Pls__right) ).
fof(fact_22_number__of__is__id,axiom,
! [X14] : number_number_of(int,X14) = ti(int,X14),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(tsy_c_Int_OBit0_res,hypothesis,
! [X1] : ti(int,bit0(X1)) = bit0(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_OBit0_res) ).
fof(conj_0,conjecture,
ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_120_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_120_Pls__def) ).
fof(fact_67_plus__numeral__code_I9_J,axiom,
! [X12,X11] : plus_plus(int,number_number_of(int,X12),number_number_of(int,X11)) = number_number_of(int,plus_plus(int,X12,X11)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_67_plus__numeral__code_I9_J) ).
fof(fact_3_t,axiom,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).
fof(fact_94_zadd__assoc,axiom,
! [X18,X19,X20] : plus_plus(int,plus_plus(int,X18,X19),X20) = plus_plus(int,X18,plus_plus(int,X19,X20)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_94_zadd__assoc) ).
fof(fact_23_zmult__commute,axiom,
! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(fact_96_zadd__commute,axiom,
! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_96_zadd__commute) ).
fof(fact_62_mult__Pls,axiom,
! [X11] : times_times(int,pls,X11) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).
fof(c_0_15,plain,
! [X1718] : bit0(X1718) = plus_plus(int,X1718,X1718),
inference(variable_rename,[status(thm)],[fact_130_Bit0__def]) ).
fof(c_0_16,plain,
! [X1773] : bit1(X1773) = plus_plus(int,plus_plus(int,one_one(int),X1773),X1773),
inference(variable_rename,[status(thm)],[fact_162_Bit1__def]) ).
cnf(c_0_17,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,bit0(bit1(pls))),
inference(split_conjunct,[status(thm)],[fact_61_nat__1__add__1]) ).
cnf(c_0_18,plain,
bit0(X1) = plus_plus(int,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
bit1(X1) = plus_plus(int,plus_plus(int,one_one(int),X1),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X1714] : plus_plus(int,X1714,pls) = ti(int,X1714),
inference(variable_rename,[status(thm)],[fact_127_add__Pls__right]) ).
fof(c_0_21,plain,
! [X1511] : number_number_of(int,X1511) = ti(int,X1511),
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_22,hypothesis,
! [X1443] : ti(int,bit0(X1443)) = bit0(X1443),
inference(variable_rename,[status(thm)],[tsy_c_Int_OBit0_res]) ).
fof(c_0_23,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
cnf(c_0_24,plain,
plus_plus(nat,one_one(nat),one_one(nat)) = number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_25,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_120_Pls__def]) ).
cnf(c_0_26,plain,
plus_plus(int,X1,pls) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,hypothesis,
ti(int,bit0(X1)) = bit0(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),zero_zero(int)),zero_zero(int)),plus_plus(int,plus_plus(int,one_one(int),zero_zero(int)),zero_zero(int)))) = plus_plus(nat,one_one(nat),one_one(nat)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_31,plain,
plus_plus(int,X1,zero_zero(int)) = number_number_of(int,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_25]),c_0_27]) ).
fof(c_0_32,plain,
! [X1598,X1599] : plus_plus(int,number_number_of(int,X1598),number_number_of(int,X1599)) = number_number_of(int,plus_plus(int,X1598,X1599)),
inference(variable_rename,[status(thm)],[fact_67_plus__numeral__code_I9_J]) ).
cnf(c_0_33,hypothesis,
ti(int,plus_plus(int,X1,X1)) = plus_plus(int,X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_18]),c_0_18]) ).
cnf(c_0_34,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),one_one(int)),zero_zero(int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_18]),c_0_19]),c_0_19]) ).
cnf(c_0_35,plain,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
fof(c_0_36,plain,
! [X1654,X1655,X1656] : plus_plus(int,plus_plus(int,X1654,X1655),X1656) = plus_plus(int,X1654,plus_plus(int,X1655,X1656)),
inference(variable_rename,[status(thm)],[fact_94_zadd__assoc]) ).
fof(c_0_37,plain,
! [X1512,X1513] : times_times(int,X1512,X1513) = times_times(int,X1513,X1512),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_38,plain,
! [X1660,X1661] : plus_plus(int,X1660,X1661) = plus_plus(int,X1661,X1660),
inference(variable_rename,[status(thm)],[fact_96_zadd__commute]) ).
cnf(c_0_39,plain,
number_number_of(nat,plus_plus(int,number_number_of(int,number_number_of(int,one_one(int))),number_number_of(int,number_number_of(int,one_one(int))))) = plus_plus(nat,one_one(nat),one_one(nat)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_40,plain,
plus_plus(int,number_number_of(int,X1),number_number_of(int,X2)) = number_number_of(int,plus_plus(int,X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,hypothesis,
number_number_of(int,plus_plus(int,X1,X1)) = plus_plus(int,X1,X1),
inference(rw,[status(thm)],[c_0_33,c_0_27]) ).
fof(c_0_42,plain,
! [X1591] : times_times(int,pls,X1591) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(c_0_43,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),zero_zero(int)),zero_zero(int)),plus_plus(int,plus_plus(int,one_one(int),zero_zero(int)),zero_zero(int))))),one_one(int)),zero_zero(int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_25]),c_0_25]),c_0_25]),c_0_25]) ).
cnf(c_0_44,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).
cnf(c_0_45,plain,
plus_plus(int,power_power(int,s,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_46,plain,
plus_plus(int,plus_plus(int,X1,X2),X3) = plus_plus(int,X1,plus_plus(int,X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_48,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_49,plain,
number_number_of(nat,plus_plus(int,one_one(int),one_one(int))) = plus_plus(nat,one_one(nat),one_one(nat)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_40]),c_0_41]),c_0_41]) ).
cnf(c_0_50,plain,
times_times(int,pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat))),one_one(int)),zero_zero(int)),
inference(rw,[status(thm)],[c_0_43,c_0_30]) ).
cnf(c_0_52,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int)),zero_zero(int))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_18]),c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]),c_0_19]) ).
cnf(c_0_53,plain,
times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,number_number_of(int,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))) = plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_46]),c_0_47]),c_0_48]),c_0_47]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_49]),c_0_48]) ).
cnf(c_0_54,plain,
times_times(int,zero_zero(int),X1) = zero_zero(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_25]),c_0_25]) ).
cnf(c_0_55,negated_conjecture,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,plus_plus(nat,one_one(nat),one_one(nat)))),zero_zero(int)),
inference(rw,[status(thm)],[c_0_51,c_0_48]) ).
cnf(c_0_56,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_46]),c_0_47]),c_0_48]),c_0_47]),c_0_53]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_25]),c_0_31]),c_0_40]),c_0_40]),c_0_41]),c_0_41]),c_0_46]),c_0_47]),c_0_48]),c_0_47]),c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : NUM924+6 : TPTP v9.2.1. Released v5.3.0.
% 0.00/0.09 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.29 % Computer : n024.cluster.edu
% 0.06/0.29 % Model : x86_64 x86_64
% 0.06/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.29 % Memory : 8042.1875MB
% 0.06/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.29 % CPULimit : 300
% 0.06/0.29 % WCLimit : 300
% 0.06/0.29 % DateTime : Mon May 4 20:17:56 EDT 2026
% 0.06/0.29 % CPUTime :
% 0.06/0.30 % start to proof: theBenchmark
% 1.30/1.75 % Version : CSE_E---1.7
% 1.30/1.75 % Problem : theBenchmark.p
% 1.30/1.75 % SZS status Theorem for theBenchmark.p
% 1.30/1.75 % SZS output start CNFRefutation
% See solution above
% 1.30/1.75 % Total time : 1.415s
%------------------------------------------------------------------------------