TSTP Solution File: SET865-1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET865-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n008.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:23 EDT 2024
% Result : Unsatisfiable 5.21s 1.17s
% Output : CNFRefutation 5.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 27 ( 6 unt; 0 nHn; 23 RR)
% Number of literals : 58 ( 6 equ; 36 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_Set_OsubsetD_0,axiom,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/Axioms/MSC001-0.ax',cls_Set_OsubsetD_0) ).
cnf(cls_Zorn_Omaxchain__Zorn_0,axiom,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__Zorn_0) ).
cnf(cls_conjecture_2,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_conjecture_0,negated_conjecture,
( c_in(c_Union(X1,t_a),v_S,tc_set(t_a))
| ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
cnf(cls_Zorn_Omaxchain__subset__chain_0,axiom,
c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_Omaxchain__subset__chain_0) ).
cnf(cls_conjecture_1,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
cnf(cls_Zorn_OHausdorff_0,axiom,
c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OHausdorff_0) ).
cnf(c_0_8,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Set_OsubsetD_0]) ).
cnf(c_0_9,plain,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_Omaxchain__Zorn_0]) ).
cnf(c_0_10,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_11,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_12,negated_conjecture,
( c_in(c_Union(X1,t_a),v_S,tc_set(t_a))
| ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_0]) ).
cnf(c_0_13,plain,
( c_in(X1,X4,X3)
| ~ c_in(X1,X2,X3)
| ~ c_lessequals(X2,X4,tc_set(X3)) ),
c_0_8 ).
cnf(c_0_14,axiom,
c_lessequals(c_Zorn_Omaxchain(X1,X2),c_Zorn_Ochain(X1,X2),tc_set(tc_set(tc_set(X2)))),
cls_Zorn_Omaxchain__subset__chain_0 ).
cnf(c_0_15,plain,
( c_Union(X4,X3) = X1
| ~ c_in(X1,X2,tc_set(X3))
| ~ c_in(X4,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3)))
| ~ c_lessequals(c_Union(X4,X3),X1,tc_set(X3)) ),
c_0_9 ).
cnf(c_0_16,negated_conjecture,
( c_lessequals(X1,v_x(X1),tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
c_0_10 ).
cnf(c_0_17,negated_conjecture,
( X1 != v_x(X1)
| ~ c_in(X1,v_S,tc_set(t_a)) ),
c_0_11 ).
cnf(c_0_18,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_19,negated_conjecture,
( c_in(c_Union(X1,t_a),v_S,tc_set(t_a))
| ~ c_in(X1,c_Zorn_Ochain(v_S,t_a),tc_set(tc_set(t_a))) ),
c_0_12 ).
cnf(c_0_20,plain,
( c_in(X1,c_Zorn_Ochain(X2,X3),tc_set(tc_set(X3)))
| ~ c_in(X1,c_Zorn_Omaxchain(X2,X3),tc_set(tc_set(X3))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( ~ c_in(X1,c_Zorn_Omaxchain(X2,t_a),tc_set(tc_set(t_a)))
| ~ c_in(v_x(c_Union(X1,t_a)),X2,tc_set(t_a))
| ~ c_in(c_Union(X1,t_a),v_S,tc_set(t_a)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( c_in(v_x(X1),v_S,tc_set(t_a))
| ~ c_in(X1,v_S,tc_set(t_a)) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
( c_in(c_Union(X1,t_a),v_S,tc_set(t_a))
| ~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
~ c_in(X1,c_Zorn_Omaxchain(v_S,t_a),tc_set(tc_set(t_a))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_25,axiom,
c_in(c_Zorn_OHausdorff__1(X1,X2),c_Zorn_Omaxchain(X1,X2),tc_set(tc_set(X2))),
cls_Zorn_OHausdorff_0 ).
cnf(c_0_26,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_24,c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET865-1 : TPTP v8.2.0. Released v3.2.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n008.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 13:23:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 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/benchmark/theBenchmark.p
% 5.21/1.17 # Version: 3.1.0
% 5.21/1.17 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.21/1.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.21/1.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.21/1.17 # Starting new_bool_3 with 300s (1) cores
% 5.21/1.17 # Starting new_bool_1 with 300s (1) cores
% 5.21/1.17 # Starting sh5l with 300s (1) cores
% 5.21/1.17 # sh5l with pid 25146 completed with status 0
% 5.21/1.17 # Result found by sh5l
% 5.21/1.17 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.21/1.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.21/1.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.21/1.17 # Starting new_bool_3 with 300s (1) cores
% 5.21/1.17 # Starting new_bool_1 with 300s (1) cores
% 5.21/1.17 # Starting sh5l with 300s (1) cores
% 5.21/1.17 # SinE strategy is gf500_gu_R04_F100_L20000
% 5.21/1.17 # Search class: FGHSM-SSLM32-MFFFFFNN
% 5.21/1.17 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.21/1.17 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 5.21/1.17 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 25154 completed with status 0
% 5.21/1.17 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 5.21/1.17 # Preprocessing class: FMLMSMSMSSSNFFN.
% 5.21/1.17 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.21/1.17 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 5.21/1.17 # Starting new_bool_3 with 300s (1) cores
% 5.21/1.17 # Starting new_bool_1 with 300s (1) cores
% 5.21/1.17 # Starting sh5l with 300s (1) cores
% 5.21/1.17 # SinE strategy is gf500_gu_R04_F100_L20000
% 5.21/1.17 # Search class: FGHSM-SSLM32-MFFFFFNN
% 5.21/1.17 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 5.21/1.17 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 5.21/1.17 # Preprocessing time : 0.009 s
% 5.21/1.17 # Presaturation interreduction done
% 5.21/1.17
% 5.21/1.17 # Proof found!
% 5.21/1.17 # SZS status Unsatisfiable
% 5.21/1.17 # SZS output start CNFRefutation
% See solution above
% 5.21/1.17 # Parsed axioms : 1364
% 5.21/1.17 # Removed by relevancy pruning/SinE : 138
% 5.21/1.17 # Initial clauses : 1226
% 5.21/1.17 # Removed in clause preprocessing : 1
% 5.21/1.17 # Initial clauses in saturation : 1225
% 5.21/1.17 # Processed clauses : 7697
% 5.21/1.17 # ...of these trivial : 12
% 5.21/1.17 # ...subsumed : 3413
% 5.21/1.17 # ...remaining for further processing : 4272
% 5.21/1.17 # Other redundant clauses eliminated : 0
% 5.21/1.17 # Clauses deleted for lack of memory : 0
% 5.21/1.17 # Backward-subsumed : 8
% 5.21/1.17 # Backward-rewritten : 15
% 5.21/1.17 # Generated clauses : 16282
% 5.21/1.17 # ...of the previous two non-redundant : 15351
% 5.21/1.17 # ...aggressively subsumed : 0
% 5.21/1.17 # Contextual simplify-reflections : 8
% 5.21/1.17 # Paramodulations : 16262
% 5.21/1.17 # Factorizations : 0
% 5.21/1.17 # NegExts : 0
% 5.21/1.17 # Equation resolutions : 20
% 5.21/1.17 # Disequality decompositions : 0
% 5.21/1.17 # Total rewrite steps : 933
% 5.21/1.17 # ...of those cached : 809
% 5.21/1.17 # Propositional unsat checks : 0
% 5.21/1.17 # Propositional check models : 0
% 5.21/1.17 # Propositional check unsatisfiable : 0
% 5.21/1.17 # Propositional clauses : 0
% 5.21/1.17 # Propositional clauses after purity: 0
% 5.21/1.17 # Propositional unsat core size : 0
% 5.21/1.17 # Propositional preprocessing time : 0.000
% 5.21/1.17 # Propositional encoding time : 0.000
% 5.21/1.17 # Propositional solver time : 0.000
% 5.21/1.17 # Success case prop preproc time : 0.000
% 5.21/1.17 # Success case prop encoding time : 0.000
% 5.21/1.17 # Success case prop solver time : 0.000
% 5.21/1.17 # Current number of processed clauses : 3047
% 5.21/1.17 # Positive orientable unit clauses : 179
% 5.21/1.17 # Positive unorientable unit clauses: 0
% 5.21/1.17 # Negative unit clauses : 1265
% 5.21/1.17 # Non-unit-clauses : 1603
% 5.21/1.17 # Current number of unprocessed clauses: 10079
% 5.21/1.17 # ...number of literals in the above : 13194
% 5.21/1.17 # Current number of archived formulas : 0
% 5.21/1.17 # Current number of archived clauses : 1225
% 5.21/1.17 # Clause-clause subsumption calls (NU) : 1577043
% 5.21/1.17 # Rec. Clause-clause subsumption calls : 1481376
% 5.21/1.17 # Non-unit clause-clause subsumptions : 2796
% 5.21/1.17 # Unit Clause-clause subsumption calls : 438048
% 5.21/1.17 # Rewrite failures with RHS unbound : 0
% 5.21/1.17 # BW rewrite match attempts : 116
% 5.21/1.17 # BW rewrite match successes : 12
% 5.21/1.17 # Condensation attempts : 0
% 5.21/1.17 # Condensation successes : 0
% 5.21/1.17 # Termbank termtop insertions : 550221
% 5.21/1.17 # Search garbage collected termcells : 1919
% 5.21/1.17
% 5.21/1.17 # -------------------------------------------------
% 5.21/1.17 # User time : 0.598 s
% 5.21/1.17 # System time : 0.049 s
% 5.21/1.17 # Total time : 0.647 s
% 5.21/1.17 # Maximum resident set size: 4052 pages
% 5.21/1.17
% 5.21/1.17 # -------------------------------------------------
% 5.21/1.17 # User time : 0.619 s
% 5.21/1.17 # System time : 0.051 s
% 5.21/1.17 # Total time : 0.670 s
% 5.21/1.17 # Maximum resident set size: 2412 pages
% 5.21/1.17 % E---3.1 exiting
% 5.21/1.17 % E exiting
%------------------------------------------------------------------------------