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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---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 : n023.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:24:08 EDT 2023

% Result   : Unsatisfiable 33.04s 5.04s
% Output   : CNFRefutation 33.04s
% 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/sandbox2/tmp/tmp.QSnH2QB0oK/E---3.1_22714.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/sandbox2/tmp/tmp.QSnH2QB0oK/E---3.1_22714.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/sandbox2/tmp/tmp.QSnH2QB0oK/E---3.1_22714.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/sandbox2/tmp/tmp.QSnH2QB0oK/E---3.1_22714.p',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OinsertCI_1,axiom,
    c_in(X1,c_insert(X1,X2,X3),X3),
    file('/export/starexec/sandbox2/tmp/tmp.QSnH2QB0oK/E---3.1_22714.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/sandbox2/tmp/tmp.QSnH2QB0oK/E---3.1_22714.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.02/0.10  % Problem    : SET839-1 : TPTP v8.1.2. Released v3.2.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.10/0.32  % Computer : n023.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 2400
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Mon Oct  2 16:48:07 EDT 2023
% 0.10/0.32  % CPUTime    : 
% 0.16/0.48  Running first-order model finding
% 0.16/0.48  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.QSnH2QB0oK/E---3.1_22714.p
% 33.04/5.04  # Version: 3.1pre001
% 33.04/5.04  # Preprocessing class: FMLMSMSMSSSNFFN.
% 33.04/5.04  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.04/5.04  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 33.04/5.04  # Starting new_bool_3 with 300s (1) cores
% 33.04/5.04  # Starting new_bool_1 with 300s (1) cores
% 33.04/5.04  # Starting sh5l with 300s (1) cores
% 33.04/5.04  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22791 completed with status 0
% 33.04/5.04  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 33.04/5.04  # Preprocessing class: FMLMSMSMSSSNFFN.
% 33.04/5.04  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.04/5.04  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 33.04/5.04  # No SInE strategy applied
% 33.04/5.04  # Search class: FGHSM-SSLM33-MFFFFFNN
% 33.04/5.04  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.04/5.04  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 33.04/5.04  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 33.04/5.04  # Starting new_bool_3 with 136s (1) cores
% 33.04/5.04  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 33.04/5.04  # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 33.04/5.04  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 22798 completed with status 0
% 33.04/5.04  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 33.04/5.04  # Preprocessing class: FMLMSMSMSSSNFFN.
% 33.04/5.04  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.04/5.04  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 33.04/5.04  # No SInE strategy applied
% 33.04/5.04  # Search class: FGHSM-SSLM33-MFFFFFNN
% 33.04/5.04  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 33.04/5.04  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 33.04/5.04  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 33.04/5.04  # Preprocessing time       : 0.009 s
% 33.04/5.04  # Presaturation interreduction done
% 33.04/5.04  
% 33.04/5.04  # Proof found!
% 33.04/5.04  # SZS status Unsatisfiable
% 33.04/5.04  # SZS output start CNFRefutation
% See solution above
% 33.04/5.04  # Parsed axioms                        : 1359
% 33.04/5.04  # Removed by relevancy pruning/SinE    : 0
% 33.04/5.04  # Initial clauses                      : 1359
% 33.04/5.04  # Removed in clause preprocessing      : 1
% 33.04/5.04  # Initial clauses in saturation        : 1358
% 33.04/5.04  # Processed clauses                    : 14875
% 33.04/5.04  # ...of these trivial                  : 198
% 33.04/5.04  # ...subsumed                          : 9593
% 33.04/5.04  # ...remaining for further processing  : 5084
% 33.04/5.04  # Other redundant clauses eliminated   : 123
% 33.04/5.04  # Clauses deleted for lack of memory   : 0
% 33.04/5.04  # Backward-subsumed                    : 297
% 33.04/5.04  # Backward-rewritten                   : 269
% 33.04/5.04  # Generated clauses                    : 101517
% 33.04/5.04  # ...of the previous two non-redundant : 97647
% 33.04/5.04  # ...aggressively subsumed             : 0
% 33.04/5.04  # Contextual simplify-reflections      : 23
% 33.04/5.04  # Paramodulations                      : 101350
% 33.04/5.04  # Factorizations                       : 4
% 33.04/5.04  # NegExts                              : 0
% 33.04/5.04  # Equation resolutions                 : 161
% 33.04/5.04  # Total rewrite steps                  : 28436
% 33.04/5.04  # Propositional unsat checks           : 1
% 33.04/5.04  #    Propositional check models        : 0
% 33.04/5.04  #    Propositional check unsatisfiable : 0
% 33.04/5.04  #    Propositional clauses             : 0
% 33.04/5.04  #    Propositional clauses after purity: 0
% 33.04/5.04  #    Propositional unsat core size     : 0
% 33.04/5.04  #    Propositional preprocessing time  : 0.000
% 33.04/5.04  #    Propositional encoding time       : 0.407
% 33.04/5.04  #    Propositional solver time         : 0.204
% 33.04/5.04  #    Success case prop preproc time    : 0.000
% 33.04/5.04  #    Success case prop encoding time   : 0.000
% 33.04/5.04  #    Success case prop solver time     : 0.000
% 33.04/5.04  # Current number of processed clauses  : 3194
% 33.04/5.04  #    Positive orientable unit clauses  : 331
% 33.04/5.04  #    Positive unorientable unit clauses: 0
% 33.04/5.04  #    Negative unit clauses             : 142
% 33.04/5.04  #    Non-unit-clauses                  : 2721
% 33.04/5.04  # Current number of unprocessed clauses: 84135
% 33.04/5.04  # ...number of literals in the above   : 245921
% 33.04/5.04  # Current number of archived formulas  : 0
% 33.04/5.04  # Current number of archived clauses   : 1890
% 33.04/5.04  # Clause-clause subsumption calls (NU) : 4467684
% 33.04/5.04  # Rec. Clause-clause subsumption calls : 3587825
% 33.04/5.04  # Non-unit clause-clause subsumptions  : 5887
% 33.04/5.04  # Unit Clause-clause subsumption calls : 35543
% 33.04/5.04  # Rewrite failures with RHS unbound    : 0
% 33.04/5.04  # BW rewrite match attempts            : 342
% 33.04/5.04  # BW rewrite match successes           : 180
% 33.04/5.04  # Condensation attempts                : 0
% 33.04/5.04  # Condensation successes               : 0
% 33.04/5.04  # Termbank termtop insertions          : 6977309
% 33.04/5.04  
% 33.04/5.04  # -------------------------------------------------
% 33.04/5.04  # User time                : 4.229 s
% 33.04/5.04  # System time              : 0.134 s
% 33.04/5.04  # Total time               : 4.363 s
% 33.04/5.04  # Maximum resident set size: 3720 pages
% 33.04/5.04  
% 33.04/5.04  # -------------------------------------------------
% 33.04/5.04  # User time                : 21.146 s
% 33.04/5.04  # System time              : 0.565 s
% 33.04/5.04  # Total time               : 21.711 s
% 33.04/5.04  # Maximum resident set size: 2396 pages
% 33.04/5.04  % E---3.1 exiting
%------------------------------------------------------------------------------