TSTP Solution File: SET847-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET847-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:10 EDT 2023
% Result : Unsatisfiable 1.15s 0.91s
% Output : CNFRefutation 1.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of clauses : 31 ( 12 unt; 4 nHn; 21 RR)
% Number of literals : 54 ( 13 equ; 29 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 3 con; 0-3 aty)
% Number of variables : 64 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Set_OsubsetI_0) ).
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.Uk2I50sHrv/E---3.1_29081.p',cls_Set_Osubset__antisym_0) ).
cnf(cls_Set_Oempty__subsetI_0,axiom,
c_lessequals(c_emptyset,X1,tc_set(X2)),
file('/export/starexec/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Set_Oempty__subsetI_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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Set_ODiffI_0) ).
cnf(cls_Set_OemptyE_0,axiom,
~ c_in(X1,c_emptyset,X2),
file('/export/starexec/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Zorn_OTFin__chain__lemma4_0) ).
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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Zorn_OTFin__UnionI_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/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Zorn_Oequal__succ__Union_1) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/tmp/tmp.Uk2I50sHrv/E---3.1_29081.p',cls_Set_Osubset__refl_0) ).
cnf(c_0_11,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_12,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_13,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_14,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_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( X1 = c_Zorn_Omaxchain(v_S,t_a)
| ~ c_lessequals(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
c_lessequals(c_emptyset,X1,tc_set(X2)),
cls_Set_Oempty__subsetI_0 ).
cnf(c_0_17,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 ),
cls_Zorn_Osucc__not__equals_0 ).
cnf(c_0_18,negated_conjecture,
c_Zorn_Omaxchain(v_S,t_a) = c_emptyset,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,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_17,c_0_18]) ).
cnf(c_0_20,axiom,
( c_in(X1,X4,X3)
| c_in(X1,c_minus(X2,X4,tc_set(X3)),X3)
| ~ c_in(X1,X2,X3) ),
cls_Set_ODiffI_0 ).
cnf(c_0_21,axiom,
~ c_in(X1,c_emptyset,X2),
cls_Set_OemptyE_0 ).
cnf(c_0_22,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_19,c_0_20]),c_0_21]) ).
cnf(c_0_23,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))) ),
cls_Zorn_OTFin__chain__lemma4_0 ).
cnf(c_0_24,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_22,c_0_23]) ).
cnf(c_0_25,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)))) ),
cls_Zorn_OTFin__UnionI_0 ).
cnf(c_0_26,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))) ),
cls_Zorn_Oequal__succ__Union_1 ).
cnf(c_0_27,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_28,negated_conjecture,
( c_Zorn_Osucc(v_S,c_Union(X1,tc_set(t_a)),t_a) != c_Union(X1,tc_set(t_a))
| ~ c_lessequals(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(tc_set(t_a)))) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
c_Zorn_Osucc(X1,c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X2) = c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_25]),c_0_27])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_27])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SET847-2 : TPTP v8.1.2. Released v3.2.0.
% 0.08/0.10 % Command : run_E %s %d THM
% 0.09/0.30 % Computer : n024.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 2400
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Mon Oct 2 16:32:57 EDT 2023
% 0.09/0.30 % CPUTime :
% 0.15/0.39 Running first-order model finding
% 0.15/0.40 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.Uk2I50sHrv/E---3.1_29081.p
% 1.15/0.91 # Version: 3.1pre001
% 1.15/0.91 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.15/0.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.15/0.91 # Starting new_bool_3 with 300s (1) cores
% 1.15/0.91 # Starting new_bool_1 with 300s (1) cores
% 1.15/0.91 # Starting sh5l with 300s (1) cores
% 1.15/0.91 # sh5l with pid 29162 completed with status 0
% 1.15/0.91 # Result found by sh5l
% 1.15/0.91 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.15/0.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.15/0.91 # Starting new_bool_3 with 300s (1) cores
% 1.15/0.91 # Starting new_bool_1 with 300s (1) cores
% 1.15/0.91 # Starting sh5l with 300s (1) cores
% 1.15/0.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.15/0.91 # Search class: FGHSS-FFSF32-MFFFFFNN
% 1.15/0.91 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.15/0.91 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.15/0.91 # SAT001_MinMin_p005000_rr_RG with pid 29170 completed with status 0
% 1.15/0.91 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.15/0.91 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.15/0.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.15/0.91 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.15/0.91 # Starting new_bool_3 with 300s (1) cores
% 1.15/0.91 # Starting new_bool_1 with 300s (1) cores
% 1.15/0.91 # Starting sh5l with 300s (1) cores
% 1.15/0.91 # SinE strategy is gf500_gu_R04_F100_L20000
% 1.15/0.91 # Search class: FGHSS-FFSF32-MFFFFFNN
% 1.15/0.91 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.15/0.91 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 1.15/0.91 # Preprocessing time : 0.001 s
% 1.15/0.91 # Presaturation interreduction done
% 1.15/0.91
% 1.15/0.91 # Proof found!
% 1.15/0.91 # SZS status Unsatisfiable
% 1.15/0.91 # SZS output start CNFRefutation
% See solution above
% 1.15/0.91 # Parsed axioms : 11
% 1.15/0.91 # Removed by relevancy pruning/SinE : 0
% 1.15/0.91 # Initial clauses : 11
% 1.15/0.91 # Removed in clause preprocessing : 0
% 1.15/0.91 # Initial clauses in saturation : 11
% 1.15/0.91 # Processed clauses : 38
% 1.15/0.91 # ...of these trivial : 0
% 1.15/0.91 # ...subsumed : 2
% 1.15/0.91 # ...remaining for further processing : 36
% 1.15/0.91 # Other redundant clauses eliminated : 0
% 1.15/0.91 # Clauses deleted for lack of memory : 0
% 1.15/0.91 # Backward-subsumed : 1
% 1.15/0.91 # Backward-rewritten : 4
% 1.15/0.91 # Generated clauses : 17
% 1.15/0.91 # ...of the previous two non-redundant : 17
% 1.15/0.91 # ...aggressively subsumed : 0
% 1.15/0.91 # Contextual simplify-reflections : 0
% 1.15/0.91 # Paramodulations : 17
% 1.15/0.91 # Factorizations : 0
% 1.15/0.91 # NegExts : 0
% 1.15/0.91 # Equation resolutions : 0
% 1.15/0.91 # Total rewrite steps : 9
% 1.15/0.91 # Propositional unsat checks : 0
% 1.15/0.91 # Propositional check models : 0
% 1.15/0.91 # Propositional check unsatisfiable : 0
% 1.15/0.91 # Propositional clauses : 0
% 1.15/0.91 # Propositional clauses after purity: 0
% 1.15/0.91 # Propositional unsat core size : 0
% 1.15/0.91 # Propositional preprocessing time : 0.000
% 1.15/0.91 # Propositional encoding time : 0.000
% 1.15/0.91 # Propositional solver time : 0.000
% 1.15/0.91 # Success case prop preproc time : 0.000
% 1.15/0.91 # Success case prop encoding time : 0.000
% 1.15/0.91 # Success case prop solver time : 0.000
% 1.15/0.91 # Current number of processed clauses : 20
% 1.15/0.91 # Positive orientable unit clauses : 4
% 1.15/0.91 # Positive unorientable unit clauses: 0
% 1.15/0.91 # Negative unit clauses : 1
% 1.15/0.91 # Non-unit-clauses : 15
% 1.15/0.91 # Current number of unprocessed clauses: 1
% 1.15/0.91 # ...number of literals in the above : 2
% 1.15/0.91 # Current number of archived formulas : 0
% 1.15/0.91 # Current number of archived clauses : 16
% 1.15/0.91 # Clause-clause subsumption calls (NU) : 9
% 1.15/0.91 # Rec. Clause-clause subsumption calls : 9
% 1.15/0.91 # Non-unit clause-clause subsumptions : 2
% 1.15/0.91 # Unit Clause-clause subsumption calls : 0
% 1.15/0.91 # Rewrite failures with RHS unbound : 0
% 1.15/0.91 # BW rewrite match attempts : 4
% 1.15/0.91 # BW rewrite match successes : 2
% 1.15/0.91 # Condensation attempts : 0
% 1.15/0.91 # Condensation successes : 0
% 1.15/0.91 # Termbank termtop insertions : 1051
% 1.15/0.91
% 1.15/0.91 # -------------------------------------------------
% 1.15/0.91 # User time : 0.004 s
% 1.15/0.91 # System time : 0.001 s
% 1.15/0.91 # Total time : 0.004 s
% 1.15/0.91 # Maximum resident set size: 1632 pages
% 1.15/0.91
% 1.15/0.91 # -------------------------------------------------
% 1.15/0.91 # User time : 0.004 s
% 1.15/0.91 # System time : 0.003 s
% 1.15/0.91 # Total time : 0.007 s
% 1.15/0.91 # Maximum resident set size: 1680 pages
% 1.15/0.91 % E---3.1 exiting
%------------------------------------------------------------------------------