TSTP Solution File: SET843-2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET843-2 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 02:56:14 EDT 2024
% Result : Unsatisfiable 0.18s 0.48s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 10
% Syntax : Number of clauses : 41 ( 11 unt; 4 nHn; 36 RR)
% Number of literals : 89 ( 31 equ; 49 neg)
% Maximal clause size : 4 ( 2 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 : 78 ( 4 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/benchmark/theBenchmark.p',cls_Zorn_Oeq__succ__upper_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/benchmark/theBenchmark.p',cls_Set_OUnion__upper_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/benchmark/theBenchmark.p',cls_Set_Osubset__antisym_0) ).
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/benchmark/theBenchmark.p',cls_conjecture_0) ).
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/benchmark/theBenchmark.p',cls_Zorn_OTFin_OsuccI_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
| v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_2) ).
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/benchmark/theBenchmark.p',cls_Zorn_OAbrial__axiom1_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/benchmark/theBenchmark.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( v_m != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| v_m != c_Zorn_Osucc(v_S,v_m,t_a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cls_Set_Osubset__refl_0) ).
cnf(c_0_10,plain,
( 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) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Oeq__succ__upper_0]) ).
cnf(c_0_11,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_12,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_Osubset__antisym_0]) ).
cnf(c_0_13,plain,
( 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) ),
c_0_10 ).
cnf(c_0_14,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_15,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_16,plain,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
c_0_11 ).
cnf(c_0_17,negated_conjecture,
( v_m = c_Zorn_Osucc(v_S,v_m,t_a)
| v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) ),
cls_conjecture_2 ).
cnf(c_0_18,plain,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
c_0_12 ).
cnf(c_0_19,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
cls_Zorn_OAbrial__axiom1_0 ).
cnf(c_0_20,negated_conjecture,
( c_lessequals(v_m,X1,tc_set(tc_set(t_a)))
| 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_13,c_0_14]) ).
cnf(c_0_21,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_15 ).
cnf(c_0_22,negated_conjecture,
( c_Zorn_Osucc(v_S,v_m,t_a) = v_m
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,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_18,c_0_19]) ).
cnf(c_0_24,negated_conjecture,
( c_lessequals(v_m,c_Zorn_Osucc(v_S,X1,t_a),tc_set(tc_set(t_a)))
| c_Zorn_Osucc(v_S,c_Zorn_Osucc(v_S,X1,t_a),t_a) != c_Zorn_Osucc(v_S,X1,t_a)
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( c_Zorn_Osucc(v_S,v_m,t_a) = v_m
| c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a)))
| ~ 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_21]) ).
cnf(c_0_26,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_23,c_0_16]) ).
cnf(c_0_27,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_28,negated_conjecture,
( v_m != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| v_m != c_Zorn_Osucc(v_S,v_m,t_a) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_29,negated_conjecture,
( c_Zorn_Osucc(v_S,X1,t_a) = v_m
| c_Zorn_Osucc(v_S,c_Zorn_Osucc(v_S,X1,t_a),t_a) != c_Zorn_Osucc(v_S,X1,t_a)
| ~ c_lessequals(c_Zorn_Osucc(v_S,X1,t_a),v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_30,plain,
( c_lessequals(c_Zorn_Osucc(X1,X2,X3),X4,tc_set(tc_set(X3)))
| c_Zorn_Osucc(X1,X4,X3) != X4
| ~ c_in(X4,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3)))
| ~ c_in(X2,c_Zorn_OTFin(X1,X3),tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_13,c_0_21]) ).
cnf(c_0_31,negated_conjecture,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_25]),c_0_14])]) ).
cnf(c_0_32,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))
| ~ 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_26,c_0_21]) ).
cnf(c_0_33,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_27 ).
cnf(c_0_34,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_35,negated_conjecture,
( v_m != c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a))
| v_m != c_Zorn_Osucc(v_S,v_m,t_a) ),
c_0_28 ).
cnf(c_0_36,negated_conjecture,
( c_Zorn_Osucc(v_S,X1,t_a) = v_m
| c_Zorn_Osucc(v_S,c_Zorn_Osucc(v_S,X1,t_a),t_a) != c_Zorn_Osucc(v_S,X1,t_a)
| ~ c_in(X1,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_14])]) ).
cnf(c_0_37,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_32,c_0_33]),c_0_34])]) ).
cnf(c_0_38,negated_conjecture,
c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)) != v_m,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_31])]) ).
cnf(c_0_39,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(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_37])]),c_0_38]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SET843-2 : TPTP v8.2.0. Released v3.2.0.
% 0.06/0.13 % Command : run_E %s %d THM
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon May 20 13:13:53 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.18/0.47 Running first-order theorem proving
% 0.18/0.47 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/benchmark/theBenchmark.p
% 0.18/0.48 # Version: 3.1.0
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # sh5l with pid 9535 completed with status 0
% 0.18/0.48 # Result found by sh5l
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.48 # Search class: FGHSS-FFSF32-MFFFFFNN
% 0.18/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48 # SAT001_MinMin_p005000_rr_RG with pid 9537 completed with status 0
% 0.18/0.48 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.18/0.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.18/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.18/0.48 # Starting new_bool_3 with 300s (1) cores
% 0.18/0.48 # Starting new_bool_1 with 300s (1) cores
% 0.18/0.48 # Starting sh5l with 300s (1) cores
% 0.18/0.48 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.18/0.48 # Search class: FGHSS-FFSF32-MFFFFFNN
% 0.18/0.48 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.48 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.18/0.48 # Preprocessing time : 0.001 s
% 0.18/0.48 # Presaturation interreduction done
% 0.18/0.48
% 0.18/0.48 # Proof found!
% 0.18/0.48 # SZS status Unsatisfiable
% 0.18/0.48 # SZS output start CNFRefutation
% See solution above
% 0.18/0.48 # Parsed axioms : 10
% 0.18/0.48 # Removed by relevancy pruning/SinE : 0
% 0.18/0.48 # Initial clauses : 10
% 0.18/0.48 # Removed in clause preprocessing : 0
% 0.18/0.48 # Initial clauses in saturation : 10
% 0.18/0.48 # Processed clauses : 43
% 0.18/0.48 # ...of these trivial : 0
% 0.18/0.48 # ...subsumed : 3
% 0.18/0.48 # ...remaining for further processing : 40
% 0.18/0.48 # Other redundant clauses eliminated : 0
% 0.18/0.48 # Clauses deleted for lack of memory : 0
% 0.18/0.48 # Backward-subsumed : 1
% 0.18/0.48 # Backward-rewritten : 7
% 0.18/0.48 # Generated clauses : 40
% 0.18/0.48 # ...of the previous two non-redundant : 30
% 0.18/0.48 # ...aggressively subsumed : 0
% 0.18/0.48 # Contextual simplify-reflections : 0
% 0.18/0.48 # Paramodulations : 40
% 0.18/0.48 # Factorizations : 0
% 0.18/0.48 # NegExts : 0
% 0.18/0.48 # Equation resolutions : 0
% 0.18/0.48 # Disequality decompositions : 0
% 0.18/0.48 # Total rewrite steps : 27
% 0.18/0.48 # ...of those cached : 18
% 0.18/0.48 # Propositional unsat checks : 0
% 0.18/0.48 # Propositional check models : 0
% 0.18/0.48 # Propositional check unsatisfiable : 0
% 0.18/0.48 # Propositional clauses : 0
% 0.18/0.48 # Propositional clauses after purity: 0
% 0.18/0.48 # Propositional unsat core size : 0
% 0.18/0.48 # Propositional preprocessing time : 0.000
% 0.18/0.48 # Propositional encoding time : 0.000
% 0.18/0.48 # Propositional solver time : 0.000
% 0.18/0.48 # Success case prop preproc time : 0.000
% 0.18/0.48 # Success case prop encoding time : 0.000
% 0.18/0.48 # Success case prop solver time : 0.000
% 0.18/0.48 # Current number of processed clauses : 22
% 0.18/0.48 # Positive orientable unit clauses : 6
% 0.18/0.48 # Positive unorientable unit clauses: 0
% 0.18/0.48 # Negative unit clauses : 3
% 0.18/0.48 # Non-unit-clauses : 13
% 0.18/0.48 # Current number of unprocessed clauses: 5
% 0.18/0.48 # ...number of literals in the above : 19
% 0.18/0.48 # Current number of archived formulas : 0
% 0.18/0.48 # Current number of archived clauses : 18
% 0.18/0.48 # Clause-clause subsumption calls (NU) : 65
% 0.18/0.48 # Rec. Clause-clause subsumption calls : 51
% 0.18/0.48 # Non-unit clause-clause subsumptions : 3
% 0.18/0.48 # Unit Clause-clause subsumption calls : 0
% 0.18/0.48 # Rewrite failures with RHS unbound : 0
% 0.18/0.48 # BW rewrite match attempts : 3
% 0.18/0.48 # BW rewrite match successes : 3
% 0.18/0.48 # Condensation attempts : 0
% 0.18/0.48 # Condensation successes : 0
% 0.18/0.48 # Termbank termtop insertions : 1588
% 0.18/0.48 # Search garbage collected termcells : 25
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.006 s
% 0.18/0.48 # System time : 0.000 s
% 0.18/0.48 # Total time : 0.006 s
% 0.18/0.48 # Maximum resident set size: 1588 pages
% 0.18/0.48
% 0.18/0.48 # -------------------------------------------------
% 0.18/0.48 # User time : 0.007 s
% 0.18/0.48 # System time : 0.002 s
% 0.18/0.48 # Total time : 0.009 s
% 0.18/0.48 # Maximum resident set size: 1696 pages
% 0.18/0.48 % E---3.1 exiting
% 0.18/0.48 % E exiting
%------------------------------------------------------------------------------