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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n024.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 02:59:57 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   33 (  13 unt;   0 def)
%            Number of atoms       :  114 (   0 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  138 (  57   ~;  54   |;  22   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   10 (   9 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   25 (   6 sgn  17   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(the_axiom,conjecture,
    ( ! [X1] :
        ( cowlThing(X1)
        & ~ cowlNothing(X1) )
    & ! [X1] :
        ( xsd_string(X1)
      <=> ~ xsd_integer(X1) )
    & cowlThing(iV21080)
    & cC12(iV21080)
    & cC10(iV21081)
    & cowlThing(iV21081) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',the_axiom) ).

fof(axiom_0,axiom,
    ! [X1] :
      ( cowlThing(X1)
      & ~ cowlNothing(X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_0) ).

fof(axiom_2,axiom,
    ! [X1] :
      ( cC10(X1)
    <=> ( cC2(X1)
        & cC4(X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_2) ).

fof(axiom_1,axiom,
    ! [X1] :
      ( xsd_string(X1)
    <=> ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_1) ).

fof(axiom_3,axiom,
    ! [X1] :
      ( cC12(X1)
    <=> ? [X2] :
          ( rR1(X1,X2)
          & cC10(X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_3) ).

fof(axiom_15,axiom,
    cC4(iV21081),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_15) ).

fof(axiom_14,axiom,
    cC2(iV21081),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_14) ).

fof(axiom_11,axiom,
    rR1(iV21080,iV21081),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',axiom_11) ).

fof(c_0_8,negated_conjecture,
    ~ ( ! [X1] :
          ( cowlThing(X1)
          & ~ cowlNothing(X1) )
      & ! [X1] :
          ( xsd_string(X1)
        <=> ~ xsd_integer(X1) )
      & cowlThing(iV21080)
      & cC12(iV21080)
      & cC10(iV21081)
      & cowlThing(iV21081) ),
    inference(assume_negation,[status(cth)],[the_axiom]) ).

fof(c_0_9,negated_conjecture,
    ( ( ~ xsd_string(esk3_0)
      | xsd_integer(esk3_0)
      | ~ cowlThing(esk1_0)
      | cowlNothing(esk2_0)
      | ~ cowlThing(iV21080)
      | ~ cC12(iV21080)
      | ~ cC10(iV21081)
      | ~ cowlThing(iV21081) )
    & ( xsd_string(esk3_0)
      | ~ xsd_integer(esk3_0)
      | ~ cowlThing(esk1_0)
      | cowlNothing(esk2_0)
      | ~ cowlThing(iV21080)
      | ~ cC12(iV21080)
      | ~ cC10(iV21081)
      | ~ cowlThing(iV21081) ) ),
    inference(distribute,[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)],[c_0_8])])])])])])]) ).

fof(c_0_10,plain,
    ! [X2,X2] :
      ( cowlThing(X2)
      & ~ cowlNothing(X2) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_0])])])]) ).

fof(c_0_11,plain,
    ! [X2,X2] :
      ( ( cC2(X2)
        | ~ cC10(X2) )
      & ( cC4(X2)
        | ~ cC10(X2) )
      & ( ~ cC2(X2)
        | ~ cC4(X2)
        | cC10(X2) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])]) ).

cnf(c_0_12,negated_conjecture,
    ( cowlNothing(esk2_0)
    | xsd_string(esk3_0)
    | ~ cowlThing(iV21081)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080)
    | ~ cowlThing(iV21080)
    | ~ cowlThing(esk1_0)
    | ~ xsd_integer(esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    cowlThing(X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

fof(c_0_14,plain,
    ! [X2,X2] :
      ( ( ~ xsd_string(X2)
        | ~ xsd_integer(X2) )
      & ( xsd_integer(X2)
        | xsd_string(X2) ) ),
    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)],[axiom_1])])])])]) ).

fof(c_0_15,plain,
    ! [X3,X3,X5] :
      ( ( rR1(X3,esk4_1(X3))
        | ~ cC12(X3) )
      & ( cC10(esk4_1(X3))
        | ~ cC12(X3) )
      & ( ~ rR1(X3,X5)
        | ~ cC10(X5)
        | cC12(X3) ) ),
    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)],[axiom_3])])])])])])]) ).

cnf(c_0_16,plain,
    ( cC10(X1)
    | ~ cC4(X1)
    | ~ cC2(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,plain,
    cC4(iV21081),
    inference(split_conjunct,[status(thm)],[axiom_15]) ).

cnf(c_0_18,plain,
    cC2(iV21081),
    inference(split_conjunct,[status(thm)],[axiom_14]) ).

cnf(c_0_19,plain,
    ~ cowlNothing(X1),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_20,negated_conjecture,
    ( cowlNothing(esk2_0)
    | xsd_string(esk3_0)
    | ~ xsd_integer(esk3_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13]),c_0_13]),c_0_13])]) ).

cnf(c_0_21,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_22,plain,
    ( cC12(X1)
    | ~ cC10(X2)
    | ~ rR1(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,plain,
    rR1(iV21080,iV21081),
    inference(split_conjunct,[status(thm)],[axiom_11]) ).

cnf(c_0_24,plain,
    cC10(iV21081),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_25,negated_conjecture,
    ( cowlNothing(esk2_0)
    | xsd_integer(esk3_0)
    | ~ cowlThing(iV21081)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080)
    | ~ cowlThing(iV21080)
    | ~ cowlThing(esk1_0)
    | ~ xsd_string(esk3_0) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_26,negated_conjecture,
    ( xsd_string(esk3_0)
    | ~ cC12(iV21080)
    | ~ cC10(iV21081) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_27,plain,
    cC12(iV21080),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_28,negated_conjecture,
    ( cowlNothing(esk2_0)
    | xsd_integer(esk3_0)
    | ~ xsd_string(esk3_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_13]),c_0_13]),c_0_13])]) ).

cnf(c_0_29,negated_conjecture,
    xsd_string(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]),c_0_27])]) ).

cnf(c_0_30,plain,
    ( ~ xsd_integer(X1)
    | ~ xsd_string(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_31,negated_conjecture,
    xsd_integer(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_24])]),c_0_19]),c_0_27]),c_0_29])]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n024.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jun  7 09:08:20 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.015 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 33
% 0.23/1.41  # Proof object clause steps            : 19
% 0.23/1.41  # Proof object formula steps           : 14
% 0.23/1.41  # Proof object conjectures             : 11
% 0.23/1.41  # Proof object clause conjectures      : 8
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 11
% 0.23/1.41  # Proof object initial formulas used   : 8
% 0.23/1.41  # Proof object generating inferences   : 4
% 0.23/1.41  # Proof object simplifying inferences  : 25
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 17
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 2
% 0.23/1.41  # Initial clauses                      : 26
% 0.23/1.41  # Removed in clause preprocessing      : 3
% 0.23/1.41  # Initial clauses in saturation        : 23
% 0.23/1.41  # Processed clauses                    : 30
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 1
% 0.23/1.41  # ...remaining for further processing  : 29
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 1
% 0.23/1.41  # Backward-rewritten                   : 3
% 0.23/1.41  # Generated clauses                    : 21
% 0.23/1.41  # ...of the previous two non-trivial   : 17
% 0.23/1.41  # Contextual simplify-reflections      : 1
% 0.23/1.41  # Paramodulations                      : 21
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 25
% 0.23/1.41  #    Positive orientable unit clauses  : 7
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 3
% 0.23/1.41  #    Non-unit-clauses                  : 15
% 0.23/1.41  # Current number of unprocessed clauses: 9
% 0.23/1.41  # ...number of literals in the above   : 19
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 5
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 42
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 31
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 2
% 0.23/1.41  # Unit Clause-clause subsumption calls : 27
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 2
% 0.23/1.41  # BW rewrite match successes           : 2
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 1376
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.014 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.017 s
% 0.23/1.41  # Maximum resident set size: 2696 pages
%------------------------------------------------------------------------------