TSTP Solution File: GEO462+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : GEO462+1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 20:02:11 EDT 2024
% Result : Theorem 122.31s 16.83s
% Output : CNFRefutation 122.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 15 unt; 0 def)
% Number of atoms : 65 ( 10 equ)
% Maximal formula atoms : 33 ( 2 avg)
% Number of connectives : 70 ( 27 ~; 26 |; 12 &)
% ( 1 <=>; 4 =>; 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 : 44 ( 2 sgn 32 !; 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))))
<=> ( 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))))
& ! [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),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),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(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)))) )
& ! [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)))) ) ) ),
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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[aSUBSPACEu_IMPu_NONEMPTY])]) ).
fof(c_0_6,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_7,plain,
! [X2086,X2087,X2088,X2089,X2090,X2091,X2092,X2093] :
( ( 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))))
| ~ 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),X2088))),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),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),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),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),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),subspace),s(fun(cart(real,X2086),bool),X2087)))) )
& ( 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),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(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),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(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),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(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),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),esk176_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),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(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),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(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),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(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),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),esk176_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(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(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),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(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),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(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),subspace),s(fun(cart(real,X2092),bool),X2093)))) ) ),
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_8,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_9,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_10,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))))
& s(fun(cart(real,esk1_0),bool),esk2_0) = s(fun(cart(real,esk1_0),bool),empty) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_11,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_6])]) ).
cnf(c_0_12,plain,
( 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))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,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_9]) ).
cnf(c_0_15,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_10]) ).
cnf(c_0_16,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_10]) ).
cnf(c_0_17,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_11]) ).
cnf(c_0_18,plain,
( 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))))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X2)))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_19,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_15,c_0_16]) ).
cnf(c_0_20,plain,
~ p(s(bool,i(s(fun(X1,bool),empty),s(X1,X2)))),
inference(rw,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_16]),c_0_19])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO462+1 : TPTP v8.2.0. Released v7.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n009.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Sun May 19 13:36:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.19/0.48 Running first-order model finding
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 122.31/16.83 # Version: 3.1.0
% 122.31/16.83 # Preprocessing class: FMLMSMSLSSSNFFN.
% 122.31/16.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 122.31/16.83 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 122.31/16.83 # Starting new_bool_3 with 600s (2) cores
% 122.31/16.83 # Starting new_bool_1 with 600s (2) cores
% 122.31/16.83 # Starting sh5l with 300s (1) cores
% 122.31/16.83 # new_bool_1 with pid 3758 completed with status 0
% 122.31/16.83 # Result found by new_bool_1
% 122.31/16.83 # Preprocessing class: FMLMSMSLSSSNFFN.
% 122.31/16.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 122.31/16.83 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 122.31/16.83 # Starting new_bool_3 with 600s (2) cores
% 122.31/16.83 # Starting new_bool_1 with 600s (2) cores
% 122.31/16.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 122.31/16.83 # Search class: FGHSM-SMLM33-DFFFFFNN
% 122.31/16.83 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 122.31/16.83 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 122.31/16.83 # Starting new_bool_1 with 61s (1) cores
% 122.31/16.83 # SAT001_MinMin_p005000_rr with pid 3760 completed with status 0
% 122.31/16.83 # Result found by SAT001_MinMin_p005000_rr
% 122.31/16.83 # Preprocessing class: FMLMSMSLSSSNFFN.
% 122.31/16.83 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 122.31/16.83 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 122.31/16.83 # Starting new_bool_3 with 600s (2) cores
% 122.31/16.83 # Starting new_bool_1 with 600s (2) cores
% 122.31/16.83 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 122.31/16.83 # Search class: FGHSM-SMLM33-DFFFFFNN
% 122.31/16.83 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 122.31/16.83 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 122.31/16.83 # Preprocessing time : 0.250 s
% 122.31/16.83 # Presaturation interreduction done
% 122.31/16.83
% 122.31/16.83 # Proof found!
% 122.31/16.83 # SZS status Theorem
% 122.31/16.83 # SZS output start CNFRefutation
% See solution above
% 122.31/16.83 # Parsed axioms : 3299
% 122.31/16.83 # Removed by relevancy pruning/SinE : 2171
% 122.31/16.83 # Initial clauses : 3086
% 122.31/16.83 # Removed in clause preprocessing : 168
% 122.31/16.83 # Initial clauses in saturation : 2918
% 122.31/16.83 # Processed clauses : 11644
% 122.31/16.83 # ...of these trivial : 90
% 122.31/16.83 # ...subsumed : 7873
% 122.31/16.83 # ...remaining for further processing : 3681
% 122.31/16.83 # Other redundant clauses eliminated : 0
% 122.31/16.83 # Clauses deleted for lack of memory : 0
% 122.31/16.83 # Backward-subsumed : 39
% 122.31/16.83 # Backward-rewritten : 50
% 122.31/16.83 # Generated clauses : 334465
% 122.31/16.83 # ...of the previous two non-redundant : 264847
% 122.31/16.83 # ...aggressively subsumed : 0
% 122.31/16.83 # Contextual simplify-reflections : 196
% 122.31/16.83 # Paramodulations : 334411
% 122.31/16.83 # Factorizations : 12
% 122.31/16.83 # NegExts : 0
% 122.31/16.83 # Equation resolutions : 42
% 122.31/16.83 # Disequality decompositions : 0
% 122.31/16.83 # Total rewrite steps : 124046
% 122.31/16.83 # ...of those cached : 88510
% 122.31/16.83 # Propositional unsat checks : 0
% 122.31/16.83 # Propositional check models : 0
% 122.31/16.83 # Propositional check unsatisfiable : 0
% 122.31/16.83 # Propositional clauses : 0
% 122.31/16.83 # Propositional clauses after purity: 0
% 122.31/16.83 # Propositional unsat core size : 0
% 122.31/16.83 # Propositional preprocessing time : 0.000
% 122.31/16.83 # Propositional encoding time : 0.000
% 122.31/16.83 # Propositional solver time : 0.000
% 122.31/16.83 # Success case prop preproc time : 0.000
% 122.31/16.83 # Success case prop encoding time : 0.000
% 122.31/16.83 # Success case prop solver time : 0.000
% 122.31/16.83 # Current number of processed clauses : 1228
% 122.31/16.83 # Positive orientable unit clauses : 351
% 122.31/16.83 # Positive unorientable unit clauses: 38
% 122.31/16.83 # Negative unit clauses : 86
% 122.31/16.83 # Non-unit-clauses : 753
% 122.31/16.83 # Current number of unprocessed clauses: 256548
% 122.31/16.83 # ...number of literals in the above : 698704
% 122.31/16.83 # Current number of archived formulas : 0
% 122.31/16.83 # Current number of archived clauses : 2453
% 122.31/16.83 # Clause-clause subsumption calls (NU) : 3183773
% 122.31/16.83 # Rec. Clause-clause subsumption calls : 231181
% 122.31/16.83 # Non-unit clause-clause subsumptions : 3402
% 122.31/16.83 # Unit Clause-clause subsumption calls : 2772
% 122.31/16.83 # Rewrite failures with RHS unbound : 628
% 122.31/16.83 # BW rewrite match attempts : 114706
% 122.31/16.83 # BW rewrite match successes : 375
% 122.31/16.83 # Condensation attempts : 0
% 122.31/16.83 # Condensation successes : 0
% 122.31/16.83 # Termbank termtop insertions : 29760276
% 122.31/16.83 # Search garbage collected termcells : 107984
% 122.31/16.83
% 122.31/16.83 # -------------------------------------------------
% 122.31/16.83 # User time : 15.508 s
% 122.31/16.83 # System time : 0.348 s
% 122.31/16.83 # Total time : 15.856 s
% 122.31/16.83 # Maximum resident set size: 24244 pages
% 122.31/16.83
% 122.31/16.83 # -------------------------------------------------
% 122.31/16.83 # User time : 31.247 s
% 122.31/16.83 # System time : 0.368 s
% 122.31/16.83 # Total time : 31.615 s
% 122.31/16.83 # Maximum resident set size: 11820 pages
% 122.31/16.83 % E---3.1 exiting
%------------------------------------------------------------------------------