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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---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 : n028.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:08:56 EDT 2024

% Result   : Theorem 31.73s 9.50s
% Output   : CNFRefutation 31.73s
% 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.7A4E6Ruxz9/E---3.1_1727.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.7A4E6Ruxz9/E---3.1_1727.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.7A4E6Ruxz9/E---3.1_1727.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.7A4E6Ruxz9/E---3.1_1727.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
% 0.03/0.13  % Problem    : ITP015+4 : TPTP v8.1.2. Bugfixed v7.5.0.
% 0.13/0.14  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n028.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 12:25:05 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 3.60/3.79  Running first-order model finding
% 3.60/3.79  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.7A4E6Ruxz9/E---3.1_1727.p
% 31.73/9.50  # Version: 3.1.0
% 31.73/9.50  # Preprocessing class: FMLLSMLLSSSNFFN.
% 31.73/9.50  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 31.73/9.50  # Starting new_bool_3 with 897s (3) cores
% 31.73/9.50  # Starting new_bool_1 with 897s (3) cores
% 31.73/9.50  # Starting sh5l with 299s (1) cores
% 31.73/9.50  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 31.73/9.50  # new_bool_3 with pid 1817 completed with status 0
% 31.73/9.50  # Result found by new_bool_3
% 31.73/9.50  # Preprocessing class: FMLLSMLLSSSNFFN.
% 31.73/9.50  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 31.73/9.50  # Starting new_bool_3 with 897s (3) cores
% 31.73/9.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.73/9.50  # Search class: FGHSM-SMLM33-DFFFFFNN
% 31.73/9.50  # Scheduled 6 strats onto 3 cores with 897 seconds (897 total)
% 31.73/9.50  # Starting SAT001_MinMin_p005000_rr with 485s (1) cores
% 31.73/9.50  # Starting new_bool_3 with 90s (1) cores
% 31.73/9.50  # Starting SAT001_CA_MinMin_p005000_rr with 81s (1) cores
% 31.73/9.50  # SAT001_CA_MinMin_p005000_rr with pid 1826 completed with status 0
% 31.73/9.50  # Result found by SAT001_CA_MinMin_p005000_rr
% 31.73/9.50  # Preprocessing class: FMLLSMLLSSSNFFN.
% 31.73/9.50  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 31.73/9.50  # Starting new_bool_3 with 897s (3) cores
% 31.73/9.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 31.73/9.50  # Search class: FGHSM-SMLM33-DFFFFFNN
% 31.73/9.50  # Scheduled 6 strats onto 3 cores with 897 seconds (897 total)
% 31.73/9.50  # Starting SAT001_MinMin_p005000_rr with 485s (1) cores
% 31.73/9.50  # Starting new_bool_3 with 90s (1) cores
% 31.73/9.50  # Starting SAT001_CA_MinMin_p005000_rr with 81s (1) cores
% 31.73/9.50  # Preprocessing time       : 0.154 s
% 31.73/9.50  # Presaturation interreduction done
% 31.73/9.50  
% 31.73/9.50  # Proof found!
% 31.73/9.50  # SZS status Theorem
% 31.73/9.50  # SZS output start CNFRefutation
% See solution above
% 31.73/9.50  # Parsed axioms                        : 19036
% 31.73/9.50  # Removed by relevancy pruning/SinE    : 16928
% 31.73/9.50  # Initial clauses                      : 5077
% 31.73/9.50  # Removed in clause preprocessing      : 929
% 31.73/9.50  # Initial clauses in saturation        : 4148
% 31.73/9.50  # Processed clauses                    : 4974
% 31.73/9.50  # ...of these trivial                  : 304
% 31.73/9.50  # ...subsumed                          : 1468
% 31.73/9.50  # ...remaining for further processing  : 3202
% 31.73/9.50  # Other redundant clauses eliminated   : 0
% 31.73/9.50  # Clauses deleted for lack of memory   : 0
% 31.73/9.50  # Backward-subsumed                    : 19
% 31.73/9.50  # Backward-rewritten                   : 117
% 31.73/9.50  # Generated clauses                    : 2765
% 31.73/9.50  # ...of the previous two non-redundant : 1158
% 31.73/9.50  # ...aggressively subsumed             : 0
% 31.73/9.50  # Contextual simplify-reflections      : 21
% 31.73/9.50  # Paramodulations                      : 2762
% 31.73/9.50  # Factorizations                       : 2
% 31.73/9.50  # NegExts                              : 0
% 31.73/9.50  # Equation resolutions                 : 1
% 31.73/9.50  # Disequality decompositions           : 0
% 31.73/9.50  # Total rewrite steps                  : 9955
% 31.73/9.50  # ...of those cached                   : 8514
% 31.73/9.50  # Propositional unsat checks           : 0
% 31.73/9.50  #    Propositional check models        : 0
% 31.73/9.50  #    Propositional check unsatisfiable : 0
% 31.73/9.50  #    Propositional clauses             : 0
% 31.73/9.50  #    Propositional clauses after purity: 0
% 31.73/9.50  #    Propositional unsat core size     : 0
% 31.73/9.50  #    Propositional preprocessing time  : 0.000
% 31.73/9.50  #    Propositional encoding time       : 0.000
% 31.73/9.50  #    Propositional solver time         : 0.000
% 31.73/9.50  #    Success case prop preproc time    : 0.000
% 31.73/9.50  #    Success case prop encoding time   : 0.000
% 31.73/9.50  #    Success case prop solver time     : 0.000
% 31.73/9.50  # Current number of processed clauses  : 136
% 31.73/9.50  #    Positive orientable unit clauses  : 89
% 31.73/9.50  #    Positive unorientable unit clauses: 1
% 31.73/9.50  #    Negative unit clauses             : 20
% 31.73/9.50  #    Non-unit-clauses                  : 26
% 31.73/9.50  # Current number of unprocessed clauses: 3206
% 31.73/9.50  # ...number of literals in the above   : 10433
% 31.73/9.50  # Current number of archived formulas  : 0
% 31.73/9.50  # Current number of archived clauses   : 3066
% 31.73/9.50  # Clause-clause subsumption calls (NU) : 3092177
% 31.73/9.50  # Rec. Clause-clause subsumption calls : 235292
% 31.73/9.50  # Non-unit clause-clause subsumptions  : 871
% 31.73/9.50  # Unit Clause-clause subsumption calls : 296
% 31.73/9.50  # Rewrite failures with RHS unbound    : 104
% 31.73/9.50  # BW rewrite match attempts            : 14937
% 31.73/9.50  # BW rewrite match successes           : 221
% 31.73/9.50  # Condensation attempts                : 7965
% 31.73/9.50  # Condensation successes               : 135
% 31.73/9.50  # Termbank termtop insertions          : 2418433
% 31.73/9.50  # Search garbage collected termcells   : 349063
% 31.73/9.50  
% 31.73/9.50  # -------------------------------------------------
% 31.73/9.50  # User time                : 3.514 s
% 31.73/9.50  # System time              : 0.111 s
% 31.73/9.50  # Total time               : 3.625 s
% 31.73/9.50  # Maximum resident set size: 62464 pages
% 31.73/9.50  
% 31.73/9.50  # -------------------------------------------------
% 31.73/9.50  # User time                : 11.088 s
% 31.73/9.50  # System time              : 0.238 s
% 31.73/9.50  # Total time               : 11.326 s
% 31.73/9.50  # Maximum resident set size: 51356 pages
% 31.73/9.50  % E---3.1 exiting
%------------------------------------------------------------------------------