TSTP Solution File: SEU119+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 600s
% DateTime : Tue Jul 19 09:16:54 EDT 2022
% Result : Theorem 0.24s 1.44s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 56 ( 7 unt; 0 def)
% Number of atoms : 166 ( 45 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 190 ( 80 ~; 82 |; 23 &)
% ( 4 <=>; 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 : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 106 ( 21 sgn 34 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(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(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(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_xboole_0) ).
fof(t3_xboole_0,conjecture,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_xboole_0) ).
fof(c_0_5,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_6,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])])])]) ).
fof(c_0_7,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(esk7_3(X5,X6,X7),X7)
| ~ in(esk7_3(X5,X6,X7),X5)
| ~ in(esk7_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X5)
| in(esk7_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk7_3(X5,X6,X7),X6)
| in(esk7_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])])])])])])]) ).
cnf(c_0_8,plain,
( disjoint(X1,X2)
| ~ disjoint(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,plain,
! [X3,X4,X3] :
( ( X3 != empty_set
| ~ in(X4,X3) )
& ( in(esk6_1(X3),X3)
| X3 = empty_set ) ),
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)],[d1_xboole_0])])])])])])]) ).
cnf(c_0_11,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( disjoint(X1,X2)
| set_intersection2(X2,X1) != empty_set ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_14,plain,
( ~ in(X1,X2)
| X2 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( set_intersection2(X1,X2) = X2
| in(esk7_3(X1,X2,X2),X2) ),
inference(ef,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( in(X4,X2)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
( set_intersection2(X1,X2) = empty_set
| set_intersection2(X2,X1) != empty_set ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( set_intersection2(X1,X2) = X2
| X2 != empty_set ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_19,negated_conjecture,
~ ! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(assume_negation,[status(cth)],[t3_xboole_0]) ).
cnf(c_0_20,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( set_intersection2(X1,X2) = empty_set
| X1 != empty_set ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,negated_conjecture,
! [X6] :
( ( in(esk5_0,esk3_0)
| ~ disjoint(esk1_0,esk2_0) )
& ( in(esk5_0,esk4_0)
| ~ disjoint(esk1_0,esk2_0) )
& ( disjoint(esk3_0,esk4_0)
| ~ disjoint(esk1_0,esk2_0) )
& ( in(esk5_0,esk3_0)
| ~ in(X6,esk1_0)
| ~ in(X6,esk2_0) )
& ( in(esk5_0,esk4_0)
| ~ in(X6,esk1_0)
| ~ in(X6,esk2_0) )
& ( disjoint(esk3_0,esk4_0)
| ~ in(X6,esk1_0)
| ~ in(X6,esk2_0) ) ),
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)],[c_0_19])])])])])])])]) ).
cnf(c_0_24,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_20]) ).
cnf(c_0_25,plain,
( X1 = empty_set
| in(esk6_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,plain,
( X1 != empty_set
| ~ in(X2,empty_set) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_14]) ).
cnf(c_0_28,negated_conjecture,
( disjoint(esk3_0,esk4_0)
| ~ in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_29,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk6_1(set_intersection2(X1,X2)),X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,negated_conjecture,
( disjoint(esk3_0,esk4_0)
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_32,plain,
( set_intersection2(X1,empty_set) = empty_set
| X2 != empty_set ),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_33,negated_conjecture,
( set_intersection2(X1,esk2_0) = empty_set
| disjoint(esk3_0,esk4_0)
| ~ in(esk6_1(set_intersection2(X1,esk2_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( set_intersection2(X1,X2) = empty_set
| in(esk6_1(set_intersection2(X1,X2)),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_35,negated_conjecture,
( disjoint(esk3_0,esk4_0)
| set_intersection2(esk1_0,esk2_0) != empty_set ),
inference(spm,[status(thm)],[c_0_30,c_0_9]) ).
cnf(c_0_36,plain,
( set_intersection2(X1,X2) != empty_set
| ~ in(X3,X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_14,c_0_31]) ).
cnf(c_0_37,plain,
set_intersection2(X1,empty_set) = empty_set,
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_38,negated_conjecture,
( in(esk5_0,esk4_0)
| ~ in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_39,negated_conjecture,
disjoint(esk3_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_40,plain,
( ~ in(X1,empty_set)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( X1 = set_intersection2(X2,esk2_0)
| in(esk7_3(X2,esk2_0,X1),X1)
| in(esk5_0,esk4_0)
| ~ in(esk7_3(X2,esk2_0,X1),esk1_0) ),
inference(spm,[status(thm)],[c_0_38,c_0_11]) ).
cnf(c_0_42,plain,
( X1 = set_intersection2(X2,X3)
| in(esk7_3(X2,X3,X1),X1)
| in(esk7_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_43,negated_conjecture,
( in(esk5_0,esk4_0)
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_44,negated_conjecture,
( in(esk5_0,esk3_0)
| ~ in(X1,esk2_0)
| ~ in(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_45,negated_conjecture,
( in(esk5_0,esk3_0)
| ~ disjoint(esk1_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_46,negated_conjecture,
set_intersection2(esk3_0,esk4_0) = empty_set,
inference(spm,[status(thm)],[c_0_12,c_0_39]) ).
cnf(c_0_47,plain,
~ in(X1,empty_set),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_37]),c_0_40]) ).
cnf(c_0_48,negated_conjecture,
( X1 = set_intersection2(esk1_0,esk2_0)
| in(esk7_3(esk1_0,esk2_0,X1),X1)
| in(esk5_0,esk4_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( in(esk5_0,esk4_0)
| set_intersection2(esk1_0,esk2_0) != empty_set ),
inference(spm,[status(thm)],[c_0_43,c_0_9]) ).
cnf(c_0_50,negated_conjecture,
( set_intersection2(X1,esk2_0) = empty_set
| in(esk5_0,esk3_0)
| ~ in(esk6_1(set_intersection2(X1,esk2_0)),esk1_0) ),
inference(spm,[status(thm)],[c_0_44,c_0_29]) ).
cnf(c_0_51,negated_conjecture,
( in(esk5_0,esk3_0)
| set_intersection2(esk1_0,esk2_0) != empty_set ),
inference(spm,[status(thm)],[c_0_45,c_0_9]) ).
cnf(c_0_52,negated_conjecture,
( ~ in(X1,esk4_0)
| ~ in(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_53,negated_conjecture,
in(esk5_0,esk4_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49]) ).
cnf(c_0_54,negated_conjecture,
in(esk5_0,esk3_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_34]),c_0_51]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEU119+2 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n005.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 20 12:20:08 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.24/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.44 # Preprocessing time : 0.016 s
% 0.24/1.44
% 0.24/1.44 # Proof found!
% 0.24/1.44 # SZS status Theorem
% 0.24/1.44 # SZS output start CNFRefutation
% See solution above
% 0.24/1.44 # Proof object total steps : 56
% 0.24/1.44 # Proof object clause steps : 45
% 0.24/1.44 # Proof object formula steps : 11
% 0.24/1.44 # Proof object conjectures : 22
% 0.24/1.44 # Proof object clause conjectures : 19
% 0.24/1.44 # Proof object formula conjectures : 3
% 0.24/1.44 # Proof object initial clauses used : 16
% 0.24/1.44 # Proof object initial formulas used : 5
% 0.24/1.44 # Proof object generating inferences : 29
% 0.24/1.44 # Proof object simplifying inferences : 7
% 0.24/1.44 # Training examples: 0 positive, 0 negative
% 0.24/1.44 # Parsed axioms : 13
% 0.24/1.44 # Removed by relevancy pruning/SinE : 2
% 0.24/1.44 # Initial clauses : 23
% 0.24/1.44 # Removed in clause preprocessing : 0
% 0.24/1.44 # Initial clauses in saturation : 23
% 0.24/1.44 # Processed clauses : 351
% 0.24/1.44 # ...of these trivial : 6
% 0.24/1.44 # ...subsumed : 193
% 0.24/1.44 # ...remaining for further processing : 152
% 0.24/1.44 # Other redundant clauses eliminated : 12
% 0.24/1.44 # Clauses deleted for lack of memory : 0
% 0.24/1.44 # Backward-subsumed : 20
% 0.24/1.44 # Backward-rewritten : 47
% 0.24/1.44 # Generated clauses : 1469
% 0.24/1.44 # ...of the previous two non-trivial : 1258
% 0.24/1.44 # Contextual simplify-reflections : 128
% 0.24/1.44 # Paramodulations : 1432
% 0.24/1.44 # Factorizations : 20
% 0.24/1.44 # Equation resolutions : 17
% 0.24/1.44 # Current number of processed clauses : 85
% 0.24/1.44 # Positive orientable unit clauses : 12
% 0.24/1.44 # Positive unorientable unit clauses: 1
% 0.24/1.44 # Negative unit clauses : 8
% 0.24/1.44 # Non-unit-clauses : 64
% 0.24/1.44 # Current number of unprocessed clauses: 580
% 0.24/1.44 # ...number of literals in the above : 1752
% 0.24/1.44 # Current number of archived formulas : 0
% 0.24/1.44 # Current number of archived clauses : 67
% 0.24/1.44 # Clause-clause subsumption calls (NU) : 6934
% 0.24/1.44 # Rec. Clause-clause subsumption calls : 5198
% 0.24/1.44 # Non-unit clause-clause subsumptions : 265
% 0.24/1.44 # Unit Clause-clause subsumption calls : 404
% 0.24/1.44 # Rewrite failures with RHS unbound : 0
% 0.24/1.44 # BW rewrite match attempts : 15
% 0.24/1.44 # BW rewrite match successes : 10
% 0.24/1.44 # Condensation attempts : 0
% 0.24/1.44 # Condensation successes : 0
% 0.24/1.44 # Termbank termtop insertions : 16322
% 0.24/1.44
% 0.24/1.44 # -------------------------------------------------
% 0.24/1.44 # User time : 0.064 s
% 0.24/1.44 # System time : 0.001 s
% 0.24/1.44 # Total time : 0.065 s
% 0.24/1.44 # Maximum resident set size: 3568 pages
%------------------------------------------------------------------------------