TSTP Solution File: SET847-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET847-1 : TPTP v8.1.2. Released v3.2.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 09:20:57 EDT 2024
% Result : Unsatisfiable 8.94s 1.70s
% Output : CNFRefutation 8.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 40 ( 16 unt; 8 nHn; 31 RR)
% Number of literals : 70 ( 14 equ; 38 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 87 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_Onot__psubset__empty__iff1_0,axiom,
~ c_less(X1,c_emptyset,tc_set(X2)),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Set_Onot__psubset__empty__iff1_0) ).
cnf(cls_Set_OpsubsetI_0,axiom,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Set_OpsubsetI_0) ).
cnf(cls_conjecture_0,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_conjecture_0) ).
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.5uDh54SEL5/E---3.1_30963.p',cls_Set_OsubsetI_0) ).
cnf(cls_Zorn_Osucc__not__equals_0,axiom,
( ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3)))
| c_Zorn_Osucc(X2,X1,X3) != X1 ),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Zorn_Osucc__not__equals_0) ).
cnf(cls_Set_ODiffI_0,axiom,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Set_ODiffI_0) ).
cnf(cls_Set_OemptyE_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Set_OemptyE_0) ).
cnf(cls_Zorn_OTFin__chain__lemma4_0,axiom,
( c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Zorn_OTFin__chain__lemma4_0) ).
cnf(cls_Zorn_Oequal__succ__Union_1,axiom,
( c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2)
| ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Zorn_Oequal__succ__Union_1) ).
cnf(cls_Zorn_OTFin__UnionI_0,axiom,
( c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3)))) ),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/tmp/tmp.5uDh54SEL5/E---3.1_30963.p',cls_Set_Osubset__refl_0) ).
cnf(c_0_11,plain,
~ c_less(X1,c_emptyset,tc_set(X2)),
inference(fof_simplification,[status(thm)],[cls_Set_Onot__psubset__empty__iff1_0]) ).
cnf(c_0_12,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetI_0]) ).
cnf(c_0_13,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_14,plain,
~ c_less(X1,c_emptyset,tc_set(X2)),
c_0_11 ).
cnf(c_0_15,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_12 ).
cnf(c_0_16,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
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_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3)))
| c_Zorn_Osucc(X2,X1,X3) != X1 ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Osucc__not__equals_0]) ).
cnf(c_0_19,plain,
( X1 = c_emptyset
| ~ c_lessequals(X1,c_emptyset,tc_set(X2)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,negated_conjecture,
c_lessequals(c_Zorn_Omaxchain(v_S,t_a),X1,tc_set(tc_set(tc_set(t_a)))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ c_in(X1,c_minus(c_Zorn_Ochain(X2,X3),c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(tc_set(X3)))),tc_set(tc_set(X3)))
| c_Zorn_Osucc(X2,X1,X3) != X1 ),
c_0_18 ).
cnf(c_0_22,negated_conjecture,
c_Zorn_Omaxchain(v_S,t_a) = c_emptyset,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[cls_Set_ODiffI_0]) ).
cnf(c_0_24,plain,
~ c_in(X1,c_emptyset,X2),
inference(fof_simplification,[status(thm)],[cls_Set_OemptyE_0]) ).
cnf(c_0_25,negated_conjecture,
( c_Zorn_Osucc(v_S,X1,t_a) != X1
| ~ c_in(X1,c_minus(c_Zorn_Ochain(v_S,t_a),c_emptyset,tc_set(tc_set(tc_set(t_a)))),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,plain,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
c_0_23 ).
cnf(c_0_27,plain,
~ c_in(X1,c_emptyset,X2),
c_0_24 ).
cnf(c_0_28,plain,
( c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__chain__lemma4_0]) ).
cnf(c_0_29,negated_conjecture,
( c_Zorn_Osucc(v_S,X1,t_a) != X1
| ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
( c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
c_0_28 ).
cnf(c_0_31,plain,
( c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2)
| ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Oequal__succ__Union_1]) ).
cnf(c_0_32,plain,
( c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3)))) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OTFin__UnionI_0]) ).
cnf(c_0_33,negated_conjecture,
( c_Zorn_Osucc(v_S,X1,t_a) != X1
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)) = c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2)
| ~ c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
c_0_31 ).
cnf(c_0_35,plain,
( c_in(c_Union(X1,tc_set(X3)),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(tc_set(X3)))) ),
c_0_32 ).
cnf(c_0_36,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_37,negated_conjecture,
~ c_in(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,plain,
c_in(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.18 % Problem : SET847-1 : TPTP v8.1.2. Released v3.2.0.
% 0.17/0.19 % Command : run_E %s %d THM
% 0.17/0.38 % Computer : n010.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Fri May 3 10:13:33 EDT 2024
% 0.17/0.38 % CPUTime :
% 0.22/0.57 Running first-order theorem proving
% 0.22/0.57 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.5uDh54SEL5/E---3.1_30963.p
% 8.94/1.70 # Version: 3.1.0
% 8.94/1.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 8.94/1.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.94/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.94/1.70 # Starting new_bool_3 with 300s (1) cores
% 8.94/1.70 # Starting new_bool_1 with 300s (1) cores
% 8.94/1.70 # Starting sh5l with 300s (1) cores
% 8.94/1.70 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 31041 completed with status 0
% 8.94/1.70 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 8.94/1.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 8.94/1.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.94/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.94/1.70 # No SInE strategy applied
% 8.94/1.70 # Search class: FGHSM-SSLM33-MFFFFFNN
% 8.94/1.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.94/1.70 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 8.94/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.94/1.70 # Starting new_bool_3 with 136s (1) cores
% 8.94/1.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 8.94/1.70 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 8.94/1.70 # G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with pid 31052 completed with status 0
% 8.94/1.70 # Result found by G-E--_207_B07_F1_AE_CS_SP_PS_S0Y
% 8.94/1.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 8.94/1.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.94/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 8.94/1.70 # No SInE strategy applied
% 8.94/1.70 # Search class: FGHSM-SSLM33-MFFFFFNN
% 8.94/1.70 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 8.94/1.70 # Starting G-E--_208_B07AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 8.94/1.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 8.94/1.70 # Starting new_bool_3 with 136s (1) cores
% 8.94/1.70 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S2k with 136s (1) cores
% 8.94/1.70 # Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 8.94/1.70 # Preprocessing time : 0.009 s
% 8.94/1.70 # Presaturation interreduction done
% 8.94/1.70
% 8.94/1.70 # Proof found!
% 8.94/1.70 # SZS status Unsatisfiable
% 8.94/1.70 # SZS output start CNFRefutation
% See solution above
% 8.94/1.70 # Parsed axioms : 1364
% 8.94/1.70 # Removed by relevancy pruning/SinE : 0
% 8.94/1.70 # Initial clauses : 1364
% 8.94/1.70 # Removed in clause preprocessing : 1
% 8.94/1.70 # Initial clauses in saturation : 1363
% 8.94/1.70 # Processed clauses : 12337
% 8.94/1.70 # ...of these trivial : 808
% 8.94/1.70 # ...subsumed : 7411
% 8.94/1.70 # ...remaining for further processing : 4118
% 8.94/1.70 # Other redundant clauses eliminated : 26
% 8.94/1.70 # Clauses deleted for lack of memory : 0
% 8.94/1.70 # Backward-subsumed : 65
% 8.94/1.70 # Backward-rewritten : 360
% 8.94/1.70 # Generated clauses : 38176
% 8.94/1.70 # ...of the previous two non-redundant : 34772
% 8.94/1.70 # ...aggressively subsumed : 0
% 8.94/1.70 # Contextual simplify-reflections : 5
% 8.94/1.70 # Paramodulations : 38108
% 8.94/1.70 # Factorizations : 4
% 8.94/1.70 # NegExts : 0
% 8.94/1.70 # Equation resolutions : 63
% 8.94/1.70 # Disequality decompositions : 0
% 8.94/1.70 # Total rewrite steps : 57894
% 8.94/1.70 # ...of those cached : 54866
% 8.94/1.70 # Propositional unsat checks : 0
% 8.94/1.70 # Propositional check models : 0
% 8.94/1.70 # Propositional check unsatisfiable : 0
% 8.94/1.70 # Propositional clauses : 0
% 8.94/1.70 # Propositional clauses after purity: 0
% 8.94/1.70 # Propositional unsat core size : 0
% 8.94/1.70 # Propositional preprocessing time : 0.000
% 8.94/1.70 # Propositional encoding time : 0.000
% 8.94/1.70 # Propositional solver time : 0.000
% 8.94/1.70 # Success case prop preproc time : 0.000
% 8.94/1.70 # Success case prop encoding time : 0.000
% 8.94/1.70 # Success case prop solver time : 0.000
% 8.94/1.70 # Current number of processed clauses : 2365
% 8.94/1.70 # Positive orientable unit clauses : 342
% 8.94/1.70 # Positive unorientable unit clauses: 4
% 8.94/1.70 # Negative unit clauses : 303
% 8.94/1.70 # Non-unit-clauses : 1716
% 8.94/1.70 # Current number of unprocessed clauses: 24134
% 8.94/1.70 # ...number of literals in the above : 52026
% 8.94/1.70 # Current number of archived formulas : 0
% 8.94/1.70 # Current number of archived clauses : 1753
% 8.94/1.70 # Clause-clause subsumption calls (NU) : 1794872
% 8.94/1.70 # Rec. Clause-clause subsumption calls : 1637509
% 8.94/1.70 # Non-unit clause-clause subsumptions : 3348
% 8.94/1.70 # Unit Clause-clause subsumption calls : 113415
% 8.94/1.70 # Rewrite failures with RHS unbound : 294
% 8.94/1.70 # BW rewrite match attempts : 494
% 8.94/1.70 # BW rewrite match successes : 258
% 8.94/1.70 # Condensation attempts : 0
% 8.94/1.70 # Condensation successes : 0
% 8.94/1.70 # Termbank termtop insertions : 705417
% 8.94/1.70 # Search garbage collected termcells : 1608
% 8.94/1.70
% 8.94/1.70 # -------------------------------------------------
% 8.94/1.70 # User time : 1.023 s
% 8.94/1.70 # System time : 0.043 s
% 8.94/1.70 # Total time : 1.066 s
% 8.94/1.70 # Maximum resident set size: 3908 pages
% 8.94/1.70
% 8.94/1.70 # -------------------------------------------------
% 8.94/1.70 # User time : 5.183 s
% 8.94/1.70 # System time : 0.149 s
% 8.94/1.70 # Total time : 5.332 s
% 8.94/1.70 # Maximum resident set size: 2424 pages
% 8.94/1.70 % E---3.1 exiting
% 8.94/1.70 % E exiting
%------------------------------------------------------------------------------