%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM924+3 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 01:56:54 PM UTC 2026
% Result : Theorem 1.61s 0.82s
% Output : CNFRefutation 1.61s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% 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 : 3 ( 1 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 18 ( 18 usr; 7 con; 0-2 aty)
% Number of variables : 39 ( 1 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_236_Bit1__def,axiom,
! [X13] : bit1(X13) = hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),X13)),X13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_236_Bit1__def) ).
fof(fact_134_zadd__commute,axiom,
! [X14,X12] : hAPP_int_int(plus_plus_int(X14),X12) = hAPP_int_int(plus_plus_int(X12),X14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_134_zadd__commute) ).
fof(conj_0,conjecture,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_248_number__of__Bit1,axiom,
! [X89] : number_number_of_int(bit1(X89)) = hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),number_number_of_int(X89))),number_number_of_int(X89)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_248_number__of__Bit1) ).
fof(fact_187_double__number__of__Bit0,axiom,
! [X69] : hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)),number_number_of_int(X69)) = number_number_of_int(bit0(X69)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_187_double__number__of__Bit0) ).
fof(fact_182_Bit0__def,axiom,
! [X13] : bit0(X13) = hAPP_int_int(plus_plus_int(X13),X13),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_182_Bit0__def) ).
fof(fact_415_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J,axiom,
! [X188] : hAPP_int_int(plus_plus_int(X188),X188) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)),X188),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_415_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J) ).
fof(fact_160_one__is__num__one,axiom,
one_one_int = number_number_of_int(bit1(pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_160_one__is__num__one) ).
fof(fact_172_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_172_Pls__def) ).
fof(fact_135_zero__is__num__zero,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_135_zero__is__num__zero) ).
fof(fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X96] : hAPP_int_int(times_times_int(X96),X96) = hAPP_nat_int(power_power_int(X96),number_number_of_nat(bit0(bit1(pls)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
fof(fact_35_zmult__commute,axiom,
! [X14,X12] : hAPP_int_int(times_times_int(X14),X12) = hAPP_int_int(times_times_int(X12),X14),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_35_zmult__commute) ).
fof(fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
! [X159] : hAPP_int_int(times_times_int(X159),zero_zero_int) = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).
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,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t)),hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),zero_zero_int))),
file('/export/starexec/sandbox2/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(fact_3_t,axiom,
hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).
fof(c_0_15,plain,
! [X563] : bit1(X563) = hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),X563)),X563),
inference(variable_rename,[status(thm)],[fact_236_Bit1__def]) ).
fof(c_0_16,plain,
! [X924,X925] : hAPP_int_int(plus_plus_int(X924),X925) = hAPP_int_int(plus_plus_int(X925),X924),
inference(variable_rename,[status(thm)],[fact_134_zadd__commute]) ).
fof(c_0_17,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_18,plain,
! [X565] : number_number_of_int(bit1(X565)) = hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),number_number_of_int(X565))),number_number_of_int(X565)),
inference(variable_rename,[status(thm)],[fact_248_number__of__Bit1]) ).
cnf(c_0_19,plain,
bit1(X1) = hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),X1)),X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
hAPP_int_int(plus_plus_int(X1),X2) = hAPP_int_int(plus_plus_int(X2),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X562] : hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)),number_number_of_int(X562)) = number_number_of_int(bit0(X562)),
inference(variable_rename,[status(thm)],[fact_187_double__number__of__Bit0]) ).
fof(c_0_22,plain,
! [X767] : bit0(X767) = hAPP_int_int(plus_plus_int(X767),X767),
inference(variable_rename,[status(thm)],[fact_182_Bit0__def]) ).
fof(c_0_23,plain,
! [X575] : hAPP_int_int(plus_plus_int(X575),X575) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)),X575),
inference(variable_rename,[status(thm)],[fact_415_comm__semiring__1__class_Onormalizing__semiring__rules_I4_J]) ).
fof(c_0_24,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
one_one_int = number_number_of_int(bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_160_one__is__num__one]) ).
cnf(c_0_26,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_172_Pls__def]) ).
cnf(c_0_27,plain,
number_number_of_int(bit1(X1)) = hAPP_int_int(plus_plus_int(hAPP_int_int(plus_plus_int(one_one_int),number_number_of_int(X1))),number_number_of_int(X1)),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
hAPP_int_int(plus_plus_int(X1),hAPP_int_int(plus_plus_int(one_one_int),X1)) = bit1(X1),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,plain,
zero_zero_int = number_number_of_int(pls),
inference(split_conjunct,[status(thm)],[fact_135_zero__is__num__zero]) ).
cnf(c_0_30,plain,
hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)),number_number_of_int(X1)) = number_number_of_int(bit0(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_31,plain,
bit0(X1) = hAPP_int_int(plus_plus_int(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_32,plain,
hAPP_int_int(plus_plus_int(X1),X1) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(one_one_int),one_one_int)),X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_33,plain,
! [X827] : hAPP_int_int(times_times_int(X827),X827) = hAPP_nat_int(power_power_int(X827),number_number_of_nat(bit0(bit1(pls)))),
inference(variable_rename,[status(thm)],[fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
fof(c_0_34,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
inference(fof_nnf,[status(thm)],[c_0_24]) ).
cnf(c_0_35,plain,
number_number_of_int(bit1(zero_zero_int)) = one_one_int,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,plain,
number_number_of_int(bit1(X1)) = bit1(number_number_of_int(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_20]),c_0_28]) ).
cnf(c_0_37,plain,
number_number_of_int(zero_zero_int) = zero_zero_int,
inference(rw,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_38,plain,
hAPP_int_int(times_times_int(bit0(one_one_int)),number_number_of_int(X1)) = number_number_of_int(bit0(X1)),
inference(rw,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_39,plain,
hAPP_int_int(times_times_int(bit0(one_one_int)),X1) = bit0(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_31]),c_0_31]) ).
fof(c_0_40,plain,
! [X1076,X1077] : hAPP_int_int(times_times_int(X1076),X1077) = hAPP_int_int(times_times_int(X1077),X1076),
inference(variable_rename,[status(thm)],[fact_35_zmult__commute]) ).
fof(c_0_41,plain,
! [X598] : hAPP_int_int(times_times_int(X598),zero_zero_int) = zero_zero_int,
inference(variable_rename,[status(thm)],[fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).
cnf(c_0_42,plain,
hAPP_int_int(times_times_int(X1),X1) = hAPP_nat_int(power_power_int(X1),number_number_of_nat(bit0(bit1(pls)))),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_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_34]) ).
cnf(c_0_44,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t)),hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_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,
bit1(zero_zero_int) = one_one_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).
cnf(c_0_46,plain,
number_number_of_int(bit0(X1)) = bit0(number_number_of_int(X1)),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_47,plain,
hAPP_int_int(times_times_int(X1),X2) = hAPP_int_int(times_times_int(X2),X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_48,plain,
hAPP_int_int(times_times_int(X1),zero_zero_int) = zero_zero_int,
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_49,plain,
hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_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]) ).
cnf(c_0_50,plain,
hAPP_int_int(times_times_int(X1),X1) = hAPP_nat_int(power_power_int(X1),number_number_of_nat(bit0(bit1(zero_zero_int)))),
inference(rw,[status(thm)],[c_0_42,c_0_26]) ).
cnf(c_0_51,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(zero_zero_int))))),one_one_int)),zero_zero_int)),
inference(rw,[status(thm)],[c_0_43,c_0_26]) ).
cnf(c_0_52,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(t),hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(m),bit0(bit0(number_number_of_int(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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_26]),c_0_45]),c_0_46]),c_0_46]),c_0_47]),c_0_20]),c_0_47]),c_0_26]),c_0_45]),c_0_46]),c_0_46]),c_0_47]),c_0_20]),c_0_48]) ).
cnf(c_0_53,plain,
number_number_of_int(one_one_int) = one_one_int,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_45]),c_0_37]),c_0_45]) ).
cnf(c_0_54,plain,
hAPP_int_int(times_times_int(t),hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(m),bit0(bit0(one_one_int))))) = hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s)),
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_49,c_0_26]),c_0_50]),c_0_20]),c_0_26]),c_0_46]),c_0_46]),c_0_35]),c_0_47]),c_0_20]),c_0_47]) ).
cnf(c_0_55,negated_conjecture,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s))),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_20]),c_0_50]) ).
cnf(c_0_56,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 03:14:35 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.61/0.82 % Version: 3.5.1
% 1.61/0.82 % Preprocessing class: FMLSSMSMSSSNFFN.
% 1.61/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.82 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1.61/0.82 % Starting new_bool_3 with 600s (2) cores
% 1.61/0.82 % Starting new_bool_1 with 600s (2) cores
% 1.61/0.82 % Starting sh5l with 300s (1) cores
% 1.61/0.82 % new_bool_3 with pid 48207 completed with status 0
% 1.61/0.82 % Result found by new_bool_3
% 1.61/0.82 % Preprocessing class: FMLSSMSMSSSNFFN.
% 1.61/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.82 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1.61/0.82 % Starting new_bool_3 with 600s (2) cores
% 1.61/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.61/0.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.61/0.82 % Search class: FGHSM-SSLM31-DFFFFFNN
% 1.61/0.82 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 1.61/0.82 % Starting SubtermCWHack with 55s (1) cores
% 1.61/0.82 % Starting new_bool_3 with 61s (1) cores
% 1.61/0.82 % new_bool_3 with pid 48217 completed with status 0
% 1.61/0.82 % Result found by new_bool_3
% 1.61/0.82 % Preprocessing class: FMLSSMSMSSSNFFN.
% 1.61/0.82 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.61/0.82 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1.61/0.82 % Starting new_bool_3 with 600s (2) cores
% 1.61/0.82 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.61/0.82 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.61/0.82 % Search class: FGHSM-SSLM31-DFFFFFNN
% 1.61/0.82 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 1.61/0.82 % Starting SubtermCWHack with 55s (1) cores
% 1.61/0.82 % Starting new_bool_3 with 61s (1) cores
% 1.61/0.82 % Preprocessing time : 0.021 s
% 1.61/0.82 % Presaturation interreduction done
% 1.61/0.82
% 1.61/0.82 % Proof found!
% 1.61/0.82 % SZS status Theorem
% 1.61/0.82 % SZS output start CNFRefutation
% See solution above
% 1.61/0.82 % Parsed axioms : 1230
% 1.61/0.82 % Removed by relevancy pruning/SinE : 300
% 1.61/0.82 % Initial clauses : 1405
% 1.61/0.82 % Removed in clause preprocessing : 83
% 1.61/0.82 % Initial clauses in saturation : 1322
% 1.61/0.82 % Processed clauses : 2767
% 1.61/0.82 % ...of these trivial : 118
% 1.61/0.82 % ...subsumed : 834
% 1.61/0.82 % ...remaining for further processing : 1814
% 1.61/0.82 % Other redundant clauses eliminated : 114
% 1.61/0.82 % Clauses deleted for lack of memory : 0
% 1.61/0.82 % Backward-subsumed : 16
% 1.61/0.82 % Backward-rewritten : 76
% 1.61/0.82 % Generated clauses : 4059
% 1.61/0.82 % ...of the previous two non-redundant : 3206
% 1.61/0.82 % ...aggressively subsumed : 0
% 1.61/0.82 % Contextual simplify-reflections : 4
% 1.61/0.82 % Paramodulations : 3953
% 1.61/0.82 % Factorizations : 0
% 1.61/0.82 % NegExts : 0
% 1.61/0.82 % Equation resolutions : 120
% 1.61/0.82 % Disequality decompositions : 0
% 1.61/0.82 % Total rewrite steps : 3224
% 1.61/0.82 % ...of those cached : 2272
% 1.61/0.82 % Propositional unsat checks : 0
% 1.61/0.82 % Propositional check models : 0
% 1.61/0.82 % Propositional check unsatisfiable : 0
% 1.61/0.82 % Propositional clauses : 0
% 1.61/0.82 % Propositional clauses after purity: 0
% 1.61/0.82 % Propositional unsat core size : 0
% 1.61/0.82 % Propositional preprocessing time : 0.000
% 1.61/0.82 % Propositional encoding time : 0.000
% 1.61/0.82 % Propositional solver time : 0.000
% 1.61/0.82 % Success case prop preproc time : 0.000
% 1.61/0.82 % Success case prop encoding time : 0.000
% 1.61/0.82 % Success case prop solver time : 0.000
% 1.61/0.82 % Current number of processed clauses : 705
% 1.61/0.82 % Positive orientable unit clauses : 438
% 1.61/0.82 % Positive unorientable unit clauses: 1
% 1.61/0.82 % Negative unit clauses : 172
% 1.61/0.82 % Non-unit-clauses : 94
% 1.61/0.82 % Current number of unprocessed clauses: 2662
% 1.61/0.82 % ...number of literals in the above : 4331
% 1.61/0.82 % Current number of archived formulas : 0
% 1.61/0.82 % Current number of archived clauses : 1017
% 1.61/0.82 % Clause-clause subsumption calls (NU) : 87539
% 1.61/0.82 % Rec. Clause-clause subsumption calls : 38449
% 1.61/0.82 % Non-unit clause-clause subsumptions : 223
% 1.61/0.82 % Unit Clause-clause subsumption calls : 6710
% 1.61/0.82 % Rewrite failures with RHS unbound : 0
% 1.61/0.82 % BW rewrite match attempts : 11925
% 1.61/0.82 % BW rewrite match successes : 156
% 1.61/0.82 % Condensation attempts : 0
% 1.61/0.82 % Condensation successes : 0
% 1.61/0.82 % Termbank termtop insertions : 209761
% 1.61/0.82 % Search garbage collected termcells : 18317
% 1.61/0.82
% 1.61/0.82 % -------------------------------------------------
% 1.61/0.82 % User time : 0.315 s
% 1.61/0.82 % System time : 0.026 s
% 1.61/0.82 % Total time : 0.341 s
% 1.61/0.82 % Maximum resident set size: 9548 pages
% 1.61/0.82
% 1.61/0.82 % -------------------------------------------------
% 1.61/0.82 % User time : 0.537 s
% 1.61/0.82 % System time : 0.052 s
% 1.61/0.82 % Total time : 0.589 s
% 1.61/0.82 % Maximum resident set size: 6912 pages
% 1.61/0.82 % E exiting
%------------------------------------------------------------------------------