↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n004.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.14s 0.43s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   12 (   5 unt;   0 def)
%            Number of atoms       :   57 (   0 equ)
%            Maximal formula atoms :   14 (   4 avg)
%            Number of connectives :   60 (  15   ~;  11   |;  24   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   6 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   37 (   1 sgn  28   !;   2   ?)

% 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) ) )
     => likes(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(c_0_1,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) ) )
       => likes(X2,X1) ),
    inference(assume_negation,[status(cth)],[prove_this]) ).

fof(c_0_2,negated_conjecture,
    ! [X15,X16,X17,X18,X19,X20] :
      ( ~ likes(esk2_0,esk1_0)
      & ( not_killed_by(X19,X20)
        | ~ alive(X19) )
      & ( eats(esk4_0,X18)
        | ~ eats(esk3_0,X18) )
      & alive(esk3_0)
      & eats(esk3_0,esk1_0)
      & ( food(X16)
        | ~ not_killed_by(X17,X16)
        | ~ eats(X17,X16) )
      & food(esk6_0)
      & food(esk5_0)
      & ( likes(esk2_0,X15)
        | ~ food(X15) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    ( ~ not_killed_by(X1,X2)
    | ~ eats(X1,X2)
    | food(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ alive(X1)
    | not_killed_by(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

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

cnf(c_0_6,negated_conjecture,
    ( ~ food(X1)
    | likes(esk2_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ eats(X2,X1)
    | ~ alive(X2)
    | food(X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_8,negated_conjecture,
    eats(esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    alive(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_10,negated_conjecture,
    ~ food(esk1_0),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : PUZ060+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36  % Computer : n004.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 03:48:34 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41  Running first-order theorem proving
% 0.14/0.41  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.14/0.43  % Version: 3.5.1
% 0.14/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43  % Starting sh5l with 300s (1) cores
% 0.14/0.43  % new_bool_3 with pid 2179201 completed with status 0
% 0.14/0.43  % Result found by new_bool_3
% 0.14/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.14/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43  % SubtermCWHack with pid 2179204 completed with status 0
% 0.14/0.43  % Result found by SubtermCWHack
% 0.14/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43  % Search class: FHUNF-FFSS00-SFFFFFNN
% 0.14/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.43  % Preprocessing time       : 0.001 s
% 0.14/0.43  
% 0.14/0.43  % Proof found!
% 0.14/0.43  % SZS status Theorem
% 0.14/0.43  % SZS output start CNFRefutation
% See solution above
% 0.14/0.43  % Parsed axioms                        : 1
% 0.14/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.14/0.43  % Initial clauses                      : 9
% 0.14/0.43  % Removed in clause preprocessing      : 0
% 0.14/0.43  % Initial clauses in saturation        : 9
% 0.14/0.43  % Processed clauses                    : 11
% 0.14/0.43  % ...of these trivial                  : 0
% 0.14/0.43  % ...subsumed                          : 0
% 0.14/0.43  % ...remaining for further processing  : 11
% 0.14/0.43  % Other redundant clauses eliminated   : 0
% 0.14/0.43  % Clauses deleted for lack of memory   : 0
% 0.14/0.43  % Backward-subsumed                    : 0
% 0.14/0.43  % Backward-rewritten                   : 0
% 0.14/0.43  % Generated clauses                    : 4
% 0.14/0.43  % ...of the previous two non-redundant : 3
% 0.14/0.43  % ...aggressively subsumed             : 0
% 0.14/0.43  % Contextual simplify-reflections      : 0
% 0.14/0.43  % Paramodulations                      : 4
% 0.14/0.43  % Factorizations                       : 0
% 0.14/0.43  % NegExts                              : 0
% 0.14/0.43  % Equation resolutions                 : 0
% 0.14/0.43  % Disequality decompositions           : 0
% 0.14/0.43  % Total rewrite steps                  : 1
% 0.14/0.43  % ...of those cached                   : 0
% 0.14/0.43  % Propositional unsat checks           : 0
% 0.14/0.43  %    Propositional check models        : 0
% 0.14/0.43  %    Propositional check unsatisfiable : 0
% 0.14/0.43  %    Propositional clauses             : 0
% 0.14/0.43  %    Propositional clauses after purity: 0
% 0.14/0.43  %    Propositional unsat core size     : 0
% 0.14/0.43  %    Propositional preprocessing time  : 0.000
% 0.14/0.43  %    Propositional encoding time       : 0.000
% 0.14/0.43  %    Propositional solver time         : 0.000
% 0.14/0.43  %    Success case prop preproc time    : 0.000
% 0.14/0.43  %    Success case prop encoding time   : 0.000
% 0.14/0.43  %    Success case prop solver time     : 0.000
% 0.14/0.43  % Current number of processed clauses  : 11
% 0.14/0.43  %    Positive orientable unit clauses  : 4
% 0.14/0.43  %    Positive unorientable unit clauses: 0
% 0.14/0.43  %    Negative unit clauses             : 2
% 0.14/0.43  %    Non-unit-clauses                  : 5
% 0.14/0.43  % Current number of unprocessed clauses: 0
% 0.14/0.43  % ...number of literals in the above   : 0
% 0.14/0.43  % Current number of archived formulas  : 0
% 0.14/0.43  % Current number of archived clauses   : 0
% 0.14/0.43  % Clause-clause subsumption calls (NU) : 3
% 0.14/0.43  % Rec. Clause-clause subsumption calls : 2
% 0.14/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.14/0.43  % Unit Clause-clause subsumption calls : 1
% 0.14/0.43  % Rewrite failures with RHS unbound    : 0
% 0.14/0.43  % BW rewrite match attempts            : 0
% 0.14/0.43  % BW rewrite match successes           : 0
% 0.14/0.43  % Condensation attempts                : 0
% 0.14/0.43  % Condensation successes               : 0
% 0.14/0.43  % Termbank termtop insertions          : 689
% 0.14/0.43  % Search garbage collected termcells   : 252
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.000 s
% 0.14/0.43  % System time              : 0.004 s
% 0.14/0.43  % Total time               : 0.004 s
% 0.14/0.43  % Maximum resident set size: 3632 pages
% 0.14/0.43  
% 0.14/0.43  % -------------------------------------------------
% 0.14/0.43  % User time                : 0.002 s
% 0.14/0.43  % System time              : 0.007 s
% 0.14/0.43  % Total time               : 0.009 s
% 0.14/0.43  % Maximum resident set size: 4608 pages
% 0.14/0.43  % E exiting
%------------------------------------------------------------------------------