TSTP Solution File: SET834-1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n019.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 : Tue May 21 03:00:03 EDT 2024

% Result   : Unsatisfiable 4.24s 1.05s
% Output   : CNFRefutation 4.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   37 (  12 unt;   6 nHn;  27 RR)
%            Number of literals    :   72 (   0 equ;  35 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-3 aty)
%            Number of variables   :   83 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
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/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_1) ).

cnf(cls_Set_OUnCI_0,axiom,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_0) ).

cnf(cls_Set_OUnCI_1,axiom,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnCI_1) ).

cnf(cls_conjecture_5,negated_conjecture,
    ( c_lessequals(v_X,X1,tc_set(t_a))
    | ~ c_lessequals(v_Z,X1,tc_set(t_a))
    | ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_5) ).

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/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetI_0) ).

cnf(cls_Set_OsubsetD_0,axiom,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).

cnf(cls_Set_OUnE_0,axiom,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MSC001-2.ax',cls_Set_OUnE_0) ).

cnf(cls_conjecture_4,negated_conjecture,
    ~ c_in(v_x,v_Y,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_4) ).

cnf(cls_conjecture_3,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_3) ).

cnf(cls_conjecture_2,negated_conjecture,
    c_in(v_x,v_X,t_a),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).

cnf(c_0_10,plain,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsubsetI_1]) ).

cnf(c_0_11,plain,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_0]) ).

cnf(c_0_12,plain,
    ( c_lessequals(X1,X2,tc_set(X3))
    | ~ c_in(c_Main_OsubsetI__1(X1,X2,X3),X2,X3) ),
    c_0_10 ).

cnf(c_0_13,plain,
    ( c_in(X1,c_union(X4,X2,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    c_0_11 ).

cnf(c_0_14,plain,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUnCI_1]) ).

cnf(c_0_15,negated_conjecture,
    ( c_lessequals(v_X,X1,tc_set(t_a))
    | ~ c_lessequals(v_Z,X1,tc_set(t_a))
    | ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
    inference(fof_simplification,[status(thm)],[cls_conjecture_5]) ).

cnf(c_0_16,plain,
    ( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X3,X4) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,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_18,plain,
    ( c_in(X1,c_union(X2,X4,X3),X3)
    | ~ c_in(X1,X2,X3) ),
    c_0_14 ).

cnf(c_0_19,negated_conjecture,
    ( c_lessequals(v_X,X1,tc_set(t_a))
    | ~ c_lessequals(v_Z,X1,tc_set(t_a))
    | ~ c_lessequals(v_Y,X1,tc_set(t_a)) ),
    c_0_15 ).

cnf(c_0_20,plain,
    c_lessequals(X1,c_union(X2,X1,X3),tc_set(X3)),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_21,plain,
    ( c_lessequals(X1,c_union(X2,X3,X4),tc_set(X4))
    | ~ c_in(c_Main_OsubsetI__1(X1,c_union(X2,X3,X4),X4),X2,X4) ),
    inference(spm,[status(thm)],[c_0_12,c_0_18]) ).

cnf(c_0_22,plain,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).

cnf(c_0_23,negated_conjecture,
    ( c_lessequals(v_X,c_union(X1,v_Z,t_a),tc_set(t_a))
    | ~ c_lessequals(v_Y,c_union(X1,v_Z,t_a),tc_set(t_a)) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    c_lessequals(X1,c_union(X1,X2,X3),tc_set(X3)),
    inference(spm,[status(thm)],[c_0_21,c_0_17]) ).

cnf(c_0_25,plain,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    inference(fof_simplification,[status(thm)],[cls_Set_OUnE_0]) ).

cnf(c_0_26,plain,
    ( c_in(X1,X4,X3)
    | ~ c_in(X1,X2,X3)
    | ~ c_lessequals(X2,X4,tc_set(X3)) ),
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    c_lessequals(v_X,c_union(v_Y,v_Z,t_a),tc_set(t_a)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_28,plain,
    ( c_in(X1,X3,X4)
    | c_in(X1,X2,X4)
    | ~ c_in(X1,c_union(X2,X3,X4),X4) ),
    c_0_25 ).

cnf(c_0_29,negated_conjecture,
    ( c_in(X1,c_union(v_Y,v_Z,t_a),t_a)
    | ~ c_in(X1,v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ~ c_in(v_x,v_Y,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).

cnf(c_0_31,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).

cnf(c_0_32,negated_conjecture,
    ( c_in(X1,v_Y,t_a)
    | c_in(X1,v_Z,t_a)
    | ~ c_in(X1,v_X,t_a) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    c_in(v_x,v_X,t_a),
    cls_conjecture_2 ).

cnf(c_0_34,negated_conjecture,
    ~ c_in(v_x,v_Y,t_a),
    c_0_30 ).

cnf(c_0_35,negated_conjecture,
    ~ c_in(v_x,v_Z,t_a),
    c_0_31 ).

cnf(c_0_36,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13  % Problem    : SET834-1 : TPTP v8.2.0. Released v3.2.0.
% 0.11/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n019.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Mon May 20 11:28:53 EDT 2024
% 0.13/0.35  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  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/benchmark/theBenchmark.p
% 4.24/1.05  # Version: 3.1.0
% 4.24/1.05  # Preprocessing class: FMLMSMSMSSSNFFN.
% 4.24/1.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.24/1.05  # Starting new_bool_3 with 300s (1) cores
% 4.24/1.05  # Starting new_bool_1 with 300s (1) cores
% 4.24/1.05  # Starting sh5l with 300s (1) cores
% 4.24/1.05  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28574 completed with status 0
% 4.24/1.05  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.24/1.05  # Preprocessing class: FMLMSMSMSSSNFFN.
% 4.24/1.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.24/1.05  # No SInE strategy applied
% 4.24/1.05  # Search class: FGHSM-SSLM33-MFFFFFNN
% 4.24/1.05  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.24/1.05  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 4.24/1.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.24/1.05  # Starting new_bool_3 with 136s (1) cores
% 4.24/1.05  # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 4.24/1.05  # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 4.24/1.05  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 28581 completed with status 0
% 4.24/1.05  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.24/1.05  # Preprocessing class: FMLMSMSMSSSNFFN.
% 4.24/1.05  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.24/1.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.24/1.05  # No SInE strategy applied
% 4.24/1.05  # Search class: FGHSM-SSLM33-MFFFFFNN
% 4.24/1.05  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.24/1.05  # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 4.24/1.05  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.24/1.05  # Preprocessing time       : 0.012 s
% 4.24/1.05  # Presaturation interreduction done
% 4.24/1.05  
% 4.24/1.05  # Proof found!
% 4.24/1.05  # SZS status Unsatisfiable
% 4.24/1.05  # SZS output start CNFRefutation
% See solution above
% 4.24/1.05  # Parsed axioms                        : 1363
% 4.24/1.05  # Removed by relevancy pruning/SinE    : 0
% 4.24/1.05  # Initial clauses                      : 1363
% 4.24/1.05  # Removed in clause preprocessing      : 1
% 4.24/1.05  # Initial clauses in saturation        : 1362
% 4.24/1.05  # Processed clauses                    : 5944
% 4.24/1.05  # ...of these trivial                  : 20
% 4.24/1.05  # ...subsumed                          : 2883
% 4.24/1.05  # ...remaining for further processing  : 3041
% 4.24/1.05  # Other redundant clauses eliminated   : 31
% 4.24/1.05  # Clauses deleted for lack of memory   : 0
% 4.24/1.05  # Backward-subsumed                    : 6
% 4.24/1.05  # Backward-rewritten                   : 66
% 4.24/1.05  # Generated clauses                    : 6723
% 4.24/1.05  # ...of the previous two non-redundant : 5595
% 4.24/1.05  # ...aggressively subsumed             : 0
% 4.24/1.05  # Contextual simplify-reflections      : 0
% 4.24/1.05  # Paramodulations                      : 6662
% 4.24/1.05  # Factorizations                       : 0
% 4.24/1.05  # NegExts                              : 0
% 4.24/1.05  # Equation resolutions                 : 61
% 4.24/1.05  # Disequality decompositions           : 0
% 4.24/1.05  # Total rewrite steps                  : 1449
% 4.24/1.05  # ...of those cached                   : 1139
% 4.24/1.05  # Propositional unsat checks           : 0
% 4.24/1.05  #    Propositional check models        : 0
% 4.24/1.05  #    Propositional check unsatisfiable : 0
% 4.24/1.05  #    Propositional clauses             : 0
% 4.24/1.05  #    Propositional clauses after purity: 0
% 4.24/1.05  #    Propositional unsat core size     : 0
% 4.24/1.05  #    Propositional preprocessing time  : 0.000
% 4.24/1.05  #    Propositional encoding time       : 0.000
% 4.24/1.05  #    Propositional solver time         : 0.000
% 4.24/1.05  #    Success case prop preproc time    : 0.000
% 4.24/1.05  #    Success case prop encoding time   : 0.000
% 4.24/1.05  #    Success case prop solver time     : 0.000
% 4.24/1.05  # Current number of processed clauses  : 1643
% 4.24/1.05  #    Positive orientable unit clauses  : 231
% 4.24/1.05  #    Positive unorientable unit clauses: 0
% 4.24/1.05  #    Negative unit clauses             : 79
% 4.24/1.05  #    Non-unit-clauses                  : 1333
% 4.24/1.05  # Current number of unprocessed clauses: 2260
% 4.24/1.05  # ...number of literals in the above   : 5047
% 4.24/1.05  # Current number of archived formulas  : 0
% 4.24/1.05  # Current number of archived clauses   : 1398
% 4.24/1.05  # Clause-clause subsumption calls (NU) : 1469013
% 4.24/1.05  # Rec. Clause-clause subsumption calls : 1349185
% 4.24/1.05  # Non-unit clause-clause subsumptions  : 2813
% 4.24/1.05  # Unit Clause-clause subsumption calls : 35505
% 4.24/1.05  # Rewrite failures with RHS unbound    : 0
% 4.24/1.05  # BW rewrite match attempts            : 164
% 4.24/1.05  # BW rewrite match successes           : 50
% 4.24/1.05  # Condensation attempts                : 0
% 4.24/1.05  # Condensation successes               : 0
% 4.24/1.05  # Termbank termtop insertions          : 107356
% 4.24/1.05  # Search garbage collected termcells   : 1597
% 4.24/1.05  
% 4.24/1.05  # -------------------------------------------------
% 4.24/1.05  # User time                : 0.481 s
% 4.24/1.05  # System time              : 0.014 s
% 4.24/1.05  # Total time               : 0.495 s
% 4.24/1.05  # Maximum resident set size: 3888 pages
% 4.24/1.05  
% 4.24/1.05  # -------------------------------------------------
% 4.24/1.05  # User time                : 2.376 s
% 4.24/1.05  # System time              : 0.068 s
% 4.24/1.05  # Total time               : 2.444 s
% 4.24/1.05  # Maximum resident set size: 2408 pages
% 4.24/1.05  % E---3.1 exiting
%------------------------------------------------------------------------------