TSTP Solution File: SET845-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET845-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:56 EDT 2024
% Result : Unsatisfiable 0.48s 0.70s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 26 ( 10 unt; 3 nHn; 24 RR)
% Number of literals : 46 ( 12 equ; 23 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 52 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OpsubsetE_0,axiom,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p',cls_Set_OpsubsetE_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/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p',cls_Set_OpsubsetI_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.dqb8GO3mIX/E---3.1_12097.p',cls_Zorn_OAbrial__axiom1_0) ).
cnf(cls_Set_OUnion__upper_0,axiom,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
file('/export/starexec/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p',cls_Set_OUnion__upper_0) ).
cnf(cls_conjecture_1,negated_conjecture,
v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p',cls_conjecture_1) ).
cnf(cls_Zorn_OTFin_OsuccI_0,axiom,
( c_in(c_Zorn_Osucc(X2,X1,X3),c_Zorn_OTFin(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.dqb8GO3mIX/E---3.1_12097.p',cls_Zorn_OTFin_OsuccI_0) ).
cnf(cls_conjecture_2,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p',cls_conjecture_2) ).
cnf(cls_conjecture_0,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p',cls_conjecture_0) ).
cnf(c_0_8,plain,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OpsubsetE_0]) ).
cnf(c_0_9,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_10,plain,
( ~ c_less(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_8 ).
cnf(c_0_11,plain,
( c_less(X1,X2,tc_set(X3))
| X1 = X2
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
c_0_9 ).
cnf(c_0_12,plain,
( X1 = X2
| ~ c_lessequals(X2,X1,tc_set(X3))
| ~ c_lessequals(X1,X2,tc_set(X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_13,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
cls_Zorn_OAbrial__axiom1_0 ).
cnf(c_0_14,plain,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OUnion__upper_0]) ).
cnf(c_0_15,plain,
( c_Zorn_Osucc(X1,X2,X3) = X2
| ~ c_lessequals(c_Zorn_Osucc(X1,X2,X3),X2,tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
c_0_14 ).
cnf(c_0_17,plain,
( c_Zorn_Osucc(X1,c_Union(X2,tc_set(X3)),X3) = c_Union(X2,tc_set(X3))
| ~ c_in(c_Zorn_Osucc(X1,c_Union(X2,tc_set(X3)),X3),X2,tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,negated_conjecture,
v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
cls_conjecture_1 ).
cnf(c_0_19,plain,
( c_in(c_Zorn_Osucc(X2,X1,X3),c_Zorn_OTFin(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_OsuccI_0]) ).
cnf(c_0_20,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_21,negated_conjecture,
( c_Zorn_Osucc(X1,v_m,t_a) = v_m
| ~ c_in(c_Zorn_Osucc(X1,v_m,t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( c_in(c_Zorn_Osucc(X2,X1,X3),c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3))) ),
c_0_19 ).
cnf(c_0_23,negated_conjecture,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
cls_conjecture_0 ).
cnf(c_0_24,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
c_0_20 ).
cnf(c_0_25,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.22 % Problem : SET845-1 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.23 % Command : run_E %s %d THM
% 0.24/0.43 % Computer : n028.cluster.edu
% 0.24/0.43 % Model : x86_64 x86_64
% 0.24/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.43 % Memory : 8042.1875MB
% 0.24/0.43 % OS : Linux 3.10.0-693.el7.x86_64
% 0.24/0.43 % CPULimit : 300
% 0.24/0.43 % WCLimit : 300
% 0.24/0.43 % DateTime : Fri May 3 10:27:48 EDT 2024
% 0.24/0.44 % CPUTime :
% 0.48/0.67 Running first-order theorem proving
% 0.48/0.67 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.dqb8GO3mIX/E---3.1_12097.p
% 0.48/0.70 # Version: 3.1.0
% 0.48/0.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.70 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.70 # Starting new_bool_1 with 300s (1) cores
% 0.48/0.70 # Starting sh5l with 300s (1) cores
% 0.48/0.70 # new_bool_3 with pid 12177 completed with status 0
% 0.48/0.70 # Result found by new_bool_3
% 0.48/0.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.70 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.70 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/0.70 # Search class: FGHSM-FFMS32-MFFFFFNN
% 0.48/0.70 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.70 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.48/0.70 # SAT001_MinMin_p005000_rr_RG with pid 12180 completed with status 0
% 0.48/0.70 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.48/0.70 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.48/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.70 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.48/0.70 # Starting new_bool_3 with 300s (1) cores
% 0.48/0.70 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.48/0.70 # Search class: FGHSM-FFMS32-MFFFFFNN
% 0.48/0.70 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.48/0.70 # Starting SAT001_MinMin_p005000_rr_RG with 100s (1) cores
% 0.48/0.70 # Preprocessing time : 0.003 s
% 0.48/0.70 # Presaturation interreduction done
% 0.48/0.70
% 0.48/0.70 # Proof found!
% 0.48/0.70 # SZS status Unsatisfiable
% 0.48/0.70 # SZS output start CNFRefutation
% See solution above
% 0.48/0.70 # Parsed axioms : 1367
% 0.48/0.70 # Removed by relevancy pruning/SinE : 1322
% 0.48/0.70 # Initial clauses : 45
% 0.48/0.70 # Removed in clause preprocessing : 0
% 0.48/0.70 # Initial clauses in saturation : 45
% 0.48/0.70 # Processed clauses : 100
% 0.48/0.70 # ...of these trivial : 0
% 0.48/0.70 # ...subsumed : 4
% 0.48/0.70 # ...remaining for further processing : 96
% 0.48/0.70 # Other redundant clauses eliminated : 0
% 0.48/0.70 # Clauses deleted for lack of memory : 0
% 0.48/0.70 # Backward-subsumed : 0
% 0.48/0.70 # Backward-rewritten : 1
% 0.48/0.70 # Generated clauses : 27
% 0.48/0.70 # ...of the previous two non-redundant : 21
% 0.48/0.70 # ...aggressively subsumed : 0
% 0.48/0.70 # Contextual simplify-reflections : 0
% 0.48/0.70 # Paramodulations : 27
% 0.48/0.70 # Factorizations : 0
% 0.48/0.70 # NegExts : 0
% 0.48/0.70 # Equation resolutions : 0
% 0.48/0.70 # Disequality decompositions : 0
% 0.48/0.70 # Total rewrite steps : 5
% 0.48/0.70 # ...of those cached : 0
% 0.48/0.70 # Propositional unsat checks : 0
% 0.48/0.70 # Propositional check models : 0
% 0.48/0.70 # Propositional check unsatisfiable : 0
% 0.48/0.70 # Propositional clauses : 0
% 0.48/0.70 # Propositional clauses after purity: 0
% 0.48/0.70 # Propositional unsat core size : 0
% 0.48/0.70 # Propositional preprocessing time : 0.000
% 0.48/0.70 # Propositional encoding time : 0.000
% 0.48/0.70 # Propositional solver time : 0.000
% 0.48/0.70 # Success case prop preproc time : 0.000
% 0.48/0.70 # Success case prop encoding time : 0.000
% 0.48/0.70 # Success case prop solver time : 0.000
% 0.48/0.70 # Current number of processed clauses : 52
% 0.48/0.70 # Positive orientable unit clauses : 8
% 0.48/0.70 # Positive unorientable unit clauses: 0
% 0.48/0.70 # Negative unit clauses : 4
% 0.48/0.70 # Non-unit-clauses : 40
% 0.48/0.70 # Current number of unprocessed clauses: 5
% 0.48/0.70 # ...number of literals in the above : 14
% 0.48/0.70 # Current number of archived formulas : 0
% 0.48/0.70 # Current number of archived clauses : 44
% 0.48/0.70 # Clause-clause subsumption calls (NU) : 467
% 0.48/0.70 # Rec. Clause-clause subsumption calls : 465
% 0.48/0.70 # Non-unit clause-clause subsumptions : 3
% 0.48/0.70 # Unit Clause-clause subsumption calls : 0
% 0.48/0.70 # Rewrite failures with RHS unbound : 0
% 0.48/0.70 # BW rewrite match attempts : 6
% 0.48/0.70 # BW rewrite match successes : 1
% 0.48/0.70 # Condensation attempts : 0
% 0.48/0.70 # Condensation successes : 0
% 0.48/0.70 # Termbank termtop insertions : 9402
% 0.48/0.70 # Search garbage collected termcells : 2660
% 0.48/0.70
% 0.48/0.70 # -------------------------------------------------
% 0.48/0.70 # User time : 0.010 s
% 0.48/0.70 # System time : 0.003 s
% 0.48/0.70 # Total time : 0.014 s
% 0.48/0.70 # Maximum resident set size: 2864 pages
% 0.48/0.70
% 0.48/0.70 # -------------------------------------------------
% 0.48/0.70 # User time : 0.021 s
% 0.48/0.70 # System time : 0.006 s
% 0.48/0.70 # Total time : 0.027 s
% 0.48/0.70 # Maximum resident set size: 2424 pages
% 0.48/0.70 % E---3.1 exiting
% 0.48/0.70 % E exiting
%------------------------------------------------------------------------------