TSTP Solution File: SWV576-1 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWV576-1 : TPTP v8.1.2. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n010.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:54:56 EDT 2023

% Result   : Unsatisfiable 1780.11s 225.43s
% Output   : CNFRefutation 1780.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (  20 unt;   0 nHn;  12 RR)
%            Number of literals    :   24 (  19 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    9 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   3 con; 0-3 aty)
%            Number of variables   :   20 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_conjecture_0,negated_conjecture,
    c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))))),tc_nat) != c_Set_Oinsert(c_HOL_Ozero__class_Ozero(tc_nat),c_Set_Oinsert(c_HOL_Oone__class_Oone(tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),tc_nat),tc_nat),tc_nat),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_conjecture_0) ).

cnf(cls_One__nat__def_0,axiom,
    c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_One__nat__def_0) ).

cnf(cls_comp__arith_I115_J_0,axiom,
    c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_comp__arith_I115_J_0) ).

cnf(cls_numeral__3__eq__3_0,axiom,
    c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat) = c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)))),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_numeral__3__eq__3_0) ).

cnf(cls_atLeastLessThan0_0,axiom,
    c_SetInterval_Oord__class_OatLeastLessThan(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat) = c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_atLeastLessThan0_0) ).

cnf(cls_atLeastLessThanSuc_0,axiom,
    ( c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X2),tc_nat) = c_Set_Oinsert(X2,c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,tc_nat),tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_atLeastLessThanSuc_0) ).

cnf(cls_le0_0,axiom,
    c_lessequals(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_le0_0) ).

cnf(cls_atLeastLessThan__singleton_0,axiom,
    c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_atLeastLessThan__singleton_0) ).

cnf(cls_insert__commute_0,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    file('/export/starexec/sandbox2/tmp/tmp.uHPvJBFhaP/E---3.1_27989.p',cls_insert__commute_0) ).

cnf(c_0_9,negated_conjecture,
    c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))))),tc_nat) != c_Set_Oinsert(c_HOL_Ozero__class_Ozero(tc_nat),c_Set_Oinsert(c_HOL_Oone__class_Oone(tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Set_Oinsert(c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat),c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),tc_nat),tc_nat),tc_nat),
    cls_conjecture_0 ).

cnf(c_0_10,axiom,
    c_HOL_Oone__class_Oone(tc_nat) = c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),
    cls_One__nat__def_0 ).

cnf(c_0_11,axiom,
    c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))) = c_Int_Onumber__class_Onumber__of(c_Int_OBit0(c_Int_OBit1(c_Int_OPls)),tc_nat),
    cls_comp__arith_I115_J_0 ).

cnf(c_0_12,axiom,
    c_Int_Onumber__class_Onumber__of(c_Int_OBit1(c_Int_OBit1(c_Int_OPls)),tc_nat) = c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)))),
    cls_numeral__3__eq__3_0 ).

cnf(c_0_13,axiom,
    c_SetInterval_Oord__class_OatLeastLessThan(X1,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat) = c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),
    cls_atLeastLessThan0_0 ).

cnf(c_0_14,axiom,
    ( c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X2),tc_nat) = c_Set_Oinsert(X2,c_SetInterval_Oord__class_OatLeastLessThan(X1,X2,tc_nat),tc_nat)
    | ~ c_lessequals(X1,X2,tc_nat) ),
    cls_atLeastLessThanSuc_0 ).

cnf(c_0_15,axiom,
    c_lessequals(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),
    cls_le0_0 ).

cnf(c_0_16,axiom,
    c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_Orderings_Obot__class_Obot(tc_fun(tc_nat,tc_bool)),tc_nat),
    cls_atLeastLessThan__singleton_0 ).

cnf(c_0_17,negated_conjecture,
    c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))))),tc_nat) != c_Set_Oinsert(c_HOL_Ozero__class_Ozero(tc_nat),c_Set_Oinsert(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)),c_Set_Oinsert(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat))),c_Set_Oinsert(c_Suc(c_Suc(c_Suc(c_HOL_Ozero__class_Ozero(tc_nat)))),c_SetInterval_Oord__class_OatLeastLessThan(tc_nat,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),tc_nat),tc_nat),tc_nat),tc_nat),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_12]),c_0_13]) ).

cnf(c_0_18,plain,
    c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_SetInterval_Oord__class_OatLeastLessThan(c_HOL_Ozero__class_Ozero(tc_nat),X1,tc_nat),tc_nat),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,plain,
    c_SetInterval_Oord__class_OatLeastLessThan(X1,c_Suc(X1),tc_nat) = c_Set_Oinsert(X1,c_SetInterval_Oord__class_OatLeastLessThan(tc_nat,c_HOL_Ozero__class_Ozero(tc_nat),tc_nat),tc_nat),
    inference(rw,[status(thm)],[c_0_16,c_0_13]) ).

cnf(c_0_20,axiom,
    c_Set_Oinsert(X1,c_Set_Oinsert(X2,X3,X4),X4) = c_Set_Oinsert(X2,c_Set_Oinsert(X1,X3,X4),X4),
    cls_insert__commute_0 ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]),c_0_18]),c_0_19]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_20]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.25  % Problem    : SWV576-1 : TPTP v8.1.2. Released v4.1.0.
% 0.25/0.26  % Command    : run_E %s %d THM
% 0.25/0.46  % Computer : n010.cluster.edu
% 0.25/0.46  % Model    : x86_64 x86_64
% 0.25/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.25/0.46  % Memory   : 8042.1875MB
% 0.25/0.46  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.25/0.46  % CPULimit   : 2400
% 0.25/0.46  % WCLimit    : 300
% 0.25/0.46  % DateTime   : Tue Oct  3 03:41:35 EDT 2023
% 0.25/0.46  % CPUTime    : 
% 0.39/0.71  Running first-order theorem proving
% 0.39/0.71  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.uHPvJBFhaP/E---3.1_27989.p
% 1780.11/225.43  # Version: 3.1pre001
% 1780.11/225.43  # Preprocessing class: FMLSSMSSSSSNFFN.
% 1780.11/225.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1780.11/225.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1780.11/225.43  # Starting new_bool_3 with 600s (2) cores
% 1780.11/225.43  # Starting new_bool_1 with 600s (2) cores
% 1780.11/225.43  # Starting sh5l with 300s (1) cores
% 1780.11/225.43  # sh5l with pid 28070 completed with status 0
% 1780.11/225.43  # Result found by sh5l
% 1780.11/225.43  # Preprocessing class: FMLSSMSSSSSNFFN.
% 1780.11/225.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1780.11/225.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1780.11/225.43  # Starting new_bool_3 with 600s (2) cores
% 1780.11/225.43  # Starting new_bool_1 with 600s (2) cores
% 1780.11/225.43  # Starting sh5l with 300s (1) cores
% 1780.11/225.43  # SinE strategy is gf500_gu_R04_F100_L20000
% 1780.11/225.43  # Search class: FGHSM-SSLM31-DFFFFFNN
% 1780.11/225.43  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1780.11/225.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 163s (1) cores
% 1780.11/225.43  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 28075 completed with status 7
% 1780.11/225.43  # Starting sh5l with 31s (1) cores
% 1780.11/225.43  # sh5l with pid 28156 completed with status 7
% 1780.11/225.43  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 28s (1) cores
% 1780.11/225.43  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29070 completed with status 7
% 1780.11/225.43  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 1780.11/225.43  # G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 29786 completed with status 0
% 1780.11/225.43  # Result found by G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1780.11/225.43  # Preprocessing class: FMLSSMSSSSSNFFN.
% 1780.11/225.43  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1780.11/225.43  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 1780.11/225.43  # Starting new_bool_3 with 600s (2) cores
% 1780.11/225.43  # Starting new_bool_1 with 600s (2) cores
% 1780.11/225.43  # Starting sh5l with 300s (1) cores
% 1780.11/225.43  # SinE strategy is gf500_gu_R04_F100_L20000
% 1780.11/225.43  # Search class: FGHSM-SSLM31-DFFFFFNN
% 1780.11/225.43  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1780.11/225.43  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 163s (1) cores
% 1780.11/225.43  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 28075 completed with status 7
% 1780.11/225.43  # Starting sh5l with 31s (1) cores
% 1780.11/225.43  # sh5l with pid 28156 completed with status 7
% 1780.11/225.43  # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 28s (1) cores
% 1780.11/225.43  # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 29070 completed with status 7
% 1780.11/225.43  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 28s (1) cores
% 1780.11/225.43  # Preprocessing time       : 0.011 s
% 1780.11/225.43  # Presaturation interreduction done
% 1780.11/225.43  
% 1780.11/225.43  # Proof found!
% 1780.11/225.43  # SZS status Unsatisfiable
% 1780.11/225.43  # SZS output start CNFRefutation
% See solution above
% 1780.11/225.43  # Parsed axioms                        : 1458
% 1780.11/225.43  # Removed by relevancy pruning/SinE    : 231
% 1780.11/225.43  # Initial clauses                      : 1227
% 1780.11/225.43  # Removed in clause preprocessing      : 0
% 1780.11/225.43  # Initial clauses in saturation        : 1227
% 1780.11/225.43  # Processed clauses                    : 2537
% 1780.11/225.43  # ...of these trivial                  : 44
% 1780.11/225.43  # ...subsumed                          : 1099
% 1780.11/225.43  # ...remaining for further processing  : 1394
% 1780.11/225.43  # Other redundant clauses eliminated   : 17
% 1780.11/225.43  # Clauses deleted for lack of memory   : 0
% 1780.11/225.43  # Backward-subsumed                    : 26
% 1780.11/225.43  # Backward-rewritten                   : 41
% 1780.11/225.43  # Generated clauses                    : 3331
% 1780.11/225.43  # ...of the previous two non-redundant : 2763
% 1780.11/225.43  # ...aggressively subsumed             : 0
% 1780.11/225.43  # Contextual simplify-reflections      : 3
% 1780.11/225.43  # Paramodulations                      : 3310
% 1780.11/225.43  # Factorizations                       : 0
% 1780.11/225.43  # NegExts                              : 0
% 1780.11/225.43  # Equation resolutions                 : 21
% 1780.11/225.43  # Total rewrite steps                  : 2382
% 1780.11/225.43  # Propositional unsat checks           : 0
% 1780.11/225.43  #    Propositional check models        : 0
% 1780.11/225.43  #    Propositional check unsatisfiable : 0
% 1780.11/225.43  #    Propositional clauses             : 0
% 1780.11/225.43  #    Propositional clauses after purity: 0
% 1780.11/225.43  #    Propositional unsat core size     : 0
% 1780.11/225.43  #    Propositional preprocessing time  : 0.000
% 1780.11/225.43  #    Propositional encoding time       : 0.000
% 1780.11/225.43  #    Propositional solver time         : 0.000
% 1780.11/225.43  #    Success case prop preproc time    : 0.000
% 1780.11/225.43  #    Success case prop encoding time   : 0.000
% 1780.11/225.43  #    Success case prop solver time     : 0.000
% 1780.11/225.43  # Current number of processed clauses  : 453
% 1780.11/225.43  #    Positive orientable unit clauses  : 140
% 1780.11/225.43  #    Positive unorientable unit clauses: 8
% 1780.11/225.43  #    Negative unit clauses             : 110
% 1780.11/225.43  #    Non-unit-clauses                  : 195
% 1780.11/225.43  # Current number of unprocessed clauses: 2311
% 1780.11/225.43  # ...number of literals in the above   : 4546
% 1780.11/225.43  # Current number of archived formulas  : 0
% 1780.11/225.43  # Current number of archived clauses   : 941
% 1780.11/225.43  # Clause-clause subsumption calls (NU) : 65877
% 1780.11/225.43  # Rec. Clause-clause subsumption calls : 31556
% 1780.11/225.43  # Non-unit clause-clause subsumptions  : 384
% 1780.11/225.43  # Unit Clause-clause subsumption calls : 1385
% 1780.11/225.43  # Rewrite failures with RHS unbound    : 0
% 1780.11/225.43  # BW rewrite match attempts            : 652
% 1780.11/225.43  # BW rewrite match successes           : 211
% 1780.11/225.43  # Condensation attempts                : 0
% 1780.11/225.43  # Condensation successes               : 0
% 1780.11/225.43  # Termbank termtop insertions          : 111009
% 1780.11/225.43  
% 1780.11/225.43  # -------------------------------------------------
% 1780.11/225.43  # User time                : 219.317 s
% 1780.11/225.43  # System time              : 3.106 s
% 1780.11/225.43  # Total time               : 222.423 s
% 1780.11/225.43  # Maximum resident set size: 4376 pages
% 1780.11/225.43  
% 1780.11/225.43  # -------------------------------------------------
% 1780.11/225.43  # User time                : 219.366 s
% 1780.11/225.43  # System time              : 3.111 s
% 1780.11/225.43  # Total time               : 222.476 s
% 1780.11/225.43  # Maximum resident set size: 2748 pages
% 1780.11/225.43  % E---3.1 exiting
% 1780.11/225.44  % E---3.1 exiting
%------------------------------------------------------------------------------