%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM926_1 : 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 : n001.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:51:04 PM UTC 2026
% Result : Theorem 0.26s 0.51s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 25 unt; 0 typ; 0 def)
% Number of atoms : 63 ( 42 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 47 ( 24 ~; 15 |; 4 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 7 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn 38 !; 8 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
int: $tType ).
tff(decl_sort2,type,
nat: $tType ).
tff(decl_23,type,
one_one_int: int ).
tff(decl_25,type,
plus_plus_int: ( int * int ) > int ).
tff(decl_27,type,
times_times_int: ( int * int ) > int ).
tff(decl_30,type,
bit0: int > int ).
tff(decl_31,type,
bit1: int > int ).
tff(decl_32,type,
pls: int ).
tff(decl_33,type,
number_number_of_int: int > int ).
tff(decl_34,type,
number_number_of_nat: int > nat ).
tff(decl_35,type,
ord_less_int: ( int * int ) > $o ).
tff(decl_37,type,
ord_less_eq_int: ( int * int ) > $o ).
tff(decl_39,type,
power_power_int: ( nat * int ) > int ).
tff(decl_42,type,
m: int ).
tff(decl_44,type,
t: int ).
tff(decl_45,type,
esk1_0: int ).
tff(decl_46,type,
esk2_0: int ).
tff(decl_47,type,
esk3_0: int ).
tff(decl_48,type,
esk4_0: int ).
tff(conj_0,conjecture,
? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(fact_111_number__of__is__id,axiom,
! [X26: int] : ( number_number_of_int(X26) = X26 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_111_number__of__is__id) ).
tff(fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X142: int,X143: int] : ( plus_plus_int(X142,X143) = plus_plus_int(X143,X142) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
tff(fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J,axiom,
! [X106: int,X107: int] : ( times_times_int(X106,X107) = times_times_int(X107,X106) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J) ).
tff(fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
! [X10: int] : ( times_times_int(X10,X10) = power_power_int(X10,number_number_of_nat(bit0(bit1(pls)))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).
tff(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ord_less_int(one_one_int,t)
=> ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
tff(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06,axiom,
( ( t = one_one_int )
=> ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
tff(fact_28_zless__le,axiom,
! [X22: int,X23: int] :
( ord_less_int(X22,X23)
<=> ( ( X22 != X23 )
& ord_less_eq_int(X22,X23) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_28_zless__le) ).
tff(fact_0_tpos,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_tpos) ).
tff(c_0_9,negated_conjecture,
~ ? [X1: int,X2: int] : ( plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
tff(c_0_10,negated_conjecture,
! [X394: int,X395: int] : ( plus_plus_int(power_power_int(X394,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X395,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
tff(c_0_11,plain,
! [X373: int] : ( number_number_of_int(X373) = X373 ),
inference(variable_rename,[status(thm)],[fact_111_number__of__is__id]) ).
tcf(c_0_12,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
tcf(c_0_13,plain,
! [X1: int] : number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_14,plain,
! [X354: int,X355: int] : ( plus_plus_int(X354,X355) = plus_plus_int(X355,X354) ),
inference(variable_rename,[status(thm)],[fact_102_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
tff(c_0_15,plain,
! [X318: int,X319: int] : ( times_times_int(X318,X319) = times_times_int(X319,X318) ),
inference(variable_rename,[status(thm)],[fact_90_comm__semiring__1__class_Onormalizing__semiring__rules_I7_J]) ).
tcf(c_0_16,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
tcf(c_0_17,plain,
! [X2: int,X1: int] : plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_18,plain,
! [X2: int,X1: int] : times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tff(c_0_19,plain,
! [X167: int] : ( times_times_int(X167,X167) = power_power_int(X167,number_number_of_nat(bit0(bit1(pls)))) ),
inference(variable_rename,[status(thm)],[fact_16_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).
tff(c_0_20,plain,
( ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
tff(c_0_21,plain,
( ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ( t != one_one_int ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])])])]) ).
tff(c_0_22,plain,
! [X22: int,X23: int] :
( ord_less_int(X22,X23)
<=> ( ( X22 != X23 )
& ord_less_eq_int(X22,X23) ) ),
inference(fof_simplification,[status(thm)],[fact_28_zless__le]) ).
tcf(c_0_23,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X2,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
tcf(c_0_24,plain,
! [X1: int] : times_times_int(X1,X1) = power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_25,plain,
( ~ ord_less_int(one_one_int,t)
| ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_26,plain,
( ( t != one_one_int )
| ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tff(c_0_27,plain,
! [X181: int,X182: int] :
( ( ord_less_int(X181,X182)
| ( X181 = X182 )
| ~ ord_less_eq_int(X181,X182) )
& ( ~ ord_less_int(X181,X182)
| ( X181 != X182 ) )
& ( ~ ord_less_int(X181,X182)
| ord_less_eq_int(X181,X182) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
tcf(c_0_28,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
tcf(c_0_29,plain,
( ~ ord_less_int(one_one_int,t)
| ( plus_plus_int(power_power_int(esk3_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk4_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) ) ),
inference(rw,[status(thm)],[c_0_25,c_0_13]) ).
tcf(c_0_30,plain,
( ( t != one_one_int )
| ( plus_plus_int(power_power_int(esk1_0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(esk2_0,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int) ) ),
inference(rw,[status(thm)],[c_0_26,c_0_13]) ).
tcf(c_0_31,plain,
! [X1: int,X2: int] :
( ~ ord_less_eq_int(X1,X2)
| ord_less_int(X1,X2)
| ( X1 = X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(c_0_32,plain,
ord_less_eq_int(one_one_int,t),
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
tcf(c_0_33,negated_conjecture,
! [X1: int,X2: int] : plus_plus_int(times_times_int(X1,X1),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_28,c_0_24]) ).
tcf(c_0_34,plain,
( ~ ord_less_int(one_one_int,t)
| ( plus_plus_int(times_times_int(esk3_0,esk3_0),times_times_int(esk4_0,esk4_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_24]),c_0_24]),c_0_17]),c_0_18]) ).
tcf(c_0_35,plain,
( ( t != one_one_int )
| ( plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_24]),c_0_24]),c_0_17]),c_0_18]) ).
tcf(c_0_36,plain,
( ord_less_int(one_one_int,t)
| ( t = one_one_int ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
tcf(c_0_37,negated_conjecture,
~ ord_less_int(one_one_int,t),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
tcf(c_0_38,negated_conjecture,
t != one_one_int,
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_36,c_0_37]),c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM926_1 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n001.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 03:23:28 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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
% 0.26/0.51 % Version: 3.5.1
% 0.26/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.26/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.26/0.51 % Starting sh5l with 300s (1) cores
% 0.26/0.51 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2078550 completed with status 0
% 0.26/0.51 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.26/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.51 % No SInE strategy applied
% 0.26/0.51 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.26/0.51 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.26/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.26/0.51 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.26/0.51 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 2078557 completed with status 0
% 0.26/0.51 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.26/0.51 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.26/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.26/0.51 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.51 % No SInE strategy applied
% 0.26/0.51 % Search class: FGHSM-FFMM21-DFFFFFNN
% 0.26/0.51 % partial match(1): FGHSM-FFMM21-SFFFFFNN
% 0.26/0.51 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.51 % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.51 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.26/0.51 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.26/0.51 % Preprocessing time : 0.003 s
% 0.26/0.51
% 0.26/0.51 % Proof found!
% 0.26/0.51 % SZS status Theorem
% 0.26/0.51 % SZS output start CNFRefutation
% See solution above
% 0.26/0.51 % Parsed axioms : 148
% 0.26/0.51 % Removed by relevancy pruning/SinE : 0
% 0.26/0.51 % Initial clauses : 187
% 0.26/0.51 % Removed in clause preprocessing : 41
% 0.26/0.51 % Initial clauses in saturation : 146
% 0.26/0.51 % Processed clauses : 915
% 0.26/0.51 % ...of these trivial : 85
% 0.26/0.51 % ...subsumed : 465
% 0.26/0.51 % ...remaining for further processing : 364
% 0.26/0.51 % Other redundant clauses eliminated : 1
% 0.26/0.51 % Clauses deleted for lack of memory : 0
% 0.26/0.51 % Backward-subsumed : 26
% 0.26/0.51 % Backward-rewritten : 11
% 0.26/0.51 % Generated clauses : 3544
% 0.26/0.51 % ...of the previous two non-redundant : 3322
% 0.26/0.51 % ...aggressively subsumed : 0
% 0.26/0.51 % Contextual simplify-reflections : 1
% 0.26/0.51 % Paramodulations : 3526
% 0.26/0.51 % Factorizations : 6
% 0.26/0.51 % NegExts : 0
% 0.26/0.51 % Equation resolutions : 3
% 0.26/0.51 % Disequality decompositions : 0
% 0.26/0.51 % Total rewrite steps : 1065
% 0.26/0.51 % ...of those cached : 690
% 0.26/0.51 % Propositional unsat checks : 0
% 0.26/0.51 % Propositional check models : 0
% 0.26/0.51 % Propositional check unsatisfiable : 0
% 0.26/0.51 % Propositional clauses : 0
% 0.26/0.51 % Propositional clauses after purity: 0
% 0.26/0.51 % Propositional unsat core size : 0
% 0.26/0.51 % Propositional preprocessing time : 0.000
% 0.26/0.51 % Propositional encoding time : 0.000
% 0.26/0.51 % Propositional solver time : 0.000
% 0.26/0.51 % Success case prop preproc time : 0.000
% 0.26/0.51 % Success case prop encoding time : 0.000
% 0.26/0.51 % Success case prop solver time : 0.000
% 0.26/0.51 % Current number of processed clauses : 317
% 0.26/0.51 % Positive orientable unit clauses : 58
% 0.26/0.51 % Positive unorientable unit clauses: 21
% 0.26/0.51 % Negative unit clauses : 50
% 0.26/0.51 % Non-unit-clauses : 188
% 0.26/0.51 % Current number of unprocessed clauses: 2472
% 0.26/0.51 % ...number of literals in the above : 4764
% 0.26/0.51 % Current number of archived formulas : 0
% 0.26/0.51 % Current number of archived clauses : 47
% 0.26/0.51 % Clause-clause subsumption calls (NU) : 5726
% 0.26/0.51 % Rec. Clause-clause subsumption calls : 4398
% 0.26/0.51 % Non-unit clause-clause subsumptions : 217
% 0.26/0.51 % Unit Clause-clause subsumption calls : 1394
% 0.26/0.51 % Rewrite failures with RHS unbound : 0
% 0.26/0.51 % BW rewrite match attempts : 117
% 0.26/0.51 % BW rewrite match successes : 77
% 0.26/0.51 % Condensation attempts : 0
% 0.26/0.51 % Condensation successes : 0
% 0.26/0.51 % Termbank termtop insertions : 53230
% 0.26/0.51 % Search garbage collected termcells : 930
% 0.26/0.51
% 0.26/0.51 % -------------------------------------------------
% 0.26/0.51 % User time : 0.054 s
% 0.26/0.51 % System time : 0.007 s
% 0.26/0.51 % Total time : 0.061 s
% 0.26/0.51 % Maximum resident set size: 4092 pages
% 0.26/0.51
% 0.26/0.51 % -------------------------------------------------
% 0.26/0.51 % User time : 0.200 s
% 0.26/0.51 % System time : 0.023 s
% 0.26/0.51 % Total time : 0.223 s
% 0.26/0.51 % Maximum resident set size: 4864 pages
% 0.26/0.51 % E exiting
%------------------------------------------------------------------------------