↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n020.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 01:28:57 PM UTC 2026

% Result   : Theorem 0.11s 0.43s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   7 unt;   0 def)
%            Number of atoms       :   77 (   4 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   90 (  39   ~;  28   |;   9   &)
%                                         (   2 <=>;  12  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :   24 (   0 sgn  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(no_bad,conjecture,
    ! [X1] :
      ( dive(X1)
     => ! [X2] :
          ( outcome(X1,X2)
         => ~ bad(X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_bad) ).

fof(dci_is_the_only_bad_outcome,axiom,
    ! [X1] :
      ( dive(X1)
     => ! [X2] :
          ( ( bad(X2)
            & outcome(X1,X2) )
         => X2 = dci ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',dci_is_the_only_bad_outcome) ).

fof(no_deep_long,axiom,
    ! [X1] :
      ( dive(X1)
     => ( ~ greater(time(X1),time_limit)
        & ~ greater(depth(X1),depth_limit) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',no_deep_long) ).

fof(depth_and_time_and_nitrogen,axiom,
    ! [X1] :
      ( dive(X1)
     => ( ( greater(time(X1),time_limit)
          | greater(depth(X1),depth_limit) )
      <=> greater(nitrogen(X1),nitrogen_limit) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',depth_and_time_and_nitrogen) ).

fof(too_much_nitrogen,axiom,
    ! [X1] :
      ( dive(X1)
     => ( greater(nitrogen(X1),nitrogen_limit)
      <=> outcome(X1,dci) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',too_much_nitrogen) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( dive(X1)
       => ! [X2] :
            ( outcome(X1,X2)
           => ~ bad(X2) ) ),
    inference(assume_negation,[status(cth)],[no_bad]) ).

fof(c_0_6,negated_conjecture,
    ~ ! [X1] :
        ( dive(X1)
       => ! [X2] :
            ( outcome(X1,X2)
           => ~ bad(X2) ) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

fof(c_0_7,plain,
    ! [X5,X6] :
      ( X6 = dci
      | ~ bad(X6)
      | ~ outcome(X5,X6)
      | ~ dive(X5) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dci_is_the_only_bad_outcome])])])]) ).

fof(c_0_8,negated_conjecture,
    ( bad(esk2_0)
    & outcome(esk1_0,esk2_0)
    & dive(esk1_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).

fof(c_0_9,plain,
    ! [X1] :
      ( dive(X1)
     => ( ~ greater(time(X1),time_limit)
        & ~ greater(depth(X1),depth_limit) ) ),
    inference(fof_simplification,[status(thm)],[no_deep_long]) ).

cnf(c_0_10,plain,
    ( ~ bad(X2)
    | ~ outcome(X1,X2)
    | ~ dive(X1)
    | X2 = dci ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    outcome(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    bad(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    dive(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,plain,
    ! [X8] :
      ( ( ~ dive(X8)
        | greater(time(X8),time_limit)
        | greater(depth(X8),depth_limit)
        | ~ greater(nitrogen(X8),nitrogen_limit) )
      & ( ~ dive(X8)
        | greater(nitrogen(X8),nitrogen_limit)
        | ~ greater(time(X8),time_limit) )
      & ( ~ dive(X8)
        | greater(nitrogen(X8),nitrogen_limit)
        | ~ greater(depth(X8),depth_limit) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[depth_and_time_and_nitrogen])])])]) ).

fof(c_0_15,plain,
    ! [X9] :
      ( ( ~ dive(X9)
        | ~ greater(time(X9),time_limit) )
      & ( ~ dive(X9)
        | ~ greater(depth(X9),depth_limit) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).

fof(c_0_16,plain,
    ! [X7] :
      ( ( ~ dive(X7)
        | greater(nitrogen(X7),nitrogen_limit)
        | ~ outcome(X7,dci) )
      & ( ~ dive(X7)
        | outcome(X7,dci)
        | ~ greater(nitrogen(X7),nitrogen_limit) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[too_much_nitrogen])])])]) ).

cnf(c_0_17,negated_conjecture,
    esk2_0 = dci,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).

cnf(c_0_18,plain,
    ( ~ dive(X1)
    | ~ greater(nitrogen(X1),nitrogen_limit)
    | greater(time(X1),time_limit)
    | greater(depth(X1),depth_limit) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    ( ~ dive(X1)
    | ~ greater(time(X1),time_limit) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    ( ~ dive(X1)
    | ~ greater(depth(X1),depth_limit) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    ( ~ dive(X1)
    | ~ outcome(X1,dci)
    | greater(nitrogen(X1),nitrogen_limit) ),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_22,negated_conjecture,
    outcome(esk1_0,dci),
    inference(rw,[status(thm)],[c_0_11,c_0_17]) ).

cnf(c_0_23,plain,
    ( ~ dive(X1)
    | ~ greater(nitrogen(X1),nitrogen_limit) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_24,negated_conjecture,
    greater(nitrogen(esk1_0),nitrogen_limit),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_13])]) ).

cnf(c_0_25,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_13])]),
    [proof] ).

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