%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU155+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:17:14 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 37 ( 16 unt; 0 def)
% Number of atoms : 114 ( 31 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 124 ( 47 ~; 49 |; 21 &)
% ( 5 <=>; 2 =>; 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 : 10 ( 10 usr; 2 con; 0-3 aty)
% Number of variables : 93 ( 17 sgn 53 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l50_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l50_zfmisc_1) ).
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(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d4_tarski) ).
fof(t3_xboole_0,lemma,
! [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(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(t48_xboole_1,lemma,
! [X1,X2] : set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t48_xboole_1) ).
fof(t36_xboole_1,lemma,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t36_xboole_1) ).
fof(t83_xboole_1,lemma,
! [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(c_0_8,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[l50_zfmisc_1]) ).
fof(c_0_9,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(esk10_3(X5,X6,X7),X7)
| ~ in(esk10_3(X5,X6,X7),X5)
| in(esk10_3(X5,X6,X7),X6)
| X7 = set_difference(X5,X6) )
& ( in(esk10_3(X5,X6,X7),X5)
| in(esk10_3(X5,X6,X7),X7)
| X7 = set_difference(X5,X6) )
& ( ~ in(esk10_3(X5,X6,X7),X6)
| in(esk10_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])])])])])])])]) ).
fof(c_0_10,plain,
! [X5,X6,X7,X7,X9,X5,X6,X11] :
( ( in(X7,esk4_3(X5,X6,X7))
| ~ in(X7,X6)
| X6 != union(X5) )
& ( in(esk4_3(X5,X6,X7),X5)
| ~ in(X7,X6)
| X6 != union(X5) )
& ( ~ in(X7,X9)
| ~ in(X9,X5)
| in(X7,X6)
| X6 != union(X5) )
& ( ~ in(esk5_2(X5,X6),X6)
| ~ in(esk5_2(X5,X6),X11)
| ~ in(X11,X5)
| X6 = union(X5) )
& ( in(esk5_2(X5,X6),esk6_2(X5,X6))
| in(esk5_2(X5,X6),X6)
| X6 = union(X5) )
& ( in(esk6_2(X5,X6),X5)
| in(esk5_2(X5,X6),X6)
| X6 = union(X5) ) ),
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)],[d4_tarski])])])])])])]) ).
fof(c_0_11,negated_conjecture,
( in(esk1_0,esk2_0)
& ~ subset(esk1_0,union(esk2_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_12,plain,
( X1 != set_difference(X2,X3)
| ~ in(X4,X1)
| ~ in(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,lemma,
! [X4,X5,X4,X5,X7] :
( ( in(esk14_2(X4,X5),X4)
| disjoint(X4,X5) )
& ( in(esk14_2(X4,X5),X5)
| disjoint(X4,X5) )
& ( ~ in(X7,X4)
| ~ in(X7,X5)
| ~ disjoint(X4,X5) ) ),
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)],[t3_xboole_0])])])])])])])]) ).
cnf(c_0_14,plain,
( in(X3,X1)
| X1 != union(X2)
| ~ in(X4,X2)
| ~ in(X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ in(X1,set_difference(X2,X3))
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_17,lemma,
( disjoint(X1,X2)
| in(esk14_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( in(X1,X2)
| X2 != union(esk2_0)
| ~ in(X1,esk1_0) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,lemma,
( disjoint(X1,X2)
| in(esk14_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_20,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_21,lemma,
! [X3,X4] : set_difference(X3,set_difference(X3,X4)) = set_intersection2(X3,X4),
inference(variable_rename,[status(thm)],[t48_xboole_1]) ).
cnf(c_0_22,lemma,
( disjoint(X1,set_difference(X2,X3))
| ~ in(esk14_2(X1,set_difference(X2,X3)),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,lemma,
( disjoint(esk1_0,X1)
| in(esk14_2(esk1_0,X1),X2)
| X2 != union(esk2_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
fof(c_0_24,lemma,
! [X3,X4] : subset(set_difference(X3,X4),X3),
inference(variable_rename,[status(thm)],[t36_xboole_1]) ).
cnf(c_0_25,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_26,lemma,
set_difference(X1,set_difference(X1,X2)) = set_intersection2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_27,lemma,
! [X3,X4,X3,X4] :
( ( ~ disjoint(X3,X4)
| set_difference(X3,X4) = X3 )
& ( set_difference(X3,X4) != X3
| disjoint(X3,X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t83_xboole_1])])])]) ).
cnf(c_0_28,lemma,
( disjoint(esk1_0,set_difference(X1,X2))
| X2 != union(esk2_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,lemma,
subset(set_difference(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
set_difference(X1,set_difference(X1,X2)) = set_difference(X2,set_difference(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_26]) ).
cnf(c_0_31,lemma,
( set_difference(X1,X2) = X1
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,lemma,
disjoint(esk1_0,set_difference(X1,union(esk2_0))),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_33,lemma,
subset(set_difference(X1,set_difference(X1,X2)),X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,lemma,
set_difference(esk1_0,set_difference(X1,union(esk2_0))) = esk1_0,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_35,negated_conjecture,
~ subset(esk1_0,union(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_36,lemma,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU155+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Sun Jun 19 12:20:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41 # Preprocessing time : 0.019 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 37
% 0.23/1.41 # Proof object clause steps : 20
% 0.23/1.41 # Proof object formula steps : 17
% 0.23/1.41 # Proof object conjectures : 6
% 0.23/1.41 # Proof object clause conjectures : 3
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 10
% 0.23/1.41 # Proof object initial formulas used : 8
% 0.23/1.41 # Proof object generating inferences : 9
% 0.23/1.41 # Proof object simplifying inferences : 3
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 80
% 0.23/1.41 # Removed by relevancy pruning/SinE : 28
% 0.23/1.41 # Initial clauses : 92
% 0.23/1.41 # Removed in clause preprocessing : 1
% 0.23/1.41 # Initial clauses in saturation : 91
% 0.23/1.41 # Processed clauses : 2107
% 0.23/1.41 # ...of these trivial : 117
% 0.23/1.41 # ...subsumed : 1345
% 0.23/1.41 # ...remaining for further processing : 645
% 0.23/1.41 # Other redundant clauses eliminated : 242
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 3
% 0.23/1.41 # Backward-rewritten : 15
% 0.23/1.41 # Generated clauses : 19255
% 0.23/1.41 # ...of the previous two non-trivial : 14732
% 0.23/1.41 # Contextual simplify-reflections : 253
% 0.23/1.41 # Paramodulations : 18928
% 0.23/1.41 # Factorizations : 27
% 0.23/1.41 # Equation resolutions : 300
% 0.23/1.41 # Current number of processed clauses : 624
% 0.23/1.41 # Positive orientable unit clauses : 85
% 0.23/1.41 # Positive unorientable unit clauses: 2
% 0.23/1.41 # Negative unit clauses : 29
% 0.23/1.41 # Non-unit-clauses : 508
% 0.23/1.41 # Current number of unprocessed clauses: 11644
% 0.23/1.41 # ...number of literals in the above : 38344
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 19
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 37005
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 25390
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1094
% 0.23/1.41 # Unit Clause-clause subsumption calls : 1187
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 118
% 0.23/1.41 # BW rewrite match successes : 23
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 189910
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.271 s
% 0.23/1.41 # System time : 0.010 s
% 0.23/1.41 # Total time : 0.281 s
% 0.23/1.41 # Maximum resident set size: 13988 pages
%------------------------------------------------------------------------------