%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP012+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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 12:55:48 PM UTC 2026
% Result : Theorem 73.36s 12.78s
% Output : CNFRefutation 73.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 45 ( 17 unt; 0 def)
% Number of atoms : 136 ( 12 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 147 ( 56 ~; 56 |; 10 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 53 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_thm_2Einteger_2EINT__DIVIDES__RSUB,conjecture,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__sub,X107),X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__RSUB) ).
fof(ap_tp,axiom,
! [X1,X2,X3] :
( mem(X3,arr(X1,X2))
=> ! [X4] :
( mem(X4,X1)
=> mem(ap(X3,X4),X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',ap_tp) ).
fof(conj_thm_2Einteger_2EINT__NEG__SUB,axiom,
! [X32] :
( mem(X32,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,X32),X25)) = ap(ap(c_2Einteger_2Eint__sub,X25),X32) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__NEG__SUB) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__NEG,axiom,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ( ( p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X34)),X106))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X106)) )
& ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(c_2Einteger_2Eint__neg,X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X106)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__NEG) ).
fof(mem_c_2Einteger_2Eint__sub,axiom,
mem(c_2Einteger_2Eint__sub,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Einteger_2Eint__sub) ).
fof(conj_thm_2Einteger_2EINT__SUB__SUB2,axiom,
! [X32] :
( mem(X32,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ap(ap(c_2Einteger_2Eint__sub,X32),ap(ap(c_2Einteger_2Eint__sub,X32),X25)) = X25 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__SUB__SUB2) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__LSUB,axiom,
! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__sub,X106),X107)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__LSUB) ).
fof(c_0_7,negated_conjecture,
~ ! [X34] :
( mem(X34,ty_2Einteger_2Eint)
=> ! [X106] :
( mem(X106,ty_2Einteger_2Eint)
=> ! [X107] :
( mem(X107,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),X106))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X34),ap(ap(c_2Einteger_2Eint__sub,X107),X106)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X34),X107)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Einteger_2EINT__DIVIDES__RSUB]) ).
fof(c_0_8,plain,
! [X13590,X13591,X13592,X13593] :
( mem(ap(X13592,X13593),X13591)
| ~ mem(X13593,X13590)
| ~ mem(X13592,arr(X13590,X13591)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ap_tp])])])]) ).
fof(c_0_9,negated_conjecture,
( ( p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))) )
& p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk2_0))
& mem(esk3_0,ty_2Einteger_2Eint)
& mem(esk2_0,ty_2Einteger_2Eint)
& mem(esk1_0,ty_2Einteger_2Eint) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
fof(c_0_10,plain,
! [X13643,X13644] :
( ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,X13643),X13644)) = ap(ap(c_2Einteger_2Eint__sub,X13644),X13643)
| ~ mem(X13644,ty_2Einteger_2Eint)
| ~ mem(X13643,ty_2Einteger_2Eint) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Einteger_2EINT__NEG__SUB])])])]) ).
cnf(c_0_11,plain,
( ~ mem(X4,X2)
| ~ mem(X1,arr(X2,X3))
| mem(ap(X1,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
mem(esk3_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X13629,X13630] :
( ( ~ mem(X13629,ty_2Einteger_2Eint)
| ~ mem(X13630,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X13629)),X13630))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13629),X13630)) )
& ( ~ mem(X13629,ty_2Einteger_2Eint)
| ~ mem(X13630,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,X13629),X13630))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X13629)),X13630)) )
& ( ~ mem(X13629,ty_2Einteger_2Eint)
| ~ mem(X13630,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,X13629),ap(c_2Einteger_2Eint__neg,X13630)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13629),X13630)) )
& ( ~ mem(X13629,ty_2Einteger_2Eint)
| ~ mem(X13630,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,X13629),X13630))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13629),ap(c_2Einteger_2Eint__neg,X13630))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Einteger_2EINT__DIVIDES__NEG])])])])]) ).
cnf(c_0_14,plain,
( ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,X1),X2)) = ap(ap(c_2Einteger_2Eint__sub,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
mem(esk2_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,negated_conjecture,
( ~ mem(X1,arr(ty_2Einteger_2Eint,X2))
| mem(ap(X1,esk3_0),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
mem(c_2Einteger_2Eint__sub,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint))),
inference(split_conjunct,[status(thm)],[mem_c_2Einteger_2Eint__sub]) ).
fof(c_0_18,plain,
! [X13697,X13698] :
( ap(ap(c_2Einteger_2Eint__sub,X13697),ap(ap(c_2Einteger_2Eint__sub,X13697),X13698)) = X13698
| ~ mem(X13698,ty_2Einteger_2Eint)
| ~ mem(X13697,ty_2Einteger_2Eint) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Einteger_2EINT__SUB__SUB2])])])]) ).
fof(c_0_19,plain,
! [X13631,X13632,X13633] :
( ( ~ mem(X13631,ty_2Einteger_2Eint)
| ~ mem(X13632,ty_2Einteger_2Eint)
| ~ mem(X13633,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13631),X13632))
| p(ap(ap(c_2Einteger_2Eint__divides,X13631),ap(ap(c_2Einteger_2Eint__sub,X13632),X13633)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13631),X13633)) )
& ( ~ mem(X13631,ty_2Einteger_2Eint)
| ~ mem(X13632,ty_2Einteger_2Eint)
| ~ mem(X13633,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13631),X13632))
| p(ap(ap(c_2Einteger_2Eint__divides,X13631),X13633))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X13631),ap(ap(c_2Einteger_2Eint__sub,X13632),X13633))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Einteger_2EINT__DIVIDES__LSUB])])])])]) ).
cnf(c_0_20,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X2))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_22,negated_conjecture,
mem(esk1_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_23,negated_conjecture,
( ~ mem(X1,ty_2Einteger_2Eint)
| ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,X1),esk2_0)) = ap(ap(c_2Einteger_2Eint__sub,esk2_0),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_24,negated_conjecture,
( ~ mem(X1,arr(ty_2Einteger_2Eint,X2))
| mem(ap(X1,esk2_0),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
mem(ap(c_2Einteger_2Eint__sub,esk3_0),arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
( ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ap(ap(c_2Einteger_2Eint__sub,X1),ap(ap(c_2Einteger_2Eint__sub,X1),X2)) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3)))
| p(ap(ap(c_2Einteger_2Eint__divides,X1),X3)) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( ~ mem(ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0),ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]) ).
cnf(c_0_30,negated_conjecture,
ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0)) = ap(ap(c_2Einteger_2Eint__sub,esk2_0),esk3_0),
inference(spm,[status(thm)],[c_0_23,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
mem(ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0),ty_2Einteger_2Eint),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_32,negated_conjecture,
( ~ mem(X1,ty_2Einteger_2Eint)
| ap(ap(c_2Einteger_2Eint__sub,X1),ap(ap(c_2Einteger_2Eint__sub,X1),esk3_0)) = esk3_0 ),
inference(spm,[status(thm)],[c_0_26,c_0_12]) ).
cnf(c_0_33,negated_conjecture,
mem(ap(c_2Einteger_2Eint__sub,esk2_0),arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
inference(spm,[status(thm)],[c_0_24,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk2_0),X1)))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_15]),c_0_22])]) ).
cnf(c_0_35,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk2_0),esk3_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
ap(ap(c_2Einteger_2Eint__sub,esk2_0),ap(ap(c_2Einteger_2Eint__sub,esk2_0),esk3_0)) = esk3_0,
inference(spm,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_37,negated_conjecture,
mem(ap(ap(c_2Einteger_2Eint__sub,esk2_0),esk3_0),ty_2Einteger_2Eint),
inference(spm,[status(thm)],[c_0_16,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_12])]) ).
cnf(c_0_39,negated_conjecture,
( ~ mem(X1,ty_2Einteger_2Eint)
| ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,X1),esk3_0)) = ap(ap(c_2Einteger_2Eint__sub,esk3_0),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_40,negated_conjecture,
( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),esk3_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_41,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk2_0),esk3_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_36]),c_0_37])]),c_0_38])]) ).
cnf(c_0_42,negated_conjecture,
ap(c_2Einteger_2Eint__neg,ap(ap(c_2Einteger_2Eint__sub,esk2_0),esk3_0)) = ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0),
inference(spm,[status(thm)],[c_0_39,c_0_15]) ).
cnf(c_0_43,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk1_0),ap(ap(c_2Einteger_2Eint__sub,esk3_0),esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_41]),c_0_42]),c_0_37]),c_0_22])]),c_0_43]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP012+5 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.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 : Sun Sep 20 21:46:29 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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
% 73.36/12.78 % Version: 3.5.1
% 73.36/12.78 % Preprocessing class: FMLLSMLLSSSNFFN.
% 73.36/12.78 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 73.36/12.78 % Starting new_bool_3 with 897s (3) cores
% 73.36/12.78 % Starting new_bool_1 with 897s (3) cores
% 73.36/12.78 % Starting sh5l with 299s (1) cores
% 73.36/12.78 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 73.36/12.78 % new_bool_3 with pid 95648 completed with status 0
% 73.36/12.78 % Result found by new_bool_3
% 73.36/12.78 % Preprocessing class: FMLLSMLLSSSNFFN.
% 73.36/12.78 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 73.36/12.78 % Starting new_bool_3 with 897s (3) cores
% 73.36/12.78 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 73.36/12.78 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 73.36/12.78 % Search class: FGHSF-SMLM33-DFFFFFNN
% 73.36/12.78 % partial match(1): FGHSM-SMLM33-DFFFFFNN
% 73.36/12.78 % Scheduled 7 strats onto 3 cores with 897 seconds (897 total)
% 73.36/12.78 % Starting SubtermCWHack with 81s (1) cores
% 73.36/12.78 % Starting new_bool_3 with 90s (1) cores
% 73.36/12.78 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 81s (1) cores
% 73.36/12.78 % new_bool_3 with pid 95653 completed with status 0
% 73.36/12.78 % Result found by new_bool_3
% 73.36/12.78 % Preprocessing class: FMLLSMLLSSSNFFN.
% 73.36/12.78 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 73.36/12.78 % Starting new_bool_3 with 897s (3) cores
% 73.36/12.78 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 73.36/12.78 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 73.36/12.78 % Search class: FGHSF-SMLM33-DFFFFFNN
% 73.36/12.78 % partial match(1): FGHSM-SMLM33-DFFFFFNN
% 73.36/12.78 % Scheduled 7 strats onto 3 cores with 897 seconds (897 total)
% 73.36/12.78 % Starting SubtermCWHack with 81s (1) cores
% 73.36/12.78 % Starting new_bool_3 with 90s (1) cores
% 73.36/12.78 % Preprocessing time : 0.205 s
% 73.36/12.78 % Presaturation interreduction done
% 73.36/12.78
% 73.36/12.78 % Proof found!
% 73.36/12.78 % SZS status Theorem
% 73.36/12.78 % SZS output start CNFRefutation
% See solution above
% 73.36/12.79 % Parsed axioms : 10257
% 73.36/12.79 % Removed by relevancy pruning/SinE : 9415
% 73.36/12.79 % Initial clauses : 5322
% 73.36/12.79 % Removed in clause preprocessing : 1213
% 73.36/12.79 % Initial clauses in saturation : 4109
% 73.36/12.79 % Processed clauses : 6657
% 73.36/12.79 % ...of these trivial : 19
% 73.36/12.79 % ...subsumed : 502
% 73.36/12.79 % ...remaining for further processing : 6136
% 73.36/12.79 % Other redundant clauses eliminated : 193
% 73.36/12.79 % Clauses deleted for lack of memory : 0
% 73.36/12.79 % Backward-subsumed : 12
% 73.36/12.79 % Backward-rewritten : 92
% 73.36/12.79 % Generated clauses : 14567
% 73.36/12.79 % ...of the previous two non-redundant : 14359
% 73.36/12.79 % ...aggressively subsumed : 0
% 73.36/12.79 % Contextual simplify-reflections : 13
% 73.36/12.79 % Paramodulations : 14409
% 73.36/12.79 % Factorizations : 2
% 73.36/12.79 % NegExts : 0
% 73.36/12.79 % Equation resolutions : 193
% 73.36/12.79 % Disequality decompositions : 0
% 73.36/12.79 % Total rewrite steps : 4415
% 73.36/12.79 % ...of those cached : 4222
% 73.36/12.79 % Propositional unsat checks : 1
% 73.36/12.79 % Propositional check models : 1
% 73.36/12.79 % Propositional check unsatisfiable : 0
% 73.36/12.79 % Propositional clauses : 0
% 73.36/12.79 % Propositional clauses after purity: 0
% 73.36/12.79 % Propositional unsat core size : 0
% 73.36/12.79 % Propositional preprocessing time : 0.000
% 73.36/12.79 % Propositional encoding time : 0.050
% 73.36/12.79 % Propositional solver time : 0.004
% 73.36/12.79 % Success case prop preproc time : 0.000
% 73.36/12.79 % Success case prop encoding time : 0.000
% 73.36/12.79 % Success case prop solver time : 0.000
% 73.36/12.79 % Current number of processed clauses : 2090
% 73.36/12.79 % Positive orientable unit clauses : 560
% 73.36/12.79 % Positive unorientable unit clauses: 0
% 73.36/12.79 % Negative unit clauses : 700
% 73.36/12.79 % Non-unit-clauses : 830
% 73.36/12.79 % Current number of unprocessed clauses: 15538
% 73.36/12.79 % ...number of literals in the above : 52353
% 73.36/12.79 % Current number of archived formulas : 0
% 73.36/12.79 % Current number of archived clauses : 3890
% 73.36/12.79 % Clause-clause subsumption calls (NU) : 8932826
% 73.36/12.79 % Rec. Clause-clause subsumption calls : 63609
% 73.36/12.79 % Non-unit clause-clause subsumptions : 446
% 73.36/12.79 % Unit Clause-clause subsumption calls : 43071
% 73.36/12.79 % Rewrite failures with RHS unbound : 0
% 73.36/12.79 % BW rewrite match attempts : 7043
% 73.36/12.79 % BW rewrite match successes : 42
% 73.36/12.79 % Condensation attempts : 0
% 73.36/12.79 % Condensation successes : 0
% 73.36/12.79 % Termbank termtop insertions : 1694656
% 73.36/12.79 % Search garbage collected termcells : 322798
% 73.36/12.79
% 73.36/12.79 % -------------------------------------------------
% 73.36/12.79 % User time : 10.200 s
% 73.36/12.79 % System time : 0.166 s
% 73.36/12.79 % Total time : 10.366 s
% 73.36/12.79 % Maximum resident set size: 55688 pages
% 73.36/12.79
% 73.36/12.79 % -------------------------------------------------
% 73.36/12.79 % User time : 31.514 s
% 73.36/12.79 % System time : 0.681 s
% 73.36/12.79 % Total time : 32.195 s
% 73.36/12.79 % Maximum resident set size: 43008 pages
% 73.36/12.79 % E exiting
%------------------------------------------------------------------------------