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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SYN066+1 : TPTP v8.1.0. Bugfixed v3.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel37_3,axiom,
    ( ? [X3,X4] : big_q(X3,X4)
   => ! [X1] : big_r(X1,X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel37_3) ).

fof(pel37_1,axiom,
    ! [X1] :
    ? [X2] :
    ! [X3] :
    ? [X4] :
      ( ( big_p(X3,X1)
       => big_p(X4,X2) )
      & big_p(X4,X1)
      & ( big_p(X4,X2)
       => ? [X5] : big_q(X5,X2) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel37_1) ).

fof(pel37,conjecture,
    ! [X3] :
    ? [X4] : big_r(X3,X4),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel37) ).

fof(c_0_3,plain,
    ! [X5,X6,X7] :
      ( ~ big_q(X5,X6)
      | big_r(X7,X7) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel37_3])])])])]) ).

fof(c_0_4,plain,
    ! [X6,X8] :
      ( ( ~ big_p(X8,X6)
        | big_p(esk2_2(X6,X8),esk1_1(X6)) )
      & big_p(esk2_2(X6,X8),X6)
      & ( ~ big_p(esk2_2(X6,X8),esk1_1(X6))
        | big_q(esk3_2(X6,X8),esk1_1(X6)) ) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel37_1])])])])]) ).

cnf(c_0_5,plain,
    ( big_r(X1,X1)
    | ~ big_q(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( big_q(esk3_2(X1,X2),esk1_1(X1))
    | ~ big_p(esk2_2(X1,X2),esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X3] :
      ? [X4] : big_r(X3,X4),
    inference(assume_negation,[status(cth)],[pel37]) ).

cnf(c_0_8,plain,
    ( big_r(X1,X1)
    | ~ big_p(esk2_2(X2,X3),esk1_1(X2)) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_9,plain,
    ( big_p(esk2_2(X1,X2),esk1_1(X1))
    | ~ big_p(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_10,negated_conjecture,
    ! [X6] : ~ big_r(esk5_0,X6),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

cnf(c_0_11,plain,
    ( big_r(X1,X1)
    | ~ big_p(X2,X3) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    big_p(esk2_2(X1,X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,negated_conjecture,
    ~ big_r(esk5_0,X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    big_r(X1,X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

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