TSTP Solution File: SET846-2 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SET846-2 : 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:24:29 EDT 2024
% Result : Timeout 300.24s 100.58s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 17 ( 8 unt; 0 nHn; 15 RR)
% Number of literals : 26 ( 0 equ; 14 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 31 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(cls_conjecture_1,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(t_a))),
file('/export/starexec/sandbox/tmp/tmp.RrNtVKkevM/E---3.1_3190.p',cls_conjecture_1) ).
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/sandbox/tmp/tmp.RrNtVKkevM/E---3.1_3190.p',cls_Set_OUnion__upper_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/sandbox/tmp/tmp.RrNtVKkevM/E---3.1_3190.p',cls_Zorn_OTFin_OsuccI_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/sandbox/tmp/tmp.RrNtVKkevM/E---3.1_3190.p',cls_Zorn_OTFin__UnionI_0) ).
cnf(cls_Set_Osubset__refl_0,axiom,
c_lessequals(X1,X1,tc_set(X2)),
file('/export/starexec/sandbox/tmp/tmp.RrNtVKkevM/E---3.1_3190.p',cls_Set_Osubset__refl_0) ).
cnf(c_0_5,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(t_a))),
inference(fof_simplification,[status(thm)],[cls_conjecture_1]) ).
cnf(c_0_6,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_7,negated_conjecture,
~ c_lessequals(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),tc_set(tc_set(t_a))),
c_0_5 ).
cnf(c_0_8,plain,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
c_0_6 ).
cnf(c_0_9,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_10,negated_conjecture,
~ c_in(c_Zorn_Osucc(v_S,c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),t_a),c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,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_9 ).
cnf(c_0_12,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_13,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(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,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_12 ).
cnf(c_0_15,axiom,
c_lessequals(X1,X1,tc_set(X2)),
cls_Set_Osubset__refl_0 ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET846-2 : TPTP v8.1.2. Released v3.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n028.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 10:43:48 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.48 Running first-order model finding
% 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 --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.RrNtVKkevM/E---3.1_3190.p
% 300.24/100.58 # Version: 3.1.0
% 300.24/100.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.24/100.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.24/100.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.24/100.58 # Starting new_bool_3 with 300s (1) cores
% 300.24/100.58 # Starting new_bool_1 with 300s (1) cores
% 300.24/100.58 # Starting sh5l with 300s (1) cores
% 300.24/100.58 # new_bool_3 with pid 3303 completed with status 0
% 300.24/100.58 # Result found by new_bool_3
% 300.24/100.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.24/100.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.24/100.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.24/100.58 # Starting new_bool_3 with 300s (1) cores
% 300.24/100.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.24/100.58 # Search class: FHUNF-FFSF32-MFFFFFNN
% 300.24/100.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.24/100.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 300.24/100.58 # SAT001_MinMin_p005000_rr_RG with pid 3307 completed with status 0
% 300.24/100.58 # Result found by SAT001_MinMin_p005000_rr_RG
% 300.24/100.58 # Preprocessing class: FSSSSMSSSSSNFFN.
% 300.24/100.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 300.24/100.58 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 300.24/100.58 # Starting new_bool_3 with 300s (1) cores
% 300.24/100.58 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 300.24/100.58 # Search class: FHUNF-FFSF32-MFFFFFNN
% 300.24/100.58 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 300.24/100.58 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 300.24/100.58 # Preprocessing time : 0.001 s
% 300.24/100.58 # Presaturation interreduction done
% 300.24/100.58
% 300.24/100.58 # Proof found!
% 300.24/100.58 # SZS status Unsatisfiable
% 300.24/100.58 # SZS output start CNFRefutation
% See solution above
% 300.24/100.58 # Parsed axioms : 5
% 300.24/100.58 # Removed by relevancy pruning/SinE : 0
% 300.24/100.58 # Initial clauses : 5
% 300.24/100.58 # Removed in clause preprocessing : 0
% 300.24/100.58 # Initial clauses in saturation : 5
% 300.24/100.58 # Processed clauses : 12
% 300.24/100.58 # ...of these trivial : 0
% 300.24/100.58 # ...subsumed : 0
% 300.24/100.58 # ...remaining for further processing : 12
% 300.24/100.58 # Other redundant clauses eliminated : 0
% 300.24/100.58 # Clauses deleted for lack of memory : 0
% 300.24/100.58 # Backward-subsumed : 0
% 300.24/100.58 # Backward-rewritten : 0
% 300.24/100.58 # Generated clauses : 3
% 300.24/100.58 # ...of the previous two non-redundant : 2
% 300.24/100.58 # ...aggressively subsumed : 0
% 300.24/100.58 # Contextual simplify-reflections : 0
% 300.24/100.58 # Paramodulations : 3
% 300.24/100.58 # Factorizations : 0
% 300.24/100.58 # NegExts : 0
% 300.24/100.58 # Equation resolutions : 0
% 300.24/100.58 # Disequality decompositions : 0
% 300.24/100.58 # Total rewrite steps : 1
% 300.24/100.58 # ...of those cached : 0
% 300.24/100.58 # Propositional unsat checks : 0
% 300.24/100.58 # Propositional check models : 0
% 300.24/100.58 # Propositional check unsatisfiable : 0
% 300.24/100.58 # Propositional clauses : 0
% 300.24/100.58 # Propositional clauses after purity: 0
% 300.24/100.58 # Propositional unsat core size : 0
% 300.24/100.58 # Propositional preprocessing time : 0.000
% 300.24/100.58 # Propositional encoding time : 0.000
% 300.24/100.58 # Propositional solver time : 0.000
% 300.24/100.58 # Success case prop preproc time : 0.000
% 300.24/100.58 # Success case prop encoding time : 0.000
% 300.24/100.58 # Success case prop solver time : 0.000
% 300.24/100.58 # Current number of processed clauses : 7
% 300.24/100.58 # Positive orientable unit clauses : 1
% 300.24/100.58 # Positive unorientable unit clauses: 0
% 300.24/100.58 # Negative unit clauses : 3
% 300.24/100.58 # Non-unit-clauses : 3
% 300.24/100.58 # Current number of unprocessed clauses: 0
% 300.24/100.58 # ...number of literals in the above : 0
% 300.24/100.58 # Current number of archived formulas : 0
% 300.24/100.58 # Current number of archived clauses : 5
% 300.24/100.58 # Clause-clause subsumption calls (NU) : 0
% 300.24/100.58 # Rec. Clause-clause subsumption calls : 0
% 300.24/100.58 # Non-unit clause-clause subsumptions : 0
% 300.24/100.58 # Unit Clause-clause subsumption calls : 1
% 300.24/100.58 # Rewrite failures with RHS unbound : 0
% 300.24/100.58 # BW rewrite match attempts : 0
% 300.24/100.58 # BW rewrite match successes : 0
% 300.24/100.58 # Condensation attempts : 0
% 300.24/100.58 # Condensation successes : 0
% 300.24/100.58 # Termbank termtop insertions : 273
% 300.24/100.58 # Search garbage collected termcells : 11
% 300.24/100.58
% 300.24/100.58 # -------------------------------------------------
% 300.24/100.58 # User time : 0.004 s
% 300.24/100.58 # System time : 0.000 s
% 300.24/100.58 # Total time : 0.004 s
% 300.24/100.58 # Maximum resident set size: 1604 pages
% 300.24/100.58
% 300.24/100.58 # -------------------------------------------------
% 300.24/100.58 # User time : 0.006 s
% 300.24/100.58 # System time : 0.002 s
% 300.24/100.58 # Total time : 0.008 s
% 300.24/100.58 # Maximum resident set size: 1688 pages
% 300.24/100.58 % E---3.1 exiting
%------------------------------------------------------------------------------