TSTP Solution File: SET844-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET844-1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.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:21:04 EDT 2023
% Result : Unsatisfiable 0.43s 0.66s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 15 ( 9 unt; 0 nHn; 13 RR)
% Number of literals : 28 ( 6 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 25 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Zorn_Oeq__succ__upper_0,axiom,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| X1 != c_Zorn_Osucc(X2,X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.vBLF2lFa5k/E---3.1_9633.p',cls_Zorn_Oeq__succ__upper_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.vBLF2lFa5k/E---3.1_9633.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/tmp/tmp.vBLF2lFa5k/E---3.1_9633.p',cls_Set_Osubset__refl_0) ).
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox2/tmp/tmp.vBLF2lFa5k/E---3.1_9633.p',cls_conjecture_2) ).
cnf(cls_conjecture_1,negated_conjecture,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox2/tmp/tmp.vBLF2lFa5k/E---3.1_9633.p',cls_conjecture_1) ).
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.vBLF2lFa5k/E---3.1_9633.p',cls_conjecture_0) ).
cnf(c_0_6,axiom,
( c_lessequals(X4,X1,tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X4,c_Zorn_OTFin(X2,X3),tc_set(tc_set(X3)))
| X1 != c_Zorn_Osucc(X2,X1,X3) ),
cls_Zorn_Oeq__succ__upper_0 ).
cnf(c_0_7,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_8,plain,
( c_lessequals(c_Union(X1,tc_set(X2)),X3,tc_set(tc_set(X2)))
| c_Zorn_Osucc(X4,X3,X2) != X3
| ~ c_lessequals(X1,c_Zorn_OTFin(X4,X2),tc_set(tc_set(tc_set(X2))))
| ~ c_in(X3,c_Zorn_OTFin(X4,X2),tc_set(tc_set(X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_10,negated_conjecture,
~ c_lessequals(c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
cls_conjecture_2 ).
cnf(c_0_11,plain,
( c_lessequals(c_Union(c_Zorn_OTFin(X1,X2),tc_set(X2)),X3,tc_set(tc_set(X2)))
| c_Zorn_Osucc(X1,X3,X2) != X3
| ~ c_in(X3,c_Zorn_OTFin(X1,X2),tc_set(tc_set(X2))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
cls_conjecture_1 ).
cnf(c_0_13,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_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.18/0.18 % Problem : SET844-1 : TPTP v8.1.2. Released v3.2.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.19/0.39 % Computer : n016.cluster.edu
% 0.19/0.39 % Model : x86_64 x86_64
% 0.19/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.39 % Memory : 8042.1875MB
% 0.19/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.19/0.39 % CPULimit : 2400
% 0.19/0.39 % WCLimit : 300
% 0.19/0.39 % DateTime : Mon Oct 2 18:24:06 EDT 2023
% 0.19/0.39 % CPUTime :
% 0.40/0.59 Running first-order theorem proving
% 0.40/0.59 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.vBLF2lFa5k/E---3.1_9633.p
% 0.43/0.66 # Version: 3.1pre001
% 0.43/0.66 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.43/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.43/0.66 # Starting sh5l with 300s (1) cores
% 0.43/0.66 # new_bool_3 with pid 9712 completed with status 0
% 0.43/0.66 # Result found by new_bool_3
% 0.43/0.66 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.43/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.66 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.43/0.66 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.66 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.43/0.66 # G-E--_303_C18_F1_URBAN_S0Y with pid 9716 completed with status 0
% 0.43/0.66 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 0.43/0.66 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.43/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.66 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.43/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.43/0.66 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.43/0.66 # Search class: FGHSM-FSLM32-MFFFFFNN
% 0.43/0.66 # Scheduled 12 strats onto 1 cores with 300 seconds (300 total)
% 0.43/0.66 # Starting G-E--_303_C18_F1_URBAN_S0Y with 25s (1) cores
% 0.43/0.66 # Preprocessing time : 0.007 s
% 0.43/0.66
% 0.43/0.66 # Proof found!
% 0.43/0.66 # SZS status Unsatisfiable
% 0.43/0.66 # SZS output start CNFRefutation
% See solution above
% 0.43/0.66 # Parsed axioms : 1367
% 0.43/0.66 # Removed by relevancy pruning/SinE : 982
% 0.43/0.66 # Initial clauses : 385
% 0.43/0.66 # Removed in clause preprocessing : 0
% 0.43/0.66 # Initial clauses in saturation : 385
% 0.43/0.66 # Processed clauses : 538
% 0.43/0.66 # ...of these trivial : 2
% 0.43/0.66 # ...subsumed : 91
% 0.43/0.66 # ...remaining for further processing : 445
% 0.43/0.66 # Other redundant clauses eliminated : 0
% 0.43/0.66 # Clauses deleted for lack of memory : 0
% 0.43/0.66 # Backward-subsumed : 2
% 0.43/0.66 # Backward-rewritten : 1
% 0.43/0.66 # Generated clauses : 350
% 0.43/0.66 # ...of the previous two non-redundant : 287
% 0.43/0.66 # ...aggressively subsumed : 0
% 0.43/0.66 # Contextual simplify-reflections : 0
% 0.43/0.66 # Paramodulations : 346
% 0.43/0.66 # Factorizations : 0
% 0.43/0.66 # NegExts : 0
% 0.43/0.66 # Equation resolutions : 4
% 0.43/0.66 # Total rewrite steps : 67
% 0.43/0.66 # Propositional unsat checks : 0
% 0.43/0.66 # Propositional check models : 0
% 0.43/0.66 # Propositional check unsatisfiable : 0
% 0.43/0.66 # Propositional clauses : 0
% 0.43/0.66 # Propositional clauses after purity: 0
% 0.43/0.66 # Propositional unsat core size : 0
% 0.43/0.66 # Propositional preprocessing time : 0.000
% 0.43/0.66 # Propositional encoding time : 0.000
% 0.43/0.66 # Propositional solver time : 0.000
% 0.43/0.66 # Success case prop preproc time : 0.000
% 0.43/0.66 # Success case prop encoding time : 0.000
% 0.43/0.66 # Success case prop solver time : 0.000
% 0.43/0.66 # Current number of processed clauses : 442
% 0.43/0.66 # Positive orientable unit clauses : 38
% 0.43/0.66 # Positive unorientable unit clauses: 0
% 0.43/0.66 # Negative unit clauses : 5
% 0.43/0.66 # Non-unit-clauses : 399
% 0.43/0.66 # Current number of unprocessed clauses: 127
% 0.43/0.66 # ...number of literals in the above : 362
% 0.43/0.66 # Current number of archived formulas : 0
% 0.43/0.66 # Current number of archived clauses : 3
% 0.43/0.66 # Clause-clause subsumption calls (NU) : 54733
% 0.43/0.66 # Rec. Clause-clause subsumption calls : 53926
% 0.43/0.66 # Non-unit clause-clause subsumptions : 86
% 0.43/0.66 # Unit Clause-clause subsumption calls : 5
% 0.43/0.66 # Rewrite failures with RHS unbound : 0
% 0.43/0.66 # BW rewrite match attempts : 8
% 0.43/0.66 # BW rewrite match successes : 1
% 0.43/0.66 # Condensation attempts : 0
% 0.43/0.66 # Condensation successes : 0
% 0.43/0.66 # Termbank termtop insertions : 19735
% 0.43/0.66
% 0.43/0.66 # -------------------------------------------------
% 0.43/0.66 # User time : 0.033 s
% 0.43/0.66 # System time : 0.009 s
% 0.43/0.66 # Total time : 0.042 s
% 0.43/0.66 # Maximum resident set size: 2992 pages
% 0.43/0.66
% 0.43/0.66 # -------------------------------------------------
% 0.43/0.66 # User time : 0.053 s
% 0.43/0.66 # System time : 0.011 s
% 0.43/0.66 # Total time : 0.063 s
% 0.43/0.66 # Maximum resident set size: 2404 pages
% 0.43/0.66 % E---3.1 exiting
% 0.43/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------