TSTP Solution File: SET918+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SET918+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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:21:18 EDT 2023
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 13 unt; 0 def)
% Number of atoms : 105 ( 58 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 122 ( 46 ~; 50 |; 20 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 71 ( 2 sgn; 47 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t59_zfmisc_1,conjecture,
! [X1,X2,X3] :
~ ( set_intersection2(unordered_pair(X1,X2),X3) = singleton(X1)
& in(X2,X3)
& X1 != X2 ),
file('/export/starexec/sandbox2/tmp/tmp.FdPkEnBcvm/E---3.1_25790.p',t59_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.FdPkEnBcvm/E---3.1_25790.p',commutativity_k2_tarski) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.FdPkEnBcvm/E---3.1_25790.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.FdPkEnBcvm/E---3.1_25790.p',commutativity_k3_xboole_0) ).
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.FdPkEnBcvm/E---3.1_25790.p',d3_xboole_0) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.FdPkEnBcvm/E---3.1_25790.p',d2_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
~ ( set_intersection2(unordered_pair(X1,X2),X3) = singleton(X1)
& in(X2,X3)
& X1 != X2 ),
inference(assume_negation,[status(cth)],[t59_zfmisc_1]) ).
fof(c_0_7,negated_conjecture,
( set_intersection2(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0)
& in(esk2_0,esk3_0)
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_8,plain,
! [X29,X30] : unordered_pair(X29,X30) = unordered_pair(X30,X29),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_9,plain,
! [X19,X20,X21,X22,X23,X24] :
( ( ~ in(X21,X20)
| X21 = X19
| X20 != singleton(X19) )
& ( X22 != X19
| in(X22,X20)
| X20 != singleton(X19) )
& ( ~ in(esk5_2(X23,X24),X24)
| esk5_2(X23,X24) != X23
| X24 = singleton(X23) )
& ( in(esk5_2(X23,X24),X24)
| esk5_2(X23,X24) = X23
| X24 = singleton(X23) ) ),
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_10,negated_conjecture,
set_intersection2(unordered_pair(esk1_0,esk2_0),esk3_0) = singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X26,X27] : set_intersection2(X26,X27) = set_intersection2(X27,X26),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_13,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
singleton(esk1_0) = set_intersection2(unordered_pair(esk2_0,esk1_0),esk3_0),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X10,X11,X12,X13,X14,X15,X16,X17] :
( ( in(X13,X10)
| ~ in(X13,X12)
| X12 != set_intersection2(X10,X11) )
& ( in(X13,X11)
| ~ in(X13,X12)
| X12 != set_intersection2(X10,X11) )
& ( ~ in(X14,X10)
| ~ in(X14,X11)
| in(X14,X12)
| X12 != set_intersection2(X10,X11) )
& ( ~ in(esk4_3(X15,X16,X17),X17)
| ~ in(esk4_3(X15,X16,X17),X15)
| ~ in(esk4_3(X15,X16,X17),X16)
| X17 = set_intersection2(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X15)
| in(esk4_3(X15,X16,X17),X17)
| X17 = set_intersection2(X15,X16) )
& ( in(esk4_3(X15,X16,X17),X16)
| in(esk4_3(X15,X16,X17),X17)
| X17 = set_intersection2(X15,X16) ) ),
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])])])])])]) ).
cnf(c_0_17,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
singleton(esk1_0) = set_intersection2(esk3_0,unordered_pair(esk2_0,esk1_0)),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X31,X32,X33,X34,X35,X36,X37,X38] :
( ( ~ in(X34,X33)
| X34 = X31
| X34 = X32
| X33 != unordered_pair(X31,X32) )
& ( X35 != X31
| in(X35,X33)
| X33 != unordered_pair(X31,X32) )
& ( X35 != X32
| in(X35,X33)
| X33 != unordered_pair(X31,X32) )
& ( esk6_3(X36,X37,X38) != X36
| ~ in(esk6_3(X36,X37,X38),X38)
| X38 = unordered_pair(X36,X37) )
& ( esk6_3(X36,X37,X38) != X37
| ~ in(esk6_3(X36,X37,X38),X38)
| X38 = unordered_pair(X36,X37) )
& ( in(esk6_3(X36,X37,X38),X38)
| esk6_3(X36,X37,X38) = X36
| esk6_3(X36,X37,X38) = X37
| X38 = unordered_pair(X36,X37) ) ),
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)],[d2_tarski])])])])])]) ).
cnf(c_0_21,negated_conjecture,
( X1 = esk1_0
| ~ in(X1,set_intersection2(esk3_0,unordered_pair(esk2_0,esk1_0))) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( X1 = esk1_0
| ~ in(X1,unordered_pair(esk2_0,esk1_0))
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
in(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET918+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.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 17:54:30 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 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.FdPkEnBcvm/E---3.1_25790.p
% 0.17/0.45 # Version: 3.1pre001
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # new_bool_3 with pid 25869 completed with status 0
% 0.17/0.45 # Result found by new_bool_3
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 0.17/0.45 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25872 completed with status 0
% 0.17/0.45 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.17/0.45 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.45 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.45 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.45 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.17/0.45 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.45 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 114s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 10
% 0.17/0.45 # Removed by relevancy pruning/SinE : 2
% 0.17/0.45 # Initial clauses : 23
% 0.17/0.45 # Removed in clause preprocessing : 0
% 0.17/0.45 # Initial clauses in saturation : 23
% 0.17/0.45 # Processed clauses : 69
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 8
% 0.17/0.45 # ...remaining for further processing : 61
% 0.17/0.45 # Other redundant clauses eliminated : 11
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 2
% 0.17/0.45 # Generated clauses : 60
% 0.17/0.45 # ...of the previous two non-redundant : 49
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 52
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 11
% 0.17/0.45 # Total rewrite steps : 10
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 28
% 0.17/0.45 # Positive orientable unit clauses : 8
% 0.17/0.45 # Positive unorientable unit clauses: 2
% 0.17/0.45 # Negative unit clauses : 7
% 0.17/0.45 # Non-unit-clauses : 11
% 0.17/0.45 # Current number of unprocessed clauses: 26
% 0.17/0.45 # ...number of literals in the above : 72
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 25
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 153
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 138
% 0.17/0.45 # Non-unit clause-clause subsumptions : 2
% 0.17/0.45 # Unit Clause-clause subsumption calls : 17
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 22
% 0.17/0.45 # BW rewrite match successes : 18
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 1770
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.007 s
% 0.17/0.45 # System time : 0.000 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1712 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.007 s
% 0.17/0.45 # System time : 0.003 s
% 0.17/0.45 # Total time : 0.010 s
% 0.17/0.45 # Maximum resident set size: 1680 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E---3.1 exiting
%------------------------------------------------------------------------------