TSTP Solution File: GEO452+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : GEO452+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n020.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:52 EDT 2022

% Result   : Theorem 0.95s 3.14s
% Output   : CNFRefutation 0.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   16 (   8 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   11 (   5   ~;   2   |;   1   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(aMATRIXu_VECTORu_MUL,conjecture,
    ! [X733,X738,X11] :
      ( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
     => ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aMATRIXu_VECTORu_MUL) ).

fof(aMATRIXu_WORKS,axiom,
    ! [X733,X738,X11] :
      ( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
     => ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',aMATRIXu_WORKS) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X733,X738,X11] :
        ( p(s(bool,i(s(fun(fun(cart(real,X738),cart(real,X733)),bool),linear),s(fun(cart(real,X738),cart(real,X733)),X11))))
       => ! [X1] : s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),X11),s(cart(real,X738),X1))) = s(cart(real,X733),i(s(fun(cart(real,X738),cart(real,X733)),i(s(fun(cart(cart(real,X738),X733),fun(cart(real,X738),cart(real,X733))),matrixu_vectoru_mul),s(cart(cart(real,X738),X733),i(s(fun(fun(cart(real,X738),cart(real,X733)),cart(cart(real,X738),X733)),matrix),s(fun(cart(real,X738),cart(real,X733)),X11))))),s(cart(real,X738),X1))) ),
    inference(assume_negation,[status(cth)],[aMATRIXu_VECTORu_MUL]) ).

fof(c_0_3,plain,
    ! [X739,X740,X741,X742] :
      ( ~ p(s(bool,i(s(fun(fun(cart(real,X740),cart(real,X739)),bool),linear),s(fun(cart(real,X740),cart(real,X739)),X741))))
      | s(cart(real,X739),i(s(fun(cart(real,X740),cart(real,X739)),i(s(fun(cart(cart(real,X740),X739),fun(cart(real,X740),cart(real,X739))),matrixu_vectoru_mul),s(cart(cart(real,X740),X739),i(s(fun(fun(cart(real,X740),cart(real,X739)),cart(cart(real,X740),X739)),matrix),s(fun(cart(real,X740),cart(real,X739)),X741))))),s(cart(real,X740),X742))) = s(cart(real,X739),i(s(fun(cart(real,X740),cart(real,X739)),X741),s(cart(real,X740),X742))) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aMATRIXu_WORKS])])])])]) ).

fof(c_0_4,negated_conjecture,
    ( p(s(bool,i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),bool),linear),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))
    & s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),esk4_0))) != s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),esk4_0))) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).

cnf(c_0_5,plain,
    ( s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),i(s(fun(cart(cart(real,X2),X1),fun(cart(real,X2),cart(real,X1))),matrixu_vectoru_mul),s(cart(cart(real,X2),X1),i(s(fun(fun(cart(real,X2),cart(real,X1)),cart(cart(real,X2),X1)),matrix),s(fun(cart(real,X2),cart(real,X1)),X3))))),s(cart(real,X2),X4))) = s(cart(real,X1),i(s(fun(cart(real,X2),cart(real,X1)),X3),s(cart(real,X2),X4)))
    | ~ p(s(bool,i(s(fun(fun(cart(real,X2),cart(real,X1)),bool),linear),s(fun(cart(real,X2),cart(real,X1)),X3)))) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    p(s(bool,i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),bool),linear),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0)))),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),esk4_0))) != s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),esk4_0))),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),i(s(fun(cart(cart(real,esk2_0),esk1_0),fun(cart(real,esk2_0),cart(real,esk1_0))),matrixu_vectoru_mul),s(cart(cart(real,esk2_0),esk1_0),i(s(fun(fun(cart(real,esk2_0),cart(real,esk1_0)),cart(cart(real,esk2_0),esk1_0)),matrix),s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0))))),s(cart(real,esk2_0),X1))) = s(cart(real,esk1_0),i(s(fun(cart(real,esk2_0),cart(real,esk1_0)),esk3_0),s(cart(real,esk2_0),X1))),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_7,c_0_8])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GEO452+1 : TPTP v8.1.0. Released v7.0.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Fri Jun 17 15:40:34 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.95/3.14  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.95/3.14  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.95/3.14  # Preprocessing time       : 0.371 s
% 0.95/3.14  
% 0.95/3.14  # Proof found!
% 0.95/3.14  # SZS status Theorem
% 0.95/3.14  # SZS output start CNFRefutation
% See solution above
% 0.95/3.14  # Proof object total steps             : 10
% 0.95/3.14  # Proof object clause steps            : 5
% 0.95/3.14  # Proof object formula steps           : 5
% 0.95/3.14  # Proof object conjectures             : 7
% 0.95/3.14  # Proof object clause conjectures      : 4
% 0.95/3.14  # Proof object formula conjectures     : 3
% 0.95/3.14  # Proof object initial clauses used    : 3
% 0.95/3.14  # Proof object initial formulas used   : 2
% 0.95/3.14  # Proof object generating inferences   : 1
% 0.95/3.14  # Proof object simplifying inferences  : 2
% 0.95/3.14  # Training examples: 0 positive, 0 negative
% 0.95/3.14  # Parsed axioms                        : 3177
% 0.95/3.14  # Removed by relevancy pruning/SinE    : 3076
% 0.95/3.14  # Initial clauses                      : 343
% 0.95/3.14  # Removed in clause preprocessing      : 141
% 0.95/3.14  # Initial clauses in saturation        : 202
% 0.95/3.14  # Processed clauses                    : 203
% 0.95/3.14  # ...of these trivial                  : 0
% 0.95/3.14  # ...subsumed                          : 0
% 0.95/3.14  # ...remaining for further processing  : 203
% 0.95/3.14  # Other redundant clauses eliminated   : 0
% 0.95/3.14  # Clauses deleted for lack of memory   : 0
% 0.95/3.14  # Backward-subsumed                    : 0
% 0.95/3.14  # Backward-rewritten                   : 1
% 0.95/3.14  # Generated clauses                    : 9248
% 0.95/3.14  # ...of the previous two non-trivial   : 8733
% 0.95/3.14  # Contextual simplify-reflections      : 0
% 0.95/3.14  # Paramodulations                      : 9239
% 0.95/3.14  # Factorizations                       : 2
% 0.95/3.14  # Equation resolutions                 : 7
% 0.95/3.14  # Current number of processed clauses  : 202
% 0.95/3.14  #    Positive orientable unit clauses  : 11
% 0.95/3.14  #    Positive unorientable unit clauses: 2
% 0.95/3.14  #    Negative unit clauses             : 0
% 0.95/3.14  #    Non-unit-clauses                  : 189
% 0.95/3.14  # Current number of unprocessed clauses: 8732
% 0.95/3.14  # ...number of literals in the above   : 41659
% 0.95/3.14  # Current number of archived formulas  : 0
% 0.95/3.14  # Current number of archived clauses   : 1
% 0.95/3.14  # Clause-clause subsumption calls (NU) : 16830
% 0.95/3.14  # Rec. Clause-clause subsumption calls : 5410
% 0.95/3.14  # Non-unit clause-clause subsumptions  : 0
% 0.95/3.14  # Unit Clause-clause subsumption calls : 3
% 0.95/3.14  # Rewrite failures with RHS unbound    : 0
% 0.95/3.14  # BW rewrite match attempts            : 243
% 0.95/3.14  # BW rewrite match successes           : 1
% 0.95/3.14  # Condensation attempts                : 0
% 0.95/3.14  # Condensation successes               : 0
% 0.95/3.14  # Termbank termtop insertions          : 1336341
% 0.95/3.14  
% 0.95/3.14  # -------------------------------------------------
% 0.95/3.14  # User time                : 1.410 s
% 0.95/3.14  # System time              : 0.021 s
% 0.95/3.14  # Total time               : 1.431 s
% 0.95/3.14  # Maximum resident set size: 24792 pages
%------------------------------------------------------------------------------