TSTP Solution File: KRS193+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : KRS193+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n002.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 23:16:44 EDT 2024

% Result   : Theorem 0.18s 0.48s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   5 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   42 (  16   ~;  16   |;   5   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :   39 (   4 sgn  25   !;   1   ?)

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

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

fof(c_0_4,plain,
    ! [X25,X27,X28,X29,X30] :
      ( ( model(esk4_1(X25),X25)
        | status(X25,X27,cax) )
      & ( ~ status(X28,X29,cax)
        | ~ model(X30,X28) ) ),
    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)],[cax])])])])])]) ).

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

cnf(c_0_6,plain,
    ( ~ status(X1,X2,cax)
    | ~ model(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

fof(c_0_8,plain,
    ! [X19,X20,X22,X23,X24] :
      ( ( model(esk3_2(X19,X20),X19)
        | status(X19,X20,thm) )
      & ( ~ model(esk3_2(X19,X20),X20)
        | status(X19,X20,thm) )
      & ( ~ status(X22,X23,thm)
        | ~ model(X24,X22)
        | model(X24,X23) ) ),
    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_9,negated_conjecture,
    ~ isa(cax,thm),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[isa_cax_thm])]) ).

cnf(c_0_10,plain,
    ( isa(cax,X1)
    | ~ model(X2,esk1_2(cax,X1)) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

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

fof(c_0_12,negated_conjecture,
    ~ isa(cax,thm),
    inference(fof_nnf,[status(thm)],[c_0_9]) ).

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

cnf(c_0_14,plain,
    ( isa(cax,X1)
    | status(esk1_2(cax,X1),X2,thm) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    ~ isa(cax,thm),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11  % Problem    : KRS193+1 : TPTP v8.2.0. Bugfixed v5.4.0.
% 0.08/0.12  % Command    : run_E %s %d THM
% 0.12/0.33  % Computer : n002.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit   : 300
% 0.12/0.33  % WCLimit    : 300
% 0.12/0.33  % DateTime   : Sat May 18 22:17:08 EDT 2024
% 0.12/0.33  % CPUTime    : 
% 0.18/0.46  Running first-order theorem proving
% 0.18/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.18/0.48  # Version: 3.1.0
% 0.18/0.48  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # Starting sh5l with 300s (1) cores
% 0.18/0.48  # new_bool_1 with pid 20231 completed with status 0
% 0.18/0.48  # Result found by new_bool_1
% 0.18/0.48  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  # Search class: FGHNF-FFSM21-SFFFFFNN
% 0.18/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48  # SAT001_MinMin_p005000_rr_RG with pid 20234 completed with status 0
% 0.18/0.48  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.48  # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.18/0.48  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.18/0.48  # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48  # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.18/0.48  # Search class: FGHNF-FFSM21-SFFFFFNN
% 0.18/0.48  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48  # Preprocessing time       : 0.001 s
% 0.18/0.48  # Presaturation interreduction done
% 0.18/0.48  
% 0.18/0.48  # Proof found!
% 0.18/0.48  # SZS status Theorem
% 0.18/0.48  # SZS output start CNFRefutation
% See solution above
% 0.18/0.48  # Parsed axioms                        : 33
% 0.18/0.48  # Removed by relevancy pruning/SinE    : 23
% 0.18/0.48  # Initial clauses                      : 24
% 0.18/0.48  # Removed in clause preprocessing      : 0
% 0.18/0.48  # Initial clauses in saturation        : 24
% 0.18/0.48  # Processed clauses                    : 80
% 0.18/0.48  # ...of these trivial                  : 1
% 0.18/0.48  # ...subsumed                          : 6
% 0.18/0.48  # ...remaining for further processing  : 73
% 0.18/0.48  # Other redundant clauses eliminated   : 0
% 0.18/0.48  # Clauses deleted for lack of memory   : 0
% 0.18/0.48  # Backward-subsumed                    : 0
% 0.18/0.48  # Backward-rewritten                   : 0
% 0.18/0.48  # Generated clauses                    : 59
% 0.18/0.48  # ...of the previous two non-redundant : 41
% 0.18/0.48  # ...aggressively subsumed             : 0
% 0.18/0.48  # Contextual simplify-reflections      : 0
% 0.18/0.48  # Paramodulations                      : 59
% 0.18/0.48  # Factorizations                       : 0
% 0.18/0.48  # NegExts                              : 0
% 0.18/0.48  # Equation resolutions                 : 0
% 0.18/0.48  # Disequality decompositions           : 0
% 0.18/0.48  # Total rewrite steps                  : 17
% 0.18/0.48  # ...of those cached                   : 2
% 0.18/0.48  # Propositional unsat checks           : 0
% 0.18/0.48  #    Propositional check models        : 0
% 0.18/0.48  #    Propositional check unsatisfiable : 0
% 0.18/0.48  #    Propositional clauses             : 0
% 0.18/0.48  #    Propositional clauses after purity: 0
% 0.18/0.48  #    Propositional unsat core size     : 0
% 0.18/0.48  #    Propositional preprocessing time  : 0.000
% 0.18/0.48  #    Propositional encoding time       : 0.000
% 0.18/0.48  #    Propositional solver time         : 0.000
% 0.18/0.48  #    Success case prop preproc time    : 0.000
% 0.18/0.48  #    Success case prop encoding time   : 0.000
% 0.18/0.48  #    Success case prop solver time     : 0.000
% 0.18/0.48  # Current number of processed clauses  : 49
% 0.18/0.48  #    Positive orientable unit clauses  : 21
% 0.18/0.48  #    Positive unorientable unit clauses: 0
% 0.18/0.48  #    Negative unit clauses             : 7
% 0.18/0.48  #    Non-unit-clauses                  : 21
% 0.18/0.48  # Current number of unprocessed clauses: 7
% 0.18/0.48  # ...number of literals in the above   : 19
% 0.18/0.48  # Current number of archived formulas  : 0
% 0.18/0.48  # Current number of archived clauses   : 24
% 0.18/0.48  # Clause-clause subsumption calls (NU) : 25
% 0.18/0.48  # Rec. Clause-clause subsumption calls : 23
% 0.18/0.48  # Non-unit clause-clause subsumptions  : 4
% 0.18/0.48  # Unit Clause-clause subsumption calls : 30
% 0.18/0.48  # Rewrite failures with RHS unbound    : 0
% 0.18/0.48  # BW rewrite match attempts            : 12
% 0.18/0.48  # BW rewrite match successes           : 0
% 0.18/0.48  # Condensation attempts                : 0
% 0.18/0.48  # Condensation successes               : 0
% 0.18/0.48  # Termbank termtop insertions          : 2154
% 0.18/0.48  # Search garbage collected termcells   : 499
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.005 s
% 0.18/0.48  # System time              : 0.002 s
% 0.18/0.48  # Total time               : 0.008 s
% 0.18/0.48  # Maximum resident set size: 1720 pages
% 0.18/0.48  
% 0.18/0.48  # -------------------------------------------------
% 0.18/0.48  # User time                : 0.008 s
% 0.18/0.48  # System time              : 0.004 s
% 0.18/0.48  # Total time               : 0.012 s
% 0.18/0.48  # Maximum resident set size: 1740 pages
% 0.18/0.48  % E---3.1 exiting
% 0.18/0.48  % E exiting
%------------------------------------------------------------------------------