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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SET839-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n015.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:21:02 EDT 2023

% Result   : Unsatisfiable 38.92s 5.65s
% Output   : CNFRefutation 38.92s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   19 (   6 unt;   6 nHn;  11 RR)
%            Number of literals    :   40 (   5 equ;  16 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-3 aty)
%            Number of variables   :   41 (   6 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__antisym_0,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p',cls_Set_Osubset__antisym_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ( c_lessequals(X1,X2,tc_set(t_a))
    | ~ c_in(X2,v_S,tc_set(t_a))
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    file('/export/starexec/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p',cls_conjecture_1) ).

cnf(cls_Set_OsubsetI_0,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    file('/export/starexec/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OsubsetI_1,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    file('/export/starexec/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p',cls_Set_OinsertCI_1) ).

cnf(cls_conjecture_0,negated_conjecture,
    ~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p',cls_conjecture_0) ).

cnf(c_0_6,axiom,
    ( X2 = X1
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X2,X1,tc_set(X3)) ),
    cls_Set_Osubset__antisym_0 ).

cnf(c_0_7,negated_conjecture,
    ( c_lessequals(X1,X2,tc_set(t_a))
    | ~ c_in(X2,v_S,tc_set(t_a))
    | ~ c_in(X1,v_S,tc_set(t_a)) ),
    cls_conjecture_1 ).

cnf(c_0_8,negated_conjecture,
    ( X1 = X2
    | ~ c_in(X1,v_S,tc_set(t_a))
    | ~ c_in(X2,v_S,tc_set(t_a)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).

cnf(c_0_9,axiom,
    ( c_in(c_Main_OsubsetI__1(X1,X2,X3),X1,X3)
    | c_lessequals(X1,X2,tc_set(X3)) ),
    cls_Set_OsubsetI_0 ).

cnf(c_0_10,negated_conjecture,
    ( c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = X2
    | c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
    | ~ c_in(X2,v_S,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_11,axiom,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    cls_Set_OsubsetI_1 ).

cnf(c_0_12,negated_conjecture,
    ( c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)) = c_Main_OsubsetI__1(v_S,X2,tc_set(t_a))
    | c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
    | c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_10,c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ( c_lessequals(v_S,X1,tc_set(tc_set(t_a)))
    | c_lessequals(v_S,X2,tc_set(tc_set(t_a)))
    | ~ c_in(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_14,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    cls_Set_OinsertCI_1 ).

cnf(c_0_15,negated_conjecture,
    ~ c_lessequals(v_S,c_insert(X1,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
    cls_conjecture_0 ).

cnf(c_0_16,negated_conjecture,
    ( c_lessequals(v_S,c_insert(c_Main_OsubsetI__1(v_S,X1,tc_set(t_a)),X2,tc_set(t_a)),tc_set(tc_set(t_a)))
    | c_lessequals(v_S,X1,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    c_lessequals(v_S,X1,tc_set(tc_set(t_a))),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.21  % Problem    : SET839-1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.22  % Command    : run_E %s %d THM
% 0.19/0.41  % Computer : n015.cluster.edu
% 0.19/0.41  % Model    : x86_64 x86_64
% 0.19/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.41  % Memory   : 8042.1875MB
% 0.19/0.41  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.19/0.41  % CPULimit   : 2400
% 0.19/0.41  % WCLimit    : 300
% 0.19/0.41  % DateTime   : Mon Oct  2 16:48:46 EDT 2023
% 0.19/0.41  % CPUTime    : 
% 0.24/0.61  Running first-order theorem proving
% 0.24/0.61  Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.NI2gRhe22K/E---3.1_18183.p
% 38.92/5.65  # Version: 3.1pre001
% 38.92/5.65  # Preprocessing class: FMLMSMSMSSSNFFN.
% 38.92/5.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.92/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 38.92/5.65  # Starting new_bool_3 with 300s (1) cores
% 38.92/5.65  # Starting new_bool_1 with 300s (1) cores
% 38.92/5.65  # Starting sh5l with 300s (1) cores
% 38.92/5.65  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18263 completed with status 0
% 38.92/5.65  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 38.92/5.65  # Preprocessing class: FMLMSMSMSSSNFFN.
% 38.92/5.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.92/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 38.92/5.65  # No SInE strategy applied
% 38.92/5.65  # Search class: FGHSM-SSLM33-MFFFFFNN
% 38.92/5.65  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 38.92/5.65  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 38.92/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 38.92/5.65  # Starting new_bool_3 with 136s (1) cores
% 38.92/5.65  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 38.92/5.65  # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 38.92/5.65  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 18274 completed with status 0
% 38.92/5.65  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 38.92/5.65  # Preprocessing class: FMLMSMSMSSSNFFN.
% 38.92/5.65  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 38.92/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 38.92/5.65  # No SInE strategy applied
% 38.92/5.65  # Search class: FGHSM-SSLM33-MFFFFFNN
% 38.92/5.65  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 38.92/5.65  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 38.92/5.65  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 38.92/5.65  # Preprocessing time       : 0.010 s
% 38.92/5.65  # Presaturation interreduction done
% 38.92/5.65  
% 38.92/5.65  # Proof found!
% 38.92/5.65  # SZS status Unsatisfiable
% 38.92/5.65  # SZS output start CNFRefutation
% See solution above
% 38.92/5.65  # Parsed axioms                        : 1359
% 38.92/5.65  # Removed by relevancy pruning/SinE    : 0
% 38.92/5.65  # Initial clauses                      : 1359
% 38.92/5.65  # Removed in clause preprocessing      : 1
% 38.92/5.65  # Initial clauses in saturation        : 1358
% 38.92/5.65  # Processed clauses                    : 14853
% 38.92/5.65  # ...of these trivial                  : 195
% 38.92/5.65  # ...subsumed                          : 9588
% 38.92/5.65  # ...remaining for further processing  : 5070
% 38.92/5.65  # Other redundant clauses eliminated   : 123
% 38.92/5.65  # Clauses deleted for lack of memory   : 0
% 38.92/5.65  # Backward-subsumed                    : 298
% 38.92/5.65  # Backward-rewritten                   : 265
% 38.92/5.65  # Generated clauses                    : 100350
% 38.92/5.65  # ...of the previous two non-redundant : 96496
% 38.92/5.65  # ...aggressively subsumed             : 0
% 38.92/5.65  # Contextual simplify-reflections      : 21
% 38.92/5.65  # Paramodulations                      : 100184
% 38.92/5.65  # Factorizations                       : 4
% 38.92/5.65  # NegExts                              : 0
% 38.92/5.65  # Equation resolutions                 : 161
% 38.92/5.65  # Total rewrite steps                  : 28420
% 38.92/5.65  # Propositional unsat checks           : 1
% 38.92/5.65  #    Propositional check models        : 0
% 38.92/5.65  #    Propositional check unsatisfiable : 0
% 38.92/5.65  #    Propositional clauses             : 0
% 38.92/5.65  #    Propositional clauses after purity: 0
% 38.92/5.65  #    Propositional unsat core size     : 0
% 38.92/5.65  #    Propositional preprocessing time  : 0.000
% 38.92/5.65  #    Propositional encoding time       : 0.555
% 38.92/5.65  #    Propositional solver time         : 0.237
% 38.92/5.65  #    Success case prop preproc time    : 0.000
% 38.92/5.65  #    Success case prop encoding time   : 0.000
% 38.92/5.65  #    Success case prop solver time     : 0.000
% 38.92/5.65  # Current number of processed clauses  : 3184
% 38.92/5.65  #    Positive orientable unit clauses  : 329
% 38.92/5.65  #    Positive unorientable unit clauses: 0
% 38.92/5.65  #    Negative unit clauses             : 142
% 38.92/5.65  #    Non-unit-clauses                  : 2713
% 38.92/5.65  # Current number of unprocessed clauses: 83010
% 38.92/5.65  # ...number of literals in the above   : 242012
% 38.92/5.65  # Current number of archived formulas  : 0
% 38.92/5.65  # Current number of archived clauses   : 1886
% 38.92/5.65  # Clause-clause subsumption calls (NU) : 4455272
% 38.92/5.65  # Rec. Clause-clause subsumption calls : 3585901
% 38.92/5.65  # Non-unit clause-clause subsumptions  : 5868
% 38.92/5.65  # Unit Clause-clause subsumption calls : 34890
% 38.92/5.65  # Rewrite failures with RHS unbound    : 0
% 38.92/5.65  # BW rewrite match attempts            : 337
% 38.92/5.65  # BW rewrite match successes           : 176
% 38.92/5.65  # Condensation attempts                : 0
% 38.92/5.65  # Condensation successes               : 0
% 38.92/5.65  # Termbank termtop insertions          : 7011911
% 38.92/5.65  
% 38.92/5.65  # -------------------------------------------------
% 38.92/5.65  # User time                : 4.659 s
% 38.92/5.65  # System time              : 0.156 s
% 38.92/5.65  # Total time               : 4.815 s
% 38.92/5.65  # Maximum resident set size: 3716 pages
% 38.92/5.65  
% 38.92/5.65  # -------------------------------------------------
% 38.92/5.65  # User time                : 23.578 s
% 38.92/5.65  # System time              : 0.568 s
% 38.92/5.65  # Total time               : 24.146 s
% 38.92/5.65  # Maximum resident set size: 2396 pages
% 38.92/5.65  % E---3.1 exiting
% 38.92/5.65  % E---3.1 exiting
%------------------------------------------------------------------------------