↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n006.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:01:09 PM UTC 2026

% Result   : Theorem 0.14s 15.66s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   27 (  11 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :   12 (   2 avg)
%            Number of connectives :   76 (  30   ~;  25   |;  15   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   6 con; 0-2 aty)
%            Number of variables   :   57 (   3 sgn  28   !;  14   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(non_thm_spt,axiom,
    ? [X3,X1,X2] :
      ( ? [X4] : model(X4,X2)
      & ~ model(X3,X2)
      & model(X3,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',non_thm_spt) ).

fof(esa,axiom,
    ! [X1,X2] :
      ( ( ? [X3] : model(X3,X1)
      <=> ? [X4] : model(X4,X2) )
    <=> status(X1,X2,esa) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',esa) ).

fof(nota_esa_thm,conjecture,
    nota(esa,thm),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',nota_esa_thm) ).

fof(nota,axiom,
    ! [X7,X8] :
      ( ? [X1,X2] :
          ( ~ status(X1,X2,X8)
          & status(X1,X2,X7) )
    <=> nota(X7,X8) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+1.ax',nota) ).

fof(thm,axiom,
    ! [X1,X2] :
      ( ! [X3] :
          ( model(X3,X1)
         => model(X3,X2) )
    <=> status(X1,X2,thm) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KRS001+0.ax',thm) ).

fof(c_0_5,plain,
    ? [X3,X1,X2] :
      ( ? [X4] : model(X4,X2)
      & ~ model(X3,X2)
      & model(X3,X1) ),
    inference(fof_simplification,[status(thm)],[non_thm_spt]) ).

fof(c_0_6,plain,
    ! [X25,X26,X27,X28,X31,X32,X33,X35] :
      ( ( ~ status(X31,X32,esa)
        | model(esk7_2(X31,X32),X31)
        | ~ model(X35,X32) )
      & ( ~ status(X31,X32,esa)
        | model(esk6_2(X31,X32),X32)
        | ~ model(X33,X31) )
      & ( status(X25,X26,esa)
        | model(esk5_2(X25,X26),X26)
        | model(esk4_2(X25,X26),X25) )
      & ( status(X25,X26,esa)
        | ~ model(X28,X26)
        | ~ model(X27,X25) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[esa])])])])])])]) ).

fof(c_0_7,plain,
    ( model(esk25_0,esk24_0)
    & ~ model(esk22_0,esk24_0)
    & model(esk22_0,esk23_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,negated_conjecture,
    ~ nota(esa,thm),
    inference(assume_negation,[status(cth)],[nota_esa_thm]) ).

fof(c_0_9,plain,
    ! [X7,X8] :
      ( ? [X1,X2] :
          ( ~ status(X1,X2,X8)
          & status(X1,X2,X7) )
    <=> nota(X7,X8) ),
    inference(fof_simplification,[status(thm)],[nota]) ).

cnf(c_0_10,plain,
    ( ~ model(X3,X4)
    | ~ model(X1,X2)
    | status(X2,X4,esa) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    model(esk25_0,esk24_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_12,negated_conjecture,
    ~ nota(esa,thm),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_13,plain,
    ! [X11,X12,X13,X14,X15,X16] :
      ( ( ~ nota(X15,X16)
        | ~ status(esk1_2(X15,X16),esk2_2(X15,X16),X16) )
      & ( ~ nota(X15,X16)
        | status(esk1_2(X15,X16),esk2_2(X15,X16),X15) )
      & ( nota(X11,X12)
        | status(X13,X14,X12)
        | ~ status(X13,X14,X11) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).

cnf(c_0_14,plain,
    ( ~ model(X2,X1)
    | status(X1,esk24_0,esa) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    model(esk22_0,esk23_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_16,negated_conjecture,
    ~ nota(esa,thm),
    inference(fof_nnf,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    ( ~ status(X1,X2,X3)
    | nota(X3,X4)
    | status(X1,X2,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    status(esk23_0,esk24_0,esa),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

fof(c_0_19,plain,
    ! [X19,X20,X22,X23,X24] :
      ( ( model(X24,X23)
        | ~ model(X24,X22)
        | ~ status(X22,X23,thm) )
      & ( status(X19,X20,thm)
        | ~ model(esk3_2(X19,X20),X20) )
      & ( status(X19,X20,thm)
        | model(esk3_2(X19,X20),X19) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[thm])])])])])])]) ).

cnf(c_0_20,negated_conjecture,
    ~ nota(esa,thm),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_21,plain,
    ( status(esk23_0,esk24_0,X1)
    | nota(esa,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( ~ model(X3,X1)
    | ~ status(X1,X2,thm)
    | model(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    status(esk23_0,esk24_0,thm),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ model(X1,esk23_0)
    | model(X1,esk24_0) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_25,plain,
    ~ model(esk22_0,esk24_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_26,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_15]),c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS202+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/15.59  % Computer : n006.cluster.edu
% 0.10/15.59  % Model    : x86_64 x86_64
% 0.10/15.59  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.59  % Memory   : 8046.5625MB
% 0.10/15.59  % OS       : Linux 6.8.0-71-generic
% 0.10/15.59  % CPULimit : 300
% 0.10/15.59  % WCLimit  : 300
% 0.10/15.59  % DateTime : Sun Sep 20 22:56:16 UTC 2026
% 0.10/15.59  % CPUTime  : 
% 0.10/15.59  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/15.63  Running first-order theorem proving
% 0.14/15.63  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.14/15.66  % Version: 3.5.1
% 0.14/15.66  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/15.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/15.66  % Starting new_bool_3 with 300s (1) cores
% 0.14/15.66  % Starting new_bool_1 with 300s (1) cores
% 0.14/15.66  % Starting sh5l with 300s (1) cores
% 0.14/15.66  % new_bool_3 with pid 1439392 completed with status 0
% 0.14/15.66  % Result found by new_bool_3
% 0.14/15.66  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/15.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/15.66  % Starting new_bool_3 with 300s (1) cores
% 0.14/15.66  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/15.66  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/15.66  % Search class: FGHNF-FFSM22-SFFFFFNN
% 0.14/15.66  % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.14/15.66  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/15.66  % Starting SubtermCWHack with 31s (1) cores
% 0.14/15.66  % SubtermCWHack with pid 1439395 completed with status 0
% 0.14/15.66  % Result found by SubtermCWHack
% 0.14/15.66  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.14/15.66  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/15.66  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.14/15.66  % Starting new_bool_3 with 300s (1) cores
% 0.14/15.66  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/15.66  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/15.66  % Search class: FGHNF-FFSM22-SFFFFFNN
% 0.14/15.66  % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.14/15.66  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/15.66  % Starting SubtermCWHack with 31s (1) cores
% 0.14/15.66  % Preprocessing time       : 0.001 s
% 0.14/15.66  
% 0.14/15.66  % Proof found!
% 0.14/15.66  % SZS status Theorem
% 0.14/15.66  % SZS output start CNFRefutation
% See solution above
% 0.14/15.66  % Parsed axioms                        : 33
% 0.14/15.66  % Removed by relevancy pruning/SinE    : 23
% 0.14/15.66  % Initial clauses                      : 26
% 0.14/15.66  % Removed in clause preprocessing      : 0
% 0.14/15.66  % Initial clauses in saturation        : 26
% 0.14/15.66  % Processed clauses                    : 144
% 0.14/15.66  % ...of these trivial                  : 7
% 0.14/15.66  % ...subsumed                          : 3
% 0.14/15.66  % ...remaining for further processing  : 134
% 0.14/15.66  % Other redundant clauses eliminated   : 0
% 0.14/15.66  % Clauses deleted for lack of memory   : 0
% 0.14/15.66  % Backward-subsumed                    : 0
% 0.14/15.66  % Backward-rewritten                   : 0
% 0.14/15.66  % Generated clauses                    : 352
% 0.14/15.66  % ...of the previous two non-redundant : 289
% 0.14/15.66  % ...aggressively subsumed             : 0
% 0.14/15.66  % Contextual simplify-reflections      : 0
% 0.14/15.66  % Paramodulations                      : 352
% 0.14/15.66  % Factorizations                       : 0
% 0.14/15.66  % NegExts                              : 0
% 0.14/15.66  % Equation resolutions                 : 0
% 0.14/15.66  % Disequality decompositions           : 0
% 0.14/15.66  % Total rewrite steps                  : 65
% 0.14/15.66  % ...of those cached                   : 8
% 0.14/15.66  % Propositional unsat checks           : 0
% 0.14/15.66  %    Propositional check models        : 0
% 0.14/15.66  %    Propositional check unsatisfiable : 0
% 0.14/15.66  %    Propositional clauses             : 0
% 0.14/15.66  %    Propositional clauses after purity: 0
% 0.14/15.66  %    Propositional unsat core size     : 0
% 0.14/15.66  %    Propositional preprocessing time  : 0.000
% 0.14/15.66  %    Propositional encoding time       : 0.000
% 0.14/15.66  %    Propositional solver time         : 0.000
% 0.14/15.66  %    Success case prop preproc time    : 0.000
% 0.14/15.66  %    Success case prop encoding time   : 0.000
% 0.14/15.66  %    Success case prop solver time     : 0.000
% 0.14/15.66  % Current number of processed clauses  : 134
% 0.14/15.66  %    Positive orientable unit clauses  : 88
% 0.14/15.66  %    Positive unorientable unit clauses: 0
% 0.14/15.66  %    Negative unit clauses             : 8
% 0.14/15.66  %    Non-unit-clauses                  : 38
% 0.14/15.66  % Current number of unprocessed clauses: 171
% 0.14/15.66  % ...number of literals in the above   : 394
% 0.14/15.66  % Current number of archived formulas  : 0
% 0.14/15.66  % Current number of archived clauses   : 0
% 0.14/15.66  % Clause-clause subsumption calls (NU) : 206
% 0.14/15.66  % Rec. Clause-clause subsumption calls : 205
% 0.14/15.66  % Non-unit clause-clause subsumptions  : 2
% 0.14/15.66  % Unit Clause-clause subsumption calls : 327
% 0.14/15.66  % Rewrite failures with RHS unbound    : 0
% 0.14/15.66  % BW rewrite match attempts            : 19
% 0.14/15.66  % BW rewrite match successes           : 0
% 0.14/15.66  % Condensation attempts                : 0
% 0.14/15.66  % Condensation successes               : 0
% 0.14/15.66  % Termbank termtop insertions          : 4892
% 0.14/15.66  % Search garbage collected termcells   : 569
% 0.14/15.66  
% 0.14/15.66  % -------------------------------------------------
% 0.14/15.66  % User time                : 0.010 s
% 0.14/15.66  % System time              : 0.004 s
% 0.14/15.66  % Total time               : 0.014 s
% 0.14/15.66  % Maximum resident set size: 3680 pages
% 0.14/15.66  
% 0.14/15.66  % -------------------------------------------------
% 0.14/15.66  % User time                : 0.013 s
% 0.14/15.66  % System time              : 0.008 s
% 0.14/15.66  % Total time               : 0.021 s
% 0.14/15.66  % Maximum resident set size: 4864 pages
% 0.14/15.66  % E exiting
%------------------------------------------------------------------------------