TSTP Solution File: NUM924+8 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : NUM924+8 : TPTP v8.2.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n032.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 : Mon Jun 24 12:50:02 EDT 2024
% Result : Theorem 5.65s 2.40s
% Output : CNFRefutation 5.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 36 ( 36 unt; 0 def)
% Number of atoms : 36 ( 26 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 22 ( 22 usr; 11 con; 0-4 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',conj_0) ).
fof(fact_99_zadd__commute,axiom,
! [X16,X12] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X16),X12) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X12),X16),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_99_zadd__commute) ).
fof(fact_22_number__of__is__id,axiom,
! [X15] : hAPP(int,int,number_number_of(int),X15) = ti(int,X15),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_22_number__of__is__id) ).
fof(fact_23_zmult__commute,axiom,
! [X16,X12] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X16),X12) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X12),X16),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_23_zmult__commute) ).
fof(fact_467__096s_A_094_A2_A_N_A_N1_A_061_As_A_094_A2_A_L_A1_096,axiom,
hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(int,int,number_number_of(int),min_1)) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_467__096s_A_094_A2_A_N_A_N1_A_061_As_A_094_A2_A_L_A1_096) ).
fof(fact_1427_semiring__norm_I115_J,axiom,
hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))) = hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_1427_semiring__norm_I115_J) ).
fof(tsy_c_Int_OMin_res,axiom,
ti(int,min_1) = min_1,
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',tsy_c_Int_OMin_res) ).
fof(fact_3_t,axiom,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_3_t) ).
fof(fact_62_mult__Pls,axiom,
! [X12] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X12) = pls,
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_62_mult__Pls) ).
fof(fact_123_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p',fact_123_Pls__def) ).
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(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),zero_zero(int)))),
file('/export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.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_11,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
fof(c_0_12,plain,
! [X588,X589] : hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X588),X589) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X589),X588),
inference(variable_rename,[status(thm)],[fact_99_zadd__commute]) ).
fof(c_0_13,plain,
! [X347] : hAPP(int,int,number_number_of(int),X347) = ti(int,X347),
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_14,plain,
! [X920,X921] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X920),X921) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X921),X920),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_15,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(fof_nnf,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),hAPP(int,int,number_number_of(int),min_1)) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)),
inference(split_conjunct,[status(thm)],[fact_467__096s_A_094_A2_A_N_A_N1_A_061_As_A_094_A2_A_L_A1_096]) ).
cnf(c_0_17,plain,
hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))) = hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
inference(split_conjunct,[status(thm)],[fact_1427_semiring__norm_I115_J]) ).
cnf(c_0_18,plain,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X1),X2) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),X2),X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
ti(int,min_1) = min_1,
inference(split_conjunct,[status(thm)],[tsy_c_Int_OMin_res]) ).
cnf(c_0_20,plain,
hAPP(int,int,number_number_of(int),X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int)) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t),
inference(split_conjunct,[status(thm)],[fact_3_t]) ).
cnf(c_0_22,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X1),X2) = hAPP(int,int,hAPP(int,fun(int,int),times_times(int),X2),X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X432] : hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X432) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(c_0_24,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(int,nat,number_number_of(nat),hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),one_one(int))),zero_zero(int))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_123_Pls__def]) ).
cnf(c_0_26,plain,
hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),hAPP(int,int,number_number_of(int),min_1)) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_17]),c_0_18]) ).
cnf(c_0_27,plain,
hAPP(int,int,number_number_of(int),min_1) = min_1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))),m)),one_one(int))),t)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,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_29,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),t),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(int,int,hAPP(int,fun(int,int),times_times(int),m),hAPP(int,int,number_number_of(int),hAPP(int,int,bit0,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))))))) = hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_22]),c_0_17]),c_0_18]) ).
cnf(c_0_30,plain,
hAPP(int,int,hAPP(int,fun(int,int),times_times(int),pls),X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),one_one(int))),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_25]) ).
cnf(c_0_32,plain,
hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))) = hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),min_1),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),plus_plus(int),one_one(int)),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat)))))),pls)),
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_28,c_0_22]),c_0_18]),c_0_22]),c_0_29]),c_0_22]),c_0_18]),c_0_25]),c_0_22]),c_0_30]) ).
cnf(c_0_34,negated_conjecture,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),hAPP(int,int,hAPP(int,fun(int,int),minus_minus(int),hAPP(nat,int,hAPP(int,fun(nat,int),power_power(int),s),hAPP(nat,nat,suc,hAPP(nat,nat,suc,zero_zero(nat))))),min_1)),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_18]),c_0_32]) ).
cnf(c_0_35,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_32]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.10 % Problem : NUM924+8 : TPTP v8.2.0. Released v5.3.0.
% 0.03/0.10 % Command : run_E %s %d SAT
% 0.09/0.30 % Computer : n032.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Sun Jun 23 01:50:53 EDT 2024
% 0.09/0.30 % CPUTime :
% 1.31/1.46 Running first-order model finding
% 1.31/1.46 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.FvIZgPvPgC/E---3.1_30769.p
% 5.65/2.40 # Version: 3.2.0
% 5.65/2.40 # Preprocessing class: FMLMSMSLSSSNFFN.
% 5.65/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/2.40 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 5.65/2.40 # Starting new_bool_3 with 600s (2) cores
% 5.65/2.40 # Starting new_bool_1 with 600s (2) cores
% 5.65/2.40 # Starting sh5l with 300s (1) cores
% 5.65/2.40 # new_bool_3 with pid 30848 completed with status 0
% 5.65/2.40 # Result found by new_bool_3
% 5.65/2.40 # Preprocessing class: FMLMSMSLSSSNFFN.
% 5.65/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/2.40 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 5.65/2.40 # Starting new_bool_3 with 600s (2) cores
% 5.65/2.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.65/2.40 # Search class: FGHSM-SMLM32-DFFFFFNN
% 5.65/2.40 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 5.65/2.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 45s (1) cores
% 5.65/2.40 # Starting new_bool_3 with 61s (1) cores
% 5.65/2.40 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 30853 completed with status 0
% 5.65/2.40 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 5.65/2.40 # Preprocessing class: FMLMSMSLSSSNFFN.
% 5.65/2.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.65/2.40 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 5.65/2.40 # Starting new_bool_3 with 600s (2) cores
% 5.65/2.40 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.65/2.40 # Search class: FGHSM-SMLM32-DFFFFFNN
% 5.65/2.40 # Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 5.65/2.40 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 45s (1) cores
% 5.65/2.40 # Preprocessing time : 0.044 s
% 5.65/2.40 # Presaturation interreduction done
% 5.65/2.40
% 5.65/2.40 # Proof found!
% 5.65/2.40 # SZS status Theorem
% 5.65/2.40 # SZS output start CNFRefutation
% See solution above
% 5.65/2.40 # Parsed axioms : 5738
% 5.65/2.40 # Removed by relevancy pruning/SinE : 4366
% 5.65/2.40 # Initial clauses : 2237
% 5.65/2.40 # Removed in clause preprocessing : 83
% 5.65/2.40 # Initial clauses in saturation : 2154
% 5.65/2.40 # Processed clauses : 2875
% 5.65/2.40 # ...of these trivial : 70
% 5.65/2.40 # ...subsumed : 245
% 5.65/2.40 # ...remaining for further processing : 2559
% 5.65/2.40 # Other redundant clauses eliminated : 301
% 5.65/2.40 # Clauses deleted for lack of memory : 0
% 5.65/2.40 # Backward-subsumed : 2
% 5.65/2.40 # Backward-rewritten : 67
% 5.65/2.40 # Generated clauses : 3700
% 5.65/2.40 # ...of the previous two non-redundant : 2944
% 5.65/2.40 # ...aggressively subsumed : 0
% 5.65/2.40 # Contextual simplify-reflections : 4
% 5.65/2.40 # Paramodulations : 3395
% 5.65/2.40 # Factorizations : 1
% 5.65/2.40 # NegExts : 0
% 5.65/2.40 # Equation resolutions : 317
% 5.65/2.40 # Disequality decompositions : 0
% 5.65/2.40 # Total rewrite steps : 3925
% 5.65/2.40 # ...of those cached : 3210
% 5.65/2.40 # Propositional unsat checks : 0
% 5.65/2.40 # Propositional check models : 0
% 5.65/2.40 # Propositional check unsatisfiable : 0
% 5.65/2.40 # Propositional clauses : 0
% 5.65/2.40 # Propositional clauses after purity: 0
% 5.65/2.40 # Propositional unsat core size : 0
% 5.65/2.40 # Propositional preprocessing time : 0.000
% 5.65/2.40 # Propositional encoding time : 0.000
% 5.65/2.40 # Propositional solver time : 0.000
% 5.65/2.40 # Success case prop preproc time : 0.000
% 5.65/2.40 # Success case prop encoding time : 0.000
% 5.65/2.40 # Success case prop solver time : 0.000
% 5.65/2.40 # Current number of processed clauses : 507
% 5.65/2.40 # Positive orientable unit clauses : 165
% 5.65/2.40 # Positive unorientable unit clauses: 4
% 5.65/2.40 # Negative unit clauses : 30
% 5.65/2.40 # Non-unit-clauses : 308
% 5.65/2.40 # Current number of unprocessed clauses: 3993
% 5.65/2.40 # ...number of literals in the above : 9656
% 5.65/2.40 # Current number of archived formulas : 0
% 5.65/2.40 # Current number of archived clauses : 1839
% 5.65/2.40 # Clause-clause subsumption calls (NU) : 259313
% 5.65/2.40 # Rec. Clause-clause subsumption calls : 97462
% 5.65/2.40 # Non-unit clause-clause subsumptions : 224
% 5.65/2.40 # Unit Clause-clause subsumption calls : 4443
% 5.65/2.40 # Rewrite failures with RHS unbound : 0
% 5.65/2.40 # BW rewrite match attempts : 58025
% 5.65/2.40 # BW rewrite match successes : 232
% 5.65/2.40 # Condensation attempts : 0
% 5.65/2.40 # Condensation successes : 0
% 5.65/2.40 # Termbank termtop insertions : 955979
% 5.65/2.40 # Search garbage collected termcells : 63840
% 5.65/2.40
% 5.65/2.40 # -------------------------------------------------
% 5.65/2.40 # User time : 0.707 s
% 5.65/2.40 # System time : 0.037 s
% 5.65/2.40 # Total time : 0.744 s
% 5.65/2.40 # Maximum resident set size: 15428 pages
% 5.65/2.40
% 5.65/2.40 # -------------------------------------------------
% 5.65/2.40 # User time : 1.445 s
% 5.65/2.40 # System time : 0.048 s
% 5.65/2.40 # Total time : 1.493 s
% 5.65/2.40 # Maximum resident set size: 9952 pages
% 5.65/2.40 % E---3.1 exiting
% 5.65/2.40 % E exiting
%------------------------------------------------------------------------------