TSTP Solution File: SEU141+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 09:17:05 EDT 2022
% Result : Theorem 0.17s 1.35s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 163 ( 53 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 173 ( 71 ~; 74 |; 19 &)
% ( 7 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-3 aty)
% Number of variables : 120 ( 22 sgn 58 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(t2_boole,axiom,
! [X1] : set_intersection2(X1,empty_set) = empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_boole) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k3_xboole_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_xboole_0) ).
fof(t83_xboole_1,conjecture,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t83_xboole_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',symmetry_r1_xboole_0) ).
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d7_xboole_0) ).
fof(c_0_11,plain,
! [X2] :
( ~ empty(X2)
| X2 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(c_0_12,plain,
empty(esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
fof(c_0_13,plain,
! [X2] : set_intersection2(X2,empty_set) = empty_set,
inference(variable_rename,[status(thm)],[t2_boole]) ).
cnf(c_0_14,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
empty(esk6_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_17,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
empty_set = esk6_0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_20,plain,
! [X4,X5,X4,X5,X7] :
( ( disjoint(X4,X5)
| in(esk4_2(X4,X5),set_intersection2(X4,X5)) )
& ( ~ in(X7,set_intersection2(X4,X5))
| ~ disjoint(X4,X5) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t4_xboole_0])])])])])])]) ).
fof(c_0_21,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( in(X8,X6)
| ~ in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(X8,X5)
| ~ in(X8,X6)
| in(X8,X7)
| X7 != set_intersection2(X5,X6) )
& ( ~ in(esk5_3(X5,X6,X7),X7)
| ~ in(esk5_3(X5,X6,X7),X5)
| ~ in(esk5_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X5)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk5_3(X5,X6,X7),X6)
| in(esk5_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])])]) ).
fof(c_0_22,negated_conjecture,
~ ! [X1,X2] :
( disjoint(X1,X2)
<=> set_difference(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t83_xboole_1]) ).
cnf(c_0_23,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
set_intersection2(X1,esk6_0) = esk6_0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_25,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( in(esk4_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X3,X4] :
( ~ disjoint(X3,X4)
| disjoint(X4,X3) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(c_0_29,negated_conjecture,
( ( ~ disjoint(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) != esk1_0 )
& ( disjoint(esk1_0,esk2_0)
| set_difference(esk1_0,esk2_0) = esk1_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
cnf(c_0_30,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
set_intersection2(esk6_0,X1) = esk6_0,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_32,plain,
( disjoint(X1,X2)
| ~ empty(set_intersection2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_33,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk1_0
| disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_36,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( in(X8,X5)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X6)
| ~ in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(X8,X5)
| in(X8,X6)
| in(X8,X7)
| X7 != set_difference(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X7)
| ~ in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X5)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk3_3(X5,X6,X7),X6)
| in(esk3_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[d4_xboole_0])])])])])])])]) ).
cnf(c_0_37,plain,
( ~ disjoint(esk6_0,X1)
| ~ in(X2,esk6_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_38,plain,
disjoint(esk6_0,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_31]),c_0_15])]) ).
fof(c_0_39,plain,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_intersection2(X3,X4) = empty_set )
& ( set_intersection2(X3,X4) != empty_set
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])])]) ).
cnf(c_0_40,plain,
( ~ disjoint(X1,X2)
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_33]) ).
cnf(c_0_41,negated_conjecture,
( set_difference(esk1_0,esk2_0) = esk1_0
| disjoint(esk2_0,esk1_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_42,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_43,plain,
~ in(X1,esk6_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_38])]) ).
cnf(c_0_44,plain,
( X1 = set_intersection2(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_45,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
( ~ in(X1,esk1_0)
| ~ in(X1,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).
cnf(c_0_47,plain,
( set_intersection2(X1,X2) = esk6_0
| in(esk5_3(X1,X2,esk6_0),X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X1)
| in(esk3_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_49,negated_conjecture,
( set_difference(esk1_0,esk2_0) != esk1_0
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_50,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != esk6_0 ),
inference(rw,[status(thm)],[c_0_45,c_0_18]) ).
cnf(c_0_51,negated_conjecture,
( set_intersection2(X1,esk1_0) = esk6_0
| ~ in(esk5_3(X1,esk1_0,esk6_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_52,plain,
( X1 = set_intersection2(X2,X3)
| in(esk5_3(X2,X3,X1),X1)
| in(esk5_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_53,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_48]) ).
cnf(c_0_54,plain,
( X1 = set_difference(X2,X3)
| in(esk3_3(X2,X3,X1),X3)
| ~ in(esk3_3(X2,X3,X1),X2)
| ~ in(esk3_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_55,negated_conjecture,
( set_difference(esk1_0,esk2_0) != esk1_0
| set_intersection2(esk2_0,esk1_0) != esk6_0 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_23]) ).
cnf(c_0_56,negated_conjecture,
set_intersection2(esk2_0,esk1_0) = esk6_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_43]) ).
cnf(c_0_57,negated_conjecture,
( set_difference(esk1_0,X1) = esk1_0
| ~ in(esk3_3(esk1_0,X1,esk1_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_46,c_0_53]) ).
cnf(c_0_58,plain,
( set_difference(X1,X2) = X1
| in(esk3_3(X1,X2,X1),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_53]),c_0_53]) ).
cnf(c_0_59,negated_conjecture,
set_difference(esk1_0,esk2_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% 0.02/0.09 % Command : run_ET %s %d
% 0.09/0.29 % Computer : n027.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Sun Jun 19 04:19:08 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.17/1.35 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.17/1.35 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.17/1.35 # Preprocessing time : 0.014 s
% 0.17/1.35
% 0.17/1.35 # Proof found!
% 0.17/1.35 # SZS status Theorem
% 0.17/1.35 # SZS output start CNFRefutation
% See solution above
% 0.17/1.35 # Proof object total steps : 61
% 0.17/1.35 # Proof object clause steps : 38
% 0.17/1.35 # Proof object formula steps : 23
% 0.17/1.35 # Proof object conjectures : 13
% 0.17/1.35 # Proof object clause conjectures : 10
% 0.17/1.35 # Proof object formula conjectures : 3
% 0.17/1.35 # Proof object initial clauses used : 17
% 0.17/1.35 # Proof object initial formulas used : 11
% 0.17/1.35 # Proof object generating inferences : 17
% 0.17/1.35 # Proof object simplifying inferences : 14
% 0.17/1.35 # Training examples: 0 positive, 0 negative
% 0.17/1.35 # Parsed axioms : 24
% 0.17/1.35 # Removed by relevancy pruning/SinE : 6
% 0.17/1.35 # Initial clauses : 31
% 0.17/1.35 # Removed in clause preprocessing : 0
% 0.17/1.35 # Initial clauses in saturation : 31
% 0.17/1.35 # Processed clauses : 1365
% 0.17/1.35 # ...of these trivial : 61
% 0.17/1.35 # ...subsumed : 926
% 0.17/1.35 # ...remaining for further processing : 378
% 0.17/1.35 # Other redundant clauses eliminated : 20
% 0.17/1.35 # Clauses deleted for lack of memory : 0
% 0.17/1.35 # Backward-subsumed : 30
% 0.17/1.35 # Backward-rewritten : 19
% 0.17/1.35 # Generated clauses : 7032
% 0.17/1.35 # ...of the previous two non-trivial : 6053
% 0.17/1.35 # Contextual simplify-reflections : 207
% 0.17/1.35 # Paramodulations : 6957
% 0.17/1.35 # Factorizations : 42
% 0.17/1.35 # Equation resolutions : 31
% 0.17/1.35 # Current number of processed clauses : 327
% 0.17/1.35 # Positive orientable unit clauses : 28
% 0.17/1.35 # Positive unorientable unit clauses: 1
% 0.17/1.35 # Negative unit clauses : 24
% 0.17/1.35 # Non-unit-clauses : 274
% 0.17/1.35 # Current number of unprocessed clauses: 4487
% 0.17/1.35 # ...number of literals in the above : 13449
% 0.17/1.35 # Current number of archived formulas : 0
% 0.17/1.35 # Current number of archived clauses : 51
% 0.17/1.35 # Clause-clause subsumption calls (NU) : 34152
% 0.17/1.35 # Rec. Clause-clause subsumption calls : 30291
% 0.17/1.35 # Non-unit clause-clause subsumptions : 943
% 0.17/1.35 # Unit Clause-clause subsumption calls : 420
% 0.17/1.35 # Rewrite failures with RHS unbound : 0
% 0.17/1.35 # BW rewrite match attempts : 42
% 0.17/1.35 # BW rewrite match successes : 11
% 0.17/1.35 # Condensation attempts : 0
% 0.17/1.35 # Condensation successes : 0
% 0.17/1.35 # Termbank termtop insertions : 67420
% 0.17/1.35
% 0.17/1.35 # -------------------------------------------------
% 0.17/1.35 # User time : 0.136 s
% 0.17/1.35 # System time : 0.004 s
% 0.17/1.35 # Total time : 0.140 s
% 0.17/1.35 # Maximum resident set size: 6748 pages
%------------------------------------------------------------------------------