TSTP Solution File: KRS200+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : KRS200+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n018.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  : 600s
% DateTime : Sun Jul 17 03:00:05 EDT 2022

% Result   : Theorem 0.20s 1.39s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  11 unt;   0 def)
%            Number of atoms       :   59 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   61 (  26   ~;  19   |;  11   &)
%                                         (   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    :   12 (  12 usr;   7 con; 0-2 aty)
%            Number of variables   :   52 (  13 sgn  26   !;   9   ?)

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

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

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

fof(nota_unp_thm,conjecture,
    nota(unp,thm),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nota_unp_thm) ).

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(contradiction,axiom,
    ? [X10] :
    ! [X9] : ~ model(X9,X10),
    file('/export/starexec/sandbox2/benchmark/Axioms/KRS001+1.ax',contradiction) ).

fof(c_0_6,plain,
    ! [X5,X6,X7,X5,X6,X10] :
      ( ( ~ model(X7,X5)
        | status(X5,X6,unp) )
      & ( model(esk4_2(X5,X6),X6)
        | status(X5,X6,unp) )
      & ( ~ status(X5,X6,unp)
        | model(esk5_2(X5,X6),X5)
        | ~ model(X10,X6) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unp])])])])])])]) ).

fof(c_0_7,plain,
    ( model(esk21_0,esk22_0)
    & ~ model(esk21_0,esk23_0)
    & model(esk24_0,esk23_0) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[non_thm_spt])])])])]) ).

fof(c_0_8,plain,
    ! [X9,X10,X11,X12,X9,X10] :
      ( ( ~ status(X11,X12,X9)
        | status(X11,X12,X10)
        | nota(X9,X10) )
      & ( status(esk1_2(X9,X10),esk2_2(X9,X10),X9)
        | ~ nota(X9,X10) )
      & ( ~ status(esk1_2(X9,X10),esk2_2(X9,X10),X10)
        | ~ nota(X9,X10) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[nota])])])])])])])]) ).

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

cnf(c_0_10,plain,
    model(esk24_0,esk23_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_11,negated_conjecture,
    ~ nota(unp,thm),
    inference(assume_negation,[status(cth)],[nota_unp_thm]) ).

fof(c_0_12,plain,
    ! [X4,X5,X4,X5,X7] :
      ( ( model(esk3_2(X4,X5),X4)
        | status(X4,X5,thm) )
      & ( ~ model(esk3_2(X4,X5),X5)
        | status(X4,X5,thm) )
      & ( ~ status(X4,X5,thm)
        | ~ model(X7,X4)
        | model(X7,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thm])])])])])])]) ).

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

cnf(c_0_14,plain,
    status(esk23_0,X1,unp),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

fof(c_0_15,negated_conjecture,
    ~ nota(unp,thm),
    inference(fof_simplification,[status(thm)],[c_0_11]) ).

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

cnf(c_0_17,plain,
    ( nota(unp,X1)
    | status(esk23_0,X2,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,negated_conjecture,
    ~ nota(unp,thm),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_19,plain,
    ! [X12] : ~ model(X12,esk10_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[contradiction])])]) ).

cnf(c_0_20,plain,
    ( model(X1,X2)
    | ~ model(X1,esk23_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).

cnf(c_0_21,plain,
    ~ model(X1,esk10_0),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_22,plain,
    model(esk24_0,X1),
    inference(spm,[status(thm)],[c_0_20,c_0_10]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : KRS200+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.03/0.12  % Command  : run_ET %s %d
% 0.12/0.32  % Computer : n018.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Tue Jun  7 14:16:36 EDT 2022
% 0.12/0.32  % CPUTime  : 
% 0.20/1.39  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.20/1.39  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.20/1.39  # Preprocessing time       : 0.010 s
% 0.20/1.39  
% 0.20/1.39  # Proof found!
% 0.20/1.39  # SZS status Theorem
% 0.20/1.39  # SZS output start CNFRefutation
% See solution above
% 0.20/1.39  # Proof object total steps             : 24
% 0.20/1.39  # Proof object clause steps            : 11
% 0.20/1.39  # Proof object formula steps           : 13
% 0.20/1.39  # Proof object conjectures             : 4
% 0.20/1.39  # Proof object clause conjectures      : 1
% 0.20/1.39  # Proof object formula conjectures     : 3
% 0.20/1.39  # Proof object initial clauses used    : 6
% 0.20/1.39  # Proof object initial formulas used   : 6
% 0.20/1.39  # Proof object generating inferences   : 5
% 0.20/1.39  # Proof object simplifying inferences  : 1
% 0.20/1.39  # Training examples: 0 positive, 0 negative
% 0.20/1.39  # Parsed axioms                        : 33
% 0.20/1.39  # Removed by relevancy pruning/SinE    : 23
% 0.20/1.39  # Initial clauses                      : 25
% 0.20/1.39  # Removed in clause preprocessing      : 0
% 0.20/1.39  # Initial clauses in saturation        : 25
% 0.20/1.39  # Processed clauses                    : 47
% 0.20/1.39  # ...of these trivial                  : 1
% 0.20/1.39  # ...subsumed                          : 1
% 0.20/1.39  # ...remaining for further processing  : 45
% 0.20/1.39  # Other redundant clauses eliminated   : 0
% 0.20/1.39  # Clauses deleted for lack of memory   : 0
% 0.20/1.39  # Backward-subsumed                    : 0
% 0.20/1.39  # Backward-rewritten                   : 1
% 0.20/1.39  # Generated clauses                    : 70
% 0.20/1.39  # ...of the previous two non-trivial   : 61
% 0.20/1.39  # Contextual simplify-reflections      : 0
% 0.20/1.39  # Paramodulations                      : 68
% 0.20/1.39  # Factorizations                       : 2
% 0.20/1.39  # Equation resolutions                 : 0
% 0.20/1.39  # Current number of processed clauses  : 44
% 0.20/1.39  #    Positive orientable unit clauses  : 20
% 0.20/1.39  #    Positive unorientable unit clauses: 0
% 0.20/1.39  #    Negative unit clauses             : 8
% 0.20/1.39  #    Non-unit-clauses                  : 16
% 0.20/1.39  # Current number of unprocessed clauses: 38
% 0.20/1.39  # ...number of literals in the above   : 85
% 0.20/1.39  # Current number of archived formulas  : 0
% 0.20/1.39  # Current number of archived clauses   : 1
% 0.20/1.39  # Clause-clause subsumption calls (NU) : 13
% 0.20/1.39  # Rec. Clause-clause subsumption calls : 13
% 0.20/1.39  # Non-unit clause-clause subsumptions  : 0
% 0.20/1.39  # Unit Clause-clause subsumption calls : 57
% 0.20/1.39  # Rewrite failures with RHS unbound    : 0
% 0.20/1.39  # BW rewrite match attempts            : 12
% 0.20/1.39  # BW rewrite match successes           : 1
% 0.20/1.39  # Condensation attempts                : 0
% 0.20/1.39  # Condensation successes               : 0
% 0.20/1.39  # Termbank termtop insertions          : 2201
% 0.20/1.39  
% 0.20/1.39  # -------------------------------------------------
% 0.20/1.39  # User time                : 0.008 s
% 0.20/1.39  # System time              : 0.003 s
% 0.20/1.39  # Total time               : 0.011 s
% 0.20/1.39  # Maximum resident set size: 3024 pages
%------------------------------------------------------------------------------