↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : GEO452+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 : n014.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:28:18 PM UTC 2026

% Result   : Theorem 88.13s 14.77s
% Output   : CNFRefutation 88.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    9 (   3 unt;   0 def)
%            Number of atoms       :   15 (   7 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   :   20 (   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/sandbox2/benchmark/theBenchmark.p',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/sandbox2/benchmark/theBenchmark.p',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,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)))
    & 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(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
    ! [X1396,X1397,X1398,X1399] :
      ( s(cart(real,X1396),i(s(fun(cart(real,X1397),cart(real,X1396)),i(s(fun(cart(cart(real,X1397),X1396),fun(cart(real,X1397),cart(real,X1396))),matrixu_vectoru_mul),s(cart(cart(real,X1397),X1396),i(s(fun(fun(cart(real,X1397),cart(real,X1396)),cart(cart(real,X1397),X1396)),matrix),s(fun(cart(real,X1397),cart(real,X1396)),X1398))))),s(cart(real,X1397),X1399))) = s(cart(real,X1396),i(s(fun(cart(real,X1397),cart(real,X1396)),X1398),s(cart(real,X1397),X1399)))
      | ~ p(s(bool,i(s(fun(fun(cart(real,X1397),cart(real,X1396)),bool),linear),s(fun(cart(real,X1397),cart(real,X1396)),X1398)))) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[aMATRIXu_WORKS])])])]) ).

cnf(c_0_5,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_3]) ).

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

cnf(c_0_7,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_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO452+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.11/0.37  % Computer : n014.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 20 16:20:49 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  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
% 88.13/14.77  % Version: 3.5.1
% 88.13/14.77  % Preprocessing class: FMLMSMSLSSSNFFN.
% 88.13/14.77  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.13/14.77  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 88.13/14.77  % Starting new_bool_3 with 600s (2) cores
% 88.13/14.77  % Starting new_bool_1 with 600s (2) cores
% 88.13/14.77  % Starting sh5l with 300s (1) cores
% 88.13/14.77  % new_bool_3 with pid 1938974 completed with status 0
% 88.13/14.77  % Result found by new_bool_3
% 88.13/14.77  % Preprocessing class: FMLMSMSLSSSNFFN.
% 88.13/14.77  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.13/14.77  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 88.13/14.77  % Starting new_bool_3 with 600s (2) cores
% 88.13/14.77  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 88.13/14.77  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 88.13/14.77  % Search class: FGHSM-SMLM33-DFFFFFNN
% 88.13/14.77  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 88.13/14.77  % Starting SubtermCWHack with 55s (1) cores
% 88.13/14.77  % Starting new_bool_3 with 61s (1) cores
% 88.13/14.77  % SubtermCWHack with pid 1938977 completed with status 0
% 88.13/14.77  % Result found by SubtermCWHack
% 88.13/14.77  % Preprocessing class: FMLMSMSLSSSNFFN.
% 88.13/14.77  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.13/14.77  % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 900s (3) cores
% 88.13/14.77  % Starting new_bool_3 with 600s (2) cores
% 88.13/14.77  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 88.13/14.77  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 88.13/14.77  % Search class: FGHSM-SMLM33-DFFFFFNN
% 88.13/14.77  % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 88.13/14.77  % Starting SubtermCWHack with 55s (1) cores
% 88.13/14.77  % Preprocessing time       : 0.302 s
% 88.13/14.77  
% 88.13/14.77  % Proof found!
% 88.13/14.77  % SZS status Theorem
% 88.13/14.77  % SZS output start CNFRefutation
% See solution above
% 88.13/14.77  % Parsed axioms                        : 3177
% 88.13/14.77  % Removed by relevancy pruning/SinE    : 1754
% 88.13/14.77  % Initial clauses                      : 3789
% 88.13/14.77  % Removed in clause preprocessing      : 183
% 88.13/14.77  % Initial clauses in saturation        : 3606
% 88.13/14.77  % Processed clauses                    : 12826
% 88.13/14.77  % ...of these trivial                  : 376
% 88.13/14.77  % ...subsumed                          : 10480
% 88.13/14.77  % ...remaining for further processing  : 1970
% 88.13/14.77  % Other redundant clauses eliminated   : 0
% 88.13/14.77  % Clauses deleted for lack of memory   : 0
% 88.13/14.77  % Backward-subsumed                    : 31
% 88.13/14.77  % Backward-rewritten                   : 32
% 88.13/14.77  % Generated clauses                    : 563940
% 88.13/14.77  % ...of the previous two non-redundant : 443776
% 88.13/14.77  % ...aggressively subsumed             : 0
% 88.13/14.77  % Contextual simplify-reflections      : 11
% 88.13/14.77  % Paramodulations                      : 563839
% 88.13/14.77  % Factorizations                       : 27
% 88.13/14.77  % NegExts                              : 0
% 88.13/14.77  % Equation resolutions                 : 74
% 88.13/14.77  % Disequality decompositions           : 0
% 88.13/14.77  % Total rewrite steps                  : 193717
% 88.13/14.77  % ...of those cached                   : 160413
% 88.13/14.77  % Propositional unsat checks           : 0
% 88.13/14.77  %    Propositional check models        : 0
% 88.13/14.77  %    Propositional check unsatisfiable : 0
% 88.13/14.77  %    Propositional clauses             : 0
% 88.13/14.77  %    Propositional clauses after purity: 0
% 88.13/14.77  %    Propositional unsat core size     : 0
% 88.13/14.77  %    Propositional preprocessing time  : 0.000
% 88.13/14.77  %    Propositional encoding time       : 0.000
% 88.13/14.77  %    Propositional solver time         : 0.000
% 88.13/14.77  %    Success case prop preproc time    : 0.000
% 88.13/14.77  %    Success case prop encoding time   : 0.000
% 88.13/14.77  %    Success case prop solver time     : 0.000
% 88.13/14.77  % Current number of processed clauses  : 1907
% 88.13/14.77  %    Positive orientable unit clauses  : 598
% 88.13/14.77  %    Positive unorientable unit clauses: 23
% 88.13/14.77  %    Negative unit clauses             : 124
% 88.13/14.77  %    Non-unit-clauses                  : 1162
% 88.13/14.77  % Current number of unprocessed clauses: 434130
% 88.13/14.77  % ...number of literals in the above   : 1473688
% 88.13/14.77  % Current number of archived formulas  : 0
% 88.13/14.77  % Current number of archived clauses   : 63
% 88.13/14.77  % Clause-clause subsumption calls (NU) : 225662
% 88.13/14.77  % Rec. Clause-clause subsumption calls : 153352
% 88.13/14.77  % Non-unit clause-clause subsumptions  : 7242
% 88.13/14.77  % Unit Clause-clause subsumption calls : 17199
% 88.13/14.77  % Rewrite failures with RHS unbound    : 22
% 88.13/14.77  % BW rewrite match attempts            : 117105
% 88.13/14.77  % BW rewrite match successes           : 96
% 88.13/14.77  % Condensation attempts                : 0
% 88.13/14.77  % Condensation successes               : 0
% 88.13/14.77  % Termbank termtop insertions          : 41607437
% 88.13/14.77  % Search garbage collected termcells   : 114029
% 88.13/14.77  
% 88.13/14.77  % -------------------------------------------------
% 88.13/14.77  % User time                : 12.938 s
% 88.13/14.77  % System time              : 0.438 s
% 88.13/14.77  % Total time               : 13.376 s
% 88.13/14.77  % Maximum resident set size: 32536 pages
% 88.13/14.77  
% 88.13/14.77  % -------------------------------------------------
% 88.13/14.77  % User time                : 25.810 s
% 88.13/14.77  % System time              : 0.654 s
% 88.13/14.77  % Total time               : 26.464 s
% 88.13/14.77  % Maximum resident set size: 14336 pages
% 88.13/14.77  % E exiting
%------------------------------------------------------------------------------