TSTP Solution File: GEO465+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : GEO465+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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 : 600s
% DateTime : Sat Jul 16 04:05:55 EDT 2022
% Result : Theorem 0.94s 2.14s
% Output : CNFRefutation 0.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 6 unt; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 7 ~; 4 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 10 ( 3 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 21 ( 1 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSPANu_NEG,conjecture,
! [X1400,X1,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),X1))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97))))))
=> p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),i(s(fun(cart(real,X1400),cart(real,X1400)),vectoru_neg),s(cart(real,X1400),X1))))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97)))))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aSPANu_NEG) ).
fof(aSUBSPACEu_NEG,axiom,
! [X1369,X1,X97] :
( ( p(s(bool,i(s(fun(fun(cart(real,X1369),bool),bool),subspace),s(fun(cart(real,X1369),bool),X97))))
& p(s(bool,i(s(fun(fun(cart(real,X1369),bool),bool),i(s(fun(cart(real,X1369),fun(fun(cart(real,X1369),bool),bool)),in),s(cart(real,X1369),X1))),s(fun(cart(real,X1369),bool),X97)))) )
=> p(s(bool,i(s(fun(fun(cart(real,X1369),bool),bool),i(s(fun(cart(real,X1369),fun(fun(cart(real,X1369),bool),bool)),in),s(cart(real,X1369),i(s(fun(cart(real,X1369),cart(real,X1369)),vectoru_neg),s(cart(real,X1369),X1))))),s(fun(cart(real,X1369),bool),X97)))) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',aSUBSPACEu_NEG) ).
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/solver/bin/../tmp/theBenchmark.p',aSUBSPACEu_SPAN) ).
fof(c_0_3,negated_conjecture,
~ ! [X1400,X1,X97] :
( p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),X1))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97))))))
=> p(s(bool,i(s(fun(fun(cart(real,X1400),bool),bool),i(s(fun(cart(real,X1400),fun(fun(cart(real,X1400),bool),bool)),in),s(cart(real,X1400),i(s(fun(cart(real,X1400),cart(real,X1400)),vectoru_neg),s(cart(real,X1400),X1))))),s(fun(cart(real,X1400),bool),i(s(fun(fun(cart(real,X1400),bool),fun(cart(real,X1400),bool)),span),s(fun(cart(real,X1400),bool),X97)))))) ),
inference(assume_negation,[status(cth)],[aSPANu_NEG]) ).
fof(c_0_4,plain,
! [X1370,X1371,X1372] :
( ~ p(s(bool,i(s(fun(fun(cart(real,X1370),bool),bool),subspace),s(fun(cart(real,X1370),bool),X1372))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1370),bool),bool),i(s(fun(cart(real,X1370),fun(fun(cart(real,X1370),bool),bool)),in),s(cart(real,X1370),X1371))),s(fun(cart(real,X1370),bool),X1372))))
| p(s(bool,i(s(fun(fun(cart(real,X1370),bool),bool),i(s(fun(cart(real,X1370),fun(fun(cart(real,X1370),bool),bool)),in),s(cart(real,X1370),i(s(fun(cart(real,X1370),cart(real,X1370)),vectoru_neg),s(cart(real,X1370),X1371))))),s(fun(cart(real,X1370),bool),X1372)))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aSUBSPACEu_NEG])]) ).
fof(c_0_5,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),esk2_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),esk3_0))))))
& ~ 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(cart(real,esk1_0),cart(real,esk1_0)),vectoru_neg),s(cart(real,esk1_0),esk2_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),esk3_0)))))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,plain,
! [X1384,X1385] : p(s(bool,i(s(fun(fun(cart(real,X1384),bool),bool),subspace),s(fun(cart(real,X1384),bool),i(s(fun(fun(cart(real,X1384),bool),fun(cart(real,X1384),bool)),span),s(fun(cart(real,X1384),bool),X1385)))))),
inference(variable_rename,[status(thm)],[aSUBSPACEu_SPAN]) ).
cnf(c_0_7,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(cart(real,X1),cart(real,X1)),vectoru_neg),s(cart(real,X1),X2))))),s(fun(cart(real,X1),bool),X3))))
| ~ 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),X2))),s(fun(cart(real,X1),bool),X3))))
| ~ p(s(bool,i(s(fun(fun(cart(real,X1),bool),bool),subspace),s(fun(cart(real,X1),bool),X3)))) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
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),esk2_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),esk3_0)))))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,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_6]) ).
cnf(c_0_10,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(cart(real,esk1_0),cart(real,esk1_0)),vectoru_neg),s(cart(real,esk1_0),esk2_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),esk3_0)))))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GEO465+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 16:14:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.94/2.14 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.94/2.14 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.94/2.14 # Preprocessing time : 0.377 s
% 0.94/2.14
% 0.94/2.14 # Proof found!
% 0.94/2.14 # SZS status Theorem
% 0.94/2.14 # SZS output start CNFRefutation
% See solution above
% 0.94/2.14 # Proof object total steps : 12
% 0.94/2.14 # Proof object clause steps : 5
% 0.94/2.14 # Proof object formula steps : 7
% 0.94/2.14 # Proof object conjectures : 6
% 0.94/2.14 # Proof object clause conjectures : 3
% 0.94/2.14 # Proof object formula conjectures : 3
% 0.94/2.14 # Proof object initial clauses used : 4
% 0.94/2.14 # Proof object initial formulas used : 3
% 0.94/2.14 # Proof object generating inferences : 1
% 0.94/2.14 # Proof object simplifying inferences : 3
% 0.94/2.14 # Training examples: 0 positive, 0 negative
% 0.94/2.14 # Parsed axioms : 3336
% 0.94/2.14 # Removed by relevancy pruning/SinE : 2835
% 0.94/2.14 # Initial clauses : 1264
% 0.94/2.14 # Removed in clause preprocessing : 156
% 0.94/2.14 # Initial clauses in saturation : 1108
% 0.94/2.14 # Processed clauses : 270
% 0.94/2.14 # ...of these trivial : 9
% 0.94/2.14 # ...subsumed : 9
% 0.94/2.14 # ...remaining for further processing : 252
% 0.94/2.14 # Other redundant clauses eliminated : 0
% 0.94/2.14 # Clauses deleted for lack of memory : 0
% 0.94/2.14 # Backward-subsumed : 3
% 0.94/2.14 # Backward-rewritten : 27
% 0.94/2.14 # Generated clauses : 10553
% 0.94/2.14 # ...of the previous two non-trivial : 9548
% 0.94/2.14 # Contextual simplify-reflections : 0
% 0.94/2.14 # Paramodulations : 10534
% 0.94/2.14 # Factorizations : 0
% 0.94/2.14 # Equation resolutions : 19
% 0.94/2.14 # Current number of processed clauses : 222
% 0.94/2.14 # Positive orientable unit clauses : 43
% 0.94/2.14 # Positive unorientable unit clauses: 6
% 0.94/2.14 # Negative unit clauses : 5
% 0.94/2.14 # Non-unit-clauses : 168
% 0.94/2.14 # Current number of unprocessed clauses: 8411
% 0.94/2.14 # ...number of literals in the above : 23752
% 0.94/2.14 # Current number of archived formulas : 0
% 0.94/2.14 # Current number of archived clauses : 30
% 0.94/2.14 # Clause-clause subsumption calls (NU) : 7949
% 0.94/2.14 # Rec. Clause-clause subsumption calls : 6191
% 0.94/2.14 # Non-unit clause-clause subsumptions : 10
% 0.94/2.14 # Unit Clause-clause subsumption calls : 36
% 0.94/2.14 # Rewrite failures with RHS unbound : 0
% 0.94/2.14 # BW rewrite match attempts : 4223
% 0.94/2.14 # BW rewrite match successes : 272
% 0.94/2.14 # Condensation attempts : 0
% 0.94/2.14 # Condensation successes : 0
% 0.94/2.14 # Termbank termtop insertions : 1562473
% 0.94/2.14
% 0.94/2.14 # -------------------------------------------------
% 0.94/2.14 # User time : 0.535 s
% 0.94/2.14 # System time : 0.018 s
% 0.94/2.14 # Total time : 0.553 s
% 0.94/2.14 # Maximum resident set size: 29080 pages
%------------------------------------------------------------------------------