↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KRS188+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 : 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:07 PM UTC 2026

% Result   : Theorem 0.25s 0.56s
% Output   : CNFRefutation 0.25s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   6 unt;   0 def)
%            Number of atoms       :   76 (   0 equ)
%            Maximal formula atoms :   19 (   3 avg)
%            Number of connectives :   84 (  29   ~;  32   |;  15   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   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   :   51 (   0 sgn  31   !;   4   ?)

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

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

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(isa_wec_thm,conjecture,
    isa(wec,thm),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',isa_wec_thm) ).

fof(c_0_4,plain,
    ! [X1,X2] :
      ( ( ? [X5] :
            ( ~ model(X5,X1)
            & model(X5,X2) )
        & ! [X4] :
            ( model(X4,X1)
           => model(X4,X2) )
        & ? [X3] : model(X3,X1) )
    <=> status(X1,X2,wec) ),
    inference(fof_simplification,[status(thm)],[wec]) ).

fof(c_0_5,plain,
    ! [X25,X26,X27,X29,X30,X31,X33] :
      ( ( ~ status(X30,X31,wec)
        | ~ model(esk6_2(X30,X31),X30) )
      & ( ~ status(X30,X31,wec)
        | model(esk6_2(X30,X31),X31) )
      & ( ~ status(X30,X31,wec)
        | model(X33,X31)
        | ~ model(X33,X30) )
      & ( ~ status(X30,X31,wec)
        | model(esk5_2(X30,X31),X30) )
      & ( status(X25,X26,wec)
        | model(X29,X25)
        | ~ model(X29,X26)
        | ~ model(X27,X25)
        | ~ model(esk4_2(X25,X26),X26) )
      & ( status(X25,X26,wec)
        | model(X29,X25)
        | ~ model(X29,X26)
        | ~ model(X27,X25)
        | model(esk4_2(X25,X26),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)],[c_0_4])])])])])])]) ).

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

fof(c_0_7,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_8,plain,
    ( ~ status(X2,X3,wec)
    | ~ model(X1,X2)
    | model(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( isa(X1,X2)
    | status(esk1_2(X1,X2),esk2_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,negated_conjecture,
    ~ isa(wec,thm),
    inference(assume_negation,[status(cth)],[isa_wec_thm]) ).

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

cnf(c_0_12,plain,
    ( ~ model(X2,esk1_2(wec,X1))
    | model(X2,esk2_2(wec,X1))
    | isa(wec,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

fof(c_0_13,negated_conjecture,
    ~ isa(wec,thm),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( ~ model(esk3_2(X2,esk2_2(wec,X1)),esk1_2(wec,X1))
    | status(X2,esk2_2(wec,X1),thm)
    | isa(wec,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    ( status(X1,X2,thm)
    | model(esk3_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_16,negated_conjecture,
    ~ isa(wec,thm),
    inference(fof_nnf,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    ( ~ status(esk1_2(X1,X2),esk2_2(X1,X2),X2)
    | isa(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_18,plain,
    ( status(esk1_2(wec,X1),esk2_2(wec,X1),thm)
    | isa(wec,X1) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    ~ isa(wec,thm),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_20,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS188+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.14/0.40  % Computer : n006.cluster.edu
% 0.14/0.40  % Model    : x86_64 x86_64
% 0.14/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.40  % Memory   : 8046.5625MB
% 0.14/0.40  % OS       : Linux 6.8.0-71-generic
% 0.14/0.40  % CPULimit : 300
% 0.14/0.40  % WCLimit  : 300
% 0.14/0.40  % DateTime : Sun Sep 20 22:55:28 UTC 2026
% 0.14/0.41  % CPUTime  : 
% 0.14/0.41  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.46  Running first-order theorem proving
% 0.21/0.46  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.25/0.56  % Version: 3.5.1
% 0.25/0.56  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.25/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.25/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.56  % Starting sh5l with 300s (1) cores
% 0.25/0.56  % new_bool_1 with pid 1438264 completed with status 0
% 0.25/0.56  % Result found by new_bool_1
% 0.25/0.56  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.25/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.25/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.56  % Search class: FGHNF-FFSM22-SFFFFFNN
% 0.25/0.56  % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.25/0.56  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.56  % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.56  % SubtermCWHack with pid 1438266 completed with status 0
% 0.25/0.56  % Result found by SubtermCWHack
% 0.25/0.56  % Preprocessing class: FSMSSMSMSSSNFFN.
% 0.25/0.56  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.56  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.25/0.56  % Starting new_bool_3 with 300s (1) cores
% 0.25/0.56  % Starting new_bool_1 with 300s (1) cores
% 0.25/0.56  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.25/0.56  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.25/0.56  % Search class: FGHNF-FFSM22-SFFFFFNN
% 0.25/0.56  % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.25/0.56  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.25/0.56  % Starting SubtermCWHack with 31s (1) cores
% 0.25/0.56  % Preprocessing time       : 0.002 s
% 0.25/0.56  
% 0.25/0.56  % Proof found!
% 0.25/0.56  % SZS status Theorem
% 0.25/0.56  % SZS output start CNFRefutation
% See solution above
% 0.25/0.56  % Parsed axioms                        : 33
% 0.25/0.56  % Removed by relevancy pruning/SinE    : 23
% 0.25/0.56  % Initial clauses                      : 28
% 0.25/0.56  % Removed in clause preprocessing      : 0
% 0.25/0.56  % Initial clauses in saturation        : 28
% 0.25/0.56  % Processed clauses                    : 232
% 0.25/0.56  % ...of these trivial                  : 0
% 0.25/0.56  % ...subsumed                          : 100
% 0.25/0.56  % ...remaining for further processing  : 132
% 0.25/0.56  % Other redundant clauses eliminated   : 0
% 0.25/0.56  % Clauses deleted for lack of memory   : 0
% 0.25/0.56  % Backward-subsumed                    : 0
% 0.25/0.56  % Backward-rewritten                   : 0
% 0.25/0.56  % Generated clauses                    : 672
% 0.25/0.56  % ...of the previous two non-redundant : 578
% 0.25/0.56  % ...aggressively subsumed             : 0
% 0.25/0.56  % Contextual simplify-reflections      : 0
% 0.25/0.56  % Paramodulations                      : 672
% 0.25/0.56  % Factorizations                       : 0
% 0.25/0.56  % NegExts                              : 0
% 0.25/0.56  % Equation resolutions                 : 0
% 0.25/0.56  % Disequality decompositions           : 0
% 0.25/0.56  % Total rewrite steps                  : 102
% 0.25/0.56  % ...of those cached                   : 71
% 0.25/0.56  % Propositional unsat checks           : 0
% 0.25/0.56  %    Propositional check models        : 0
% 0.25/0.56  %    Propositional check unsatisfiable : 0
% 0.25/0.56  %    Propositional clauses             : 0
% 0.25/0.56  %    Propositional clauses after purity: 0
% 0.25/0.56  %    Propositional unsat core size     : 0
% 0.25/0.56  %    Propositional preprocessing time  : 0.000
% 0.25/0.56  %    Propositional encoding time       : 0.000
% 0.25/0.56  %    Propositional solver time         : 0.000
% 0.25/0.56  %    Success case prop preproc time    : 0.000
% 0.25/0.56  %    Success case prop encoding time   : 0.000
% 0.25/0.56  %    Success case prop solver time     : 0.000
% 0.25/0.56  % Current number of processed clauses  : 132
% 0.25/0.56  %    Positive orientable unit clauses  : 13
% 0.25/0.56  %    Positive unorientable unit clauses: 0
% 0.25/0.56  %    Negative unit clauses             : 12
% 0.25/0.56  %    Non-unit-clauses                  : 107
% 0.25/0.56  % Current number of unprocessed clauses: 372
% 0.25/0.56  % ...number of literals in the above   : 1700
% 0.25/0.56  % Current number of archived formulas  : 0
% 0.25/0.56  % Current number of archived clauses   : 0
% 0.25/0.56  % Clause-clause subsumption calls (NU) : 1727
% 0.25/0.56  % Rec. Clause-clause subsumption calls : 964
% 0.25/0.56  % Non-unit clause-clause subsumptions  : 99
% 0.25/0.56  % Unit Clause-clause subsumption calls : 36
% 0.25/0.56  % Rewrite failures with RHS unbound    : 0
% 0.25/0.56  % BW rewrite match attempts            : 9
% 0.25/0.56  % BW rewrite match successes           : 0
% 0.25/0.56  % Condensation attempts                : 0
% 0.25/0.56  % Condensation successes               : 0
% 0.25/0.56  % Termbank termtop insertions          : 12615
% 0.25/0.56  % Search garbage collected termcells   : 586
% 0.25/0.56  
% 0.25/0.56  % -------------------------------------------------
% 0.25/0.56  % User time                : 0.030 s
% 0.25/0.56  % System time              : 0.004 s
% 0.25/0.56  % Total time               : 0.034 s
% 0.25/0.56  % Maximum resident set size: 3680 pages
% 0.25/0.56  
% 0.25/0.56  % -------------------------------------------------
% 0.25/0.56  % User time                : 0.034 s
% 0.25/0.56  % System time              : 0.006 s
% 0.25/0.56  % Total time               : 0.040 s
% 0.25/0.56  % Maximum resident set size: 4864 pages
% 0.25/0.56  % E exiting
%------------------------------------------------------------------------------