TSTP Solution File: LCL638+1.001 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n009.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 : Sun Jul 17 10:12:14 EDT 2022

% Result   : Theorem 0.09s 1.29s
% Output   : CNFRefutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   3 unt;   0 def)
%            Number of atoms       :  168 (   0 equ)
%            Maximal formula atoms :   54 (   8 avg)
%            Number of connectives :  311 ( 162   ~; 128   |;  21   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (   7 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-3 aty)
%            Number of variables   :   80 (   0 sgn  53   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | p1(X2) ) )
                    & ~ p1(X2) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ p1(X2) ) )
                    & p1(X2) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ! [X2] :
                              ( ~ r1(X1,X2)
                              | ~ ! [X1] :
                                    ( ~ r1(X2,X1)
                                    | ~ p1(X1) ) ) )
                    & ! [X1] :
                        ( ~ r1(X2,X1)
                        | ~ ! [X2] :
                              ( ~ r1(X1,X2)
                              | ~ p1(X2) ) ) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | ! [X2] :
                              ( ~ r1(X1,X2)
                              | p1(X2) ) )
                    & ! [X1] :
                        ( ~ r1(X2,X1)
                        | p1(X1) ) ) )
          | ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ! [X1] :
                      ( ~ r1(X2,X1)
                      | ~ $true ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | p1(X2)
              | ~ ! [X1] :
                    ( ~ r1(X2,X1)
                    | p1(X1) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',main) ).

fof(c_0_1,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ~ ! [X2] :
                                  ( ~ r1(X1,X2)
                                  | p1(X2) ) )
                      & ~ p1(X2) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ~ ! [X2] :
                                  ( ~ r1(X1,X2)
                                  | ~ p1(X2) ) )
                      & p1(X2) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ ! [X1] :
                                      ( ~ r1(X2,X1)
                                      | ~ p1(X1) ) ) )
                      & ! [X1] :
                          ( ~ r1(X2,X1)
                          | ~ ! [X2] :
                                ( ~ r1(X1,X2)
                                | ~ p1(X2) ) ) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ( ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | ! [X2] :
                                ( ~ r1(X1,X2)
                                | p1(X2) ) )
                      & ! [X1] :
                          ( ~ r1(X2,X1)
                          | p1(X1) ) ) )
            | ~ ! [X2] :
                  ( ~ r1(X1,X2)
                  | ~ ! [X1] :
                        ( ~ r1(X2,X1)
                        | ~ $true ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | p1(X2)
                | ~ ! [X1] :
                      ( ~ r1(X2,X1)
                      | p1(X1) ) ) ),
    inference(assume_negation,[status(cth)],[main]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X5,X7,X8,X10,X11,X12,X15,X16,X17,X18,X20,X23] :
      ( ( r1(X5,esk2_2(X4,X5))
        | ~ r1(X4,X5)
        | p1(X4)
        | ~ r1(esk1_0,X4) )
      & ( ~ p1(esk2_2(X4,X5))
        | ~ r1(X4,X5)
        | p1(X4)
        | ~ r1(esk1_0,X4) )
      & ( r1(X8,esk3_2(X7,X8))
        | ~ r1(X7,X8)
        | ~ p1(X7)
        | ~ r1(esk1_0,X7) )
      & ( p1(esk3_2(X7,X8))
        | ~ r1(X7,X8)
        | ~ p1(X7)
        | ~ r1(esk1_0,X7) )
      & ( r1(X10,esk5_1(X10))
        | r1(X12,esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | ~ r1(esk1_0,X10) )
      & ( ~ r1(esk5_1(X10),X15)
        | ~ p1(X15)
        | r1(X12,esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | ~ r1(esk1_0,X10) )
      & ( r1(X10,esk5_1(X10))
        | p1(esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | ~ r1(esk1_0,X10) )
      & ( ~ r1(esk5_1(X10),X15)
        | ~ p1(X15)
        | p1(esk4_3(X10,X11,X12))
        | ~ r1(X11,X12)
        | ~ r1(X10,X11)
        | ~ r1(esk1_0,X10) )
      & ( r1(X16,esk6_1(X16))
        | ~ r1(X16,X17)
        | ~ r1(X17,X18)
        | p1(X18)
        | ~ r1(esk1_0,X16) )
      & ( ~ p1(esk6_1(X16))
        | ~ r1(X16,X17)
        | ~ r1(X17,X18)
        | p1(X18)
        | ~ r1(esk1_0,X16) )
      & ( ~ r1(esk1_0,X20)
        | r1(X20,esk7_1(X20)) )
      & r1(esk1_0,esk8_0)
      & ~ p1(esk8_0)
      & ( ~ r1(esk8_0,X23)
        | p1(X23) ) ),
    inference(distribute,[status(thm)],[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,
    ( p1(X2)
    | r1(X1,esk6_1(X1))
    | ~ r1(esk1_0,X1)
    | ~ r1(X3,X2)
    | ~ r1(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk2_2(X1,X2))
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2)
    | ~ p1(esk2_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk6_1(X2))
    | ~ r1(esk1_0,X2)
    | ~ r1(esk1_0,X1)
    | ~ r1(X2,X3)
    | ~ r1(X1,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

cnf(c_0_7,negated_conjecture,
    ( r1(X1,esk7_1(X1))
    | ~ r1(esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ( p1(X2)
    | ~ r1(esk1_0,X1)
    | ~ r1(X3,X2)
    | ~ r1(X1,X3)
    | ~ p1(esk6_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk8_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_10,negated_conjecture,
    ( p1(X1)
    | r1(X2,esk6_1(X2))
    | ~ r1(X1,esk7_1(X2))
    | ~ r1(esk1_0,X2)
    | ~ r1(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk8_0,esk6_1(X2))
    | ~ r1(esk1_0,X2)
    | ~ r1(X3,X1)
    | ~ r1(X2,X3) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,negated_conjecture,
    ( p1(X1)
    | r1(X1,esk6_1(X1))
    | ~ r1(esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_7]) ).

cnf(c_0_13,negated_conjecture,
    r1(esk1_0,esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_14,negated_conjecture,
    ~ p1(esk8_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_15,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk8_0,X2)
    | ~ r1(X2,X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    ( p1(X1)
    | ~ r1(esk7_1(esk8_0),X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_7]),c_0_13])]) ).

cnf(c_0_17,negated_conjecture,
    ( p1(X1)
    | ~ r1(X1,esk7_1(esk8_0))
    | ~ r1(esk1_0,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_4]),c_0_5]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_7]),c_0_13])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem  : LCL638+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.07  % Command  : run_ET %s %d
% 0.06/0.25  % Computer : n009.cluster.edu
% 0.06/0.25  % Model    : x86_64 x86_64
% 0.06/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25  % Memory   : 8042.1875MB
% 0.06/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25  % CPULimit : 300
% 0.06/0.25  % WCLimit  : 600
% 0.06/0.25  % DateTime : Sun Jul  3 09:39:22 EDT 2022
% 0.06/0.25  % CPUTime  : 
% 0.09/1.29  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.09/1.29  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.09/1.29  # Preprocessing time       : 0.008 s
% 0.09/1.29  
% 0.09/1.29  # Proof found!
% 0.09/1.29  # SZS status Theorem
% 0.09/1.29  # SZS output start CNFRefutation
% See solution above
% 0.09/1.29  # Proof object total steps             : 19
% 0.09/1.29  # Proof object clause steps            : 16
% 0.09/1.29  # Proof object formula steps           : 3
% 0.09/1.29  # Proof object conjectures             : 19
% 0.09/1.29  # Proof object clause conjectures      : 16
% 0.09/1.29  # Proof object formula conjectures     : 3
% 0.09/1.29  # Proof object initial clauses used    : 8
% 0.09/1.29  # Proof object initial formulas used   : 1
% 0.09/1.29  # Proof object generating inferences   : 8
% 0.09/1.29  # Proof object simplifying inferences  : 10
% 0.09/1.29  # Training examples: 0 positive, 0 negative
% 0.09/1.29  # Parsed axioms                        : 1
% 0.09/1.29  # Removed by relevancy pruning/SinE    : 0
% 0.09/1.29  # Initial clauses                      : 14
% 0.09/1.29  # Removed in clause preprocessing      : 0
% 0.09/1.29  # Initial clauses in saturation        : 14
% 0.09/1.29  # Processed clauses                    : 78
% 0.09/1.29  # ...of these trivial                  : 0
% 0.09/1.29  # ...subsumed                          : 16
% 0.09/1.29  # ...remaining for further processing  : 62
% 0.09/1.29  # Other redundant clauses eliminated   : 0
% 0.09/1.29  # Clauses deleted for lack of memory   : 0
% 0.09/1.29  # Backward-subsumed                    : 13
% 0.09/1.29  # Backward-rewritten                   : 0
% 0.09/1.29  # Generated clauses                    : 129
% 0.09/1.29  # ...of the previous two non-trivial   : 122
% 0.09/1.29  # Contextual simplify-reflections      : 41
% 0.09/1.29  # Paramodulations                      : 129
% 0.09/1.29  # Factorizations                       : 0
% 0.09/1.29  # Equation resolutions                 : 0
% 0.09/1.29  # Current number of processed clauses  : 49
% 0.09/1.29  #    Positive orientable unit clauses  : 1
% 0.09/1.29  #    Positive unorientable unit clauses: 0
% 0.09/1.29  #    Negative unit clauses             : 2
% 0.09/1.29  #    Non-unit-clauses                  : 46
% 0.09/1.29  # Current number of unprocessed clauses: 49
% 0.09/1.29  # ...number of literals in the above   : 314
% 0.09/1.29  # Current number of archived formulas  : 0
% 0.09/1.29  # Current number of archived clauses   : 13
% 0.09/1.29  # Clause-clause subsumption calls (NU) : 1204
% 0.09/1.29  # Rec. Clause-clause subsumption calls : 516
% 0.09/1.29  # Non-unit clause-clause subsumptions  : 69
% 0.09/1.29  # Unit Clause-clause subsumption calls : 0
% 0.09/1.29  # Rewrite failures with RHS unbound    : 0
% 0.09/1.29  # BW rewrite match attempts            : 0
% 0.09/1.29  # BW rewrite match successes           : 0
% 0.09/1.29  # Condensation attempts                : 0
% 0.09/1.29  # Condensation successes               : 0
% 0.09/1.29  # Termbank termtop insertions          : 4381
% 0.09/1.29  
% 0.09/1.29  # -------------------------------------------------
% 0.09/1.29  # User time                : 0.015 s
% 0.09/1.29  # System time              : 0.001 s
% 0.09/1.29  # Total time               : 0.016 s
% 0.09/1.29  # Maximum resident set size: 3032 pages
%------------------------------------------------------------------------------