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

View Problem - Process Solution

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

% Computer : n010.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:16:45 EDT 2022

% Result   : Theorem 0.20s 1.39s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    9 (   4 unt;   0 def)
%            Number of atoms       :   75 (   0 equ)
%            Maximal formula atoms :   24 (   8 avg)
%            Number of connectives :  125 (  59   ~;  51   |;  15   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   7 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   9 con; 0-0 aty)
%            Number of variables   :   36 (   0 sgn  31   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ~ ! [X2] :
                ( ~ r1(X1,X2)
                | ~ ( ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | p16(X1) )
                    | ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | p12(X1) )
                    | ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | p14(X1) )
                    | ~ ! [X1] :
                          ( ~ r1(X2,X1)
                          | p12(X1) ) ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ! [X1] :
                  ( ~ r1(X2,X1)
                  | p15(X1) ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ! [X1] :
                  ( ~ r1(X2,X1)
                  | p13(X1) ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ! [X1] :
                  ( ~ r1(X2,X1)
                  | p12(X1) ) )
          | ! [X2] :
              ( ~ r1(X1,X2)
              | ! [X1] :
                  ( ~ r1(X2,X1)
                  | p11(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)
                            | p16(X1) )
                      | ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | p12(X1) )
                      | ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | p14(X1) )
                      | ~ ! [X1] :
                            ( ~ r1(X2,X1)
                            | p12(X1) ) ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | ! [X1] :
                    ( ~ r1(X2,X1)
                    | p15(X1) ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | ! [X1] :
                    ( ~ r1(X2,X1)
                    | p13(X1) ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | ! [X1] :
                    ( ~ r1(X2,X1)
                    | p12(X1) ) )
            | ! [X2] :
                ( ~ r1(X1,X2)
                | ! [X1] :
                    ( ~ r1(X2,X1)
                    | p11(X1) ) ) ),
    inference(assume_negation,[status(cth)],[main]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X5,X6,X7,X8] :
      ( ( ~ r1(X4,X5)
        | p16(X5)
        | ~ r1(esk1_0,X4) )
      & ( ~ r1(X4,X6)
        | p12(X6)
        | ~ r1(esk1_0,X4) )
      & ( ~ r1(X4,X7)
        | p14(X7)
        | ~ r1(esk1_0,X4) )
      & ( ~ r1(X4,X8)
        | p12(X8)
        | ~ r1(esk1_0,X4) )
      & r1(esk1_0,esk2_0)
      & r1(esk2_0,esk3_0)
      & ~ p15(esk3_0)
      & r1(esk1_0,esk4_0)
      & r1(esk4_0,esk5_0)
      & ~ p13(esk5_0)
      & r1(esk1_0,esk6_0)
      & r1(esk6_0,esk7_0)
      & ~ p12(esk7_0)
      & r1(esk1_0,esk8_0)
      & r1(esk8_0,esk9_0)
      & ~ p11(esk9_0) ),
    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,
    ( p12(X2)
    | ~ r1(esk1_0,X1)
    | ~ r1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    r1(esk1_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ p12(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ( p12(X1)
    | ~ r1(esk6_0,X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    r1(esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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.11  % Problem  : LCL682+1.001 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_ET %s %d
% 0.11/0.32  % Computer : n010.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sun Jul  3 00:49:48 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.20/1.39  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39  # Preprocessing time       : 0.014 s
% 0.20/1.39  
% 0.20/1.39  # Proof found!
% 0.20/1.39  # SZS status Theorem
% 0.20/1.39  # SZS output start CNFRefutation
% See solution above
% 0.20/1.39  # Proof object total steps             : 9
% 0.20/1.39  # Proof object clause steps            : 6
% 0.20/1.39  # Proof object formula steps           : 3
% 0.20/1.39  # Proof object conjectures             : 9
% 0.20/1.39  # Proof object clause conjectures      : 6
% 0.20/1.39  # Proof object formula conjectures     : 3
% 0.20/1.39  # Proof object initial clauses used    : 4
% 0.20/1.39  # Proof object initial formulas used   : 1
% 0.20/1.39  # Proof object generating inferences   : 2
% 0.20/1.39  # Proof object simplifying inferences  : 2
% 0.20/1.39  # Training examples: 0 positive, 0 negative
% 0.20/1.39  # Parsed axioms                        : 3
% 0.20/1.39  # Removed by relevancy pruning/SinE    : 0
% 0.20/1.39  # Initial clauses                      : 18
% 0.20/1.39  # Removed in clause preprocessing      : 0
% 0.20/1.39  # Initial clauses in saturation        : 18
% 0.20/1.39  # Processed clauses                    : 28
% 0.20/1.39  # ...of these trivial                  : 0
% 0.20/1.39  # ...subsumed                          : 1
% 0.20/1.39  # ...remaining for further processing  : 27
% 0.20/1.39  # Other redundant clauses eliminated   : 0
% 0.20/1.39  # Clauses deleted for lack of memory   : 0
% 0.20/1.39  # Backward-subsumed                    : 0
% 0.20/1.39  # Backward-rewritten                   : 0
% 0.20/1.39  # Generated clauses                    : 27
% 0.20/1.39  # ...of the previous two non-trivial   : 25
% 0.20/1.39  # Contextual simplify-reflections      : 0
% 0.20/1.39  # Paramodulations                      : 27
% 0.20/1.39  # Factorizations                       : 0
% 0.20/1.39  # Equation resolutions                 : 0
% 0.20/1.39  # Current number of processed clauses  : 27
% 0.20/1.39  #    Positive orientable unit clauses  : 9
% 0.20/1.39  #    Positive unorientable unit clauses: 0
% 0.20/1.39  #    Negative unit clauses             : 5
% 0.20/1.39  #    Non-unit-clauses                  : 13
% 0.20/1.39  # Current number of unprocessed clauses: 15
% 0.20/1.39  # ...number of literals in the above   : 29
% 0.20/1.39  # Current number of archived formulas  : 0
% 0.20/1.39  # Current number of archived clauses   : 0
% 0.20/1.39  # Clause-clause subsumption calls (NU) : 30
% 0.20/1.39  # Rec. Clause-clause subsumption calls : 30
% 0.20/1.39  # Non-unit clause-clause subsumptions  : 1
% 0.20/1.39  # Unit Clause-clause subsumption calls : 12
% 0.20/1.39  # Rewrite failures with RHS unbound    : 0
% 0.20/1.39  # BW rewrite match attempts            : 0
% 0.20/1.39  # BW rewrite match successes           : 0
% 0.20/1.39  # Condensation attempts                : 0
% 0.20/1.39  # Condensation successes               : 0
% 0.20/1.39  # Termbank termtop insertions          : 1176
% 0.20/1.39  
% 0.20/1.39  # -------------------------------------------------
% 0.20/1.39  # User time                : 0.014 s
% 0.20/1.39  # System time              : 0.001 s
% 0.20/1.39  # Total time               : 0.015 s
% 0.20/1.39  # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------