TSTP Solution File: SET578+3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET578+3 : TPTP v8.1.2. Released v2.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:19:25 EDT 2023
% Result : Theorem 1.10s 0.57s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 49 ( 15 unt; 0 def)
% Number of atoms : 117 ( 13 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 109 ( 41 ~; 47 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 91 ( 10 sgn; 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th19,conjecture,
! [X1,X2,X3] :
( ! [X4] :
( member(X4,X1)
<=> ( member(X4,X2)
& member(X4,X3) ) )
=> X1 = intersection(X2,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.ORRpFn0M9x/E---3.1_20504.p',prove_th19) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ORRpFn0M9x/E---3.1_20504.p',subset_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.ORRpFn0M9x/E---3.1_20504.p',intersection_defn) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ORRpFn0M9x/E---3.1_20504.p',commutativity_of_intersection) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.ORRpFn0M9x/E---3.1_20504.p',equal_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ! [X4] :
( member(X4,X1)
<=> ( member(X4,X2)
& member(X4,X3) ) )
=> X1 = intersection(X2,X3) ),
inference(assume_negation,[status(cth)],[prove_th19]) ).
fof(c_0_6,plain,
! [X14,X15,X16,X17,X18] :
( ( ~ subset(X14,X15)
| ~ member(X16,X14)
| member(X16,X15) )
& ( member(esk4_2(X17,X18),X17)
| subset(X17,X18) )
& ( ~ member(esk4_2(X17,X18),X18)
| subset(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)],[subset_defn])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X8] :
( ( member(X8,esk2_0)
| ~ member(X8,esk1_0) )
& ( member(X8,esk3_0)
| ~ member(X8,esk1_0) )
& ( ~ member(X8,esk2_0)
| ~ member(X8,esk3_0)
| member(X8,esk1_0) )
& esk1_0 != intersection(esk2_0,esk3_0) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
fof(c_0_8,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_9,plain,
( subset(X1,X2)
| ~ member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( member(X1,X2)
| ~ member(X1,intersection(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( member(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( subset(X1,esk3_0)
| ~ member(esk4_2(X1,esk3_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( subset(intersection(X1,X2),X3)
| member(esk4_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X12,X13] : intersection(X12,X13) = intersection(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_16,plain,
( member(X1,intersection(X2,X3))
| ~ member(X1,X2)
| ~ member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,negated_conjecture,
subset(intersection(X1,esk1_0),esk3_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( subset(X1,intersection(X2,X3))
| ~ member(esk4_2(X1,intersection(X2,X3)),X3)
| ~ member(esk4_2(X1,intersection(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
( subset(X1,esk2_0)
| ~ member(esk4_2(X1,esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_22,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_23,negated_conjecture,
subset(intersection(esk1_0,X1),esk3_0),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,plain,
! [X27,X28] :
( ( subset(X27,X28)
| X27 != X28 )
& ( subset(X28,X27)
| X27 != X28 )
& ( ~ subset(X27,X28)
| ~ subset(X28,X27)
| X27 = X28 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
cnf(c_0_25,plain,
( subset(X1,intersection(X2,X1))
| ~ member(esk4_2(X1,intersection(X2,X1)),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_26,plain,
subset(intersection(X1,X2),X2),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_27,negated_conjecture,
subset(intersection(X1,esk1_0),esk2_0),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( member(X1,esk3_0)
| ~ member(X1,intersection(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
subset(X1,intersection(X1,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_31,plain,
subset(intersection(X1,X2),X1),
inference(spm,[status(thm)],[c_0_26,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
subset(intersection(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_27,c_0_19]) ).
cnf(c_0_33,negated_conjecture,
( subset(intersection(esk1_0,X1),X2)
| member(esk4_2(intersection(esk1_0,X1),X2),esk3_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_12]) ).
cnf(c_0_34,plain,
intersection(X1,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,negated_conjecture,
( member(X1,esk2_0)
| ~ member(X1,intersection(esk1_0,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( subset(esk1_0,X1)
| member(esk4_2(esk1_0,X1),esk3_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( subset(intersection(esk1_0,X1),X2)
| member(esk4_2(intersection(esk1_0,X1),X2),esk2_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_12]) ).
cnf(c_0_38,negated_conjecture,
( member(X1,esk1_0)
| ~ member(X1,esk2_0)
| ~ member(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_39,plain,
( member(X1,X2)
| ~ member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_40,negated_conjecture,
( subset(esk1_0,intersection(X1,esk3_0))
| ~ member(esk4_2(esk1_0,intersection(X1,esk3_0)),X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( subset(esk1_0,X1)
| member(esk4_2(esk1_0,X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_34]) ).
cnf(c_0_42,negated_conjecture,
( subset(intersection(X1,esk3_0),X2)
| member(esk4_2(intersection(X1,esk3_0),X2),esk1_0)
| ~ member(esk4_2(intersection(X1,esk3_0),X2),esk2_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_14]) ).
cnf(c_0_43,plain,
( subset(intersection(X1,X2),X3)
| member(esk4_2(intersection(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_39,c_0_12]) ).
cnf(c_0_44,negated_conjecture,
subset(esk1_0,intersection(esk2_0,esk3_0)),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,negated_conjecture,
esk1_0 != intersection(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_46,negated_conjecture,
( subset(intersection(esk2_0,esk3_0),X1)
| member(esk4_2(intersection(esk2_0,esk3_0),X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
~ subset(intersection(esk2_0,esk3_0),esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_44]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET578+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n008.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 16:50:58 EDT 2023
% 0.11/0.33 % CPUTime :
% 0.17/0.43 Running first-order theorem proving
% 0.17/0.43 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.ORRpFn0M9x/E---3.1_20504.p
% 1.10/0.57 # Version: 3.1pre001
% 1.10/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.10/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.10/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.57 # Starting sh5l with 300s (1) cores
% 1.10/0.57 # new_bool_1 with pid 20584 completed with status 0
% 1.10/0.57 # Result found by new_bool_1
% 1.10/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.10/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.10/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.10/0.57 # Search class: FGUSS-FFSF22-SFFFFFNN
% 1.10/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.10/0.57 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.10/0.57 # U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 20592 completed with status 0
% 1.10/0.57 # Result found by U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 1.10/0.57 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1.10/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.57 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1.10/0.57 # Starting new_bool_3 with 300s (1) cores
% 1.10/0.57 # Starting new_bool_1 with 300s (1) cores
% 1.10/0.57 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.10/0.57 # Search class: FGUSS-FFSF22-SFFFFFNN
% 1.10/0.57 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.10/0.57 # Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 1.10/0.57 # Preprocessing time : 0.001 s
% 1.10/0.57 # Presaturation interreduction done
% 1.10/0.57
% 1.10/0.57 # Proof found!
% 1.10/0.57 # SZS status Theorem
% 1.10/0.57 # SZS output start CNFRefutation
% See solution above
% 1.10/0.57 # Parsed axioms : 7
% 1.10/0.57 # Removed by relevancy pruning/SinE : 0
% 1.10/0.57 # Initial clauses : 19
% 1.10/0.57 # Removed in clause preprocessing : 2
% 1.10/0.57 # Initial clauses in saturation : 17
% 1.10/0.57 # Processed clauses : 1484
% 1.10/0.57 # ...of these trivial : 461
% 1.10/0.57 # ...subsumed : 670
% 1.10/0.57 # ...remaining for further processing : 353
% 1.10/0.57 # Other redundant clauses eliminated : 2
% 1.10/0.57 # Clauses deleted for lack of memory : 0
% 1.10/0.57 # Backward-subsumed : 0
% 1.10/0.57 # Backward-rewritten : 19
% 1.10/0.57 # Generated clauses : 11006
% 1.10/0.57 # ...of the previous two non-redundant : 7722
% 1.10/0.57 # ...aggressively subsumed : 0
% 1.10/0.57 # Contextual simplify-reflections : 2
% 1.10/0.57 # Paramodulations : 10890
% 1.10/0.57 # Factorizations : 114
% 1.10/0.57 # NegExts : 0
% 1.10/0.57 # Equation resolutions : 2
% 1.10/0.57 # Total rewrite steps : 5054
% 1.10/0.57 # Propositional unsat checks : 0
% 1.10/0.57 # Propositional check models : 0
% 1.10/0.57 # Propositional check unsatisfiable : 0
% 1.10/0.57 # Propositional clauses : 0
% 1.10/0.57 # Propositional clauses after purity: 0
% 1.10/0.57 # Propositional unsat core size : 0
% 1.10/0.57 # Propositional preprocessing time : 0.000
% 1.10/0.57 # Propositional encoding time : 0.000
% 1.10/0.57 # Propositional solver time : 0.000
% 1.10/0.57 # Success case prop preproc time : 0.000
% 1.10/0.57 # Success case prop encoding time : 0.000
% 1.10/0.57 # Success case prop solver time : 0.000
% 1.10/0.57 # Current number of processed clauses : 317
% 1.10/0.57 # Positive orientable unit clauses : 99
% 1.10/0.57 # Positive unorientable unit clauses: 1
% 1.10/0.57 # Negative unit clauses : 2
% 1.10/0.57 # Non-unit-clauses : 215
% 1.10/0.57 # Current number of unprocessed clauses: 6230
% 1.10/0.57 # ...number of literals in the above : 15685
% 1.10/0.57 # Current number of archived formulas : 0
% 1.10/0.57 # Current number of archived clauses : 34
% 1.10/0.57 # Clause-clause subsumption calls (NU) : 11150
% 1.10/0.57 # Rec. Clause-clause subsumption calls : 8080
% 1.10/0.57 # Non-unit clause-clause subsumptions : 672
% 1.10/0.57 # Unit Clause-clause subsumption calls : 778
% 1.10/0.57 # Rewrite failures with RHS unbound : 0
% 1.10/0.57 # BW rewrite match attempts : 805
% 1.10/0.57 # BW rewrite match successes : 23
% 1.10/0.57 # Condensation attempts : 0
% 1.10/0.57 # Condensation successes : 0
% 1.10/0.57 # Termbank termtop insertions : 132376
% 1.10/0.57
% 1.10/0.57 # -------------------------------------------------
% 1.10/0.57 # User time : 0.116 s
% 1.10/0.57 # System time : 0.004 s
% 1.10/0.57 # Total time : 0.120 s
% 1.10/0.57 # Maximum resident set size: 1760 pages
% 1.10/0.57
% 1.10/0.57 # -------------------------------------------------
% 1.10/0.57 # User time : 0.117 s
% 1.10/0.57 # System time : 0.005 s
% 1.10/0.57 # Total time : 0.122 s
% 1.10/0.57 # Maximum resident set size: 1676 pages
% 1.10/0.57 % E---3.1 exiting
% 1.10/0.57 % E---3.1 exiting
%------------------------------------------------------------------------------