%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM925+7 : 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 : n006.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:03 PM UTC 2026
% Result : Theorem 3.92s 1.12s
% Output : CNFRefutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 17
% Syntax : Number of formulae : 69 ( 65 unt; 0 def)
% Number of atoms : 77 ( 62 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 15 ~; 4 |; 0 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 6 con; 0-4 aty)
% Number of variables : 50 ( 1 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_514_succ__Bit0,axiom,
! [X20] : succ(bit0(X20)) = bit1(X20),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_514_succ__Bit0) ).
fof(fact_78_Bit0__def,axiom,
! [X20] : bit0(X20) = plus_plus(int,X20,X20),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_78_Bit0__def) ).
fof(fact_777_diff__bin__simps_I2_J,axiom,
! [X20] : minus_minus(int,X20,min) = succ(X20),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_777_diff__bin__simps_I2_J) ).
fof(fact_37_one__is__num__one,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_37_one__is__num__one) ).
fof(fact_72_Bit0__Pls,axiom,
bit0(pls) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_72_Bit0__Pls) ).
fof(fact_79_zadd__0__right,axiom,
! [X16] : plus_plus(int,X16,zero_zero(int)) = ti(int,X16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_79_zadd__0__right) ).
fof(fact_120_number__of__is__id,axiom,
! [X20] : number_number_of(int,X20) = ti(int,X20),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_120_number__of__is__id) ).
fof(fact_73_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_73_Pls__def) ).
fof(fact_80_zadd__0,axiom,
! [X16] : plus_plus(int,zero_zero(int),X16) = ti(int,X16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_80_zadd__0) ).
fof(tsy_c_Int_Osucc_res,axiom,
! [X1] : ti(int,succ(X1)) = succ(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tsy_c_Int_Osucc_res) ).
fof(conj_0,conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) != zero_zero(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_519_succ__def,axiom,
! [X20] : succ(X20) = plus_plus(int,X20,one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_519_succ__def) ).
fof(fact_165_field__power__not__zero,axiom,
! [X2] :
( ring_11004092258visors(X2)
=> ! [X15,X31] :
( ti(X2,X31) != zero_zero(X2)
=> hAPP(nat,X2,power_power(X2,X31),X15) != zero_zero(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_165_field__power__not__zero) ).
fof(fact_47_zadd__commute,axiom,
! [X16,X8] : plus_plus(int,X16,X8) = plus_plus(int,X8,X16),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_47_zadd__commute) ).
fof(fact_32_rel__simps_I2_J,axiom,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_32_rel__simps_I2_J) ).
fof(fact_0_n1pos,axiom,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_n1pos) ).
fof(arity_Int_Oint___Rings_Oring__1__no__zero__divisors,axiom,
ring_11004092258visors(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Oring__1__no__zero__divisors) ).
fof(c_0_17,plain,
! [X1582] : succ(bit0(X1582)) = bit1(X1582),
inference(variable_rename,[status(thm)],[fact_514_succ__Bit0]) ).
fof(c_0_18,plain,
! [X392] : bit0(X392) = plus_plus(int,X392,X392),
inference(variable_rename,[status(thm)],[fact_78_Bit0__def]) ).
fof(c_0_19,plain,
! [X2159] : minus_minus(int,X2159,min) = succ(X2159),
inference(variable_rename,[status(thm)],[fact_777_diff__bin__simps_I2_J]) ).
cnf(c_0_20,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_37_one__is__num__one]) ).
cnf(c_0_21,plain,
succ(bit0(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,plain,
bit0(X1) = plus_plus(int,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
minus_minus(int,X1,min) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_24,plain,
bit0(pls) = pls,
inference(split_conjunct,[status(thm)],[fact_72_Bit0__Pls]) ).
fof(c_0_25,plain,
! [X393] : plus_plus(int,X393,zero_zero(int)) = ti(int,X393),
inference(variable_rename,[status(thm)],[fact_79_zadd__0__right]) ).
fof(c_0_26,plain,
! [X464] : number_number_of(int,X464) = ti(int,X464),
inference(variable_rename,[status(thm)],[fact_120_number__of__is__id]) ).
cnf(c_0_27,plain,
one_one(int) = number_number_of(int,minus_minus(int,plus_plus(int,pls,pls),min)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]) ).
cnf(c_0_28,plain,
plus_plus(int,pls,pls) = pls,
inference(rw,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_29,plain,
plus_plus(int,X1,zero_zero(int)) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_73_Pls__def]) ).
cnf(c_0_31,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_32,plain,
! [X394] : plus_plus(int,zero_zero(int),X394) = ti(int,X394),
inference(variable_rename,[status(thm)],[fact_80_zadd__0]) ).
fof(c_0_33,plain,
! [X222] : ti(int,succ(X222)) = succ(X222),
inference(variable_rename,[status(thm)],[tsy_c_Int_Osucc_res]) ).
cnf(c_0_34,plain,
number_number_of(int,minus_minus(int,pls,min)) = one_one(int),
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
number_number_of(int,X1) = plus_plus(int,X1,pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_36,plain,
plus_plus(int,zero_zero(int),X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_37,plain,
ti(int,succ(X1)) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_38,negated_conjecture,
~ ( hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) != zero_zero(int) ),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_39,plain,
! [X1590] : succ(X1590) = plus_plus(int,X1590,one_one(int)),
inference(variable_rename,[status(thm)],[fact_519_succ__def]) ).
cnf(c_0_40,plain,
plus_plus(int,minus_minus(int,pls,min),pls) = one_one(int),
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
plus_plus(int,pls,X1) = plus_plus(int,X1,pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_30]),c_0_31]),c_0_35]) ).
cnf(c_0_42,plain,
ti(int,minus_minus(int,X1,min)) = minus_minus(int,X1,min),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_23]),c_0_23]) ).
cnf(c_0_43,plain,
ti(int,X1) = plus_plus(int,X1,pls),
inference(rw,[status(thm)],[c_0_31,c_0_35]) ).
fof(c_0_44,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(int),
inference(fof_simplification,[status(thm)],[c_0_38]) ).
cnf(c_0_45,plain,
succ(X1) = plus_plus(int,X1,one_one(int)),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,plain,
plus_plus(int,pls,minus_minus(int,pls,min)) = one_one(int),
inference(rw,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,plain,
plus_plus(int,pls,minus_minus(int,X1,min)) = minus_minus(int,X1,min),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_41]) ).
fof(c_0_48,plain,
! [X2] :
( ring_11004092258visors(X2)
=> ! [X15,X31] :
( ti(X2,X31) != zero_zero(X2)
=> hAPP(nat,X2,power_power(X2,X31),X15) != zero_zero(X2) ) ),
inference(fof_simplification,[status(thm)],[fact_165_field__power__not__zero]) ).
cnf(c_0_49,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls)))) = zero_zero(int),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
minus_minus(int,X1,min) = plus_plus(int,X1,one_one(int)),
inference(rw,[status(thm)],[c_0_45,c_0_23]) ).
cnf(c_0_51,plain,
one_one(int) = minus_minus(int,pls,min),
inference(rw,[status(thm)],[c_0_46,c_0_47]) ).
fof(c_0_52,plain,
! [X353,X354] : plus_plus(int,X353,X354) = plus_plus(int,X354,X353),
inference(variable_rename,[status(thm)],[fact_47_zadd__commute]) ).
fof(c_0_53,plain,
! [X560,X561,X562] :
( hAPP(nat,X560,power_power(X560,X562),X561) != zero_zero(X560)
| ti(X560,X562) = zero_zero(X560)
| ~ ring_11004092258visors(X560) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_48])])])]) ).
cnf(c_0_54,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,plus_plus(int,minus_minus(int,plus_plus(int,pls,pls),min),minus_minus(int,plus_plus(int,pls,pls),min)))) = 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_49,c_0_21]),c_0_22]),c_0_22]),c_0_23]),c_0_23]) ).
cnf(c_0_55,plain,
plus_plus(int,X1,minus_minus(int,pls,min)) = minus_minus(int,X1,min),
inference(rw,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_56,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
fof(c_0_57,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
inference(fof_simplification,[status(thm)],[fact_32_rel__simps_I2_J]) ).
cnf(c_0_58,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(split_conjunct,[status(thm)],[fact_0_n1pos]) ).
cnf(c_0_59,plain,
( hAPP(nat,X1,power_power(X1,X2),X3) != zero_zero(X1)
| ~ ring_11004092258visors(X1)
| ti(X1,X2) = zero_zero(X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,negated_conjecture,
hAPP(nat,int,power_power(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,minus_minus(int,minus_minus(int,pls,min),min))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_51]),c_0_28]),c_0_28]),c_0_55]),c_0_30]) ).
cnf(c_0_61,plain,
plus_plus(int,minus_minus(int,pls,min),X1) = minus_minus(int,X1,min),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
ring_11004092258visors(int),
inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Oring__1__no__zero__divisors]) ).
fof(c_0_63,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
inference(fof_nnf,[status(thm)],[c_0_57]) ).
cnf(c_0_64,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_30]),c_0_51]) ).
cnf(c_0_65,negated_conjecture,
minus_minus(int,hAPP(nat,int,semiring_1_of_nat(int),n),min) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61]),c_0_43]),c_0_30]),c_0_30]),c_0_62])]),c_0_56]),c_0_47]) ).
cnf(c_0_66,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
inference(split_conjunct,[status(thm)],[c_0_63]) ).
cnf(c_0_67,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),pls)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_61]),c_0_65]) ).
cnf(c_0_68,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM925+7 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.38 % Computer : n006.cluster.edu
% 0.13/0.38 % Model : x86_64 x86_64
% 0.13/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.38 % Memory : 8046.5625MB
% 0.13/0.38 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 03:17:57 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.43 Running first-order theorem proving
% 0.13/0.43 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 3.92/1.12 % Version: 3.5.1
% 3.92/1.12 % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.92/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.92/1.12 % Starting new_bool_3 with 300s (1) cores
% 3.92/1.12 % Starting new_bool_1 with 300s (1) cores
% 3.92/1.12 % Starting sh5l with 300s (1) cores
% 3.92/1.12 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1891398 completed with status 0
% 3.92/1.12 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 3.92/1.12 % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.92/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.92/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.92/1.12 % No SInE strategy applied
% 3.92/1.12 % Search class: FGHSM-SSLM32-DFFFFFNN
% 3.92/1.12 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.92/1.12 % Starting SubtermCWHack with 136s (1) cores
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 3.92/1.12 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 3.92/1.12 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 1891406 completed with status 0
% 3.92/1.12 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 3.92/1.12 % Preprocessing class: FMLMSMSMSSSNFFN.
% 3.92/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.92/1.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.92/1.12 % No SInE strategy applied
% 3.92/1.12 % Search class: FGHSM-SSLM32-DFFFFFNN
% 3.92/1.12 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 3.92/1.12 % Starting SubtermCWHack with 136s (1) cores
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 3.92/1.12 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 3.92/1.12 % Preprocessing time : 0.033 s
% 3.92/1.12 % Presaturation interreduction done
% 3.92/1.12
% 3.92/1.12 % Proof found!
% 3.92/1.12 % SZS status Theorem
% 3.92/1.12 % SZS output start CNFRefutation
% See solution above
% 3.92/1.12 % Parsed axioms : 1251
% 3.92/1.12 % Removed by relevancy pruning/SinE : 0
% 3.92/1.12 % Initial clauses : 1729
% 3.92/1.12 % Removed in clause preprocessing : 83
% 3.92/1.12 % Initial clauses in saturation : 1646
% 3.92/1.12 % Processed clauses : 3647
% 3.92/1.12 % ...of these trivial : 66
% 3.92/1.12 % ...subsumed : 1274
% 3.92/1.12 % ...remaining for further processing : 2306
% 3.92/1.12 % Other redundant clauses eliminated : 98
% 3.92/1.12 % Clauses deleted for lack of memory : 0
% 3.92/1.12 % Backward-subsumed : 17
% 3.92/1.12 % Backward-rewritten : 110
% 3.92/1.12 % Generated clauses : 5227
% 3.92/1.12 % ...of the previous two non-redundant : 4385
% 3.92/1.12 % ...aggressively subsumed : 0
% 3.92/1.12 % Contextual simplify-reflections : 1
% 3.92/1.12 % Paramodulations : 5127
% 3.92/1.12 % Factorizations : 2
% 3.92/1.12 % NegExts : 0
% 3.92/1.12 % Equation resolutions : 104
% 3.92/1.12 % Disequality decompositions : 0
% 3.92/1.12 % Total rewrite steps : 8050
% 3.92/1.12 % ...of those cached : 6741
% 3.92/1.12 % Propositional unsat checks : 0
% 3.92/1.12 % Propositional check models : 0
% 3.92/1.12 % Propositional check unsatisfiable : 0
% 3.92/1.12 % Propositional clauses : 0
% 3.92/1.12 % Propositional clauses after purity: 0
% 3.92/1.12 % Propositional unsat core size : 0
% 3.92/1.12 % Propositional preprocessing time : 0.000
% 3.92/1.12 % Propositional encoding time : 0.000
% 3.92/1.12 % Propositional solver time : 0.000
% 3.92/1.12 % Success case prop preproc time : 0.000
% 3.92/1.12 % Success case prop encoding time : 0.000
% 3.92/1.12 % Success case prop solver time : 0.000
% 3.92/1.12 % Current number of processed clauses : 756
% 3.92/1.12 % Positive orientable unit clauses : 405
% 3.92/1.12 % Positive unorientable unit clauses: 14
% 3.92/1.12 % Negative unit clauses : 160
% 3.92/1.12 % Non-unit-clauses : 177
% 3.92/1.12 % Current number of unprocessed clauses: 3735
% 3.92/1.12 % ...number of literals in the above : 5949
% 3.92/1.12 % Current number of archived formulas : 0
% 3.92/1.12 % Current number of archived clauses : 1483
% 3.92/1.12 % Clause-clause subsumption calls (NU) : 187968
% 3.92/1.12 % Rec. Clause-clause subsumption calls : 112972
% 3.92/1.12 % Non-unit clause-clause subsumptions : 273
% 3.92/1.12 % Unit Clause-clause subsumption calls : 4041
% 3.92/1.12 % Rewrite failures with RHS unbound : 0
% 3.92/1.12 % BW rewrite match attempts : 7236
% 3.92/1.12 % BW rewrite match successes : 359
% 3.92/1.12 % Condensation attempts : 0
% 3.92/1.12 % Condensation successes : 0
% 3.92/1.12 % Termbank termtop insertions : 383283
% 3.92/1.12 % Search garbage collected termcells : 20595
% 3.92/1.12
% 3.92/1.12 % -------------------------------------------------
% 3.92/1.12 % User time : 0.546 s
% 3.92/1.12 % System time : 0.034 s
% 3.92/1.12 % Total time : 0.580 s
% 3.92/1.12 % Maximum resident set size: 11064 pages
% 3.92/1.12
% 3.92/1.12 % -------------------------------------------------
% 3.92/1.12 % User time : 2.325 s
% 3.92/1.12 % System time : 0.144 s
% 3.92/1.12 % Total time : 2.469 s
% 3.92/1.12 % Maximum resident set size: 6400 pages
% 3.92/1.12 % E exiting
%------------------------------------------------------------------------------