TSTP Solution File: SET852-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET852-1 : TPTP v8.2.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 03:00:10 EDT 2024
% Result : Unsatisfiable 0.36s 0.90s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of clauses : 22 ( 9 unt; 13 nHn; 19 RR)
% Number of literals : 46 ( 0 equ; 15 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 36 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_2,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
cnf(cls_conjecture_3,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
cnf(cls_Zorn_OUnion__lemma0_0,axiom,
( c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_0) ).
cnf(cls_conjecture_4,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).
cnf(cls_Zorn_OUnion__lemma0_2,axiom,
( c_lessequals(X1,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
| ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_2) ).
cnf(cls_Zorn_OUnion__lemma0_1,axiom,
( c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Zorn_OUnion__lemma0_1) ).
cnf(c_0_6,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_2]) ).
cnf(c_0_7,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_3]) ).
cnf(c_0_8,negated_conjecture,
~ c_lessequals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
c_0_6 ).
cnf(c_0_9,axiom,
( c_in(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X3,tc_set(X4))
| c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4)) ),
cls_Zorn_OUnion__lemma0_0 ).
cnf(c_0_10,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
inference(fof_simplification,[status(thm)],[cls_conjecture_4]) ).
cnf(c_0_11,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
c_0_7 ).
cnf(c_0_12,negated_conjecture,
( c_lessequals(X1,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_in(c_Zorn_OUnion__lemma0__1(v_m,X1,v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,plain,
( c_lessequals(X1,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
| ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OUnion__lemma0_2]) ).
cnf(c_0_14,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),X1,tc_set(tc_set(t_a)))
| c_lessequals(X1,v_m,tc_set(tc_set(t_a)))
| ~ c_in(X1,v_Y,tc_set(tc_set(t_a))) ),
c_0_10 ).
cnf(c_0_15,negated_conjecture,
c_in(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4)) ),
inference(fof_simplification,[status(thm)],[cls_Zorn_OUnion__lemma0_1]) ).
cnf(c_0_17,plain,
( c_lessequals(X1,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X2,tc_set(X4))
| ~ c_lessequals(X1,c_Zorn_OUnion__lemma0__1(X2,X1,X3,X4),tc_set(X4)) ),
c_0_13 ).
cnf(c_0_18,negated_conjecture,
( c_lessequals(c_Zorn_Osucc(v_S,v_m,t_a),c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),tc_set(tc_set(t_a)))
| c_lessequals(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( c_lessequals(X2,c_Union(X3,X4),tc_set(X4))
| c_lessequals(c_Union(X3,X4),X1,tc_set(X4))
| ~ c_lessequals(c_Zorn_OUnion__lemma0__1(X1,X2,X3,X4),X1,tc_set(X4)) ),
c_0_16 ).
cnf(c_0_20,negated_conjecture,
c_lessequals(c_Zorn_OUnion__lemma0__1(v_m,c_Zorn_Osucc(v_S,v_m,t_a),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_11]),c_0_8]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_11]),c_0_8]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET852-1 : TPTP v8.2.0. Released v3.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 13:09:53 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.21/0.52 Running first-order model finding
% 0.21/0.52 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.36/0.90 # Version: 3.1.0
% 0.36/0.90 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.36/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.90 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.90 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.90 # Starting sh5l with 300s (1) cores
% 0.36/0.90 # sh5l with pid 28691 completed with status 0
% 0.36/0.90 # Result found by sh5l
% 0.36/0.90 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.36/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.90 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.90 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.90 # Starting sh5l with 300s (1) cores
% 0.36/0.90 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.90 # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.36/0.90 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.90 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 0.36/0.90 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 28697 completed with status 0
% 0.36/0.90 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 0.36/0.90 # Preprocessing class: FMLMSMSMSSSNFFN.
% 0.36/0.90 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.90 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.36/0.90 # Starting new_bool_3 with 300s (1) cores
% 0.36/0.90 # Starting new_bool_1 with 300s (1) cores
% 0.36/0.90 # Starting sh5l with 300s (1) cores
% 0.36/0.90 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.36/0.90 # Search class: FGHSM-SSLM32-MFFFFFNN
% 0.36/0.90 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.90 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 163s (1) cores
% 0.36/0.90 # Preprocessing time : 0.010 s
% 0.36/0.90 # Presaturation interreduction done
% 0.36/0.90
% 0.36/0.90 # Proof found!
% 0.36/0.90 # SZS status Unsatisfiable
% 0.36/0.90 # SZS output start CNFRefutation
% See solution above
% 0.36/0.90 # Parsed axioms : 1367
% 0.36/0.90 # Removed by relevancy pruning/SinE : 138
% 0.36/0.90 # Initial clauses : 1229
% 0.36/0.90 # Removed in clause preprocessing : 1
% 0.36/0.90 # Initial clauses in saturation : 1228
% 0.36/0.90 # Processed clauses : 3753
% 0.36/0.90 # ...of these trivial : 5
% 0.36/0.90 # ...subsumed : 974
% 0.36/0.90 # ...remaining for further processing : 2774
% 0.36/0.90 # Other redundant clauses eliminated : 0
% 0.36/0.90 # Clauses deleted for lack of memory : 0
% 0.36/0.90 # Backward-subsumed : 2
% 0.36/0.90 # Backward-rewritten : 7
% 0.36/0.90 # Generated clauses : 5404
% 0.36/0.90 # ...of the previous two non-redundant : 4588
% 0.36/0.90 # ...aggressively subsumed : 0
% 0.36/0.90 # Contextual simplify-reflections : 2
% 0.36/0.90 # Paramodulations : 5390
% 0.36/0.90 # Factorizations : 2
% 0.36/0.90 # NegExts : 0
% 0.36/0.90 # Equation resolutions : 12
% 0.36/0.90 # Disequality decompositions : 0
% 0.36/0.90 # Total rewrite steps : 828
% 0.36/0.90 # ...of those cached : 721
% 0.36/0.90 # Propositional unsat checks : 0
% 0.36/0.90 # Propositional check models : 0
% 0.36/0.90 # Propositional check unsatisfiable : 0
% 0.36/0.90 # Propositional clauses : 0
% 0.36/0.90 # Propositional clauses after purity: 0
% 0.36/0.90 # Propositional unsat core size : 0
% 0.36/0.90 # Propositional preprocessing time : 0.000
% 0.36/0.90 # Propositional encoding time : 0.000
% 0.36/0.90 # Propositional solver time : 0.000
% 0.36/0.90 # Success case prop preproc time : 0.000
% 0.36/0.90 # Success case prop encoding time : 0.000
% 0.36/0.90 # Success case prop solver time : 0.000
% 0.36/0.90 # Current number of processed clauses : 1560
% 0.36/0.90 # Positive orientable unit clauses : 155
% 0.36/0.90 # Positive unorientable unit clauses: 0
% 0.36/0.90 # Negative unit clauses : 213
% 0.36/0.90 # Non-unit-clauses : 1192
% 0.36/0.90 # Current number of unprocessed clauses: 3206
% 0.36/0.90 # ...number of literals in the above : 6536
% 0.36/0.90 # Current number of archived formulas : 0
% 0.36/0.90 # Current number of archived clauses : 1214
% 0.36/0.90 # Clause-clause subsumption calls (NU) : 906753
% 0.36/0.90 # Rec. Clause-clause subsumption calls : 879299
% 0.36/0.90 # Non-unit clause-clause subsumptions : 820
% 0.36/0.90 # Unit Clause-clause subsumption calls : 32960
% 0.36/0.90 # Rewrite failures with RHS unbound : 0
% 0.36/0.90 # BW rewrite match attempts : 66
% 0.36/0.90 # BW rewrite match successes : 7
% 0.36/0.90 # Condensation attempts : 0
% 0.36/0.90 # Condensation successes : 0
% 0.36/0.90 # Termbank termtop insertions : 101171
% 0.36/0.90 # Search garbage collected termcells : 1923
% 0.36/0.90
% 0.36/0.90 # -------------------------------------------------
% 0.36/0.90 # User time : 0.314 s
% 0.36/0.90 # System time : 0.014 s
% 0.36/0.90 # Total time : 0.328 s
% 0.36/0.90 # Maximum resident set size: 4068 pages
% 0.36/0.90
% 0.36/0.90 # -------------------------------------------------
% 0.36/0.90 # User time : 0.342 s
% 0.36/0.90 # System time : 0.018 s
% 0.36/0.90 # Total time : 0.361 s
% 0.36/0.90 # Maximum resident set size: 2416 pages
% 0.36/0.90 % E---3.1 exiting
%------------------------------------------------------------------------------