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

View Problem - Process Solution

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

% Computer : n001.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:11 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_Set_Osubset__trans_0,axiom,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    file('/export/starexec/sandbox2/tmp/tmp.WEuyu5kt3B/E---3.1_9553.p',cls_Set_Osubset__trans_0) ).

cnf(cls_conjecture_0,negated_conjecture,
    c_lessequals(v_x,v_y,tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/tmp/tmp.WEuyu5kt3B/E---3.1_9553.p',cls_conjecture_0) ).

cnf(cls_Zorn_OAbrial__axiom1_0,axiom,
    c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
    file('/export/starexec/sandbox2/tmp/tmp.WEuyu5kt3B/E---3.1_9553.p',cls_Zorn_OAbrial__axiom1_0) ).

cnf(cls_conjecture_1,negated_conjecture,
    ~ c_lessequals(v_x,c_Zorn_Osucc(v_S,v_y,t_a),tc_set(tc_set(t_a))),
    file('/export/starexec/sandbox2/tmp/tmp.WEuyu5kt3B/E---3.1_9553.p',cls_conjecture_1) ).

cnf(c_0_4,axiom,
    ( c_lessequals(X4,X2,tc_set(X3))
    | ~ c_lessequals(X1,X2,tc_set(X3))
    | ~ c_lessequals(X4,X1,tc_set(X3)) ),
    cls_Set_Osubset__trans_0 ).

cnf(c_0_5,negated_conjecture,
    c_lessequals(v_x,v_y,tc_set(tc_set(t_a))),
    cls_conjecture_0 ).

cnf(c_0_6,negated_conjecture,
    ( c_lessequals(v_x,X1,tc_set(tc_set(t_a)))
    | ~ c_lessequals(v_y,X1,tc_set(tc_set(t_a))) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_7,axiom,
    c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
    cls_Zorn_OAbrial__axiom1_0 ).

cnf(c_0_8,negated_conjecture,
    ~ c_lessequals(v_x,c_Zorn_Osucc(v_S,v_y,t_a),tc_set(tc_set(t_a))),
    cls_conjecture_1 ).

cnf(c_0_9,negated_conjecture,
    c_lessequals(v_x,c_Zorn_Osucc(X1,v_y,t_a),tc_set(tc_set(t_a))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SET850-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14  % Command    : run_E %s %d THM
% 0.14/0.34  % Computer : n001.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 2400
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Oct  2 17:48:07 EDT 2023
% 0.14/0.35  % CPUTime    : 
% 0.21/0.56  Running first-order model finding
% 0.21/0.56  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.WEuyu5kt3B/E---3.1_9553.p
% 0.21/0.61  # Version: 3.1pre001
% 0.21/0.61  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.61  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.61  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.61  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.61  # Starting sh5l with 300s (1) cores
% 0.21/0.61  # new_bool_3 with pid 9632 completed with status 0
% 0.21/0.61  # Result found by new_bool_3
% 0.21/0.61  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.61  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.61  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.61  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.61  # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.21/0.61  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.61  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.21/0.61  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 9635 completed with status 0
% 0.21/0.61  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 0.21/0.61  # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.21/0.61  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.61  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.61  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.61  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.61  # Search class: FGHSM-FSLM32-SFFFFFNN
% 0.21/0.61  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.61  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 127s (1) cores
% 0.21/0.61  # Preprocessing time       : 0.003 s
% 0.21/0.61  
% 0.21/0.61  # Proof found!
% 0.21/0.61  # SZS status Unsatisfiable
% 0.21/0.61  # SZS output start CNFRefutation
% See solution above
% 0.21/0.61  # Parsed axioms                        : 1361
% 0.21/0.61  # Removed by relevancy pruning/SinE    : 977
% 0.21/0.61  # Initial clauses                      : 384
% 0.21/0.61  # Removed in clause preprocessing      : 0
% 0.21/0.61  # Initial clauses in saturation        : 384
% 0.21/0.61  # Processed clauses                    : 390
% 0.21/0.61  # ...of these trivial                  : 0
% 0.21/0.61  # ...subsumed                          : 4
% 0.21/0.61  # ...remaining for further processing  : 386
% 0.21/0.61  # Other redundant clauses eliminated   : 0
% 0.21/0.61  # Clauses deleted for lack of memory   : 0
% 0.21/0.61  # Backward-subsumed                    : 2
% 0.21/0.61  # Backward-rewritten                   : 3
% 0.21/0.61  # Generated clauses                    : 154
% 0.21/0.61  # ...of the previous two non-redundant : 92
% 0.21/0.61  # ...aggressively subsumed             : 0
% 0.21/0.61  # Contextual simplify-reflections      : 0
% 0.21/0.61  # Paramodulations                      : 151
% 0.21/0.61  # Factorizations                       : 0
% 0.21/0.61  # NegExts                              : 0
% 0.21/0.61  # Equation resolutions                 : 3
% 0.21/0.61  # Total rewrite steps                  : 59
% 0.21/0.61  # Propositional unsat checks           : 0
% 0.21/0.61  #    Propositional check models        : 0
% 0.21/0.61  #    Propositional check unsatisfiable : 0
% 0.21/0.61  #    Propositional clauses             : 0
% 0.21/0.61  #    Propositional clauses after purity: 0
% 0.21/0.61  #    Propositional unsat core size     : 0
% 0.21/0.61  #    Propositional preprocessing time  : 0.000
% 0.21/0.61  #    Propositional encoding time       : 0.000
% 0.21/0.61  #    Propositional solver time         : 0.000
% 0.21/0.61  #    Success case prop preproc time    : 0.000
% 0.21/0.61  #    Success case prop encoding time   : 0.000
% 0.21/0.61  #    Success case prop solver time     : 0.000
% 0.21/0.61  # Current number of processed clauses  : 381
% 0.21/0.61  #    Positive orientable unit clauses  : 37
% 0.21/0.61  #    Positive unorientable unit clauses: 0
% 0.21/0.61  #    Negative unit clauses             : 5
% 0.21/0.61  #    Non-unit-clauses                  : 339
% 0.21/0.61  # Current number of unprocessed clauses: 86
% 0.21/0.61  # ...number of literals in the above   : 163
% 0.21/0.61  # Current number of archived formulas  : 0
% 0.21/0.61  # Current number of archived clauses   : 5
% 0.21/0.61  # Clause-clause subsumption calls (NU) : 24218
% 0.21/0.61  # Rec. Clause-clause subsumption calls : 24183
% 0.21/0.61  # Non-unit clause-clause subsumptions  : 5
% 0.21/0.61  # Unit Clause-clause subsumption calls : 72
% 0.21/0.61  # Rewrite failures with RHS unbound    : 0
% 0.21/0.61  # BW rewrite match attempts            : 10
% 0.21/0.61  # BW rewrite match successes           : 3
% 0.21/0.61  # Condensation attempts                : 0
% 0.21/0.61  # Condensation successes               : 0
% 0.21/0.61  # Termbank termtop insertions          : 12733
% 0.21/0.61  
% 0.21/0.61  # -------------------------------------------------
% 0.21/0.61  # User time                : 0.021 s
% 0.21/0.61  # System time              : 0.004 s
% 0.21/0.61  # Total time               : 0.025 s
% 0.21/0.61  # Maximum resident set size: 2980 pages
% 0.21/0.61  
% 0.21/0.61  # -------------------------------------------------
% 0.21/0.61  # User time                : 0.033 s
% 0.21/0.61  # System time              : 0.006 s
% 0.21/0.61  # Total time               : 0.039 s
% 0.21/0.61  # Maximum resident set size: 2400 pages
% 0.21/0.61  % E---3.1 exiting
%------------------------------------------------------------------------------