TSTP Solution File: ITP015+4 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP015+4 : TPTP v8.1.2. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n014.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 : Sat May  4 08:06:28 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(thm_2Einteger__word_2Ei2w__0,conjecture,
    ! [X1] : s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    file('/export/starexec/sandbox2/tmp/tmp.c8OR0w50MT/E---3.1_4007.p',thm_2Einteger__word_2Ei2w__0) ).

fof(thm_2Einteger__word_2Ei2w__w2i,axiom,
    ! [X1,X12342] : s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger__word_2Ew2i_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),X12342))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),X12342),
    file('/export/starexec/sandbox2/tmp/tmp.c8OR0w50MT/E---3.1_4007.p',thm_2Einteger__word_2Ei2w__w2i) ).

fof(thm_2Ewords_2Ew2w__0,axiom,
    ! [X1,X2] : s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2Ew2w_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X2),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    file('/export/starexec/sandbox2/tmp/tmp.c8OR0w50MT/E---3.1_4007.p',thm_2Ewords_2Ew2w__0) ).

fof(thm_2Einteger__word_2Eword__0__w2i,axiom,
    ! [X1] : s(tyop_2Einteger_2Eint,c_2Einteger__word_2Ew2i_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    file('/export/starexec/sandbox2/tmp/tmp.c8OR0w50MT/E---3.1_4007.p',thm_2Einteger__word_2Eword__0__w2i) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] : s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(assume_negation,[status(cth)],[thm_2Einteger__word_2Ei2w__0]) ).

fof(c_0_5,plain,
    ! [X14129,X14130] : s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X14129),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger__word_2Ew2i_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X14129),X14130))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X14129),X14130),
    inference(variable_rename,[status(thm)],[thm_2Einteger__word_2Ei2w__w2i]) ).

fof(c_0_6,plain,
    ! [X16892,X16893] : s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X16892),c_2Ewords_2Ew2w_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X16893),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X16892),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(variable_rename,[status(thm)],[thm_2Ewords_2Ew2w__0]) ).

fof(c_0_7,plain,
    ! [X16639] : s(tyop_2Einteger_2Eint,c_2Einteger__word_2Ew2i_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X16639),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(variable_rename,[status(thm)],[thm_2Einteger__word_2Eword__0__w2i]) ).

fof(c_0_8,negated_conjecture,
    s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,esk1_0),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) != s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,esk1_0),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_9,plain,
    s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger__word_2Ew2i_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),X2))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),X2),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2Ew2w_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X2),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    s(tyop_2Einteger_2Eint,c_2Einteger__word_2Ew2i_2E1(s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,esk1_0),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) != s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,esk1_0),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Einteger__word_2Ei2w_2E1(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__of__num_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))))) = s(tyop_2Efcp_2Ecart(tyop_2Emin_2Ebool,X1),c_2Ewords_2En2w_2E1(s(tyop_2Enum_2Enum,c_2Enum_2E0_2E0))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 3.13/3.14  % Problem    : ITP015+4 : TPTP v8.1.2. Bugfixed v7.5.0.
% 3.13/3.16  % Command    : run_E %s %d THM
% 3.17/3.37  % Computer : n014.cluster.edu
% 3.17/3.37  % Model    : x86_64 x86_64
% 3.17/3.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 3.17/3.37  % Memory   : 8042.1875MB
% 3.17/3.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 3.17/3.37  % CPULimit   : 300
% 3.17/3.37  % WCLimit    : 300
% 3.17/3.37  % DateTime   : Fri May  3 11:57:06 EDT 2024
% 3.17/3.37  % CPUTime    : 
% 11.60/11.82  Running first-order theorem proving
% 11.60/11.82  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/tmp/tmp.c8OR0w50MT/E---3.1_4007.p
% 40.07/17.54  # Version: 3.1.0
% 40.07/17.54  # Preprocessing class: FMLLSMLLSSSNFFN.
% 40.07/17.54  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 40.07/17.54  # Starting new_bool_3 with 897s (3) cores
% 40.07/17.54  # Starting new_bool_1 with 897s (3) cores
% 40.07/17.54  # Starting sh5l with 299s (1) cores
% 40.07/17.54  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 40.07/17.54  # new_bool_3 with pid 4098 completed with status 0
% 40.07/17.54  # Result found by new_bool_3
% 40.07/17.54  # Preprocessing class: FMLLSMLLSSSNFFN.
% 40.07/17.54  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 40.07/17.54  # Starting new_bool_3 with 897s (3) cores
% 40.07/17.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 40.07/17.54  # Search class: FGHSM-SMLM33-DFFFFFNN
% 40.07/17.54  # Scheduled 6 strats onto 3 cores with 897 seconds (897 total)
% 40.07/17.54  # Starting SAT001_MinMin_p005000_rr with 485s (1) cores
% 40.07/17.54  # Starting new_bool_3 with 90s (1) cores
% 40.07/17.54  # Starting SAT001_CA_MinMin_p005000_rr with 81s (1) cores
% 40.07/17.54  # SAT001_CA_MinMin_p005000_rr with pid 4107 completed with status 0
% 40.07/17.54  # Result found by SAT001_CA_MinMin_p005000_rr
% 40.07/17.54  # Preprocessing class: FMLLSMLLSSSNFFN.
% 40.07/17.54  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 40.07/17.54  # Starting new_bool_3 with 897s (3) cores
% 40.07/17.54  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 40.07/17.54  # Search class: FGHSM-SMLM33-DFFFFFNN
% 40.07/17.54  # Scheduled 6 strats onto 3 cores with 897 seconds (897 total)
% 40.07/17.54  # Starting SAT001_MinMin_p005000_rr with 485s (1) cores
% 40.07/17.54  # Starting new_bool_3 with 90s (1) cores
% 40.07/17.54  # Starting SAT001_CA_MinMin_p005000_rr with 81s (1) cores
% 40.07/17.54  # Preprocessing time       : 0.192 s
% 40.07/17.54  # Presaturation interreduction done
% 40.07/17.54  
% 40.07/17.54  # Proof found!
% 40.07/17.54  # SZS status Theorem
% 40.07/17.54  # SZS output start CNFRefutation
% See solution above
% 40.07/17.54  # Parsed axioms                        : 19036
% 40.07/17.54  # Removed by relevancy pruning/SinE    : 16928
% 40.07/17.54  # Initial clauses                      : 5077
% 40.07/17.54  # Removed in clause preprocessing      : 929
% 40.07/17.54  # Initial clauses in saturation        : 4148
% 40.07/17.54  # Processed clauses                    : 5085
% 40.07/17.54  # ...of these trivial                  : 304
% 40.07/17.54  # ...subsumed                          : 1565
% 40.07/17.54  # ...remaining for further processing  : 3216
% 40.07/17.54  # Other redundant clauses eliminated   : 0
% 40.07/17.54  # Clauses deleted for lack of memory   : 0
% 40.07/17.54  # Backward-subsumed                    : 19
% 40.07/17.54  # Backward-rewritten                   : 119
% 40.07/17.54  # Generated clauses                    : 3637
% 40.07/17.54  # ...of the previous two non-redundant : 1396
% 40.07/17.54  # ...aggressively subsumed             : 0
% 40.07/17.54  # Contextual simplify-reflections      : 21
% 40.07/17.54  # Paramodulations                      : 3634
% 40.07/17.54  # Factorizations                       : 2
% 40.07/17.54  # NegExts                              : 0
% 40.07/17.54  # Equation resolutions                 : 1
% 40.07/17.54  # Disequality decompositions           : 0
% 40.07/17.54  # Total rewrite steps                  : 10748
% 40.07/17.54  # ...of those cached                   : 9145
% 40.07/17.54  # Propositional unsat checks           : 0
% 40.07/17.54  #    Propositional check models        : 0
% 40.07/17.54  #    Propositional check unsatisfiable : 0
% 40.07/17.54  #    Propositional clauses             : 0
% 40.07/17.54  #    Propositional clauses after purity: 0
% 40.07/17.54  #    Propositional unsat core size     : 0
% 40.07/17.54  #    Propositional preprocessing time  : 0.000
% 40.07/17.54  #    Propositional encoding time       : 0.000
% 40.07/17.54  #    Propositional solver time         : 0.000
% 40.07/17.54  #    Success case prop preproc time    : 0.000
% 40.07/17.54  #    Success case prop encoding time   : 0.000
% 40.07/17.54  #    Success case prop solver time     : 0.000
% 40.07/17.54  # Current number of processed clauses  : 148
% 40.07/17.54  #    Positive orientable unit clauses  : 99
% 40.07/17.54  #    Positive unorientable unit clauses: 1
% 40.07/17.54  #    Negative unit clauses             : 21
% 40.07/17.54  #    Non-unit-clauses                  : 27
% 40.07/17.54  # Current number of unprocessed clauses: 3310
% 40.07/17.54  # ...number of literals in the above   : 10602
% 40.07/17.54  # Current number of archived formulas  : 0
% 40.07/17.54  # Current number of archived clauses   : 3068
% 40.07/17.54  # Clause-clause subsumption calls (NU) : 3092275
% 40.07/17.54  # Rec. Clause-clause subsumption calls : 235369
% 40.07/17.54  # Non-unit clause-clause subsumptions  : 893
% 40.07/17.54  # Unit Clause-clause subsumption calls : 304
% 40.07/17.54  # Rewrite failures with RHS unbound    : 104
% 40.07/17.54  # BW rewrite match attempts            : 14980
% 40.07/17.54  # BW rewrite match successes           : 221
% 40.07/17.54  # Condensation attempts                : 8950
% 40.07/17.54  # Condensation successes               : 142
% 40.07/17.54  # Termbank termtop insertions          : 2433729
% 40.07/17.54  # Search garbage collected termcells   : 349063
% 40.07/17.54  
% 40.07/17.54  # -------------------------------------------------
% 40.07/17.54  # User time                : 3.532 s
% 40.07/17.54  # System time              : 0.114 s
% 40.07/17.54  # Total time               : 3.646 s
% 40.07/17.54  # Maximum resident set size: 62452 pages
% 40.07/17.54  
% 40.07/17.54  # -------------------------------------------------
% 40.07/17.54  # User time                : 11.172 s
% 40.07/17.54  # System time              : 0.243 s
% 40.07/17.54  # Total time               : 11.414 s
% 40.07/17.54  # Maximum resident set size: 51388 pages
% 40.07/17.54  % E---3.1 exiting
% 40.07/17.55  % E exiting
%------------------------------------------------------------------------------