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

View Problem - Process Solution

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

% Computer : n028.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 : Mon Jul 18 18:10:45 EDT 2022

% Result   : Theorem 0.21s 1.41s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   21 (   6 unt;   0 def)
%            Number of atoms       :  110 (   0 equ)
%            Maximal formula atoms :   25 (   5 avg)
%            Number of connectives :  124 (  35   ~;  31   |;  39   &)
%                                         (   1 <=>;  18  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-6 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :  104 (  28 sgn  59   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_this,conjecture,
    ! [X1,X2,X3,X4,X5,X6] :
      ( ( ! [X7,X8] :
            ( ( alive(X8)
              & eats(X8,X6) )
           => likes(X8,X7) )
        & ! [X7] :
            ( food(X7)
           => likes(X2,X7) )
        & food(X5)
        & food(X6)
        & ! [X7] :
            ( ? [X8] :
                ( eats(X8,X7)
                & not_killed_by(X8,X7) )
           => food(X7) )
        & eats(X3,X1)
        & alive(X3)
        & ! [X7] :
            ( eats(X3,X7)
           => eats(X4,X7) )
        & ! [X8] :
            ( alive(X8)
           => ! [X7] : not_killed_by(X8,X7) ) )
     => likes(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_this) ).

fof(c_0_1,plain,
    ! [X1,X2,X3,X6,X5,X4] :
      ( epred1_6(X4,X5,X6,X3,X2,X1)
    <=> ( ! [X7,X8] :
            ( ( alive(X8)
              & eats(X8,X6) )
           => likes(X8,X7) )
        & ! [X7] :
            ( food(X7)
           => likes(X2,X7) )
        & food(X5)
        & food(X6)
        & ! [X7] :
            ( ? [X8] :
                ( eats(X8,X7)
                & not_killed_by(X8,X7) )
           => food(X7) )
        & eats(X3,X1)
        & alive(X3)
        & ! [X7] :
            ( eats(X3,X7)
           => eats(X4,X7) )
        & ! [X8] :
            ( alive(X8)
           => ! [X7] : not_killed_by(X8,X7) ) ) ),
    introduced(definition) ).

fof(c_0_2,plain,
    ! [X1,X2,X3,X6,X5,X4] :
      ( epred1_6(X4,X5,X6,X3,X2,X1)
     => ( ! [X7,X8] :
            ( ( alive(X8)
              & eats(X8,X6) )
           => likes(X8,X7) )
        & ! [X7] :
            ( food(X7)
           => likes(X2,X7) )
        & food(X5)
        & food(X6)
        & ! [X7] :
            ( ? [X8] :
                ( eats(X8,X7)
                & not_killed_by(X8,X7) )
           => food(X7) )
        & eats(X3,X1)
        & alive(X3)
        & ! [X7] :
            ( eats(X3,X7)
           => eats(X4,X7) )
        & ! [X8] :
            ( alive(X8)
           => ! [X7] : not_killed_by(X8,X7) ) ) ),
    inference(split_equiv,[status(thm)],[c_0_1]) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X1,X2,X3,X4,X5,X6] :
        ( epred1_6(X4,X5,X6,X3,X2,X1)
       => likes(X2,X1) ),
    inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove_this]),c_0_1]) ).

fof(c_0_4,plain,
    ! [X9,X10,X11,X12,X13,X14,X15,X16,X17,X18,X19,X20,X21,X22] :
      ( ( ~ alive(X16)
        | ~ eats(X16,X12)
        | likes(X16,X15)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( ~ food(X17)
        | likes(X10,X17)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( food(X13)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( food(X12)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( ~ eats(X19,X18)
        | ~ not_killed_by(X19,X18)
        | food(X18)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( eats(X11,X9)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( alive(X11)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( ~ eats(X11,X20)
        | eats(X14,X20)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) )
      & ( ~ alive(X21)
        | not_killed_by(X21,X22)
        | ~ epred1_6(X14,X13,X12,X11,X10,X9) ) ),
    inference(distribute,[status(thm)],[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)],[c_0_2])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ( epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0)
    & ~ likes(esk2_0,esk1_0) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

cnf(c_0_6,plain,
    ( food(X7)
    | ~ epred1_6(X1,X2,X3,X4,X5,X6)
    | ~ not_killed_by(X8,X7)
    | ~ eats(X8,X7) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    epred1_6(esk4_0,esk5_0,esk6_0,esk3_0,esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( not_killed_by(X7,X8)
    | ~ epred1_6(X1,X2,X3,X4,X5,X6)
    | ~ alive(X7) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    ( likes(X5,X7)
    | ~ epred1_6(X1,X2,X3,X4,X5,X6)
    | ~ food(X7) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    ( food(X1)
    | ~ not_killed_by(X2,X1)
    | ~ eats(X2,X1) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( not_killed_by(X1,X2)
    | ~ alive(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_12,plain,
    ( eats(X4,X6)
    | ~ epred1_6(X1,X2,X3,X4,X5,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_13,plain,
    ( alive(X4)
    | ~ epred1_6(X1,X2,X3,X4,X5,X6) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_14,negated_conjecture,
    ~ likes(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,negated_conjecture,
    ( likes(esk2_0,X1)
    | ~ food(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

cnf(c_0_16,negated_conjecture,
    ( food(X1)
    | ~ eats(X2,X1)
    | ~ alive(X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    eats(esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_12,c_0_7]) ).

cnf(c_0_18,plain,
    alive(esk3_0),
    inference(spm,[status(thm)],[c_0_13,c_0_7]) ).

cnf(c_0_19,negated_conjecture,
    ~ food(esk1_0),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : PUZ061+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.33  % Computer : n028.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 : Sat May 28 21:36:17 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.21/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.41  # Preprocessing time       : 0.014 s
% 0.21/1.41  
% 0.21/1.41  # Proof found!
% 0.21/1.41  # SZS status Theorem
% 0.21/1.41  # SZS output start CNFRefutation
% See solution above
% 0.21/1.41  # Proof object total steps             : 21
% 0.21/1.41  # Proof object clause steps            : 15
% 0.21/1.41  # Proof object formula steps           : 6
% 0.21/1.41  # Proof object conjectures             : 12
% 0.21/1.41  # Proof object clause conjectures      : 9
% 0.21/1.41  # Proof object formula conjectures     : 3
% 0.21/1.41  # Proof object initial clauses used    : 7
% 0.21/1.41  # Proof object initial formulas used   : 1
% 0.21/1.41  # Proof object generating inferences   : 8
% 0.21/1.41  # Proof object simplifying inferences  : 3
% 0.21/1.41  # Training examples: 0 positive, 0 negative
% 0.21/1.41  # Parsed axioms                        : 1
% 0.21/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.21/1.41  # Initial clauses                      : 11
% 0.21/1.41  # Removed in clause preprocessing      : 0
% 0.21/1.41  # Initial clauses in saturation        : 11
% 0.21/1.41  # Processed clauses                    : 24
% 0.21/1.41  # ...of these trivial                  : 0
% 0.21/1.41  # ...subsumed                          : 0
% 0.21/1.41  # ...remaining for further processing  : 24
% 0.21/1.41  # Other redundant clauses eliminated   : 0
% 0.21/1.41  # Clauses deleted for lack of memory   : 0
% 0.21/1.41  # Backward-subsumed                    : 2
% 0.21/1.41  # Backward-rewritten                   : 0
% 0.21/1.41  # Generated clauses                    : 15
% 0.21/1.41  # ...of the previous two non-trivial   : 14
% 0.21/1.41  # Contextual simplify-reflections      : 0
% 0.21/1.41  # Paramodulations                      : 15
% 0.21/1.41  # Factorizations                       : 0
% 0.21/1.41  # Equation resolutions                 : 0
% 0.21/1.41  # Current number of processed clauses  : 22
% 0.21/1.41  #    Positive orientable unit clauses  : 6
% 0.21/1.41  #    Positive unorientable unit clauses: 0
% 0.21/1.41  #    Negative unit clauses             : 2
% 0.21/1.41  #    Non-unit-clauses                  : 14
% 0.21/1.41  # Current number of unprocessed clauses: 1
% 0.21/1.41  # ...number of literals in the above   : 1
% 0.21/1.41  # Current number of archived formulas  : 0
% 0.21/1.41  # Current number of archived clauses   : 2
% 0.21/1.41  # Clause-clause subsumption calls (NU) : 33
% 0.21/1.41  # Rec. Clause-clause subsumption calls : 28
% 0.21/1.41  # Non-unit clause-clause subsumptions  : 2
% 0.21/1.41  # Unit Clause-clause subsumption calls : 11
% 0.21/1.41  # Rewrite failures with RHS unbound    : 0
% 0.21/1.41  # BW rewrite match attempts            : 0
% 0.21/1.41  # BW rewrite match successes           : 0
% 0.21/1.41  # Condensation attempts                : 0
% 0.21/1.41  # Condensation successes               : 0
% 0.21/1.41  # Termbank termtop insertions          : 903
% 0.21/1.41  
% 0.21/1.41  # -------------------------------------------------
% 0.21/1.41  # User time                : 0.012 s
% 0.21/1.41  # System time              : 0.003 s
% 0.21/1.41  # Total time               : 0.015 s
% 0.21/1.41  # Maximum resident set size: 2772 pages
%------------------------------------------------------------------------------