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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN053+1 : TPTP v8.1.0. Released v2.0.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 : Thu Jul 21 05:51:16 EDT 2022

% Result   : Theorem 0.20s 1.38s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   11 (   3 unt;   0 def)
%            Number of atoms       :   36 (   0 equ)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :   39 (  14   ~;  19   |;   4   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   2 prp; 0-1 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   13 (   7 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel23,conjecture,
    ( ! [X1] :
        ( p
        | big_f(X1) )
  <=> ( p
      | ! [X2] : big_f(X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel23) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
          ( p
          | big_f(X1) )
    <=> ( p
        | ! [X2] : big_f(X2) ) ),
    inference(assume_negation,[status(cth)],[pel23]) ).

fof(c_0_2,negated_conjecture,
    ! [X5,X6] :
      ( ( ~ p
        | ~ p )
      & ( ~ big_f(esk2_0)
        | ~ p )
      & ( ~ p
        | ~ big_f(esk1_0) )
      & ( ~ big_f(esk2_0)
        | ~ big_f(esk1_0) )
      & ( p
        | big_f(X5)
        | p
        | big_f(X6) ) ),
    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)],[c_0_1])])])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( big_f(X1)
    | p
    | big_f(X2)
    | p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ p
    | ~ p ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( p
    | big_f(X2)
    | big_f(X1) ),
    inference(cn,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ~ p,
    inference(cn,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( big_f(X1)
    | big_f(X2) ),
    inference(sr,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ big_f(esk1_0)
    | ~ big_f(esk2_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    big_f(X1),
    inference(ef,[status(thm)],[c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9])]),
    [proof] ).

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