↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : PUZ061+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n016.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 02:01:45 PM UTC 2026

% Result   : Theorem 0.26s 0.53s
% Output   : CNFRefutation 0.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   22 (   6 unt;   0 def)
%            Number of atoms       :  127 (   0 equ)
%            Maximal formula atoms :   25 (   5 avg)
%            Number of connectives :  141 (  36   ~;  31   |;  49   &)
%                                         (   1 <=>;  24  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   26 (   7 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   :  118 (  28 sgn  72   !;   4   ?)

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

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

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3,X4,X5,X6] :
        ( ( ! [X8] :
              ( alive(X8)
             => ! [X7] : not_killed_by(X8,X7) )
          & ! [X7] :
              ( eats(X3,X7)
             => eats(X4,X7) )
          & alive(X3)
          & eats(X3,X1)
          & ! [X7] :
              ( ? [X8] :
                  ( not_killed_by(X8,X7)
                  & eats(X8,X7) )
             => food(X7) )
          & food(X6)
          & food(X5)
          & ! [X7] :
              ( food(X7)
             => likes(X2,X7) )
          & ! [X7,X8] :
              ( ( eats(X8,X6)
                & alive(X8) )
             => likes(X8,X7) ) )
       => likes(X2,X1) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

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

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

fof(c_0_5,plain,
    ! [X15,X16,X17,X18,X19,X20,X21,X22,X23,X24,X25,X26,X27,X28] :
      ( ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | not_killed_by(X27,X28)
        | ~ alive(X27) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | eats(X20,X26)
        | ~ eats(X17,X26) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | alive(X17) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | eats(X17,X15) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | food(X24)
        | ~ not_killed_by(X25,X24)
        | ~ eats(X25,X24) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | food(X18) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | food(X19) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | likes(X16,X23)
        | ~ food(X23) )
      & ( ~ epred1_6(X20,X19,X18,X17,X16,X15)
        | likes(X22,X21)
        | ~ eats(X22,X18)
        | ~ alive(X22) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).

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

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

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

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

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

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

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

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

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

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

cnf(c_0_16,negated_conjecture,
    ( ~ food(X1)
    | likes(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_8]) ).

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

cnf(c_0_18,negated_conjecture,
    eats(esk3_0,esk1_0),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_19,negated_conjecture,
    alive(esk3_0),
    inference(spm,[status(thm)],[c_0_14,c_0_8]) ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : PUZ061+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.43  % Computer : n016.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Mon Sep 21 03:53:37 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.50  Running first-order theorem proving
% 0.26/0.50  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.26/0.53  % Version: 3.5.1
% 0.26/0.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.53  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.53  % Starting sh5l with 300s (1) cores
% 0.26/0.53  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1488971 completed with status 0
% 0.26/0.53  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.26/0.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.53  % No SInE strategy applied
% 0.26/0.53  % Search class: FHUNF-FFSF00-SFFFFFNN
% 0.26/0.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.53  % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.26/0.53  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.26/0.53  % Starting new_bool_3 with 136s (1) cores
% 0.26/0.53  % Starting new_bool_1 with 136s (1) cores
% 0.26/0.53  % SubtermCWHack with pid 1488975 completed with status 0
% 0.26/0.53  % Result found by SubtermCWHack
% 0.26/0.53  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.26/0.53  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.53  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.26/0.53  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.26/0.53  % No SInE strategy applied
% 0.26/0.53  % Search class: FHUNF-FFSF00-SFFFFFNN
% 0.26/0.53  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.26/0.53  % Starting SubtermCWHack with 136s (1) cores
% 0.26/0.53  % Preprocessing time       : 0.001 s
% 0.26/0.53  
% 0.26/0.53  % Proof found!
% 0.26/0.53  % SZS status Theorem
% 0.26/0.53  % SZS output start CNFRefutation
% See solution above
% 0.26/0.53  % Parsed axioms                        : 1
% 0.26/0.53  % Removed by relevancy pruning/SinE    : 0
% 0.26/0.53  % Initial clauses                      : 11
% 0.26/0.53  % Removed in clause preprocessing      : 0
% 0.26/0.53  % Initial clauses in saturation        : 11
% 0.26/0.53  % Processed clauses                    : 24
% 0.26/0.53  % ...of these trivial                  : 0
% 0.26/0.53  % ...subsumed                          : 0
% 0.26/0.53  % ...remaining for further processing  : 24
% 0.26/0.53  % Other redundant clauses eliminated   : 0
% 0.26/0.53  % Clauses deleted for lack of memory   : 0
% 0.26/0.53  % Backward-subsumed                    : 2
% 0.26/0.53  % Backward-rewritten                   : 0
% 0.26/0.53  % Generated clauses                    : 15
% 0.26/0.53  % ...of the previous two non-redundant : 14
% 0.26/0.53  % ...aggressively subsumed             : 0
% 0.26/0.53  % Contextual simplify-reflections      : 0
% 0.26/0.53  % Paramodulations                      : 15
% 0.26/0.53  % Factorizations                       : 0
% 0.26/0.53  % NegExts                              : 0
% 0.26/0.53  % Equation resolutions                 : 0
% 0.26/0.53  % Disequality decompositions           : 0
% 0.26/0.53  % Total rewrite steps                  : 1
% 0.26/0.53  % ...of those cached                   : 0
% 0.26/0.53  % Propositional unsat checks           : 0
% 0.26/0.53  %    Propositional check models        : 0
% 0.26/0.53  %    Propositional check unsatisfiable : 0
% 0.26/0.53  %    Propositional clauses             : 0
% 0.26/0.53  %    Propositional clauses after purity: 0
% 0.26/0.53  %    Propositional unsat core size     : 0
% 0.26/0.53  %    Propositional preprocessing time  : 0.000
% 0.26/0.53  %    Propositional encoding time       : 0.000
% 0.26/0.53  %    Propositional solver time         : 0.000
% 0.26/0.53  %    Success case prop preproc time    : 0.000
% 0.26/0.53  %    Success case prop encoding time   : 0.000
% 0.26/0.53  %    Success case prop solver time     : 0.000
% 0.26/0.53  % Current number of processed clauses  : 22
% 0.26/0.53  %    Positive orientable unit clauses  : 6
% 0.26/0.53  %    Positive unorientable unit clauses: 0
% 0.26/0.53  %    Negative unit clauses             : 2
% 0.26/0.53  %    Non-unit-clauses                  : 14
% 0.26/0.53  % Current number of unprocessed clauses: 0
% 0.26/0.53  % ...number of literals in the above   : 0
% 0.26/0.53  % Current number of archived formulas  : 0
% 0.26/0.53  % Current number of archived clauses   : 2
% 0.26/0.53  % Clause-clause subsumption calls (NU) : 28
% 0.26/0.53  % Rec. Clause-clause subsumption calls : 23
% 0.26/0.53  % Non-unit clause-clause subsumptions  : 2
% 0.26/0.53  % Unit Clause-clause subsumption calls : 9
% 0.26/0.53  % Rewrite failures with RHS unbound    : 0
% 0.26/0.53  % BW rewrite match attempts            : 0
% 0.26/0.53  % BW rewrite match successes           : 0
% 0.26/0.53  % Condensation attempts                : 0
% 0.26/0.53  % Condensation successes               : 0
% 0.26/0.53  % Termbank termtop insertions          : 937
% 0.26/0.53  % Search garbage collected termcells   : 205
% 0.26/0.53  
% 0.26/0.53  % -------------------------------------------------
% 0.26/0.53  % User time                : 0.004 s
% 0.26/0.53  % System time              : 0.004 s
% 0.26/0.53  % Total time               : 0.008 s
% 0.26/0.53  % Maximum resident set size: 3632 pages
% 0.26/0.53  
% 0.26/0.53  % -------------------------------------------------
% 0.26/0.53  % User time                : 0.013 s
% 0.26/0.53  % System time              : 0.016 s
% 0.26/0.53  % Total time               : 0.029 s
% 0.26/0.53  % Maximum resident set size: 4608 pages
% 0.26/0.53  % E exiting
%------------------------------------------------------------------------------