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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC291+1 : TPTP v8.1.0. Released v2.4.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 : Tue Jul 19 20:27:51 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    7 (   4 unt;   0 def)
%            Number of atoms       :   46 (   7 equ)
%            Maximal formula atoms :   14 (   6 avg)
%            Number of connectives :   55 (  16   ~;  14   |;  17   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   9 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   11 (   0 sgn   9   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ~ segmentP(X4,X3)
                    | ~ strictorderedP(X3)
                    | ? [X5] :
                        ( ssList(X5)
                        & neq(X3,X5)
                        & segmentP(X4,X5)
                        & segmentP(X5,X3)
                        & strictorderedP(X5) )
                    | strictorderedP(X1) ) ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ~ segmentP(X4,X3)
                      | ~ strictorderedP(X3)
                      | ? [X5] :
                          ( ssList(X5)
                          & neq(X3,X5)
                          & segmentP(X4,X5)
                          & segmentP(X5,X3)
                          & strictorderedP(X5) )
                      | strictorderedP(X1) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_2,negated_conjecture,
    ! [X10] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & segmentP(esk4_0,esk3_0)
      & strictorderedP(esk3_0)
      & ( ~ ssList(X10)
        | ~ neq(esk3_0,X10)
        | ~ segmentP(esk4_0,X10)
        | ~ segmentP(X10,esk3_0)
        | ~ strictorderedP(X10) )
      & ~ strictorderedP(esk1_0) ),
    inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_1])])])])])])]) ).

cnf(c_0_3,negated_conjecture,
    strictorderedP(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ strictorderedP(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_5]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWC291+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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 : Sun Jun 12 21:29:50 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.022 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 7
% 0.23/1.42  # Proof object clause steps            : 4
% 0.23/1.42  # Proof object formula steps           : 3
% 0.23/1.42  # Proof object conjectures             : 7
% 0.23/1.42  # Proof object clause conjectures      : 4
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 3
% 0.23/1.42  # Proof object initial formulas used   : 1
% 0.23/1.42  # Proof object generating inferences   : 0
% 0.23/1.42  # Proof object simplifying inferences  : 2
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 96
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 47
% 0.23/1.42  # Initial clauses                      : 86
% 0.23/1.42  # Removed in clause preprocessing      : 1
% 0.23/1.42  # Initial clauses in saturation        : 85
% 0.23/1.42  # Processed clauses                    : 10
% 0.23/1.42  # ...of these trivial                  : 2
% 0.23/1.42  # ...subsumed                          : 0
% 0.23/1.42  # ...remaining for further processing  : 7
% 0.23/1.42  # Other redundant clauses eliminated   : 0
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 0
% 0.23/1.42  # Backward-rewritten                   : 0
% 0.23/1.42  # Generated clauses                    : 0
% 0.23/1.42  # ...of the previous two non-trivial   : 0
% 0.23/1.42  # Contextual simplify-reflections      : 0
% 0.23/1.42  # Paramodulations                      : 0
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 0
% 0.23/1.42  # Current number of processed clauses  : 7
% 0.23/1.42  #    Positive orientable unit clauses  : 5
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 2
% 0.23/1.42  #    Non-unit-clauses                  : 0
% 0.23/1.42  # Current number of unprocessed clauses: 75
% 0.23/1.42  # ...number of literals in the above   : 284
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 0
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 0
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.42  # Unit Clause-clause subsumption calls : 0
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 0
% 0.23/1.42  # BW rewrite match successes           : 0
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 6555
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.020 s
% 0.23/1.42  # System time              : 0.002 s
% 0.23/1.42  # Total time               : 0.022 s
% 0.23/1.42  # Maximum resident set size: 2964 pages
%------------------------------------------------------------------------------