%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM925+7 : 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 : n004.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:58 PM UTC 2026
% Result : Theorem 6.87s 1.60s
% Output : CNFRefutation 6.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 22
% Syntax : Number of formulae : 88 ( 81 unt; 0 def)
% Number of atoms : 101 ( 79 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 18 ~; 7 |; 1 &)
% ( 1 <=>; 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 : 21 ( 21 usr; 6 con; 0-4 aty)
% Number of variables : 71 ( 1 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_514_succ__Bit0,axiom,
! [X20] : succ(bit0(X20)) = bit1(X20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_514_succ__Bit0) ).
fof(fact_78_Bit0__def,axiom,
! [X20] : bit0(X20) = plus_plus(int,X20,X20),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',fact_777_diff__bin__simps_I2_J) ).
fof(fact_590_diff__bin__simps_I1_J,axiom,
! [X20] : minus_minus(int,X20,pls) = ti(int,X20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_590_diff__bin__simps_I1_J) ).
fof(fact_120_number__of__is__id,axiom,
! [X20] : number_number_of(int,X20) = ti(int,X20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_120_number__of__is__id) ).
fof(fact_37_one__is__num__one,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_37_one__is__num__one) ).
fof(fact_72_Bit0__Pls,axiom,
bit0(pls) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_72_Bit0__Pls) ).
fof(fact_75_add__Pls__right,axiom,
! [X20] : plus_plus(int,X20,pls) = ti(int,X20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_75_add__Pls__right) ).
fof(fact_76_add__Pls,axiom,
! [X20] : plus_plus(int,pls,X20) = ti(int,X20),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_76_add__Pls) ).
fof(tsy_c_Int_Osucc_res,axiom,
! [X1] : ti(int,succ(X1)) = succ(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_Osucc_res) ).
fof(tsy_c_Int_Onat_arg1,axiom,
! [X1] : nat_1(ti(int,X1)) = nat_1(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tsy_c_Int_Onat_arg1) ).
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/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_519_succ__def,axiom,
! [X20] : succ(X20) = plus_plus(int,X20,one_one(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_519_succ__def) ).
fof(fact_427_nat__number__of__def,axiom,
! [X9] : number_number_of(nat,X9) = nat_1(number_number_of(int,X9)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_427_nat__number__of__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/sandbox2/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/sandbox2/benchmark/theBenchmark.p',fact_47_zadd__commute) ).
fof(fact_73_Pls__def,axiom,
pls = zero_zero(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_73_Pls__def) ).
fof(arity_Int_Oint___Rings_Oring__1__no__zero__divisors,axiom,
ring_11004092258visors(int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',arity_Int_Oint___Rings_Oring__1__no__zero__divisors) ).
fof(fact_117_less__not__refl,axiom,
! [X15] : ~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X15),X15)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_117_less__not__refl) ).
fof(fact_161_less__0__number__of,axiom,
! [X38] :
( hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),number_number_of(nat,X38)))
<=> hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),X38)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_161_less__0__number__of) ).
fof(fact_26_semiring__norm_I113_J,axiom,
zero_zero(nat) = number_number_of(nat,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_26_semiring__norm_I113_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/sandbox2/benchmark/theBenchmark.p',fact_0_n1pos) ).
fof(c_0_22,plain,
! [X1582] : succ(bit0(X1582)) = bit1(X1582),
inference(variable_rename,[status(thm)],[fact_514_succ__Bit0]) ).
fof(c_0_23,plain,
! [X392] : bit0(X392) = plus_plus(int,X392,X392),
inference(variable_rename,[status(thm)],[fact_78_Bit0__def]) ).
fof(c_0_24,plain,
! [X2159] : minus_minus(int,X2159,min) = succ(X2159),
inference(variable_rename,[status(thm)],[fact_777_diff__bin__simps_I2_J]) ).
fof(c_0_25,plain,
! [X1731] : minus_minus(int,X1731,pls) = ti(int,X1731),
inference(variable_rename,[status(thm)],[fact_590_diff__bin__simps_I1_J]) ).
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,bit1(pls)),
inference(split_conjunct,[status(thm)],[fact_37_one__is__num__one]) ).
cnf(c_0_28,plain,
succ(bit0(X1)) = bit1(X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_29,plain,
bit0(X1) = plus_plus(int,X1,X1),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,plain,
minus_minus(int,X1,min) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
bit0(pls) = pls,
inference(split_conjunct,[status(thm)],[fact_72_Bit0__Pls]) ).
fof(c_0_32,plain,
! [X388] : plus_plus(int,X388,pls) = ti(int,X388),
inference(variable_rename,[status(thm)],[fact_75_add__Pls__right]) ).
cnf(c_0_33,plain,
minus_minus(int,X1,pls) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
number_number_of(int,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,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_27,c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_36,plain,
plus_plus(int,pls,pls) = pls,
inference(rw,[status(thm)],[c_0_31,c_0_29]) ).
fof(c_0_37,plain,
! [X389] : plus_plus(int,pls,X389) = ti(int,X389),
inference(variable_rename,[status(thm)],[fact_76_add__Pls]) ).
cnf(c_0_38,plain,
plus_plus(int,X1,pls) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_39,plain,
number_number_of(int,X1) = minus_minus(int,X1,pls),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
fof(c_0_40,plain,
! [X222] : ti(int,succ(X222)) = succ(X222),
inference(variable_rename,[status(thm)],[tsy_c_Int_Osucc_res]) ).
fof(c_0_41,plain,
! [X215] : nat_1(ti(int,X215)) = nat_1(X215),
inference(variable_rename,[status(thm)],[tsy_c_Int_Onat_arg1]) ).
cnf(c_0_42,plain,
number_number_of(int,minus_minus(int,pls,min)) = one_one(int),
inference(rw,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
plus_plus(int,pls,X1) = ti(int,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_44,plain,
minus_minus(int,X1,pls) = plus_plus(int,X1,pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_34]),c_0_39]) ).
cnf(c_0_45,plain,
ti(int,succ(X1)) = succ(X1),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
nat_1(ti(int,X1)) = nat_1(X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
fof(c_0_47,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_48,plain,
! [X1590] : succ(X1590) = plus_plus(int,X1590,one_one(int)),
inference(variable_rename,[status(thm)],[fact_519_succ__def]) ).
cnf(c_0_49,plain,
minus_minus(int,minus_minus(int,pls,min),pls) = one_one(int),
inference(rw,[status(thm)],[c_0_42,c_0_39]) ).
cnf(c_0_50,plain,
plus_plus(int,X1,pls) = plus_plus(int,pls,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_34]),c_0_39]),c_0_44]) ).
cnf(c_0_51,plain,
ti(int,minus_minus(int,X1,min)) = minus_minus(int,X1,min),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_30]),c_0_30]) ).
cnf(c_0_52,plain,
ti(int,X1) = plus_plus(int,X1,pls),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_39]),c_0_44]) ).
fof(c_0_53,plain,
! [X1348] : number_number_of(nat,X1348) = nat_1(number_number_of(int,X1348)),
inference(variable_rename,[status(thm)],[fact_427_nat__number__of__def]) ).
cnf(c_0_54,plain,
nat_1(number_number_of(int,X1)) = nat_1(X1),
inference(rw,[status(thm)],[c_0_46,c_0_34]) ).
fof(c_0_55,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_47]) ).
cnf(c_0_56,plain,
succ(X1) = plus_plus(int,X1,one_one(int)),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,plain,
plus_plus(int,pls,minus_minus(int,pls,min)) = one_one(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_44]),c_0_50]) ).
cnf(c_0_58,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_51,c_0_52]),c_0_50]) ).
cnf(c_0_59,plain,
number_number_of(nat,X1) = nat_1(number_number_of(int,X1)),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_60,plain,
nat_1(plus_plus(int,X1,pls)) = nat_1(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_39]),c_0_44]) ).
fof(c_0_61,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_62,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_55]) ).
cnf(c_0_63,plain,
minus_minus(int,X1,min) = plus_plus(int,X1,one_one(int)),
inference(rw,[status(thm)],[c_0_56,c_0_30]) ).
cnf(c_0_64,plain,
one_one(int) = minus_minus(int,pls,min),
inference(rw,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,plain,
nat_1(X1) = number_number_of(nat,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_39]),c_0_44]),c_0_60]) ).
fof(c_0_66,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_67,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_61])])])]) ).
cnf(c_0_68,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_62,c_0_28]),c_0_29]),c_0_29]),c_0_30]),c_0_30]) ).
cnf(c_0_69,plain,
plus_plus(int,X1,minus_minus(int,pls,min)) = minus_minus(int,X1,min),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,plain,
pls = zero_zero(int),
inference(split_conjunct,[status(thm)],[fact_73_Pls__def]) ).
cnf(c_0_71,plain,
number_number_of(nat,plus_plus(int,X1,pls)) = number_number_of(nat,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_65]),c_0_65]) ).
cnf(c_0_72,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_73,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_67]) ).
cnf(c_0_74,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_68,c_0_64]),c_0_36]),c_0_36]),c_0_69]),c_0_70]) ).
cnf(c_0_75,plain,
ring_11004092258visors(int),
inference(split_conjunct,[status(thm)],[arity_Int_Oint___Rings_Oring__1__no__zero__divisors]) ).
fof(c_0_76,plain,
! [X15] : ~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X15),X15)),
inference(fof_simplification,[status(thm)],[fact_117_less__not__refl]) ).
fof(c_0_77,plain,
! [X556] :
( ( hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),number_number_of(nat,X556)))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),X556)) )
& ( hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),X556))
| ~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),number_number_of(nat,X556))) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_161_less__0__number__of])])]) ).
cnf(c_0_78,plain,
number_number_of(nat,plus_plus(int,pls,X1)) = number_number_of(nat,X1),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_79,negated_conjecture,
plus_plus(int,pls,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))) = pls,
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(spm,[status(thm)],[c_0_73,c_0_74]),c_0_52]),c_0_70]),c_0_70]),c_0_75])]),c_0_72]) ).
cnf(c_0_80,plain,
zero_zero(nat) = number_number_of(nat,pls),
inference(split_conjunct,[status(thm)],[fact_26_semiring__norm_I113_J]) ).
cnf(c_0_81,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]) ).
fof(c_0_82,plain,
! [X459] : ~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X459),X459)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_76])]) ).
cnf(c_0_83,plain,
( ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),X1))
| hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),zero_zero(nat)),number_number_of(nat,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_77]) ).
cnf(c_0_84,negated_conjecture,
number_number_of(nat,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))) = zero_zero(nat),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_80]) ).
cnf(c_0_85,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_81,c_0_70]),c_0_64]) ).
cnf(c_0_86,plain,
~ hBOOL(hAPP(nat,bool,hAPP(nat,fun(nat,bool),ord_less(nat),X1),X1)),
inference(split_conjunct,[status(thm)],[c_0_82]) ).
cnf(c_0_87,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]),c_0_86]),
[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/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n004.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:18:05 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
% 6.87/1.59 % Version: 3.5.1
% 6.87/1.59 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.87/1.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.87/1.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.87/1.59 % Starting new_bool_3 with 300s (1) cores
% 6.87/1.59 % Starting new_bool_1 with 300s (1) cores
% 6.87/1.59 % Starting sh5l with 300s (1) cores
% 6.87/1.59 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2130837 completed with status 0
% 6.87/1.59 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.87/1.59 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.87/1.59 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.87/1.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.87/1.59 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.87/1.59 % No SInE strategy applied
% 6.87/1.59 % Search class: FGHSM-SSLM32-DFFFFFNN
% 6.87/1.59 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.87/1.59 % Starting SubtermCWHack with 136s (1) cores
% 6.87/1.59 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.87/1.59 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 6.87/1.60 % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 6.87/1.60 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 6.87/1.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2130845 completed with status 0
% 6.87/1.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 6.87/1.60 % Preprocessing class: FMLMSMSMSSSNFFN.
% 6.87/1.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.87/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 6.87/1.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.87/1.60 % No SInE strategy applied
% 6.87/1.60 % Search class: FGHSM-SSLM32-DFFFFFNN
% 6.87/1.60 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 6.87/1.60 % Starting SubtermCWHack with 136s (1) cores
% 6.87/1.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 6.87/1.60 % Preprocessing time : 0.034 s
% 6.87/1.60 % Presaturation interreduction done
% 6.87/1.60
% 6.87/1.60 % Proof found!
% 6.87/1.60 % SZS status Theorem
% 6.87/1.60 % SZS output start CNFRefutation
% See solution above
% 6.87/1.60 % Parsed axioms : 1251
% 6.87/1.60 % Removed by relevancy pruning/SinE : 0
% 6.87/1.60 % Initial clauses : 1729
% 6.87/1.60 % Removed in clause preprocessing : 83
% 6.87/1.60 % Initial clauses in saturation : 1646
% 6.87/1.60 % Processed clauses : 2795
% 6.87/1.60 % ...of these trivial : 60
% 6.87/1.60 % ...subsumed : 462
% 6.87/1.60 % ...remaining for further processing : 2273
% 6.87/1.60 % Other redundant clauses eliminated : 297
% 6.87/1.60 % Clauses deleted for lack of memory : 0
% 6.87/1.60 % Backward-subsumed : 16
% 6.87/1.60 % Backward-rewritten : 81
% 6.87/1.60 % Generated clauses : 10833
% 6.87/1.60 % ...of the previous two non-redundant : 8991
% 6.87/1.60 % ...aggressively subsumed : 0
% 6.87/1.60 % Contextual simplify-reflections : 1
% 6.87/1.60 % Paramodulations : 10533
% 6.87/1.60 % Factorizations : 2
% 6.87/1.60 % NegExts : 0
% 6.87/1.60 % Equation resolutions : 304
% 6.87/1.60 % Disequality decompositions : 0
% 6.87/1.60 % Total rewrite steps : 20279
% 6.87/1.60 % ...of those cached : 18295
% 6.87/1.60 % Propositional unsat checks : 0
% 6.87/1.60 % Propositional check models : 0
% 6.87/1.60 % Propositional check unsatisfiable : 0
% 6.87/1.60 % Propositional clauses : 0
% 6.87/1.60 % Propositional clauses after purity: 0
% 6.87/1.60 % Propositional unsat core size : 0
% 6.87/1.60 % Propositional preprocessing time : 0.000
% 6.87/1.60 % Propositional encoding time : 0.000
% 6.87/1.60 % Propositional solver time : 0.000
% 6.87/1.60 % Success case prop preproc time : 0.000
% 6.87/1.60 % Success case prop encoding time : 0.000
% 6.87/1.60 % Success case prop solver time : 0.000
% 6.87/1.60 % Current number of processed clauses : 753
% 6.87/1.60 % Positive orientable unit clauses : 354
% 6.87/1.60 % Positive unorientable unit clauses: 7
% 6.87/1.60 % Negative unit clauses : 52
% 6.87/1.60 % Non-unit-clauses : 340
% 6.87/1.60 % Current number of unprocessed clauses: 9165
% 6.87/1.60 % ...number of literals in the above : 19433
% 6.87/1.60 % Current number of archived formulas : 0
% 6.87/1.60 % Current number of archived clauses : 1453
% 6.87/1.60 % Clause-clause subsumption calls (NU) : 201277
% 6.87/1.60 % Rec. Clause-clause subsumption calls : 121925
% 6.87/1.60 % Non-unit clause-clause subsumptions : 240
% 6.87/1.60 % Unit Clause-clause subsumption calls : 1398
% 6.87/1.60 % Rewrite failures with RHS unbound : 0
% 6.87/1.60 % BW rewrite match attempts : 6526
% 6.87/1.60 % BW rewrite match successes : 261
% 6.87/1.60 % Condensation attempts : 0
% 6.87/1.60 % Condensation successes : 0
% 6.87/1.60 % Termbank termtop insertions : 505164
% 6.87/1.60 % Search garbage collected termcells : 20595
% 6.87/1.60
% 6.87/1.60 % -------------------------------------------------
% 6.87/1.60 % User time : 0.947 s
% 6.87/1.60 % System time : 0.044 s
% 6.87/1.60 % Total time : 0.991 s
% 6.87/1.60 % Maximum resident set size: 11012 pages
% 6.87/1.60
% 6.87/1.60 % -------------------------------------------------
% 6.87/1.60 % User time : 3.788 s
% 6.87/1.60 % System time : 0.187 s
% 6.87/1.60 % Total time : 3.974 s
% 6.87/1.60 % Maximum resident set size: 6400 pages
% 6.87/1.60 % E exiting
%------------------------------------------------------------------------------