%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO462+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:30:14 PM UTC 2026
% Result : Theorem 0.18s 11.14s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 15 unt; 0 def)
% Number of atoms : 67 ( 11 equ)
% Maximal formula atoms : 33 ( 2 avg)
% Number of connectives : 73 ( 29 ~; 26 |; 12 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 13 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 13 con; 0-2 aty)
% Number of variables : 46 ( 2 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSUBSPACEu_IMPu_NONEMPTY,conjecture,
! [X1365,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),subspace),s(fun(cart(real,X1365),bool),X97))))
=> s(fun(cart(real,X1365),bool),X97) != s(fun(cart(real,X1365),bool),empty) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSUBSPACEu_IMPu_NONEMPTY) ).
fof(aNOTu_INu_EMPTY,axiom,
! [X4,X1] : ~ p(s(bool,i(s(fun(fun(X4,bool),bool),i(s(fun(X4,fun(fun(X4,bool),bool)),in),s(X4,X1))),s(fun(X4,bool),empty)))),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO010+0.ax',aNOTu_INu_EMPTY) ).
fof(asubspace,axiom,
! [X1361,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),subspace),s(fun(cart(real,X1361),bool),X97))))
<=> ( ! [X95,X1] :
( p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),i(s(fun(cart(real,X1361),fun(fun(cart(real,X1361),bool),bool)),in),s(cart(real,X1361),X1))),s(fun(cart(real,X1361),bool),X97))))
=> p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),i(s(fun(cart(real,X1361),fun(fun(cart(real,X1361),bool),bool)),in),s(cart(real,X1361),i(s(fun(cart(real,X1361),cart(real,X1361)),i(s(fun(real,fun(cart(real,X1361),cart(real,X1361))),r_),s(real,X95))),s(cart(real,X1361),X1))))),s(fun(cart(real,X1361),bool),X97)))) )
& ! [X1,X8] :
( ( p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),i(s(fun(cart(real,X1361),fun(fun(cart(real,X1361),bool),bool)),in),s(cart(real,X1361),X8))),s(fun(cart(real,X1361),bool),X97))))
& p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),i(s(fun(cart(real,X1361),fun(fun(cart(real,X1361),bool),bool)),in),s(cart(real,X1361),X1))),s(fun(cart(real,X1361),bool),X97)))) )
=> p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),i(s(fun(cart(real,X1361),fun(fun(cart(real,X1361),bool),bool)),in),s(cart(real,X1361),i(s(fun(cart(real,X1361),cart(real,X1361)),i(s(fun(cart(real,X1361),fun(cart(real,X1361),cart(real,X1361))),vectoru_add),s(cart(real,X1361),X1))),s(cart(real,X1361),X8))))),s(fun(cart(real,X1361),bool),X97)))) )
& p(s(bool,i(s(fun(fun(cart(real,X1361),bool),bool),i(s(fun(cart(real,X1361),fun(fun(cart(real,X1361),bool),bool)),in),s(cart(real,X1361),i(s(fun(num,cart(real,X1361)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1361),bool),X97)))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',asubspace) ).
fof(aNUMERAL,axiom,
! [X84] : s(num,i(s(fun(num,num),numeral),s(num,X84))) = s(num,X84),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO010+0.ax',aNUMERAL) ).
fof(aIN,axiom,
! [X4,X7,X1] : s(bool,i(s(fun(fun(X4,bool),bool),i(s(fun(X4,fun(fun(X4,bool),bool)),in),s(X4,X1))),s(fun(X4,bool),X7))) = s(bool,i(s(fun(X4,bool),X7),s(X4,X1))),
file('/export/starexec/sandbox2/benchmark/Axioms/GEO010+0.ax',aIN) ).
fof(c_0_5,negated_conjecture,
~ ! [X1365,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),subspace),s(fun(cart(real,X1365),bool),X97))))
=> s(fun(cart(real,X1365),bool),X97) != s(fun(cart(real,X1365),bool),empty) ),
inference(assume_negation,[status(cth)],[aSUBSPACEu_IMPu_NONEMPTY]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1365,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1365),bool),bool),subspace),s(fun(cart(real,X1365),bool),X97))))
=> s(fun(cart(real,X1365),bool),X97) != s(fun(cart(real,X1365),bool),empty) ),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
fof(c_0_7,plain,
! [X4,X1] : ~ p(s(bool,i(s(fun(fun(X4,bool),bool),i(s(fun(X4,fun(fun(X4,bool),bool)),in),s(X4,X1))),s(fun(X4,bool),empty)))),
inference(fof_simplification,[status(thm)],[aNOTu_INu_EMPTY]) ).
fof(c_0_8,plain,
! [X2086,X2087,X2088,X2089,X2090,X2091,X2092,X2093] :
( ( p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),subspace),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(num,cart(real,X2092)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(cart(real,X2092),cart(real,X2092)),i(s(fun(cart(real,X2092),fun(cart(real,X2092),cart(real,X2092))),vectoru_add),s(cart(real,X2092),esk173_2(X2092,X2093)))),s(cart(real,X2092),esk174_2(X2092,X2093)))))),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(cart(real,X2092),cart(real,X2092)),i(s(fun(real,fun(cart(real,X2092),cart(real,X2092))),r_),s(real,esk175_2(X2092,X2093)))),s(cart(real,X2092),esk176_2(X2092,X2093)))))),s(fun(cart(real,X2092),bool),X2093)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),subspace),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(num,cart(real,X2092)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(cart(real,X2092),cart(real,X2092)),i(s(fun(cart(real,X2092),fun(cart(real,X2092),cart(real,X2092))),vectoru_add),s(cart(real,X2092),esk173_2(X2092,X2093)))),s(cart(real,X2092),esk174_2(X2092,X2093)))))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk176_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),subspace),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(num,cart(real,X2092)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk174_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(cart(real,X2092),cart(real,X2092)),i(s(fun(real,fun(cart(real,X2092),cart(real,X2092))),r_),s(real,esk175_2(X2092,X2093)))),s(cart(real,X2092),esk176_2(X2092,X2093)))))),s(fun(cart(real,X2092),bool),X2093)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),subspace),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(num,cart(real,X2092)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk174_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk176_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),subspace),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(num,cart(real,X2092)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk173_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(cart(real,X2092),cart(real,X2092)),i(s(fun(real,fun(cart(real,X2092),cart(real,X2092))),r_),s(real,esk175_2(X2092,X2093)))),s(cart(real,X2092),esk176_2(X2092,X2093)))))),s(fun(cart(real,X2092),bool),X2093)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),subspace),s(fun(cart(real,X2092),bool),X2093))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),i(s(fun(num,cart(real,X2092)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk173_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093))))
| p(s(bool,i(s(fun(fun(cart(real,X2092),bool),bool),i(s(fun(cart(real,X2092),fun(fun(cart(real,X2092),bool),bool)),in),s(cart(real,X2092),esk176_2(X2092,X2093)))),s(fun(cart(real,X2092),bool),X2093)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),subspace),s(fun(cart(real,X2086),bool),X2087))))
| p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),i(s(fun(cart(real,X2086),fun(fun(cart(real,X2086),bool),bool)),in),s(cart(real,X2086),i(s(fun(cart(real,X2086),cart(real,X2086)),i(s(fun(real,fun(cart(real,X2086),cart(real,X2086))),r_),s(real,X2090))),s(cart(real,X2086),X2091))))),s(fun(cart(real,X2086),bool),X2087))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),i(s(fun(cart(real,X2086),fun(fun(cart(real,X2086),bool),bool)),in),s(cart(real,X2086),X2091))),s(fun(cart(real,X2086),bool),X2087)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),subspace),s(fun(cart(real,X2086),bool),X2087))))
| p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),i(s(fun(cart(real,X2086),fun(fun(cart(real,X2086),bool),bool)),in),s(cart(real,X2086),i(s(fun(cart(real,X2086),cart(real,X2086)),i(s(fun(cart(real,X2086),fun(cart(real,X2086),cart(real,X2086))),vectoru_add),s(cart(real,X2086),X2088))),s(cart(real,X2086),X2089))))),s(fun(cart(real,X2086),bool),X2087))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),i(s(fun(cart(real,X2086),fun(fun(cart(real,X2086),bool),bool)),in),s(cart(real,X2086),X2089))),s(fun(cart(real,X2086),bool),X2087))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),i(s(fun(cart(real,X2086),fun(fun(cart(real,X2086),bool),bool)),in),s(cart(real,X2086),X2088))),s(fun(cart(real,X2086),bool),X2087)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),subspace),s(fun(cart(real,X2086),bool),X2087))))
| p(s(bool,i(s(fun(fun(cart(real,X2086),bool),bool),i(s(fun(cart(real,X2086),fun(fun(cart(real,X2086),bool),bool)),in),s(cart(real,X2086),i(s(fun(num,cart(real,X2086)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X2086),bool),X2087)))) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[asubspace])])])])])])]) ).
fof(c_0_9,plain,
! [X3192] : s(num,i(s(fun(num,num),numeral),s(num,X3192))) = s(num,X3192),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
fof(c_0_10,plain,
! [X2127,X2128,X2129] : s(bool,i(s(fun(fun(X2127,bool),bool),i(s(fun(X2127,fun(fun(X2127,bool),bool)),in),s(X2127,X2129))),s(fun(X2127,bool),X2128))) = s(bool,i(s(fun(X2127,bool),X2128),s(X2127,X2129))),
inference(variable_rename,[status(thm)],[aIN]) ).
fof(c_0_11,negated_conjecture,
( s(fun(cart(real,esk1_0),bool),esk2_0) = s(fun(cart(real,esk1_0),bool),empty)
& p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),subspace),s(fun(cart(real,esk1_0),bool),esk2_0)))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_12,plain,
! [X1466,X1467] : ~ p(s(bool,i(s(fun(fun(X1466,bool),bool),i(s(fun(X1466,fun(fun(X1466,bool),bool)),in),s(X1466,X1467))),s(fun(X1466,bool),empty)))),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).
cnf(c_0_13,plain,
( ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X2))))
| p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),i(s(fun(cart(real,X1),fun(fun(cart(real,X1),bool),bool)),in),s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1),bool),X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
s(bool,i(s(fun(fun(X1,bool),bool),i(s(fun(X1,fun(fun(X1,bool),bool)),in),s(X1,X2))),s(fun(X1,bool),X3))) = s(bool,i(s(fun(X1,bool),X3),s(X1,X2))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),subspace),s(fun(cart(real,esk1_0),bool),esk2_0)))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,negated_conjecture,
s(fun(cart(real,esk1_0),bool),esk2_0) = s(fun(cart(real,esk1_0),bool),empty),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
~ p(s(bool,i(s(fun(fun(X1,bool),bool),i(s(fun(X1,fun(fun(X1,bool),bool)),in),s(X1,X2))),s(fun(X1,bool),empty)))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X2))))
| p(s(bool,i(s(fun(cart(real,X1),bool),X2),s(cart(real,X1),i(s(fun(num,cart(real,X1)),vec),s(num,u_0)))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,negated_conjecture,
p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),subspace),s(fun(cart(real,esk1_0),bool),empty)))),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
~ p(s(bool,i(s(fun(X1,bool),empty),s(X1,X2)))),
inference(rw,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_17]),c_0_20])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO462+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.38 % Computer : n002.cluster.edu
% 0.14/0.38 % Model : x86_64 x86_64
% 0.14/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.38 % Memory : 8046.5625MB
% 0.14/0.38 % OS : Linux 6.8.0-71-generic
% 0.14/0.38 % CPULimit : 300
% 0.14/0.38 % WCLimit : 300
% 0.14/0.38 % DateTime : Sun Sep 20 16:56:33 UTC 2026
% 0.14/0.39 % CPUTime :
% 0.14/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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
% 0.18/11.14 % Version: 3.5.1
% 0.18/11.14 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.18/11.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/11.14 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.18/11.14 % Starting new_bool_3 with 600s (2) cores
% 0.18/11.14 % Starting new_bool_1 with 600s (2) cores
% 0.18/11.14 % Starting sh5l with 300s (1) cores
% 0.18/11.14 % new_bool_1 with pid 1321741 completed with status 0
% 0.18/11.14 % Result found by new_bool_1
% 0.18/11.14 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.18/11.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/11.14 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.18/11.14 % Starting new_bool_3 with 600s (2) cores
% 0.18/11.14 % Starting new_bool_1 with 600s (2) cores
% 0.18/11.14 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/11.14 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/11.14 % Search class: FGHSM-SMLM33-DFFFFFNN
% 0.18/11.14 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.18/11.14 % Starting SubtermCWHack with 55s (1) cores
% 0.18/11.14 % Starting new_bool_1 with 61s (1) cores
% 0.18/11.14 % SubtermCWHack with pid 1321774 completed with status 0
% 0.18/11.14 % Result found by SubtermCWHack
% 0.18/11.14 % Preprocessing class: FMLMSMSLSSSNFFN.
% 0.18/11.14 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/11.14 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 0.18/11.14 % Starting new_bool_3 with 600s (2) cores
% 0.18/11.14 % Starting new_bool_1 with 600s (2) cores
% 0.18/11.14 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.18/11.14 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/11.14 % Search class: FGHSM-SMLM33-DFFFFFNN
% 0.18/11.14 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 0.18/11.14 % Starting SubtermCWHack with 55s (1) cores
% 0.18/11.14 % Preprocessing time : 0.240 s
% 0.18/11.14
% 0.18/11.14 % Proof found!
% 0.18/11.14 % SZS status Theorem
% 0.18/11.14 % SZS output start CNFRefutation
% See solution above
% 0.18/11.14 % Parsed axioms : 3299
% 0.18/11.14 % Removed by relevancy pruning/SinE : 2171
% 0.18/11.14 % Initial clauses : 3086
% 0.18/11.14 % Removed in clause preprocessing : 168
% 0.18/11.14 % Initial clauses in saturation : 2918
% 0.18/11.14 % Processed clauses : 10120
% 0.18/11.14 % ...of these trivial : 98
% 0.18/11.14 % ...subsumed : 8600
% 0.18/11.14 % ...remaining for further processing : 1422
% 0.18/11.14 % Other redundant clauses eliminated : 0
% 0.18/11.14 % Clauses deleted for lack of memory : 0
% 0.18/11.14 % Backward-subsumed : 34
% 0.18/11.14 % Backward-rewritten : 18
% 0.18/11.14 % Generated clauses : 317202
% 0.18/11.14 % ...of the previous two non-redundant : 254505
% 0.18/11.14 % ...aggressively subsumed : 0
% 0.18/11.14 % Contextual simplify-reflections : 4
% 0.18/11.14 % Paramodulations : 317128
% 0.18/11.14 % Factorizations : 14
% 0.18/11.14 % NegExts : 0
% 0.18/11.14 % Equation resolutions : 60
% 0.18/11.14 % Disequality decompositions : 0
% 0.18/11.14 % Total rewrite steps : 95546
% 0.18/11.14 % ...of those cached : 74884
% 0.18/11.14 % Propositional unsat checks : 0
% 0.18/11.14 % Propositional check models : 0
% 0.18/11.14 % Propositional check unsatisfiable : 0
% 0.18/11.14 % Propositional clauses : 0
% 0.18/11.14 % Propositional clauses after purity: 0
% 0.18/11.14 % Propositional unsat core size : 0
% 0.18/11.14 % Propositional preprocessing time : 0.000
% 0.18/11.14 % Propositional encoding time : 0.000
% 0.18/11.14 % Propositional solver time : 0.000
% 0.18/11.14 % Success case prop preproc time : 0.000
% 0.18/11.14 % Success case prop encoding time : 0.000
% 0.18/11.14 % Success case prop solver time : 0.000
% 0.18/11.14 % Current number of processed clauses : 1370
% 0.18/11.14 % Positive orientable unit clauses : 357
% 0.18/11.14 % Positive unorientable unit clauses: 48
% 0.18/11.14 % Negative unit clauses : 53
% 0.18/11.14 % Non-unit-clauses : 912
% 0.18/11.14 % Current number of unprocessed clauses: 246693
% 0.18/11.14 % ...number of literals in the above : 818597
% 0.18/11.14 % Current number of archived formulas : 0
% 0.18/11.14 % Current number of archived clauses : 52
% 0.18/11.14 % Clause-clause subsumption calls (NU) : 127091
% 0.18/11.14 % Rec. Clause-clause subsumption calls : 79094
% 0.18/11.14 % Non-unit clause-clause subsumptions : 4098
% 0.18/11.14 % Unit Clause-clause subsumption calls : 3824
% 0.18/11.14 % Rewrite failures with RHS unbound : 1022
% 0.18/11.14 % BW rewrite match attempts : 63951
% 0.18/11.14 % BW rewrite match successes : 84
% 0.18/11.14 % Condensation attempts : 0
% 0.18/11.14 % Condensation successes : 0
% 0.18/11.14 % Termbank termtop insertions : 24023551
% 0.18/11.14 % Search garbage collected termcells : 107984
% 0.18/11.14
% 0.18/11.14 % -------------------------------------------------
% 0.18/11.14 % User time : 9.718 s
% 0.18/11.14 % System time : 0.307 s
% 0.18/11.14 % Total time : 10.025 s
% 0.18/11.14 % Maximum resident set size: 26012 pages
% 0.18/11.14
% 0.18/11.14 % -------------------------------------------------
% 0.18/11.14 % User time : 19.405 s
% 0.18/11.14 % System time : 0.499 s
% 0.18/11.14 % Total time : 19.904 s
% 0.18/11.14 % Maximum resident set size: 14592 pages
% 0.18/11.14 % E exiting
%------------------------------------------------------------------------------