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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN081+1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n023.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:44 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel59,conjecture,
    ? [X1] :
      ( big_f(X1)
      & ~ big_f(f(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel59) ).

fof(pel59_1,axiom,
    ! [X1] :
      ( big_f(X1)
    <=> ~ big_f(f(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel59_1) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X1] :
        ( big_f(X1)
        & ~ big_f(f(X1)) ),
    inference(assume_negation,[status(cth)],[pel59]) ).

fof(c_0_3,negated_conjecture,
    ! [X2] :
      ( ~ big_f(X2)
      | big_f(f(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X2,X2] :
      ( ( ~ big_f(X2)
        | ~ big_f(f(X2)) )
      & ( big_f(f(X2))
        | big_f(X2) ) ),
    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)],[pel59_1])])])])]) ).

cnf(c_0_5,negated_conjecture,
    ( big_f(f(X1))
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( ~ big_f(f(X1))
    | ~ big_f(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    ( big_f(X1)
    | big_f(f(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    ~ big_f(X1),
    inference(csr,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_8]),c_0_8]),
    [proof] ).

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