TSTP Solution File: SEU128+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU128+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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:59 EDT 2022
% Result : Theorem 0.27s 3.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 41 ( 12 unt; 0 def)
% Number of atoms : 114 ( 17 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 118 ( 45 ~; 53 |; 13 &)
% ( 3 <=>; 4 =>; 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 : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 96 ( 10 sgn 40 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t19_xboole_1,conjecture,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t19_xboole_1) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t1_xboole_1) ).
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/solver/bin/../tmp/theBenchmark.p',d3_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d3_tarski) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t17_xboole_1) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X1,X3) )
=> subset(X1,set_intersection2(X2,X3)) ),
inference(assume_negation,[status(cth)],[t19_xboole_1]) ).
fof(c_0_7,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X5,X6)
| subset(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(c_0_8,negated_conjecture,
( subset(esk7_0,esk8_0)
& subset(esk7_0,esk9_0)
& ~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_9,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(esk4_3(X5,X6,X7),X7)
| ~ in(esk4_3(X5,X6,X7),X5)
| ~ in(esk4_3(X5,X6,X7),X6)
| X7 = set_intersection2(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X5)
| in(esk4_3(X5,X6,X7),X7)
| X7 = set_intersection2(X5,X6) )
& ( in(esk4_3(X5,X6,X7),X6)
| in(esk4_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_10,plain,
! [X4,X5,X6,X4,X5] :
( ( ~ subset(X4,X5)
| ~ in(X6,X4)
| in(X6,X5) )
& ( in(esk3_2(X4,X5),X4)
| subset(X4,X5) )
& ( ~ in(esk3_2(X4,X5),X5)
| subset(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)],[d3_tarski])])])])])])]) ).
cnf(c_0_11,lemma,
( subset(X1,X2)
| ~ subset(X3,X2)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
subset(esk7_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( in(X4,X1)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X3)
| ~ in(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( in(X4,X3)
| X1 != set_intersection2(X2,X3)
| ~ in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( in(X1,X2)
| ~ in(X1,X3)
| ~ subset(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( subset(X1,esk9_0)
| ~ subset(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_17,lemma,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,negated_conjecture,
( in(X1,esk9_0)
| ~ subset(X2,esk7_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
subset(esk7_0,esk8_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_25,plain,
( subset(X1,set_intersection2(X2,X3))
| ~ in(esk3_2(X1,set_intersection2(X2,X3)),X3)
| ~ in(esk3_2(X1,set_intersection2(X2,X3)),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( subset(set_intersection2(X1,X2),X3)
| in(esk3_2(set_intersection2(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,lemma,
( in(X1,esk9_0)
| ~ in(X1,set_intersection2(esk7_0,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
( X1 = set_intersection2(X2,X3)
| ~ in(esk4_3(X2,X3,X1),X3)
| ~ in(esk4_3(X2,X3,X1),X2)
| ~ in(esk4_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_29,negated_conjecture,
( in(X1,esk8_0)
| ~ in(X1,esk7_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_30,plain,
( X1 = set_intersection2(X2,X3)
| in(esk4_3(X2,X3,X1),X1)
| in(esk4_3(X2,X3,X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_31,plain,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ in(esk3_2(set_intersection2(X1,X2),set_intersection2(X3,X2)),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,lemma,
( subset(set_intersection2(esk7_0,X1),X2)
| in(esk3_2(set_intersection2(esk7_0,X1),X2),esk9_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_33,negated_conjecture,
( X1 = set_intersection2(X2,esk8_0)
| ~ in(esk4_3(X2,esk8_0,X1),esk7_0)
| ~ in(esk4_3(X2,esk8_0,X1),X2)
| ~ in(esk4_3(X2,esk8_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( set_intersection2(X1,X2) = X1
| in(esk4_3(X1,X2,X1),X1) ),
inference(ef,[status(thm)],[c_0_30]) ).
fof(c_0_35,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_36,lemma,
subset(set_intersection2(esk7_0,X1),set_intersection2(esk9_0,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
set_intersection2(esk7_0,esk8_0) = esk7_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_34]) ).
cnf(c_0_38,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_39,negated_conjecture,
~ subset(esk7_0,set_intersection2(esk8_0,esk9_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : SEU128+2 : TPTP v8.1.0. Released v3.3.0.
% 0.14/0.14 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n006.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 22:22:55 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.27/3.45 # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.27/3.45 # Preprocessing time : 0.017 s
% 0.27/3.45
% 0.27/3.45 # Proof found!
% 0.27/3.45 # SZS status Theorem
% 0.27/3.45 # SZS output start CNFRefutation
% See solution above
% 0.27/3.45 # Proof object total steps : 41
% 0.27/3.45 # Proof object clause steps : 28
% 0.27/3.45 # Proof object formula steps : 13
% 0.27/3.45 # Proof object conjectures : 12
% 0.27/3.45 # Proof object clause conjectures : 9
% 0.27/3.45 # Proof object formula conjectures : 3
% 0.27/3.45 # Proof object initial clauses used : 13
% 0.27/3.45 # Proof object initial formulas used : 6
% 0.27/3.45 # Proof object generating inferences : 15
% 0.27/3.45 # Proof object simplifying inferences : 3
% 0.27/3.45 # Training examples: 0 positive, 0 negative
% 0.27/3.45 # Parsed axioms : 36
% 0.27/3.45 # Removed by relevancy pruning/SinE : 0
% 0.27/3.45 # Initial clauses : 57
% 0.27/3.45 # Removed in clause preprocessing : 3
% 0.27/3.45 # Initial clauses in saturation : 54
% 0.27/3.45 # Processed clauses : 19708
% 0.27/3.45 # ...of these trivial : 122
% 0.27/3.45 # ...subsumed : 17302
% 0.27/3.45 # ...remaining for further processing : 2283
% 0.27/3.45 # Other redundant clauses eliminated : 53
% 0.27/3.45 # Clauses deleted for lack of memory : 81389
% 0.27/3.45 # Backward-subsumed : 92
% 0.27/3.45 # Backward-rewritten : 6
% 0.27/3.45 # Generated clauses : 216228
% 0.27/3.45 # ...of the previous two non-trivial : 206314
% 0.27/3.45 # Contextual simplify-reflections : 6149
% 0.27/3.45 # Paramodulations : 214890
% 0.27/3.45 # Factorizations : 1206
% 0.27/3.45 # Equation resolutions : 132
% 0.27/3.45 # Current number of processed clauses : 2183
% 0.27/3.45 # Positive orientable unit clauses : 75
% 0.27/3.45 # Positive unorientable unit clauses: 2
% 0.27/3.45 # Negative unit clauses : 106
% 0.27/3.45 # Non-unit-clauses : 2000
% 0.27/3.45 # Current number of unprocessed clauses: 98375
% 0.27/3.45 # ...number of literals in the above : 371230
% 0.27/3.45 # Current number of archived formulas : 0
% 0.27/3.45 # Current number of archived clauses : 98
% 0.27/3.45 # Clause-clause subsumption calls (NU) : 1689652
% 0.27/3.45 # Rec. Clause-clause subsumption calls : 1136602
% 0.27/3.45 # Non-unit clause-clause subsumptions : 14214
% 0.27/3.45 # Unit Clause-clause subsumption calls : 16063
% 0.27/3.45 # Rewrite failures with RHS unbound : 0
% 0.27/3.45 # BW rewrite match attempts : 216
% 0.27/3.45 # BW rewrite match successes : 20
% 0.27/3.45 # Condensation attempts : 0
% 0.27/3.45 # Condensation successes : 0
% 0.27/3.45 # Termbank termtop insertions : 3058918
% 0.27/3.45
% 0.27/3.45 # -------------------------------------------------
% 0.27/3.45 # User time : 2.364 s
% 0.27/3.45 # System time : 0.075 s
% 0.27/3.45 # Total time : 2.439 s
% 0.27/3.45 # Maximum resident set size: 127272 pages
%------------------------------------------------------------------------------