TSTP Solution File: SET919+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SET919+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:21:11 EDT 2024
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 10 unt; 0 def)
% Number of atoms : 136 ( 70 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 154 ( 57 ~; 71 |; 18 &)
% ( 6 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 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 : 83 ( 6 sgn 43 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t60_zfmisc_1,conjecture,
! [X1,X2,X3] :
( in(X1,X2)
=> ( ( in(X3,X2)
& X1 != X3 )
| set_intersection2(unordered_pair(X1,X3),X2) = singleton(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.L2egV4pB6U/E---3.1_26761.p',t60_zfmisc_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.L2egV4pB6U/E---3.1_26761.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/sandbox/tmp/tmp.L2egV4pB6U/E---3.1_26761.p',d3_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/tmp/tmp.L2egV4pB6U/E---3.1_26761.p',d1_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.L2egV4pB6U/E---3.1_26761.p',d2_tarski) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( in(X1,X2)
=> ( ( in(X3,X2)
& X1 != X3 )
| set_intersection2(unordered_pair(X1,X3),X2) = singleton(X1) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t60_zfmisc_1])]) ).
fof(c_0_6,negated_conjecture,
( in(esk1_0,esk2_0)
& ( ~ in(esk3_0,esk2_0)
| esk1_0 = esk3_0 )
& set_intersection2(unordered_pair(esk1_0,esk3_0),esk2_0) != singleton(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_7,plain,
! [X15,X16] : set_intersection2(X15,X16) = set_intersection2(X16,X15),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_8,plain,
! [X17,X18,X19,X20,X21,X22,X23,X24] :
( ( in(X20,X17)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( in(X20,X18)
| ~ in(X20,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(X21,X17)
| ~ in(X21,X18)
| in(X21,X19)
| X19 != set_intersection2(X17,X18) )
& ( ~ in(esk5_3(X22,X23,X24),X24)
| ~ in(esk5_3(X22,X23,X24),X22)
| ~ in(esk5_3(X22,X23,X24),X23)
| X24 = set_intersection2(X22,X23) )
& ( in(esk5_3(X22,X23,X24),X22)
| in(esk5_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) )
& ( in(esk5_3(X22,X23,X24),X23)
| in(esk5_3(X22,X23,X24),X24)
| X24 = set_intersection2(X22,X23) ) ),
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,negated_conjecture,
set_intersection2(unordered_pair(esk1_0,esk3_0),esk2_0) != singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X8,X9,X10,X11,X12,X13] :
( ( ~ in(X10,X9)
| X10 = X8
| X9 != singleton(X8) )
& ( X11 != X8
| in(X11,X9)
| X9 != singleton(X8) )
& ( ~ in(esk4_2(X12,X13),X13)
| esk4_2(X12,X13) != X12
| X13 = singleton(X12) )
& ( in(esk4_2(X12,X13),X13)
| esk4_2(X12,X13) = X12
| X13 = singleton(X12) ) ),
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])])])])])])]) ).
fof(c_0_12,plain,
! [X29,X30,X31,X32,X33,X34,X35,X36] :
( ( ~ in(X32,X31)
| X32 = X29
| X32 = X30
| X31 != unordered_pair(X29,X30) )
& ( X33 != X29
| in(X33,X31)
| X31 != unordered_pair(X29,X30) )
& ( X33 != X30
| in(X33,X31)
| X31 != unordered_pair(X29,X30) )
& ( esk6_3(X34,X35,X36) != X34
| ~ in(esk6_3(X34,X35,X36),X36)
| X36 = unordered_pair(X34,X35) )
& ( esk6_3(X34,X35,X36) != X35
| ~ in(esk6_3(X34,X35,X36),X36)
| X36 = unordered_pair(X34,X35) )
& ( in(esk6_3(X34,X35,X36),X36)
| esk6_3(X34,X35,X36) = X34
| esk6_3(X34,X35,X36) = X35
| X36 = unordered_pair(X34,X35) ) ),
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)],[d2_tarski])])])])])])]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
singleton(esk1_0) != set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0)),
inference(rw,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
( in(esk4_2(X1,X2),X2)
| esk4_2(X1,X2) = X1
| X2 = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( X1 = X3
| X1 = X4
| ~ in(X1,X2)
| X2 != unordered_pair(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk1_0
| in(esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))),set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])]) ).
cnf(c_0_19,plain,
( X1 = X2
| X1 = X3
| ~ in(X1,unordered_pair(X3,X2)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
( esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk1_0
| in(esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))),unordered_pair(esk1_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
( esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk3_0
| esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk1_0 ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,plain,
( X2 = singleton(X1)
| ~ in(esk4_2(X1,X2),X2)
| esk4_2(X1,X2) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
( esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk1_0
| esk3_0 != esk1_0 ),
inference(ef,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_28,negated_conjecture,
( esk3_0 != esk1_0
| ~ in(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_14]) ).
cnf(c_0_29,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
in(X1,unordered_pair(X1,X2)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk1_0
| in(esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))),esk2_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_33,negated_conjecture,
esk3_0 != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
( esk4_2(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) = esk1_0
| in(esk3_0,esk2_0) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_33]) ).
cnf(c_0_35,negated_conjecture,
( in(esk3_0,esk2_0)
| ~ in(esk1_0,set_intersection2(esk2_0,unordered_pair(esk1_0,esk3_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_14]) ).
cnf(c_0_36,negated_conjecture,
( esk1_0 = esk3_0
| ~ in(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
in(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]),c_0_33]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SET919+1 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n005.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 : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 10:03:40 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.42 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.L2egV4pB6U/E---3.1_26761.p
% 0.16/0.43 # Version: 3.1.0
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # sh5l with pid 26842 completed with status 0
% 0.16/0.43 # Result found by sh5l
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.43 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.16/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 103s (1) cores
% 0.16/0.43 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26850 completed with status 0
% 0.16/0.43 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.43 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.43 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.43 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 # Starting sh5l with 300s (1) cores
% 0.16/0.43 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.16/0.43 # Search class: FGHSS-FFMF32-SFFFFFNN
% 0.16/0.43 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 103s (1) cores
% 0.16/0.43 # Preprocessing time : 0.001 s
% 0.16/0.43 # Presaturation interreduction done
% 0.16/0.43
% 0.16/0.43 # Proof found!
% 0.16/0.43 # SZS status Theorem
% 0.16/0.43 # SZS output start CNFRefutation
% See solution above
% 0.16/0.43 # Parsed axioms : 10
% 0.16/0.43 # Removed by relevancy pruning/SinE : 2
% 0.16/0.43 # Initial clauses : 23
% 0.16/0.43 # Removed in clause preprocessing : 0
% 0.16/0.43 # Initial clauses in saturation : 23
% 0.16/0.43 # Processed clauses : 91
% 0.16/0.43 # ...of these trivial : 0
% 0.16/0.43 # ...subsumed : 19
% 0.16/0.43 # ...remaining for further processing : 72
% 0.16/0.43 # Other redundant clauses eliminated : 12
% 0.16/0.43 # Clauses deleted for lack of memory : 0
% 0.16/0.43 # Backward-subsumed : 2
% 0.16/0.43 # Backward-rewritten : 4
% 0.16/0.43 # Generated clauses : 108
% 0.16/0.43 # ...of the previous two non-redundant : 93
% 0.16/0.43 # ...aggressively subsumed : 0
% 0.16/0.43 # Contextual simplify-reflections : 0
% 0.16/0.43 # Paramodulations : 98
% 0.16/0.43 # Factorizations : 1
% 0.16/0.43 # NegExts : 0
% 0.16/0.43 # Equation resolutions : 12
% 0.16/0.43 # Disequality decompositions : 0
% 0.16/0.43 # Total rewrite steps : 18
% 0.16/0.43 # ...of those cached : 9
% 0.16/0.43 # Propositional unsat checks : 0
% 0.16/0.43 # Propositional check models : 0
% 0.16/0.43 # Propositional check unsatisfiable : 0
% 0.16/0.43 # Propositional clauses : 0
% 0.16/0.43 # Propositional clauses after purity: 0
% 0.16/0.43 # Propositional unsat core size : 0
% 0.16/0.43 # Propositional preprocessing time : 0.000
% 0.16/0.43 # Propositional encoding time : 0.000
% 0.16/0.43 # Propositional solver time : 0.000
% 0.16/0.43 # Success case prop preproc time : 0.000
% 0.16/0.43 # Success case prop encoding time : 0.000
% 0.16/0.43 # Success case prop solver time : 0.000
% 0.16/0.43 # Current number of processed clauses : 35
% 0.16/0.43 # Positive orientable unit clauses : 6
% 0.16/0.43 # Positive unorientable unit clauses: 2
% 0.16/0.43 # Negative unit clauses : 6
% 0.16/0.43 # Non-unit-clauses : 21
% 0.16/0.43 # Current number of unprocessed clauses: 48
% 0.16/0.43 # ...number of literals in the above : 153
% 0.16/0.43 # Current number of archived formulas : 0
% 0.16/0.43 # Current number of archived clauses : 29
% 0.16/0.43 # Clause-clause subsumption calls (NU) : 266
% 0.16/0.43 # Rec. Clause-clause subsumption calls : 248
% 0.16/0.43 # Non-unit clause-clause subsumptions : 12
% 0.16/0.43 # Unit Clause-clause subsumption calls : 18
% 0.16/0.43 # Rewrite failures with RHS unbound : 0
% 0.16/0.43 # BW rewrite match attempts : 27
% 0.16/0.43 # BW rewrite match successes : 23
% 0.16/0.43 # Condensation attempts : 0
% 0.16/0.43 # Condensation successes : 0
% 0.16/0.43 # Termbank termtop insertions : 2622
% 0.16/0.43 # Search garbage collected termcells : 506
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.006 s
% 0.16/0.43 # System time : 0.002 s
% 0.16/0.43 # Total time : 0.009 s
% 0.16/0.43 # Maximum resident set size: 1720 pages
% 0.16/0.43
% 0.16/0.43 # -------------------------------------------------
% 0.16/0.43 # User time : 0.007 s
% 0.16/0.43 # System time : 0.004 s
% 0.16/0.43 # Total time : 0.011 s
% 0.16/0.43 # Maximum resident set size: 1692 pages
% 0.16/0.43 % E---3.1 exiting
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------