TSTP Solution File: SEU154+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU154+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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:30:31 EDT 2024
% Result : Theorem 0.20s 0.49s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 110 ( 37 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 117 ( 43 ~; 48 |; 16 &)
% ( 7 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 83 ( 4 sgn 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',d3_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',d3_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',d1_tarski) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',commutativity_k3_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',d10_xboole_0) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',t2_xboole_1) ).
fof(l28_zfmisc_1,conjecture,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',l28_zfmisc_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/tmp/tmp.TkMuuj5Kg2/E---3.1_22093.p',d7_xboole_0) ).
fof(c_0_8,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ( in(X29,X26)
| ~ in(X29,X28)
| X28 != set_intersection2(X26,X27) )
& ( in(X29,X27)
| ~ in(X29,X28)
| X28 != set_intersection2(X26,X27) )
& ( ~ in(X30,X26)
| ~ in(X30,X27)
| in(X30,X28)
| X28 != set_intersection2(X26,X27) )
& ( ~ in(esk5_3(X31,X32,X33),X33)
| ~ in(esk5_3(X31,X32,X33),X31)
| ~ in(esk5_3(X31,X32,X33),X32)
| X33 = set_intersection2(X31,X32) )
& ( in(esk5_3(X31,X32,X33),X31)
| in(esk5_3(X31,X32,X33),X33)
| X33 = set_intersection2(X31,X32) )
& ( in(esk5_3(X31,X32,X33),X32)
| in(esk5_3(X31,X32,X33),X33)
| X33 = set_intersection2(X31,X32) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
cnf(c_0_9,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X20,X21,X22,X23,X24] :
( ( ~ subset(X20,X21)
| ~ in(X22,X20)
| in(X22,X21) )
& ( in(esk4_2(X23,X24),X23)
| subset(X23,X24) )
& ( ~ in(esk4_2(X23,X24),X24)
| subset(X23,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_tarski])])])])])])]) ).
fof(c_0_11,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( ~ in(X13,X12)
| X13 = X11
| X12 != singleton(X11) )
& ( X14 != X11
| in(X14,X12)
| X12 != singleton(X11) )
& ( ~ in(esk3_2(X15,X16),X16)
| esk3_2(X15,X16) != X15
| X16 = singleton(X15) )
& ( in(esk3_2(X15,X16),X16)
| esk3_2(X15,X16) = X15
| X16 = singleton(X15) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_12,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( in(esk4_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_14,plain,
! [X36,X37] : set_intersection2(X36,X37) = set_intersection2(X37,X36),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_15,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X39,X40] :
( ( subset(X39,X40)
| X39 != X40 )
& ( subset(X40,X39)
| X39 != X40 )
& ( ~ subset(X39,X40)
| ~ subset(X40,X39)
| X39 = X40 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
fof(c_0_17,plain,
! [X35] : subset(empty_set,X35),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_18,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk4_2(set_intersection2(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_15]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[l28_zfmisc_1])]) ).
cnf(c_0_22,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk4_2(set_intersection2(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
( esk4_2(set_intersection2(X1,singleton(X2)),X3) = X2
| subset(set_intersection2(X1,singleton(X2)),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
fof(c_0_26,negated_conjecture,
( ~ in(esk1_0,esk2_0)
& ~ disjoint(singleton(esk1_0),esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_27,plain,
! [X7,X8] :
( ( ~ disjoint(X7,X8)
| set_intersection2(X7,X8) = empty_set )
& ( set_intersection2(X7,X8) != empty_set
| disjoint(X7,X8) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
cnf(c_0_28,plain,
( X1 = empty_set
| ~ subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
( subset(set_intersection2(X1,singleton(X2)),X3)
| in(X2,X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
~ disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( set_intersection2(X1,singleton(X2)) = empty_set
| in(X2,X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
set_intersection2(esk2_0,singleton(esk1_0)) != empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU154+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n024.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 07:46:50 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 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.TkMuuj5Kg2/E---3.1_22093.p
% 0.20/0.49 # Version: 3.1.0
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # Starting sh5l with 300s (1) cores
% 0.20/0.49 # new_bool_1 with pid 22174 completed with status 0
% 0.20/0.49 # Result found by new_bool_1
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.20/0.49 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 22178 completed with status 0
% 0.20/0.49 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.20/0.49 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.20/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.49 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.20/0.49 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.49 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.49 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.49 # Search class: FGHSM-FFMF32-SFFFFFNN
% 0.20/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.49 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 163s (1) cores
% 0.20/0.49 # Preprocessing time : 0.001 s
% 0.20/0.49
% 0.20/0.49 # Proof found!
% 0.20/0.49 # SZS status Theorem
% 0.20/0.49 # SZS output start CNFRefutation
% See solution above
% 0.20/0.49 # Parsed axioms : 18
% 0.20/0.49 # Removed by relevancy pruning/SinE : 3
% 0.20/0.49 # Initial clauses : 29
% 0.20/0.49 # Removed in clause preprocessing : 0
% 0.20/0.49 # Initial clauses in saturation : 29
% 0.20/0.49 # Processed clauses : 111
% 0.20/0.49 # ...of these trivial : 5
% 0.20/0.49 # ...subsumed : 38
% 0.20/0.49 # ...remaining for further processing : 68
% 0.20/0.49 # Other redundant clauses eliminated : 8
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 268
% 0.20/0.49 # ...of the previous two non-redundant : 183
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 0
% 0.20/0.49 # Paramodulations : 257
% 0.20/0.49 # Factorizations : 4
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 8
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 78
% 0.20/0.49 # ...of those cached : 59
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 61
% 0.20/0.49 # Positive orientable unit clauses : 10
% 0.20/0.49 # Positive unorientable unit clauses: 1
% 0.20/0.49 # Negative unit clauses : 5
% 0.20/0.49 # Non-unit-clauses : 45
% 0.20/0.49 # Current number of unprocessed clauses: 98
% 0.20/0.49 # ...number of literals in the above : 281
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 0
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 307
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 284
% 0.20/0.49 # Non-unit clause-clause subsumptions : 33
% 0.20/0.49 # Unit Clause-clause subsumption calls : 4
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 6
% 0.20/0.49 # BW rewrite match successes : 2
% 0.20/0.49 # Condensation attempts : 0
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3975
% 0.20/0.49 # Search garbage collected termcells : 461
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.012 s
% 0.20/0.49 # System time : 0.001 s
% 0.20/0.49 # Total time : 0.013 s
% 0.20/0.49 # Maximum resident set size: 1708 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.012 s
% 0.20/0.49 # System time : 0.004 s
% 0.20/0.49 # Total time : 0.016 s
% 0.20/0.49 # Maximum resident set size: 1700 pages
% 0.20/0.49 % E---3.1 exiting
%------------------------------------------------------------------------------