TSTP Solution File: SET845-2 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET845-2 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n010.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:24:10 EDT 2023
% Result : Unsatisfiable 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 18 ( 9 unt; 0 nHn; 16 RR)
% Number of literals : 29 ( 7 equ; 13 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 29 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
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/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_Set_OUnion__upper_0) ).
cnf(cls_conjecture_1,negated_conjecture,
v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
file('/export/starexec/sandbox2/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_conjecture_1) ).
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/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_Set_Osubset__antisym_0) ).
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/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_Zorn_OAbrial__axiom1_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/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_Zorn_OTFin_OsuccI_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/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_conjecture_0) ).
cnf(cls_conjecture_2,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
file('/export/starexec/sandbox2/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p',cls_conjecture_2) ).
cnf(c_0_7,axiom,
( c_lessequals(X1,c_Union(X2,X3),tc_set(X3))
| ~ c_in(X1,X2,tc_set(X3)) ),
cls_Set_OUnion__upper_0 ).
cnf(c_0_8,negated_conjecture,
v_m = c_Union(c_Zorn_OTFin(v_S,t_a),tc_set(t_a)),
cls_conjecture_1 ).
cnf(c_0_9,axiom,
( X2 = X1
| ~ c_lessequals(X1,X2,tc_set(X3))
| ~ c_lessequals(X2,X1,tc_set(X3)) ),
cls_Set_Osubset__antisym_0 ).
cnf(c_0_10,axiom,
c_lessequals(X1,c_Zorn_Osucc(X2,X1,X3),tc_set(tc_set(X3))),
cls_Zorn_OAbrial__axiom1_0 ).
cnf(c_0_11,negated_conjecture,
( 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_7,c_0_8]) ).
cnf(c_0_12,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))) ),
cls_Zorn_OTFin_OsuccI_0 ).
cnf(c_0_13,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_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( 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_11,c_0_12]) ).
cnf(c_0_15,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_16,negated_conjecture,
v_m != c_Zorn_Osucc(v_S,v_m,t_a),
cls_conjecture_2 ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SET845-2 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.14 % Command : run_E %s %d THM
% 0.11/0.34 % Computer : n010.cluster.edu
% 0.11/0.34 % Model : x86_64 x86_64
% 0.11/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.34 % Memory : 8042.1875MB
% 0.11/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.34 % CPULimit : 2400
% 0.11/0.34 % WCLimit : 300
% 0.11/0.34 % DateTime : Mon Oct 2 17:42:05 EDT 2023
% 0.11/0.34 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.ZtcYQ8Hxf9/E---3.1_2616.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # Starting sh5l with 300s (1) cores
% 0.17/0.46 # new_bool_1 with pid 2696 completed with status 0
% 0.17/0.46 # Result found by new_bool_1
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FHUSF-FFSF32-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # SAT001_MinMin_p005000_rr_RG with pid 2701 completed with status 0
% 0.17/0.46 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46 # Search class: FHUSF-FFSF32-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.001 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Unsatisfiable
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 7
% 0.17/0.46 # Removed by relevancy pruning/SinE : 0
% 0.17/0.46 # Initial clauses : 7
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 7
% 0.17/0.46 # Processed clauses : 18
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 0
% 0.17/0.46 # ...remaining for further processing : 18
% 0.17/0.46 # Other redundant clauses eliminated : 0
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 0
% 0.17/0.46 # Backward-rewritten : 0
% 0.17/0.46 # Generated clauses : 8
% 0.17/0.46 # ...of the previous two non-redundant : 7
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 0
% 0.17/0.46 # Paramodulations : 8
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 0
% 0.17/0.46 # Total rewrite steps : 1
% 0.17/0.46 # Propositional unsat checks : 0
% 0.17/0.46 # Propositional check models : 0
% 0.17/0.46 # Propositional check unsatisfiable : 0
% 0.17/0.46 # Propositional clauses : 0
% 0.17/0.46 # Propositional clauses after purity: 0
% 0.17/0.46 # Propositional unsat core size : 0
% 0.17/0.46 # Propositional preprocessing time : 0.000
% 0.17/0.46 # Propositional encoding time : 0.000
% 0.17/0.46 # Propositional solver time : 0.000
% 0.17/0.46 # Success case prop preproc time : 0.000
% 0.17/0.46 # Success case prop encoding time : 0.000
% 0.17/0.46 # Success case prop solver time : 0.000
% 0.17/0.46 # Current number of processed clauses : 11
% 0.17/0.46 # Positive orientable unit clauses : 4
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 1
% 0.17/0.46 # Non-unit-clauses : 6
% 0.17/0.46 # Current number of unprocessed clauses: 2
% 0.17/0.46 # ...number of literals in the above : 5
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 7
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 1
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 1
% 0.17/0.46 # Non-unit clause-clause subsumptions : 0
% 0.17/0.46 # Unit Clause-clause subsumption calls : 0
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 0
% 0.17/0.46 # BW rewrite match successes : 0
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 367
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.003 s
% 0.17/0.46 # System time : 0.000 s
% 0.17/0.46 # Total time : 0.003 s
% 0.17/0.46 # Maximum resident set size: 1636 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.003 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.005 s
% 0.17/0.46 # Maximum resident set size: 1672 pages
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------