↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n001.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:11 PM UTC 2026

% Result   : Theorem 0.30s 0.73s
% Output   : CNFRefutation 0.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   26 (   6 unt;   0 def)
%            Number of atoms       :   78 (   0 equ)
%            Maximal formula atoms :   13 (   3 avg)
%            Number of connectives :   87 (  35   ~;  31   |;  12   &)
%                                         (   5 <=>;   3  =>;   0  <=;   1 <~>)
%            Maximal formula depth :   13 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   2 con; 0-2 aty)
%            Number of variables   :   58 (   0 sgn  36   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(completeness,axiom,
    ! [X9,X10] :
      ( model(X9,X10)
    <~> model(X9,not(X10)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',completeness) ).

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

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

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

fof(nevera_noc_thm,conjecture,
    nevera(noc,thm),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nevera_noc_thm) ).

fof(c_0_5,plain,
    ! [X9,X10] :
      ~ ( model(X9,X10)
      <=> model(X9,not(X10)) ),
    inference(fof_simplification,[status(thm)],[completeness]) ).

fof(c_0_6,plain,
    ! [X7,X8] :
      ( ! [X1,X2] :
          ( status(X1,X2,X7)
         => ~ status(X1,X2,X8) )
    <=> nevera(X7,X8) ),
    inference(fof_simplification,[status(thm)],[nevera]) ).

fof(c_0_7,plain,
    ! [X54,X55] :
      ( ( model(X54,not(X55))
        | model(X54,X55) )
      & ( ~ model(X54,not(X55))
        | ~ model(X54,X55) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).

fof(c_0_8,plain,
    ! [X25,X26,X27,X28,X29,X30] :
      ( ( ~ status(X29,X30,noc)
        | model(esk5_2(X29,X30),not(X30)) )
      & ( ~ status(X29,X30,noc)
        | model(esk5_2(X29,X30),X29) )
      & ( ~ status(X29,X30,noc)
        | model(esk4_2(X29,X30),X30) )
      & ( ~ status(X29,X30,noc)
        | model(esk4_2(X29,X30),X29) )
      & ( status(X25,X26,noc)
        | ~ model(X28,not(X26))
        | ~ model(X28,X25)
        | ~ model(X27,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)],[noc])])])])])])]) ).

fof(c_0_9,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])])])])])])]) ).

fof(c_0_10,plain,
    ! [X11,X12,X15,X16,X17,X18] :
      ( ( ~ status(X17,X18,X16)
        | ~ status(X17,X18,X15)
        | ~ nevera(X15,X16) )
      & ( nevera(X11,X12)
        | status(esk1_2(X11,X12),esk2_2(X11,X12),X12) )
      & ( nevera(X11,X12)
        | status(esk1_2(X11,X12),esk2_2(X11,X12),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_6])])])])])])]) ).

cnf(c_0_11,plain,
    ( ~ model(X1,not(X2))
    | ~ model(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( ~ status(X1,X2,noc)
    | model(esk5_2(X1,X2),not(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

cnf(c_0_14,plain,
    ( nevera(X1,X2)
    | status(esk1_2(X1,X2),esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_15,negated_conjecture,
    ~ nevera(noc,thm),
    inference(assume_negation,[status(cth)],[nevera_noc_thm]) ).

cnf(c_0_16,plain,
    ( ~ model(esk5_2(X1,X2),X2)
    | ~ status(X1,X2,noc) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_17,plain,
    ( ~ model(X2,esk1_2(X1,thm))
    | model(X2,esk2_2(X1,thm))
    | nevera(X1,thm) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

fof(c_0_18,negated_conjecture,
    ~ nevera(noc,thm),
    inference(fof_simplification,[status(thm)],[c_0_15]) ).

cnf(c_0_19,plain,
    ( ~ model(esk5_2(X2,esk2_2(X1,thm)),esk1_2(X1,thm))
    | ~ status(X2,esk2_2(X1,thm),noc)
    | nevera(X1,thm) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    ( ~ status(X1,X2,noc)
    | model(esk5_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_21,negated_conjecture,
    ~ nevera(noc,thm),
    inference(fof_nnf,[status(thm)],[c_0_18]) ).

cnf(c_0_22,plain,
    ( ~ status(esk1_2(X1,thm),esk2_2(X1,thm),noc)
    | nevera(X1,thm) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,plain,
    ( nevera(X1,X2)
    | status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_24,negated_conjecture,
    ~ nevera(noc,thm),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_25,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS235+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.20/0.45  % Computer : n001.cluster.edu
% 0.20/0.45  % Model    : x86_64 x86_64
% 0.20/0.45  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.45  % Memory   : 8046.5625MB
% 0.20/0.45  % OS       : Linux 6.8.0-71-generic
% 0.20/0.45  % CPULimit : 300
% 0.20/0.45  % WCLimit  : 300
% 0.20/0.45  % DateTime : Sun Sep 20 23:02:58 UTC 2026
% 0.20/0.46  % CPUTime  : 
% 0.20/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.53  Running first-order theorem proving
% 0.24/0.53  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.30/0.73  % Version: 3.5.1
% 0.30/0.73  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.30/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.30/0.73  % Starting new_bool_3 with 300s (1) cores
% 0.30/0.73  % Starting new_bool_1 with 300s (1) cores
% 0.30/0.73  % Starting sh5l with 300s (1) cores
% 0.30/0.73  % new_bool_1 with pid 1601973 completed with status 0
% 0.30/0.73  % Result found by new_bool_1
% 0.30/0.73  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.30/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.30/0.73  % Starting new_bool_3 with 300s (1) cores
% 0.30/0.73  % Starting new_bool_1 with 300s (1) cores
% 0.30/0.73  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.73  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.73  % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.30/0.73  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.73  % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.73  % SubtermCWHack with pid 1601976 completed with status 0
% 0.30/0.73  % Result found by SubtermCWHack
% 0.30/0.73  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.30/0.73  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.73  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.30/0.73  % Starting new_bool_3 with 300s (1) cores
% 0.30/0.73  % Starting new_bool_1 with 300s (1) cores
% 0.30/0.73  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.30/0.73  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.30/0.73  % Search class: FGHNF-FFSM21-SFFFFFNN
% 0.30/0.73  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.73  % Starting SubtermCWHack with 31s (1) cores
% 0.30/0.73  % Preprocessing time       : 0.002 s
% 0.30/0.73  
% 0.30/0.73  % Proof found!
% 0.30/0.73  % SZS status Theorem
% 0.30/0.73  % SZS output start CNFRefutation
% See solution above
% 0.30/0.73  % Parsed axioms                        : 33
% 0.30/0.73  % Removed by relevancy pruning/SinE    : 21
% 0.30/0.73  % Initial clauses                      : 31
% 0.30/0.73  % Removed in clause preprocessing      : 0
% 0.30/0.73  % Initial clauses in saturation        : 31
% 0.30/0.73  % Processed clauses                    : 1401
% 0.30/0.73  % ...of these trivial                  : 7
% 0.30/0.73  % ...subsumed                          : 940
% 0.30/0.73  % ...remaining for further processing  : 454
% 0.30/0.73  % Other redundant clauses eliminated   : 0
% 0.30/0.73  % Clauses deleted for lack of memory   : 0
% 0.30/0.73  % Backward-subsumed                    : 32
% 0.30/0.73  % Backward-rewritten                   : 29
% 0.30/0.73  % Generated clauses                    : 3602
% 0.30/0.73  % ...of the previous two non-redundant : 3409
% 0.30/0.73  % ...aggressively subsumed             : 0
% 0.30/0.73  % Contextual simplify-reflections      : 1
% 0.30/0.73  % Paramodulations                      : 3602
% 0.30/0.73  % Factorizations                       : 0
% 0.30/0.73  % NegExts                              : 0
% 0.30/0.73  % Equation resolutions                 : 0
% 0.30/0.73  % Disequality decompositions           : 0
% 0.30/0.73  % Total rewrite steps                  : 292
% 0.30/0.73  % ...of those cached                   : 192
% 0.30/0.73  % Propositional unsat checks           : 0
% 0.30/0.73  %    Propositional check models        : 0
% 0.30/0.73  %    Propositional check unsatisfiable : 0
% 0.30/0.73  %    Propositional clauses             : 0
% 0.30/0.73  %    Propositional clauses after purity: 0
% 0.30/0.73  %    Propositional unsat core size     : 0
% 0.30/0.73  %    Propositional preprocessing time  : 0.000
% 0.30/0.73  %    Propositional encoding time       : 0.000
% 0.30/0.73  %    Propositional solver time         : 0.000
% 0.30/0.73  %    Success case prop preproc time    : 0.000
% 0.30/0.73  %    Success case prop encoding time   : 0.000
% 0.30/0.73  %    Success case prop solver time     : 0.000
% 0.30/0.73  % Current number of processed clauses  : 393
% 0.30/0.73  %    Positive orientable unit clauses  : 39
% 0.30/0.73  %    Positive unorientable unit clauses: 0
% 0.30/0.73  %    Negative unit clauses             : 44
% 0.30/0.73  %    Non-unit-clauses                  : 310
% 0.30/0.73  % Current number of unprocessed clauses: 1940
% 0.30/0.73  % ...number of literals in the above   : 7195
% 0.30/0.73  % Current number of archived formulas  : 0
% 0.30/0.73  % Current number of archived clauses   : 61
% 0.30/0.73  % Clause-clause subsumption calls (NU) : 14002
% 0.30/0.73  % Rec. Clause-clause subsumption calls : 7363
% 0.30/0.73  % Non-unit clause-clause subsumptions  : 285
% 0.30/0.73  % Unit Clause-clause subsumption calls : 526
% 0.30/0.73  % Rewrite failures with RHS unbound    : 0
% 0.30/0.73  % BW rewrite match attempts            : 286
% 0.30/0.73  % BW rewrite match successes           : 29
% 0.30/0.73  % Condensation attempts                : 0
% 0.30/0.73  % Condensation successes               : 0
% 0.30/0.73  % Termbank termtop insertions          : 54282
% 0.30/0.73  % Search garbage collected termcells   : 563
% 0.30/0.73  
% 0.30/0.73  % -------------------------------------------------
% 0.30/0.73  % User time                : 0.138 s
% 0.30/0.73  % System time              : 0.007 s
% 0.30/0.73  % Total time               : 0.145 s
% 0.30/0.73  % Maximum resident set size: 3680 pages
% 0.30/0.73  
% 0.30/0.73  % -------------------------------------------------
% 0.30/0.73  % User time                : 0.141 s
% 0.30/0.73  % System time              : 0.014 s
% 0.30/0.73  % Total time               : 0.155 s
% 0.30/0.73  % Maximum resident set size: 4608 pages
% 0.30/0.73  % E exiting
%------------------------------------------------------------------------------