%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM926^3 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 : Wed Sep 30 08:17:49 AM UTC 2026
% Result : Theorem 1.01s 0.89s
% Output : CNFRefutation 1.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 24 unt; 0 typ; 0 def)
% Number of atoms : 52 ( 33 equ; 0 cnn)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 337 ( 18 ~; 10 |; 4 &; 301 @)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 10 con; 0-2 aty)
% Number of variables : 33 ( 0 ^; 25 !; 8 ?; 33 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
int: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_28,type,
one_one_int: int ).
thf(decl_31,type,
plus_plus_int: int > int > int ).
thf(decl_34,type,
times_times_int: int > int > int ).
thf(decl_37,type,
zero_zero_int: int ).
thf(decl_45,type,
bit0: int > int ).
thf(decl_46,type,
bit1: int > int ).
thf(decl_48,type,
pls: int ).
thf(decl_49,type,
number_number_of_int: int > int ).
thf(decl_50,type,
number_number_of_nat: int > nat ).
thf(decl_52,type,
ord_less_int: int > int > $o ).
thf(decl_55,type,
ord_less_eq_int: int > int > $o ).
thf(decl_58,type,
power_power_int: int > nat > int ).
thf(decl_75,type,
m: int ).
thf(decl_78,type,
t: int ).
thf(decl_80,type,
esk1_0: int ).
thf(decl_81,type,
esk2_0: int ).
thf(decl_82,type,
esk3_0: int ).
thf(decl_83,type,
esk4_0: int ).
thf(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/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',conj_0) ).
thf(fact_265_semiring__norm_I110_J,axiom,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',fact_265_semiring__norm_I110_J) ).
thf(fact_358_Pls__def,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',fact_358_Pls__def) ).
thf(fact_144_number__of__is__id,axiom,
! [X29: int] :
( ( number_number_of_int @ X29 )
= X29 ),
file('/export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',fact_144_number__of__is__id) ).
thf(fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J,axiom,
! [X193: int,X194: int] :
( ( plus_plus_int @ X193 @ X194 )
= ( plus_plus_int @ X194 @ X193 ) ),
file('/export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J) ).
thf(fact_37_zless__le,axiom,
! [X26: int,X25: int] :
( ( ord_less_int @ X26 @ X25 )
<=> ( ( ord_less_eq_int @ X26 @ X25 )
& ( X26 != X25 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',fact_37_zless__le) ).
thf(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/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.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) ).
thf(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/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.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) ).
thf(fact_0_tpos,axiom,
ord_less_eq_int @ one_one_int @ t,
file('/export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p',fact_0_tpos) ).
thf(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]) ).
thf(c_0_10,plain,
( one_one_int
= ( number_number_of_int @ ( bit1 @ pls ) ) ),
inference(split_conjunct,[status(thm)],[fact_265_semiring__norm_I110_J]) ).
thf(c_0_11,plain,
pls = zero_zero_int,
inference(split_conjunct,[status(thm)],[fact_358_Pls__def]) ).
thf(c_0_12,plain,
! [X4636: int] :
( ( number_number_of_int @ X4636 )
= X4636 ),
inference(variable_rename,[status(thm)],[fact_144_number__of__is__id]) ).
thf(c_0_13,negated_conjecture,
! [X6958: int,X6959: int] :
( ( plus_plus_int @ ( power_power_int @ X6958 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ ( power_power_int @ X6959 @ ( 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])])]) ).
thf(c_0_14,plain,
( ( number_number_of_int @ ( bit1 @ zero_zero_int ) )
= one_one_int ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_15,plain,
! [X1: int] :
( ( number_number_of_int @ X1 )
= X1 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
thf(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 @ ( number_number_of_int @ ( bit0 @ ( bit0 @ ( bit1 @ pls ) ) ) ) @ m ) @ one_one_int ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
( one_one_int
= ( bit1 @ zero_zero_int ) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_18,plain,
! [X4611: int,X4612: int] :
( ( plus_plus_int @ X4611 @ X4612 )
= ( plus_plus_int @ X4612 @ X4611 ) ),
inference(variable_rename,[status(thm)],[fact_132_comm__semiring__1__class_Onormalizing__semiring__rules_I24_J]) ).
thf(c_0_19,plain,
! [X26: int,X25: int] :
( ( ord_less_int @ X26 @ X25 )
<=> ( ( ord_less_eq_int @ X26 @ X25 )
& ( X26 != X25 ) ) ),
inference(fof_simplification,[status(thm)],[fact_37_zless__le]) ).
thf(c_0_20,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(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])])])]) ).
thf(c_0_21,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
!= ( plus_plus_int @ ( times_times_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) @ m ) @ ( bit1 @ zero_zero_int ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_11]),c_0_11]),c_0_15]),c_0_17]) ).
thf(c_0_22,plain,
! [X2: int,X1: int] :
( ( plus_plus_int @ X1 @ X2 )
= ( plus_plus_int @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_23,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(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])])])]) ).
thf(c_0_24,plain,
! [X4380: int,X4381: int] :
( ( ( ord_less_eq_int @ X4380 @ X4381 )
| ~ ( ord_less_int @ X4380 @ X4381 ) )
& ( ( X4380 != X4381 )
| ~ ( ord_less_int @ X4380 @ X4381 ) )
& ( ~ ( ord_less_eq_int @ X4380 @ X4381 )
| ( X4380 = X4381 )
| ( ord_less_int @ X4380 @ X4381 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])]) ).
thf(c_0_25,plain,
ord_less_eq_int @ one_one_int @ t,
inference(split_conjunct,[status(thm)],[fact_0_tpos]) ).
thf(c_0_26,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(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_27,negated_conjecture,
! [X1: int,X2: int] :
( ( plus_plus_int @ ( power_power_int @ X1 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) @ ( power_power_int @ X2 @ ( number_number_of_nat @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) ) )
!= ( plus_plus_int @ ( bit1 @ zero_zero_int ) @ ( times_times_int @ ( bit0 @ ( bit0 @ ( bit1 @ zero_zero_int ) ) ) @ m ) ) ),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
thf(c_0_28,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(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,plain,
! [X1: int,X2: int] :
( ( X1 = X2 )
| ( ord_less_int @ X1 @ X2 )
| ~ ( ord_less_eq_int @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_30,plain,
ord_less_eq_int @ ( bit1 @ zero_zero_int ) @ t,
inference(rw,[status(thm)],[c_0_25,c_0_17]) ).
thf(c_0_31,plain,
( t
!= ( bit1 @ zero_zero_int ) ),
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)],[c_0_26,c_0_11]),c_0_11]),c_0_11]),c_0_15]),c_0_17]),c_0_22]),c_0_17]),c_0_27]) ).
thf(c_0_32,plain,
~ ( ord_less_int @ ( bit1 @ zero_zero_int ) @ t ),
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)],[c_0_28,c_0_11]),c_0_11]),c_0_11]),c_0_15]),c_0_17]),c_0_22]),c_0_17]),c_0_27]) ).
thf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM926^3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18 % Computer : n015.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:09:17 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.23 Running higher-order theorem proving
% 0.35/0.39 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.4CNTBuxrEE/E---3.1_3486372.p
% 1.01/0.89 % Version: 3.5.1-ho
% 1.01/0.89 % Preprocessing class: HMLSSMSMSSSNSFA.
% 1.01/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.01/0.89 % Starting sh3 with 1500s (5) cores
% 1.01/0.89 % Starting lpo1_def_fix with 300s (1) cores
% 1.01/0.89 % Starting lpo8_s with 300s (1) cores
% 1.01/0.89 % Starting lpo1_lambda_fix with 300s (1) cores
% 1.01/0.89 % sh3 with pid 3486447 completed with status 0
% 1.01/0.89 % Result found by sh3
% 1.01/0.89 % Preprocessing class: HMLSSMSMSSSNSFA.
% 1.01/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.01/0.89 % Starting sh3 with 1500s (5) cores
% 1.01/0.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.01/0.89 % No SInE strategy applied
% 1.01/0.89 % Search class: HGHSM-SSLM32-DSFFFFBN
% 1.01/0.89 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.01/0.89 % Starting SubtermCWHack with 151s (1) cores
% 1.01/0.89 % Starting sh3 with 750s (1) cores
% 1.01/0.89 % Starting lpo1_def_fix with 188s (1) cores
% 1.01/0.89 % Starting lpo8_s with 188s (1) cores
% 1.01/0.89 % Starting lpo1_lambda_fix with 188s (1) cores
% 1.01/0.89 % sh3 with pid 3486464 completed with status 0
% 1.01/0.89 % Result found by sh3
% 1.01/0.89 % Preprocessing class: HMLSSMSMSSSNSFA.
% 1.01/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.01/0.89 % Starting sh3 with 1500s (5) cores
% 1.01/0.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.01/0.89 % No SInE strategy applied
% 1.01/0.89 % Search class: HGHSM-SSLM32-DSFFFFBN
% 1.01/0.89 % Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.01/0.89 % Starting SubtermCWHack with 151s (1) cores
% 1.01/0.89 % Starting sh3 with 750s (1) cores
% 1.01/0.89 % Preprocessing time : 0.033 s
% 1.01/0.89 % Presaturation interreduction done
% 1.01/0.89
% 1.01/0.89 % Proof found!
% 1.01/0.89 % SZS status Theorem
% 1.01/0.89 % SZS output start CNFRefutation
% See solution above
% 1.01/0.89 % Parsed axioms : 1259
% 1.01/0.89 % Removed by relevancy pruning/SinE : 0
% 1.01/0.89 % Initial clauses : 1789
% 1.01/0.89 % Removed in clause preprocessing : 150
% 1.01/0.89 % Initial clauses in saturation : 1639
% 1.01/0.89 % Processed clauses : 2023
% 1.01/0.89 % ...of these trivial : 183
% 1.01/0.89 % ...subsumed : 398
% 1.01/0.89 % ...remaining for further processing : 1442
% 1.01/0.89 % Other redundant clauses eliminated : 157
% 1.01/0.89 % Clauses deleted for lack of memory : 0
% 1.01/0.89 % Backward-subsumed : 9
% 1.01/0.89 % Backward-rewritten : 40
% 1.01/0.89 % Generated clauses : 651
% 1.01/0.89 % ...of the previous two non-redundant : 431
% 1.01/0.89 % ...aggressively subsumed : 0
% 1.01/0.89 % Contextual simplify-reflections : 3
% 1.01/0.89 % Paramodulations : 501
% 1.01/0.89 % Factorizations : 0
% 1.01/0.89 % NegExts : 0
% 1.01/0.89 % Equation resolutions : 162
% 1.01/0.89 % Disequality decompositions : 0
% 1.01/0.89 % Total rewrite steps : 1825
% 1.01/0.89 % ...of those cached : 1498
% 1.01/0.89 % Propositional unsat checks : 0
% 1.01/0.89 % Propositional check models : 0
% 1.01/0.89 % Propositional check unsatisfiable : 0
% 1.01/0.89 % Propositional clauses : 0
% 1.01/0.89 % Propositional clauses after purity: 0
% 1.01/0.89 % Propositional unsat core size : 0
% 1.01/0.89 % Propositional preprocessing time : 0.000
% 1.01/0.89 % Propositional encoding time : 0.000
% 1.01/0.89 % Propositional solver time : 0.000
% 1.01/0.89 % Success case prop preproc time : 0.000
% 1.01/0.89 % Success case prop encoding time : 0.000
% 1.01/0.89 % Success case prop solver time : 0.000
% 1.01/0.89 % Current number of processed clauses : 220
% 1.01/0.89 % Positive orientable unit clauses : 86
% 1.01/0.89 % Positive unorientable unit clauses: 2
% 1.01/0.89 % Negative unit clauses : 36
% 1.01/0.89 % Non-unit-clauses : 96
% 1.01/0.89 % Current number of unprocessed clauses: 1087
% 1.01/0.89 % ...number of literals in the above : 2556
% 1.01/0.89 % Current number of archived formulas : 0
% 1.01/0.89 % Current number of archived clauses : 1090
% 1.01/0.89 % Clause-clause subsumption calls (NU) : 143776
% 1.01/0.89 % Rec. Clause-clause subsumption calls : 89330
% 1.01/0.89 % Non-unit clause-clause subsumptions : 266
% 1.01/0.89 % Unit Clause-clause subsumption calls : 1796
% 1.01/0.89 % Rewrite failures with RHS unbound : 3
% 1.01/0.89 % BW rewrite match attempts : 352
% 1.01/0.89 % BW rewrite match successes : 225
% 1.01/0.89 % Condensation attempts : 0
% 1.01/0.89 % Condensation successes : 0
% 1.01/0.89 % Termbank termtop insertions : 161187
% 1.01/0.89 % Search garbage collected termcells : 29960
% 1.01/0.89
% 1.01/0.89 % -------------------------------------------------
% 1.01/0.89 % User time : 0.389 s
% 1.01/0.89 % System time : 0.030 s
% 1.01/0.89 % Total time : 0.419 s
% 1.01/0.89 % Maximum resident set size: 11664 pages
% 1.01/0.89
% 1.01/0.89 % -------------------------------------------------
% 1.01/0.89 % User time : 1.372 s
% 1.01/0.89 % System time : 0.112 s
% 1.01/0.89 % Total time : 1.484 s
% 1.01/0.89 % Maximum resident set size: 7168 pages
% 1.01/0.89 % E exiting
%------------------------------------------------------------------------------