%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : ITP012+2 : 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 : n007.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:47 PM UTC 2026
% Result : Theorem 1.87s 0.72s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 47 ( 18 unt; 0 def)
% Number of atoms : 164 ( 11 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 197 ( 80 ~; 79 |; 11 &)
% ( 6 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 61 ( 0 sgn 32 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(boolext,axiom,
! [X5] :
( mem(X5,bool)
=> ! [X6] :
( mem(X6,bool)
=> ( ( p(X5)
<=> p(X6) )
=> X5 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/ITP001/ITP001+2.ax',boolext) ).
fof(mem_c_2Einteger_2Eint__divides,axiom,
mem(c_2Einteger_2Eint__divides,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,bool))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Einteger_2Eint__divides) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__RADD,axiom,
! [X24] :
( mem(X24,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ! [X26] :
( mem(X26,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X24),X25))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X24),ap(ap(c_2Einteger_2Eint__add,X26),X25)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X24),X26)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__RADD) ).
fof(ax_thm_2Einteger_2Eint__sub,axiom,
! [X22] :
( mem(X22,ty_2Einteger_2Eint)
=> ! [X23] :
( mem(X23,ty_2Einteger_2Eint)
=> ap(ap(c_2Einteger_2Eint__sub,X22),X23) = ap(ap(c_2Einteger_2Eint__add,X22),ap(c_2Einteger_2Eint__neg,X23)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_thm_2Einteger_2Eint__sub) ).
fof(mem_c_2Einteger_2Eint__neg,axiom,
mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Einteger_2Eint__neg) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__RSUB,conjecture,
! [X24] :
( mem(X24,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ! [X26] :
( mem(X26,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X24),X25))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X24),ap(ap(c_2Einteger_2Eint__sub,X26),X25)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X24),X26)) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__RSUB) ).
fof(mem_c_2Ebool_2ET,axiom,
mem(c_2Ebool_2ET,bool),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mem_c_2Ebool_2ET) ).
fof(ax_true_p,axiom,
p(c_2Ebool_2ET),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_true_p) ).
fof(conj_thm_2Einteger_2EINT__DIVIDES__NEG,axiom,
! [X24] :
( mem(X24,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ( ( p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X24)),X25))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X24),X25)) )
& ( p(ap(ap(c_2Einteger_2Eint__divides,X24),ap(c_2Einteger_2Eint__neg,X25)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X24),X25)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Einteger_2EINT__DIVIDES__NEG) ).
fof(c_0_10,plain,
! [X29,X30,X31,X32] :
( mem(ap(X31,X32),X30)
| ~ mem(X32,X29)
| ~ mem(X31,arr(X29,X30)) ),
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_11,plain,
! [X33,X34] :
( ( ~ mem(X33,bool)
| ~ mem(X34,bool)
| X33 = X34
| p(X34)
| p(X33) )
& ( ~ mem(X33,bool)
| ~ mem(X34,bool)
| X33 = X34
| ~ p(X34)
| ~ p(X33) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[boolext])])])])]) ).
cnf(c_0_12,plain,
( ~ mem(X4,X2)
| ~ mem(X1,arr(X2,X3))
| mem(ap(X1,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
mem(c_2Einteger_2Eint__divides,arr(ty_2Einteger_2Eint,arr(ty_2Einteger_2Eint,bool))),
inference(split_conjunct,[status(thm)],[mem_c_2Einteger_2Eint__divides]) ).
fof(c_0_14,plain,
! [X93,X94,X95] :
( ( ~ mem(X93,ty_2Einteger_2Eint)
| ~ mem(X94,ty_2Einteger_2Eint)
| ~ mem(X95,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X93),X94))
| p(ap(ap(c_2Einteger_2Eint__divides,X93),ap(ap(c_2Einteger_2Eint__add,X95),X94)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X93),X95)) )
& ( ~ mem(X93,ty_2Einteger_2Eint)
| ~ mem(X94,ty_2Einteger_2Eint)
| ~ mem(X95,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X93),X94))
| p(ap(ap(c_2Einteger_2Eint__divides,X93),X95))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X93),ap(ap(c_2Einteger_2Eint__add,X95),X94))) ) ),
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__RADD])])])])]) ).
fof(c_0_15,plain,
! [X91,X92] :
( ap(ap(c_2Einteger_2Eint__sub,X91),X92) = ap(ap(c_2Einteger_2Eint__add,X91),ap(c_2Einteger_2Eint__neg,X92))
| ~ mem(X92,ty_2Einteger_2Eint)
| ~ mem(X91,ty_2Einteger_2Eint) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax_thm_2Einteger_2Eint__sub])])])]) ).
cnf(c_0_16,plain,
mem(c_2Einteger_2Eint__neg,arr(ty_2Einteger_2Eint,ty_2Einteger_2Eint)),
inference(split_conjunct,[status(thm)],[mem_c_2Einteger_2Eint__neg]) ).
fof(c_0_17,negated_conjecture,
~ ! [X24] :
( mem(X24,ty_2Einteger_2Eint)
=> ! [X25] :
( mem(X25,ty_2Einteger_2Eint)
=> ! [X26] :
( mem(X26,ty_2Einteger_2Eint)
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X24),X25))
=> ( p(ap(ap(c_2Einteger_2Eint__divides,X24),ap(ap(c_2Einteger_2Eint__sub,X26),X25)))
<=> p(ap(ap(c_2Einteger_2Eint__divides,X24),X26)) ) ) ) ) ),
inference(assume_negation,[status(cth)],[conj_thm_2Einteger_2EINT__DIVIDES__RSUB]) ).
cnf(c_0_18,plain,
( ~ mem(X1,bool)
| ~ mem(X2,bool)
| ~ p(X2)
| ~ p(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
mem(c_2Ebool_2ET,bool),
inference(split_conjunct,[status(thm)],[mem_c_2Ebool_2ET]) ).
cnf(c_0_20,plain,
p(c_2Ebool_2ET),
inference(split_conjunct,[status(thm)],[ax_true_p]) ).
cnf(c_0_21,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| mem(ap(c_2Einteger_2Eint__divides,X1),arr(ty_2Einteger_2Eint,bool)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_22,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3)))
| p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( ~ mem(X2,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ap(ap(c_2Einteger_2Eint__sub,X1),X2) = ap(ap(c_2Einteger_2Eint__add,X1),ap(c_2Einteger_2Eint__neg,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| mem(ap(c_2Einteger_2Eint__neg,X1),ty_2Einteger_2Eint) ),
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
fof(c_0_25,negated_conjecture,
( ( p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(ap(c_2Einteger_2Eint__sub,esk11_0),esk10_0))) )
& ( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(ap(c_2Einteger_2Eint__sub,esk11_0),esk10_0))) )
& p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk10_0))
& mem(esk11_0,ty_2Einteger_2Eint)
& mem(esk10_0,ty_2Einteger_2Eint)
& mem(esk9_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_17])])])]) ).
cnf(c_0_26,plain,
( ~ mem(X1,bool)
| ~ p(X1)
| X1 = c_2Ebool_2ET ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_27,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| mem(ap(ap(c_2Einteger_2Eint__divides,X1),X2),bool) ),
inference(spm,[status(thm)],[c_0_12,c_0_21]) ).
cnf(c_0_28,plain,
( ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(c_2Einteger_2Eint__neg,X3)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3)))
| p(ap(ap(c_2Einteger_2Eint__divides,X1),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
( p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0))
| p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(ap(c_2Einteger_2Eint__sub,esk11_0),esk10_0))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,negated_conjecture,
mem(esk11_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,negated_conjecture,
mem(esk9_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,negated_conjecture,
mem(esk10_0,ty_2Einteger_2Eint),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
fof(c_0_33,plain,
! [X96,X97] :
( ( ~ mem(X96,ty_2Einteger_2Eint)
| ~ mem(X97,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X96)),X97))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X96),X97)) )
& ( ~ mem(X96,ty_2Einteger_2Eint)
| ~ mem(X97,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,X96),X97))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,ap(c_2Einteger_2Eint__neg,X96)),X97)) )
& ( ~ mem(X96,ty_2Einteger_2Eint)
| ~ mem(X97,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,X96),ap(c_2Einteger_2Eint__neg,X97)))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X96),X97)) )
& ( ~ mem(X96,ty_2Einteger_2Eint)
| ~ mem(X97,ty_2Einteger_2Eint)
| p(ap(ap(c_2Einteger_2Eint__divides,X96),X97))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X96),ap(c_2Einteger_2Eint__neg,X97))) ) ),
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_34,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| ap(ap(c_2Einteger_2Eint__divides,X1),X2) = c_2Ebool_2ET ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk10_0)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,negated_conjecture,
( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(c_2Einteger_2Eint__neg,esk10_0)))
| p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_37,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_33]) ).
cnf(c_0_38,negated_conjecture,
ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk10_0) = c_2Ebool_2ET,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32]),c_0_31])]) ).
cnf(c_0_39,negated_conjecture,
( ~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(ap(c_2Einteger_2Eint__sub,esk11_0),esk10_0))) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_40,negated_conjecture,
p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0)),
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_36,c_0_37]),c_0_38]),c_0_20]),c_0_32]),c_0_31])]) ).
cnf(c_0_41,plain,
( ~ mem(X1,ty_2Einteger_2Eint)
| ~ mem(X3,ty_2Einteger_2Eint)
| ~ mem(X2,ty_2Einteger_2Eint)
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X3))
| ~ p(ap(ap(c_2Einteger_2Eint__divides,X1),X2))
| p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__add,X2),X3))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(ap(c_2Einteger_2Eint__sub,esk11_0),esk10_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_43,plain,
( ~ mem(X3,ty_2Einteger_2Eint)
| ~ 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,X3)))
| p(ap(ap(c_2Einteger_2Eint__divides,X1),ap(ap(c_2Einteger_2Eint__sub,X2),X3))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_23]),c_0_24]) ).
cnf(c_0_44,negated_conjecture,
ap(ap(c_2Einteger_2Eint__divides,esk9_0),esk11_0) = c_2Ebool_2ET,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_40]),c_0_30]),c_0_31])]) ).
cnf(c_0_45,negated_conjecture,
~ p(ap(ap(c_2Einteger_2Eint__divides,esk9_0),ap(c_2Einteger_2Eint__neg,esk10_0))),
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_42,c_0_43]),c_0_44]),c_0_20]),c_0_30]),c_0_31]),c_0_32])]) ).
cnf(c_0_46,negated_conjecture,
$false,
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_45,c_0_37]),c_0_38]),c_0_20]),c_0_32]),c_0_31])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ITP012+2 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.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 : Sun Sep 20 21:43:50 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 1.87/0.72 % Version: 3.5.1
% 1.87/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.87/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.87/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.87/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.87/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.87/0.72 % Starting sh5l with 300s (1) cores
% 1.87/0.72 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3617559 completed with status 0
% 1.87/0.72 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.87/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.87/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.87/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.87/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.87/0.72 % No SInE strategy applied
% 1.87/0.72 % Search class: FGHSF-FSLM32-MFFFFFNN
% 1.87/0.72 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.87/0.72 % Starting SubtermCWHack with 151s (1) cores
% 1.87/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 1.87/0.72 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 1.87/0.72 % Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 1.87/0.72 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 146s (1) cores
% 1.87/0.72 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3617575 completed with status 0
% 1.87/0.72 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.87/0.72 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.87/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.87/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.87/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.87/0.72 % No SInE strategy applied
% 1.87/0.72 % Search class: FGHSF-FSLM32-MFFFFFNN
% 1.87/0.72 % Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 1.87/0.72 % Starting SubtermCWHack with 151s (1) cores
% 1.87/0.72 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 1.87/0.72 % Preprocessing time : 0.003 s
% 1.87/0.72 % Presaturation interreduction done
% 1.87/0.72
% 1.87/0.72 % Proof found!
% 1.87/0.72 % SZS status Theorem
% 1.87/0.72 % SZS output start CNFRefutation
% See solution above
% 1.87/0.72 % Parsed axioms : 57
% 1.87/0.72 % Removed by relevancy pruning/SinE : 0
% 1.87/0.72 % Initial clauses : 352
% 1.87/0.72 % Removed in clause preprocessing : 249
% 1.87/0.72 % Initial clauses in saturation : 103
% 1.87/0.72 % Processed clauses : 1207
% 1.87/0.72 % ...of these trivial : 4
% 1.87/0.72 % ...subsumed : 522
% 1.87/0.72 % ...remaining for further processing : 681
% 1.87/0.72 % Other redundant clauses eliminated : 1
% 1.87/0.72 % Clauses deleted for lack of memory : 0
% 1.87/0.72 % Backward-subsumed : 22
% 1.87/0.72 % Backward-rewritten : 48
% 1.87/0.72 % Generated clauses : 6797
% 1.87/0.72 % ...of the previous two non-redundant : 6114
% 1.87/0.72 % ...aggressively subsumed : 0
% 1.87/0.72 % Contextual simplify-reflections : 13
% 1.87/0.72 % Paramodulations : 6781
% 1.87/0.72 % Factorizations : 12
% 1.87/0.72 % NegExts : 0
% 1.87/0.72 % Equation resolutions : 2
% 1.87/0.72 % Disequality decompositions : 0
% 1.87/0.72 % Total rewrite steps : 4164
% 1.87/0.72 % ...of those cached : 4140
% 1.87/0.72 % Propositional unsat checks : 0
% 1.87/0.72 % Propositional check models : 0
% 1.87/0.72 % Propositional check unsatisfiable : 0
% 1.87/0.72 % Propositional clauses : 0
% 1.87/0.72 % Propositional clauses after purity: 0
% 1.87/0.72 % Propositional unsat core size : 0
% 1.87/0.72 % Propositional preprocessing time : 0.000
% 1.87/0.72 % Propositional encoding time : 0.000
% 1.87/0.72 % Propositional solver time : 0.000
% 1.87/0.72 % Success case prop preproc time : 0.000
% 1.87/0.72 % Success case prop encoding time : 0.000
% 1.87/0.72 % Success case prop solver time : 0.000
% 1.87/0.72 % Current number of processed clauses : 523
% 1.87/0.72 % Positive orientable unit clauses : 28
% 1.87/0.72 % Positive unorientable unit clauses: 0
% 1.87/0.72 % Negative unit clauses : 4
% 1.87/0.72 % Non-unit-clauses : 491
% 1.87/0.72 % Current number of unprocessed clauses: 4945
% 1.87/0.72 % ...number of literals in the above : 32739
% 1.87/0.72 % Current number of archived formulas : 0
% 1.87/0.72 % Current number of archived clauses : 157
% 1.87/0.72 % Clause-clause subsumption calls (NU) : 28426
% 1.87/0.72 % Rec. Clause-clause subsumption calls : 5121
% 1.87/0.72 % Non-unit clause-clause subsumptions : 346
% 1.87/0.72 % Unit Clause-clause subsumption calls : 421
% 1.87/0.72 % Rewrite failures with RHS unbound : 0
% 1.87/0.72 % BW rewrite match attempts : 19
% 1.87/0.72 % BW rewrite match successes : 14
% 1.87/0.72 % Condensation attempts : 0
% 1.87/0.72 % Condensation successes : 0
% 1.87/0.72 % Termbank termtop insertions : 214111
% 1.87/0.72 % Search garbage collected termcells : 4095
% 1.87/0.72
% 1.87/0.72 % -------------------------------------------------
% 1.87/0.72 % User time : 0.245 s
% 1.87/0.72 % System time : 0.022 s
% 1.87/0.72 % Total time : 0.267 s
% 1.87/0.72 % Maximum resident set size: 4492 pages
% 1.87/0.72
% 1.87/0.72 % -------------------------------------------------
% 1.87/0.72 % User time : 1.089 s
% 1.87/0.72 % System time : 0.081 s
% 1.87/0.72 % Total time : 1.170 s
% 1.87/0.72 % Maximum resident set size: 4608 pages
% 1.87/0.72 % E exiting
%------------------------------------------------------------------------------