TSTP Solution File: GEO463+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GEO463+1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 19:59:24 EDT 2024
% Result : Theorem 220.91s 29.27s
% Output : CNFRefutation 220.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 20 ( 16 unt; 0 def)
% Number of atoms : 60 ( 6 equ)
% Maximal formula atoms : 33 ( 3 avg)
% Number of connectives : 64 ( 24 ~; 26 |; 11 &)
% ( 1 <=>; 2 =>; 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 : 38 ( 1 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSPANu_CLAUSESu_conjunct1,conjecture,
! [X1385] : p(s(bool,i(s(fun(fun(cart(real,X1385),bool),bool),i(s(fun(cart(real,X1385),fun(fun(cart(real,X1385),bool),bool)),in),s(cart(real,X1385),i(s(fun(num,cart(real,X1385)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1385),bool),i(s(fun(fun(cart(real,X1385),bool),fun(cart(real,X1385),bool)),span),s(fun(cart(real,X1385),bool),s0)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSPANu_CLAUSESu_conjunct1) ).
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(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(aSUBSPACEu_SPAN,axiom,
! [X1383,X97] : p(s(bool,i(s(fun(fun(cart(real,X1383),bool),bool),subspace),s(fun(cart(real,X1383),bool),i(s(fun(fun(cart(real,X1383),bool),fun(cart(real,X1383),bool)),span),s(fun(cart(real,X1383),bool),X97)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',aSUBSPACEu_SPAN) ).
fof(c_0_5,negated_conjecture,
~ ! [X1385] : p(s(bool,i(s(fun(fun(cart(real,X1385),bool),bool),i(s(fun(cart(real,X1385),fun(fun(cart(real,X1385),bool),bool)),in),s(cart(real,X1385),i(s(fun(num,cart(real,X1385)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X1385),bool),i(s(fun(fun(cart(real,X1385),bool),fun(cart(real,X1385),bool)),span),s(fun(cart(real,X1385),bool),s0)))))),
inference(assume_negation,[status(cth)],[aSPANu_CLAUSESu_conjunct1]) ).
fof(c_0_6,negated_conjecture,
~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),s0)))))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X2209] : s(num,i(s(fun(num,num),numeral),s(num,X2209))) = s(num,X2209),
inference(variable_rename,[status(thm)],[aNUMERAL]) ).
cnf(c_0_8,negated_conjecture,
~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),s0)))))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
s(num,i(s(fun(num,num),numeral),s(num,X1))) = s(num,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X2339,X2340,X2341] : s(bool,i(s(fun(fun(X2339,bool),bool),i(s(fun(X2339,fun(fun(X2339,bool),bool)),in),s(X2339,X2341))),s(fun(X2339,bool),X2340))) = s(bool,i(s(fun(X2339,bool),X2340),s(X2339,X2341))),
inference(variable_rename,[status(thm)],[aIN]) ).
fof(c_0_11,plain,
! [X5063,X5064,X5065,X5066,X5067,X5068,X5069,X5070] :
( ( p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),i(s(fun(cart(real,X5063),fun(fun(cart(real,X5063),bool),bool)),in),s(cart(real,X5063),i(s(fun(num,cart(real,X5063)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5063),bool),X5064))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),subspace),s(fun(cart(real,X5063),bool),X5064)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),i(s(fun(cart(real,X5063),fun(fun(cart(real,X5063),bool),bool)),in),s(cart(real,X5063),X5065))),s(fun(cart(real,X5063),bool),X5064))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),i(s(fun(cart(real,X5063),fun(fun(cart(real,X5063),bool),bool)),in),s(cart(real,X5063),X5066))),s(fun(cart(real,X5063),bool),X5064))))
| p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),i(s(fun(cart(real,X5063),fun(fun(cart(real,X5063),bool),bool)),in),s(cart(real,X5063),i(s(fun(cart(real,X5063),cart(real,X5063)),i(s(fun(cart(real,X5063),fun(cart(real,X5063),cart(real,X5063))),vectoru_add),s(cart(real,X5063),X5065))),s(cart(real,X5063),X5066))))),s(fun(cart(real,X5063),bool),X5064))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),subspace),s(fun(cart(real,X5063),bool),X5064)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),i(s(fun(cart(real,X5063),fun(fun(cart(real,X5063),bool),bool)),in),s(cart(real,X5063),X5068))),s(fun(cart(real,X5063),bool),X5064))))
| p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),i(s(fun(cart(real,X5063),fun(fun(cart(real,X5063),bool),bool)),in),s(cart(real,X5063),i(s(fun(cart(real,X5063),cart(real,X5063)),i(s(fun(real,fun(cart(real,X5063),cart(real,X5063))),r_),s(real,X5067))),s(cart(real,X5063),X5068))))),s(fun(cart(real,X5063),bool),X5064))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5063),bool),bool),subspace),s(fun(cart(real,X5063),bool),X5064)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1050_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1047_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(num,cart(real,X5069)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),subspace),s(fun(cart(real,X5069),bool),X5070)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(cart(real,X5069),cart(real,X5069)),i(s(fun(real,fun(cart(real,X5069),cart(real,X5069))),r_),s(real,esk1049_2(X5069,X5070)))),s(cart(real,X5069),esk1050_2(X5069,X5070)))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1047_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(num,cart(real,X5069)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),subspace),s(fun(cart(real,X5069),bool),X5070)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1050_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1048_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(num,cart(real,X5069)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),subspace),s(fun(cart(real,X5069),bool),X5070)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(cart(real,X5069),cart(real,X5069)),i(s(fun(real,fun(cart(real,X5069),cart(real,X5069))),r_),s(real,esk1049_2(X5069,X5070)))),s(cart(real,X5069),esk1050_2(X5069,X5070)))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1048_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(num,cart(real,X5069)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),subspace),s(fun(cart(real,X5069),bool),X5070)))) )
& ( p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),esk1050_2(X5069,X5070)))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(cart(real,X5069),cart(real,X5069)),i(s(fun(cart(real,X5069),fun(cart(real,X5069),cart(real,X5069))),vectoru_add),s(cart(real,X5069),esk1047_2(X5069,X5070)))),s(cart(real,X5069),esk1048_2(X5069,X5070)))))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(num,cart(real,X5069)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),subspace),s(fun(cart(real,X5069),bool),X5070)))) )
& ( ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(cart(real,X5069),cart(real,X5069)),i(s(fun(real,fun(cart(real,X5069),cart(real,X5069))),r_),s(real,esk1049_2(X5069,X5070)))),s(cart(real,X5069),esk1050_2(X5069,X5070)))))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(cart(real,X5069),cart(real,X5069)),i(s(fun(cart(real,X5069),fun(cart(real,X5069),cart(real,X5069))),vectoru_add),s(cart(real,X5069),esk1047_2(X5069,X5070)))),s(cart(real,X5069),esk1048_2(X5069,X5070)))))),s(fun(cart(real,X5069),bool),X5070))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),i(s(fun(cart(real,X5069),fun(fun(cart(real,X5069),bool),bool)),in),s(cart(real,X5069),i(s(fun(num,cart(real,X5069)),vec),s(num,i(s(fun(num,num),numeral),s(num,u_0))))))),s(fun(cart(real,X5069),bool),X5070))))
| p(s(bool,i(s(fun(fun(cart(real,X5069),bool),bool),subspace),s(fun(cart(real,X5069),bool),X5070)))) ) ),
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])])])])])])]) ).
cnf(c_0_12,negated_conjecture,
~ p(s(bool,i(s(fun(fun(cart(real,esk1_0),bool),bool),i(s(fun(cart(real,esk1_0),fun(fun(cart(real,esk1_0),bool),bool)),in),s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,u_0))))),s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),s0)))))),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,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_14,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_11]) ).
fof(c_0_15,plain,
! [X2204,X2205] : p(s(bool,i(s(fun(fun(cart(real,X2204),bool),bool),subspace),s(fun(cart(real,X2204),bool),i(s(fun(fun(cart(real,X2204),bool),fun(cart(real,X2204),bool)),span),s(fun(cart(real,X2204),bool),X2205)))))),
inference(variable_rename,[status(thm)],[aSUBSPACEu_SPAN]) ).
cnf(c_0_16,negated_conjecture,
~ p(s(bool,i(s(fun(cart(real,esk1_0),bool),i(s(fun(fun(cart(real,esk1_0),bool),fun(cart(real,esk1_0),bool)),span),s(fun(cart(real,esk1_0),bool),s0))),s(cart(real,esk1_0),i(s(fun(num,cart(real,esk1_0)),vec),s(num,u_0)))))),
inference(rw,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,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_14,c_0_9]),c_0_13]) ).
cnf(c_0_18,plain,
p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),i(s(fun(fun(cart(real,X1),bool),fun(cart(real,X1),bool)),span),s(fun(cart(real,X1),bool),X2)))))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GEO463+1 : TPTP v8.2.0. Released v7.0.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n014.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 300
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Sun May 19 13:49:53 EDT 2024
% 0.11/0.34 % CPUTime :
% 0.17/0.42 Running first-order theorem proving
% 0.17/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
% 220.91/29.27 # Version: 3.1.0
% 220.91/29.27 # Preprocessing class: FMLMSMSLSSSNFFN.
% 220.91/29.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 220.91/29.27 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 220.91/29.27 # Starting new_bool_3 with 600s (2) cores
% 220.91/29.27 # Starting new_bool_1 with 600s (2) cores
% 220.91/29.27 # Starting sh5l with 300s (1) cores
% 220.91/29.27 # new_bool_1 with pid 26790 completed with status 0
% 220.91/29.27 # Result found by new_bool_1
% 220.91/29.27 # Preprocessing class: FMLMSMSLSSSNFFN.
% 220.91/29.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 220.91/29.27 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 220.91/29.27 # Starting new_bool_3 with 600s (2) cores
% 220.91/29.27 # Starting new_bool_1 with 600s (2) cores
% 220.91/29.27 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 220.91/29.27 # Search class: FGHSM-SMLM33-DFFFFFNN
% 220.91/29.27 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 220.91/29.27 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 220.91/29.27 # Starting new_bool_1 with 61s (1) cores
% 220.91/29.27 # SAT001_MinMin_p005000_rr with pid 26792 completed with status 0
% 220.91/29.27 # Result found by SAT001_MinMin_p005000_rr
% 220.91/29.27 # Preprocessing class: FMLMSMSLSSSNFFN.
% 220.91/29.27 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 220.91/29.27 # Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 220.91/29.27 # Starting new_bool_3 with 600s (2) cores
% 220.91/29.27 # Starting new_bool_1 with 600s (2) cores
% 220.91/29.27 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 220.91/29.27 # Search class: FGHSM-SMLM33-DFFFFFNN
% 220.91/29.27 # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 220.91/29.27 # Starting SAT001_MinMin_p005000_rr with 325s (1) cores
% 220.91/29.27 # Preprocessing time : 0.483 s
% 220.91/29.27 # Presaturation interreduction done
% 220.91/29.27
% 220.91/29.27 # Proof found!
% 220.91/29.27 # SZS status Theorem
% 220.91/29.27 # SZS output start CNFRefutation
% See solution above
% 220.91/29.27 # Parsed axioms : 3317
% 220.91/29.27 # Removed by relevancy pruning/SinE : 1657
% 220.91/29.27 # Initial clauses : 5083
% 220.91/29.27 # Removed in clause preprocessing : 191
% 220.91/29.27 # Initial clauses in saturation : 4892
% 220.91/29.27 # Processed clauses : 18046
% 220.91/29.27 # ...of these trivial : 124
% 220.91/29.27 # ...subsumed : 11772
% 220.91/29.27 # ...remaining for further processing : 6150
% 220.91/29.27 # Other redundant clauses eliminated : 0
% 220.91/29.27 # Clauses deleted for lack of memory : 0
% 220.91/29.27 # Backward-subsumed : 46
% 220.91/29.27 # Backward-rewritten : 63
% 220.91/29.27 # Generated clauses : 657469
% 220.91/29.27 # ...of the previous two non-redundant : 495619
% 220.91/29.27 # ...aggressively subsumed : 0
% 220.91/29.27 # Contextual simplify-reflections : 317
% 220.91/29.27 # Paramodulations : 657389
% 220.91/29.27 # Factorizations : 12
% 220.91/29.27 # NegExts : 0
% 220.91/29.27 # Equation resolutions : 68
% 220.91/29.27 # Disequality decompositions : 0
% 220.91/29.27 # Total rewrite steps : 291141
% 220.91/29.27 # ...of those cached : 227460
% 220.91/29.27 # Propositional unsat checks : 1
% 220.91/29.27 # Propositional check models : 0
% 220.91/29.27 # Propositional check unsatisfiable : 0
% 220.91/29.27 # Propositional clauses : 0
% 220.91/29.27 # Propositional clauses after purity: 0
% 220.91/29.27 # Propositional unsat core size : 0
% 220.91/29.27 # Propositional preprocessing time : 0.000
% 220.91/29.27 # Propositional encoding time : 0.410
% 220.91/29.27 # Propositional solver time : 0.082
% 220.91/29.27 # Success case prop preproc time : 0.000
% 220.91/29.27 # Success case prop encoding time : 0.000
% 220.91/29.27 # Success case prop solver time : 0.000
% 220.91/29.27 # Current number of processed clauses : 1894
% 220.91/29.27 # Positive orientable unit clauses : 587
% 220.91/29.27 # Positive unorientable unit clauses: 47
% 220.91/29.27 # Negative unit clauses : 163
% 220.91/29.27 # Non-unit-clauses : 1097
% 220.91/29.27 # Current number of unprocessed clauses: 485824
% 220.91/29.27 # ...number of literals in the above : 1332731
% 220.91/29.27 # Current number of archived formulas : 0
% 220.91/29.27 # Current number of archived clauses : 4256
% 220.91/29.27 # Clause-clause subsumption calls (NU) : 7467853
% 220.91/29.27 # Rec. Clause-clause subsumption calls : 415720
% 220.91/29.27 # Non-unit clause-clause subsumptions : 4243
% 220.91/29.27 # Unit Clause-clause subsumption calls : 6861
% 220.91/29.27 # Rewrite failures with RHS unbound : 180
% 220.91/29.27 # BW rewrite match attempts : 219199
% 220.91/29.27 # BW rewrite match successes : 636
% 220.91/29.27 # Condensation attempts : 0
% 220.91/29.27 # Condensation successes : 0
% 220.91/29.27 # Termbank termtop insertions : 58965748
% 220.91/29.27 # Search garbage collected termcells : 132852
% 220.91/29.27
% 220.91/29.27 # -------------------------------------------------
% 220.91/29.27 # User time : 27.841 s
% 220.91/29.27 # System time : 0.477 s
% 220.91/29.27 # Total time : 28.318 s
% 220.91/29.27 # Maximum resident set size: 35812 pages
% 220.91/29.27
% 220.91/29.27 # -------------------------------------------------
% 220.91/29.27 # User time : 55.566 s
% 220.91/29.27 # System time : 0.501 s
% 220.91/29.27 # Total time : 56.067 s
% 220.91/29.27 # Maximum resident set size: 11884 pages
% 220.91/29.27 % E---3.1 exiting
% 220.91/29.27 % E exiting
%------------------------------------------------------------------------------