TSTP Solution File: SEU146+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU146+2 : TPTP v8.1.2. Released v3.3.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:24:55 EDT 2023
% Result : Theorem 0.17s 0.46s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 42 ( 8 unt; 0 def)
% Number of atoms : 135 ( 63 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 141 ( 48 ~; 66 |; 16 &)
% ( 10 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 71 ( 4 sgn; 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l4_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',l4_zfmisc_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',d3_xboole_0) ).
fof(t28_xboole_1,lemma,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',t28_xboole_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',d1_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',d1_tarski) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',d10_xboole_0) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',l2_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',reflexivity_r1_tarski) ).
fof(t2_xboole_1,lemma,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p',t2_xboole_1) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[l4_zfmisc_1]) ).
fof(c_0_10,plain,
! [X57,X58,X59,X60,X61,X62,X63,X64] :
( ( in(X60,X57)
| ~ in(X60,X59)
| X59 != set_intersection2(X57,X58) )
& ( in(X60,X58)
| ~ in(X60,X59)
| X59 != set_intersection2(X57,X58) )
& ( ~ in(X61,X57)
| ~ in(X61,X58)
| in(X61,X59)
| X59 != set_intersection2(X57,X58) )
& ( ~ in(esk7_3(X62,X63,X64),X64)
| ~ in(esk7_3(X62,X63,X64),X62)
| ~ in(esk7_3(X62,X63,X64),X63)
| X64 = set_intersection2(X62,X63) )
& ( in(esk7_3(X62,X63,X64),X62)
| in(esk7_3(X62,X63,X64),X64)
| X64 = set_intersection2(X62,X63) )
& ( in(esk7_3(X62,X63,X64),X63)
| in(esk7_3(X62,X63,X64),X64)
| X64 = set_intersection2(X62,X63) ) ),
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)],[d3_xboole_0])])])])])]) ).
fof(c_0_11,lemma,
! [X116,X117] :
( ~ subset(X116,X117)
| set_intersection2(X116,X117) = X116 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t28_xboole_1])]) ).
fof(c_0_12,negated_conjecture,
( ( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,lemma,
( set_intersection2(X1,X2) = X1
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(c_0_17,plain,
! [X7,X8,X9,X10,X11,X12] :
( ( ~ in(X9,X8)
| X9 = X7
| X8 != singleton(X7) )
& ( X10 != X7
| in(X10,X8)
| X8 != singleton(X7) )
& ( ~ in(esk3_2(X11,X12),X12)
| esk3_2(X11,X12) != X11
| X12 = singleton(X11) )
& ( in(esk3_2(X11,X12),X12)
| esk3_2(X11,X12) = X11
| X12 = singleton(X11) ) ),
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)],[d1_tarski])])])])])]) ).
cnf(c_0_18,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
( set_intersection2(esk1_0,singleton(esk2_0)) = esk1_0
| singleton(esk2_0) = esk1_0
| esk1_0 = empty_set ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,plain,
! [X20,X21,X22] :
( ( X20 != empty_set
| ~ in(X21,X20) )
& ( in(esk4_1(X22),X22)
| X22 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])])]) ).
cnf(c_0_21,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set
| in(X1,singleton(esk2_0))
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( in(esk4_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set
| in(esk4_1(esk1_0),singleton(esk2_0)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_26,plain,
! [X34,X35] :
( ( subset(X34,X35)
| X34 != X35 )
& ( subset(X35,X34)
| X34 != X35 )
& ( ~ subset(X34,X35)
| ~ subset(X35,X34)
| X34 = X35 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
fof(c_0_27,lemma,
! [X15,X16] :
( ( ~ subset(singleton(X15),X16)
| in(X15,X16) )
& ( ~ in(X15,X16)
| subset(singleton(X15),X16) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])]) ).
cnf(c_0_28,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk4_1(esk1_0) = esk2_0
| esk1_0 = empty_set ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_29,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_30,lemma,
( subset(singleton(X1),X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set
| in(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set
| ~ subset(singleton(esk2_0),esk1_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_15]) ).
fof(c_0_33,plain,
! [X36] : subset(X36,X36),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_34,negated_conjecture,
( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_35,lemma,
( singleton(esk2_0) = esk1_0
| esk1_0 = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_36,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_37,lemma,
! [X28] : subset(empty_set,X28),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_38,negated_conjecture,
( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_39,negated_conjecture,
esk1_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]) ).
cnf(c_0_40,lemma,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_40])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : SEU146+2 : TPTP v8.1.2. Released v3.3.0.
% 0.05/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.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 08:27:23 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.LGY3Gedco0/E---3.1_11774.p
% 0.17/0.46 # Version: 3.1pre001
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S 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_3 with pid 11891 completed with status 0
% 0.17/0.46 # Result found by new_bool_3
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 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: FGHSM-FFMS32-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.17/0.46 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with pid 11894 completed with status 0
% 0.17/0.46 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI
% 0.17/0.46 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.46 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.46 # Starting new_bool_3 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: FGHSM-FFMS32-SFFFFFNN
% 0.17/0.46 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 181s (1) cores
% 0.17/0.46 # Preprocessing time : 0.002 s
% 0.17/0.46 # Presaturation interreduction done
% 0.17/0.46
% 0.17/0.46 # Proof found!
% 0.17/0.46 # SZS status Theorem
% 0.17/0.46 # SZS output start CNFRefutation
% See solution above
% 0.17/0.46 # Parsed axioms : 67
% 0.17/0.46 # Removed by relevancy pruning/SinE : 19
% 0.17/0.46 # Initial clauses : 77
% 0.17/0.46 # Removed in clause preprocessing : 0
% 0.17/0.46 # Initial clauses in saturation : 77
% 0.17/0.46 # Processed clauses : 180
% 0.17/0.46 # ...of these trivial : 0
% 0.17/0.46 # ...subsumed : 24
% 0.17/0.46 # ...remaining for further processing : 156
% 0.17/0.46 # Other redundant clauses eliminated : 16
% 0.17/0.46 # Clauses deleted for lack of memory : 0
% 0.17/0.46 # Backward-subsumed : 11
% 0.17/0.46 # Backward-rewritten : 5
% 0.17/0.46 # Generated clauses : 171
% 0.17/0.46 # ...of the previous two non-redundant : 118
% 0.17/0.46 # ...aggressively subsumed : 0
% 0.17/0.46 # Contextual simplify-reflections : 1
% 0.17/0.46 # Paramodulations : 156
% 0.17/0.46 # Factorizations : 0
% 0.17/0.46 # NegExts : 0
% 0.17/0.46 # Equation resolutions : 16
% 0.17/0.46 # Total rewrite steps : 63
% 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 : 54
% 0.17/0.46 # Positive orientable unit clauses : 22
% 0.17/0.46 # Positive unorientable unit clauses: 0
% 0.17/0.46 # Negative unit clauses : 6
% 0.17/0.46 # Non-unit-clauses : 26
% 0.17/0.46 # Current number of unprocessed clauses: 86
% 0.17/0.46 # ...number of literals in the above : 194
% 0.17/0.46 # Current number of archived formulas : 0
% 0.17/0.46 # Current number of archived clauses : 88
% 0.17/0.46 # Clause-clause subsumption calls (NU) : 734
% 0.17/0.46 # Rec. Clause-clause subsumption calls : 540
% 0.17/0.46 # Non-unit clause-clause subsumptions : 23
% 0.17/0.46 # Unit Clause-clause subsumption calls : 19
% 0.17/0.46 # Rewrite failures with RHS unbound : 0
% 0.17/0.46 # BW rewrite match attempts : 39
% 0.17/0.46 # BW rewrite match successes : 17
% 0.17/0.46 # Condensation attempts : 0
% 0.17/0.46 # Condensation successes : 0
% 0.17/0.46 # Termbank termtop insertions : 5453
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.012 s
% 0.17/0.46 # System time : 0.002 s
% 0.17/0.46 # Total time : 0.014 s
% 0.17/0.46 # Maximum resident set size: 1888 pages
% 0.17/0.46
% 0.17/0.46 # -------------------------------------------------
% 0.17/0.46 # User time : 0.013 s
% 0.17/0.46 # System time : 0.004 s
% 0.17/0.46 # Total time : 0.017 s
% 0.17/0.46 # Maximum resident set size: 1732 pages
% 0.17/0.46 % E---3.1 exiting
% 0.17/0.46 % E---3.1 exiting
%------------------------------------------------------------------------------