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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : LCL460+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n003.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:11:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(rosser_kn2,conjecture,
    kn2,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rosser_kn2) ).

fof(kn2,axiom,
    ( kn2
  <=> ! [X4,X5] : is_a_theorem(implies(and(X4,X5),X4)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',kn2) ).

fof(and_1,axiom,
    ( and_1
  <=> ! [X1,X2] : is_a_theorem(implies(and(X1,X2),X1)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax',and_1) ).

fof(hilbert_and_1,axiom,
    and_1,
    file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax',hilbert_and_1) ).

fof(c_0_4,negated_conjecture,
    ~ kn2,
    inference(assume_negation,[status(cth)],[rosser_kn2]) ).

fof(c_0_5,plain,
    ! [X6,X7] :
      ( ( ~ kn2
        | is_a_theorem(implies(and(X6,X7),X6)) )
      & ( ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0))
        | kn2 ) ),
    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)],[kn2])])])])])]) ).

fof(c_0_6,negated_conjecture,
    ~ kn2,
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_7,plain,
    ! [X3,X4] :
      ( ( ~ and_1
        | is_a_theorem(implies(and(X3,X4),X3)) )
      & ( ~ is_a_theorem(implies(and(esk14_0,esk15_0),esk14_0))
        | and_1 ) ),
    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)],[and_1])])])])])]) ).

cnf(c_0_8,plain,
    ( kn2
    | ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0)) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ kn2,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( is_a_theorem(implies(and(X1,X2),X1))
    | ~ and_1 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    and_1,
    inference(split_conjunct,[status(thm)],[hilbert_and_1]) ).

cnf(c_0_12,plain,
    ~ is_a_theorem(implies(and(esk34_0,esk35_0),esk34_0)),
    inference(sr,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,plain,
    is_a_theorem(implies(and(X1,X2),X1)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_14,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL460+1 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n003.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 : Mon Jul  4 00:59:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.015 s
% 0.23/1.41  
% 0.23/1.41  # Failure: Out of unprocessed clauses!
% 0.23/1.41  # OLD status GaveUp
% 0.23/1.41  # Parsed axioms                        : 53
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 51
% 0.23/1.41  # Initial clauses                      : 3
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 3
% 0.23/1.41  # Processed clauses                    : 3
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 1
% 0.23/1.41  # ...remaining for further processing  : 2
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 0
% 0.23/1.41  # Generated clauses                    : 0
% 0.23/1.41  # ...of the previous two non-trivial   : 0
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 0
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 2
% 0.23/1.41  #    Positive orientable unit clauses  : 0
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 2
% 0.23/1.41  #    Non-unit-clauses                  : 0
% 0.23/1.41  # Current number of unprocessed clauses: 0
% 0.23/1.41  # ...number of literals in the above   : 0
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 0
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.41  # Unit Clause-clause subsumption calls : 0
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 0
% 0.23/1.41  # BW rewrite match successes           : 0
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 501
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.013 s
% 0.23/1.41  # System time              : 0.002 s
% 0.23/1.41  # Total time               : 0.015 s
% 0.23/1.41  # Maximum resident set size: 2732 pages
% 0.23/1.41  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.23/1.41  # Preprocessing time       : 0.015 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 15
% 0.23/1.41  # Proof object clause steps            : 7
% 0.23/1.41  # Proof object formula steps           : 8
% 0.23/1.41  # Proof object conjectures             : 4
% 0.23/1.41  # Proof object clause conjectures      : 1
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 4
% 0.23/1.41  # Proof object initial formulas used   : 4
% 0.23/1.41  # Proof object generating inferences   : 0
% 0.23/1.41  # Proof object simplifying inferences  : 5
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 53
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 82
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 82
% 0.23/1.41  # Processed clauses                    : 60
% 0.23/1.41  # ...of these trivial                  : 20
% 0.23/1.41  # ...subsumed                          : 1
% 0.23/1.41  # ...remaining for further processing  : 39
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 3
% 0.23/1.41  # Generated clauses                    : 11
% 0.23/1.41  # ...of the previous two non-trivial   : 9
% 0.23/1.41  # Contextual simplify-reflections      : 0
% 0.23/1.41  # Paramodulations                      : 11
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 36
% 0.23/1.41  #    Positive orientable unit clauses  : 24
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 1
% 0.23/1.41  #    Non-unit-clauses                  : 11
% 0.23/1.41  # Current number of unprocessed clauses: 31
% 0.23/1.41  # ...number of literals in the above   : 61
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 3
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 1
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 1
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.23/1.41  # Unit Clause-clause subsumption calls : 2
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 8
% 0.23/1.41  # BW rewrite match successes           : 3
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 4476
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.013 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.016 s
% 0.23/1.41  # Maximum resident set size: 3064 pages
%------------------------------------------------------------------------------