TSTP Solution File: SET637+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET637+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:20:04 EDT 2023
% Result : Theorem 0.15s 0.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 11 unt; 0 def)
% Number of atoms : 109 ( 21 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 112 ( 47 ~; 47 |; 11 &)
% ( 7 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 83 ( 4 sgn; 37 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',empty_set_defn) ).
fof(equal_member_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ! [X3] :
( member(X3,X1)
<=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',equal_member_defn) ).
fof(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',intersect_defn) ).
fof(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X1)
& member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',intersection_defn) ).
fof(prove_th119,conjecture,
! [X1,X2] :
( intersect(X1,X2)
<=> not_equal(intersection(X1,X2),empty_set) ),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',prove_th119) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',commutativity_of_intersection) ).
fof(not_equal_defn,axiom,
! [X1,X2] :
( not_equal(X1,X2)
<=> X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.FyblPS2plZ/E---3.1_9556.p',not_equal_defn) ).
fof(c_0_7,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(c_0_8,plain,
! [X8] : ~ member(X8,empty_set),
inference(variable_rename,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X22,X23,X24,X25,X26,X27] :
( ( ~ member(X24,X22)
| member(X24,X23)
| X22 != X23 )
& ( ~ member(X25,X23)
| member(X25,X22)
| X22 != X23 )
& ( ~ member(esk4_2(X26,X27),X26)
| ~ member(esk4_2(X26,X27),X27)
| X26 = X27 )
& ( member(esk4_2(X26,X27),X26)
| member(esk4_2(X26,X27),X27)
| X26 = X27 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_member_defn])])])])])]) ).
fof(c_0_10,plain,
! [X14,X15,X17,X18,X19] :
( ( member(esk3_2(X14,X15),X14)
| ~ intersect(X14,X15) )
& ( member(esk3_2(X14,X15),X15)
| ~ intersect(X14,X15) )
& ( ~ member(X19,X17)
| ~ member(X19,X18)
| intersect(X17,X18) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[intersect_defn])])])])])]) ).
fof(c_0_11,plain,
! [X9,X10,X11] :
( ( member(X11,X9)
| ~ member(X11,intersection(X9,X10)) )
& ( member(X11,X10)
| ~ member(X11,intersection(X9,X10)) )
& ( ~ member(X11,X9)
| ~ member(X11,X10)
| member(X11,intersection(X9,X10)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])]) ).
cnf(c_0_12,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( member(esk4_2(X1,X2),X1)
| member(esk4_2(X1,X2),X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( intersect(X2,X3)
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( member(esk3_2(X1,X2),X1)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(esk3_2(X1,X2),X2)
| ~ intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( empty_set = X1
| member(esk4_2(empty_set,X1),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2] :
( intersect(X1,X2)
<=> not_equal(intersection(X1,X2),empty_set) ),
inference(assume_negation,[status(cth)],[prove_th119]) ).
cnf(c_0_20,plain,
( intersect(X1,X2)
| ~ intersect(X2,X3)
| ~ member(esk3_2(X2,X3),X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
( member(esk3_2(X1,intersection(X2,X3)),X2)
| ~ intersect(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
fof(c_0_22,plain,
! [X12,X13] : intersection(X12,X13) = intersection(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_23,plain,
( empty_set = X1
| intersect(X2,X1)
| ~ member(esk4_2(empty_set,X1),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
fof(c_0_24,negated_conjecture,
( ( ~ intersect(esk1_0,esk2_0)
| ~ not_equal(intersection(esk1_0,esk2_0),empty_set) )
& ( intersect(esk1_0,esk2_0)
| not_equal(intersection(esk1_0,esk2_0),empty_set) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_25,plain,
! [X6,X7] :
( ( ~ not_equal(X6,X7)
| X6 != X7 )
& ( X6 = X7
| not_equal(X6,X7) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[not_equal_defn])]) ).
cnf(c_0_26,plain,
( intersect(X1,X2)
| ~ intersect(X2,intersection(X1,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( empty_set = X1
| intersect(X1,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_13]),c_0_12]) ).
cnf(c_0_29,negated_conjecture,
( ~ intersect(esk1_0,esk2_0)
| ~ not_equal(intersection(esk1_0,esk2_0),empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
( X1 = X2
| not_equal(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( intersect(X1,X2)
| ~ intersect(X2,intersection(X3,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
( intersection(X1,X2) = empty_set
| intersect(X1,intersection(X1,X2)) ),
inference(spm,[status(thm)],[c_0_26,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
( intersection(esk1_0,esk2_0) = empty_set
| ~ intersect(esk1_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( intersection(X1,X2) = empty_set
| intersect(X2,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,negated_conjecture,
intersection(esk1_0,esk2_0) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_27])]) ).
cnf(c_0_37,plain,
( ~ not_equal(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_12]) ).
cnf(c_0_39,negated_conjecture,
( intersect(esk1_0,esk2_0)
| not_equal(intersection(esk1_0,esk2_0),empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,plain,
~ not_equal(X1,X1),
inference(er,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( ~ intersect(X1,esk2_0)
| ~ member(esk3_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_17]) ).
cnf(c_0_42,negated_conjecture,
intersect(esk1_0,esk2_0),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_36]),c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_15]),c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET637+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:27:25 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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/tmp/tmp.FyblPS2plZ/E---3.1_9556.p
% 0.15/0.43 # Version: 3.1pre001
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.43 # Starting sh5l with 300s (1) cores
% 0.15/0.43 # new_bool_3 with pid 9636 completed with status 0
% 0.15/0.43 # Result found by new_bool_3
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # SAT001_MinMin_p005000_rr_RG with pid 9639 completed with status 0
% 0.15/0.43 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.15/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.43 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.43 # Search class: FGHSF-FFSF22-SFFFFFNN
% 0.15/0.43 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.43 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.15/0.43 # Preprocessing time : 0.001 s
% 0.15/0.43 # Presaturation interreduction done
% 0.15/0.43
% 0.15/0.43 # Proof found!
% 0.15/0.43 # SZS status Theorem
% 0.15/0.43 # SZS output start CNFRefutation
% See solution above
% 0.15/0.43 # Parsed axioms : 9
% 0.15/0.43 # Removed by relevancy pruning/SinE : 1
% 0.15/0.43 # Initial clauses : 17
% 0.15/0.43 # Removed in clause preprocessing : 2
% 0.15/0.43 # Initial clauses in saturation : 15
% 0.15/0.43 # Processed clauses : 119
% 0.15/0.43 # ...of these trivial : 3
% 0.15/0.43 # ...subsumed : 49
% 0.15/0.43 # ...remaining for further processing : 67
% 0.15/0.43 # Other redundant clauses eliminated : 1
% 0.15/0.43 # Clauses deleted for lack of memory : 0
% 0.15/0.43 # Backward-subsumed : 0
% 0.15/0.43 # Backward-rewritten : 5
% 0.15/0.43 # Generated clauses : 200
% 0.15/0.43 # ...of the previous two non-redundant : 177
% 0.15/0.43 # ...aggressively subsumed : 0
% 0.15/0.43 # Contextual simplify-reflections : 0
% 0.15/0.43 # Paramodulations : 197
% 0.15/0.43 # Factorizations : 2
% 0.15/0.43 # NegExts : 0
% 0.15/0.43 # Equation resolutions : 1
% 0.15/0.43 # Total rewrite steps : 27
% 0.15/0.43 # Propositional unsat checks : 0
% 0.15/0.43 # Propositional check models : 0
% 0.15/0.43 # Propositional check unsatisfiable : 0
% 0.15/0.43 # Propositional clauses : 0
% 0.15/0.43 # Propositional clauses after purity: 0
% 0.15/0.43 # Propositional unsat core size : 0
% 0.15/0.43 # Propositional preprocessing time : 0.000
% 0.15/0.43 # Propositional encoding time : 0.000
% 0.15/0.43 # Propositional solver time : 0.000
% 0.15/0.43 # Success case prop preproc time : 0.000
% 0.15/0.43 # Success case prop encoding time : 0.000
% 0.15/0.43 # Success case prop solver time : 0.000
% 0.15/0.43 # Current number of processed clauses : 46
% 0.15/0.43 # Positive orientable unit clauses : 7
% 0.15/0.43 # Positive unorientable unit clauses: 1
% 0.15/0.43 # Negative unit clauses : 4
% 0.15/0.43 # Non-unit-clauses : 34
% 0.15/0.43 # Current number of unprocessed clauses: 85
% 0.15/0.43 # ...number of literals in the above : 221
% 0.15/0.43 # Current number of archived formulas : 0
% 0.15/0.43 # Current number of archived clauses : 20
% 0.15/0.43 # Clause-clause subsumption calls (NU) : 157
% 0.15/0.43 # Rec. Clause-clause subsumption calls : 151
% 0.15/0.43 # Non-unit clause-clause subsumptions : 17
% 0.15/0.43 # Unit Clause-clause subsumption calls : 25
% 0.15/0.43 # Rewrite failures with RHS unbound : 0
% 0.15/0.43 # BW rewrite match attempts : 5
% 0.15/0.43 # BW rewrite match successes : 5
% 0.15/0.43 # Condensation attempts : 0
% 0.15/0.43 # Condensation successes : 0
% 0.15/0.43 # Termbank termtop insertions : 2686
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.005 s
% 0.15/0.43 # System time : 0.004 s
% 0.15/0.43 # Total time : 0.009 s
% 0.15/0.43 # Maximum resident set size: 1756 pages
% 0.15/0.43
% 0.15/0.43 # -------------------------------------------------
% 0.15/0.43 # User time : 0.005 s
% 0.15/0.43 # System time : 0.006 s
% 0.15/0.43 # Total time : 0.011 s
% 0.15/0.43 # Maximum resident set size: 1676 pages
% 0.15/0.43 % E---3.1 exiting
% 0.15/0.43 % E---3.1 exiting
%------------------------------------------------------------------------------