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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : ITP012+1 : TPTP v8.1.0. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n017.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 : Sat Jul 16 22:45:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(thm_2Einteger_2EINT__DIVIDES__RSUB,conjecture,
    ! [X24,X25,X26] :
      ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))))
     => s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X26))) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm_2Einteger_2EINT__DIVIDES__RSUB) ).

fof(thm_2Einteger_2EINT__DIVIDES__RADD,axiom,
    ! [X24,X25,X26] :
      ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))))
     => s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X26))) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm_2Einteger_2EINT__DIVIDES__RADD) ).

fof(thm_2Einteger_2Eint__sub,axiom,
    ! [X9,X10] : s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X9),s(tyop_2Einteger_2Eint,X10))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X9),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X10))))),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm_2Einteger_2Eint__sub) ).

fof(thm_2Einteger_2EINT__DIVIDES__NEG,axiom,
    ! [X24,X25] :
      ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25)))
      & s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X24))),s(tyop_2Einteger_2Eint,X25))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',thm_2Einteger_2EINT__DIVIDES__NEG) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X24,X25,X26] :
        ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))))
       => s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X26))) ),
    inference(assume_negation,[status(cth)],[thm_2Einteger_2EINT__DIVIDES__RSUB]) ).

fof(c_0_5,plain,
    ! [X27,X28,X29] :
      ( ~ p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X27),s(tyop_2Einteger_2Eint,X28))))
      | s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X27),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X29),s(tyop_2Einteger_2Eint,X28))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X27),s(tyop_2Einteger_2Eint,X29))) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thm_2Einteger_2EINT__DIVIDES__RADD])])])]) ).

fof(c_0_6,plain,
    ! [X11,X12] : s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X11),s(tyop_2Einteger_2Eint,X12))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X11),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X12))))),
    inference(variable_rename,[status(thm)],[thm_2Einteger_2Eint__sub]) ).

fof(c_0_7,plain,
    ! [X26,X27,X26,X27] :
      ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X27))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X27)))
      & s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X26))),s(tyop_2Einteger_2Eint,X27))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X27))) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[thm_2Einteger_2EINT__DIVIDES__NEG])])]) ).

fof(c_0_8,negated_conjecture,
    ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk2_0))))
    & s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,esk3_0),s(tyop_2Einteger_2Eint,esk2_0))))) != s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk3_0))) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_9,plain,
    ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X2),s(tyop_2Einteger_2Eint,X3))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2)))
    | ~ p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X3)))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X2))))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X2))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,esk3_0),s(tyop_2Einteger_2Eint,esk2_0))))) != s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X2),s(tyop_2Einteger_2Eint,X3))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2)))
    | ~ p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X3)))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk2_0)))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : ITP012+1 : TPTP v8.1.0. Bugfixed v7.5.0.
% 0.08/0.14  % Command  : run_ET %s %d
% 0.14/0.36  % Computer : n017.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Thu Jun  2 14:21:13 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.26/1.45  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.45  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.45  # Preprocessing time       : 0.022 s
% 0.26/1.45  
% 0.26/1.45  # Proof found!
% 0.26/1.45  # SZS status Theorem
% 0.26/1.45  # SZS output start CNFRefutation
% See solution above
% 0.26/1.45  # Proof object total steps             : 16
% 0.26/1.45  # Proof object clause steps            : 7
% 0.26/1.45  # Proof object formula steps           : 9
% 0.26/1.45  # Proof object conjectures             : 6
% 0.26/1.45  # Proof object clause conjectures      : 3
% 0.26/1.45  # Proof object formula conjectures     : 3
% 0.26/1.45  # Proof object initial clauses used    : 5
% 0.26/1.45  # Proof object initial formulas used   : 4
% 0.26/1.45  # Proof object generating inferences   : 2
% 0.26/1.45  # Proof object simplifying inferences  : 3
% 0.26/1.45  # Training examples: 0 positive, 0 negative
% 0.26/1.45  # Parsed axioms                        : 52
% 0.26/1.45  # Removed by relevancy pruning/SinE    : 37
% 0.26/1.45  # Initial clauses                      : 209
% 0.26/1.45  # Removed in clause preprocessing      : 177
% 0.26/1.45  # Initial clauses in saturation        : 32
% 0.26/1.45  # Processed clauses                    : 33
% 0.26/1.45  # ...of these trivial                  : 0
% 0.26/1.45  # ...subsumed                          : 12
% 0.26/1.45  # ...remaining for further processing  : 21
% 0.26/1.45  # Other redundant clauses eliminated   : 0
% 0.26/1.45  # Clauses deleted for lack of memory   : 0
% 0.26/1.45  # Backward-subsumed                    : 0
% 0.26/1.45  # Backward-rewritten                   : 0
% 0.26/1.45  # Generated clauses                    : 82
% 0.26/1.45  # ...of the previous two non-trivial   : 35
% 0.26/1.45  # Contextual simplify-reflections      : 7
% 0.26/1.45  # Paramodulations                      : 80
% 0.26/1.45  # Factorizations                       : 2
% 0.26/1.45  # Equation resolutions                 : 0
% 0.26/1.45  # Current number of processed clauses  : 21
% 0.26/1.45  #    Positive orientable unit clauses  : 4
% 0.26/1.45  #    Positive unorientable unit clauses: 0
% 0.26/1.45  #    Negative unit clauses             : 1
% 0.26/1.45  #    Non-unit-clauses                  : 16
% 0.26/1.45  # Current number of unprocessed clauses: 34
% 0.26/1.45  # ...number of literals in the above   : 118
% 0.26/1.45  # Current number of archived formulas  : 0
% 0.26/1.45  # Current number of archived clauses   : 0
% 0.26/1.45  # Clause-clause subsumption calls (NU) : 77
% 0.26/1.45  # Rec. Clause-clause subsumption calls : 71
% 0.26/1.45  # Non-unit clause-clause subsumptions  : 19
% 0.26/1.45  # Unit Clause-clause subsumption calls : 0
% 0.26/1.45  # Rewrite failures with RHS unbound    : 0
% 0.26/1.45  # BW rewrite match attempts            : 14
% 0.26/1.45  # BW rewrite match successes           : 0
% 0.26/1.45  # Condensation attempts                : 0
% 0.26/1.45  # Condensation successes               : 0
% 0.26/1.45  # Termbank termtop insertions          : 12095
% 0.26/1.45  
% 0.26/1.45  # -------------------------------------------------
% 0.26/1.45  # User time                : 0.021 s
% 0.26/1.45  # System time              : 0.004 s
% 0.26/1.45  # Total time               : 0.025 s
% 0.26/1.45  # Maximum resident set size: 3060 pages
%------------------------------------------------------------------------------