TSTP Solution File: SEU130+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU130+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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:00 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 14 unt; 0 def)
% Number of atoms : 44 ( 18 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 11 |; 4 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 5 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t28_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t28_xboole_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(t26_xboole_1,lemma,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(set_intersection2(X1,X3),set_intersection2(X2,X3)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t26_xboole_1) ).
fof(t17_xboole_1,lemma,
! [X1,X2] : subset(set_intersection2(X1,X2),X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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.mepo_128.in',commutativity_k3_xboole_0) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',idempotence_k3_xboole_0) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_intersection2(X1,X2) = X1 ),
inference(assume_negation,[status(cth)],[t28_xboole_1]) ).
fof(c_0_7,plain,
! [X3,X4,X3,X4] :
( ( subset(X3,X4)
| X3 != X4 )
& ( subset(X4,X3)
| X3 != X4 )
& ( ~ subset(X3,X4)
| ~ subset(X4,X3)
| X3 = X4 ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])])]) ).
fof(c_0_8,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| subset(set_intersection2(X4,X6),set_intersection2(X5,X6)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t26_xboole_1])])])]) ).
fof(c_0_9,lemma,
! [X3,X4] : subset(set_intersection2(X3,X4),X3),
inference(variable_rename,[status(thm)],[t17_xboole_1]) ).
fof(c_0_10,plain,
! [X3,X4] : set_intersection2(X3,X4) = set_intersection2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_11,negated_conjecture,
( subset(esk1_0,esk2_0)
& set_intersection2(esk1_0,esk2_0) != esk1_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_12,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,lemma,
( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_14,plain,
! [X3] : set_intersection2(X3,X3) = X3,
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[idempotence_k3_xboole_0])]) ).
cnf(c_0_15,lemma,
subset(set_intersection2(X1,X2),X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
set_intersection2(esk1_0,esk2_0) != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,lemma,
( set_intersection2(X1,X2) = set_intersection2(X3,X2)
| ~ subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
| ~ subset(X3,X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,lemma,
subset(set_intersection2(X1,X2),X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,negated_conjecture,
set_intersection2(esk2_0,esk1_0) != esk1_0,
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_22,lemma,
( set_intersection2(X1,X2) = X2
| ~ subset(X2,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : SEU130+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n008.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 : Sun Jun 19 03:30:52 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.017 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 25
% 0.25/1.43 # Proof object clause steps : 12
% 0.25/1.43 # Proof object formula steps : 13
% 0.25/1.43 # Proof object conjectures : 7
% 0.25/1.43 # Proof object clause conjectures : 4
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 7
% 0.25/1.43 # Proof object initial formulas used : 6
% 0.25/1.43 # Proof object generating inferences : 4
% 0.25/1.43 # Proof object simplifying inferences : 5
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 38
% 0.25/1.43 # Removed by relevancy pruning/SinE : 7
% 0.25/1.43 # Initial clauses : 47
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 47
% 0.25/1.43 # Processed clauses : 845
% 0.25/1.43 # ...of these trivial : 41
% 0.25/1.43 # ...subsumed : 576
% 0.25/1.43 # ...remaining for further processing : 228
% 0.25/1.43 # Other redundant clauses eliminated : 32
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 4
% 0.25/1.43 # Backward-rewritten : 9
% 0.25/1.43 # Generated clauses : 3422
% 0.25/1.43 # ...of the previous two non-trivial : 2390
% 0.25/1.43 # Contextual simplify-reflections : 137
% 0.25/1.43 # Paramodulations : 3365
% 0.25/1.43 # Factorizations : 16
% 0.25/1.43 # Equation resolutions : 41
% 0.25/1.43 # Current number of processed clauses : 213
% 0.25/1.43 # Positive orientable unit clauses : 35
% 0.25/1.43 # Positive unorientable unit clauses: 2
% 0.25/1.43 # Negative unit clauses : 15
% 0.25/1.43 # Non-unit-clauses : 161
% 0.25/1.43 # Current number of unprocessed clauses: 1554
% 0.25/1.43 # ...number of literals in the above : 4735
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 13
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 12441
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 10642
% 0.25/1.43 # Non-unit clause-clause subsumptions : 467
% 0.25/1.43 # Unit Clause-clause subsumption calls : 811
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 75
% 0.25/1.43 # BW rewrite match successes : 15
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 28825
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.079 s
% 0.25/1.43 # System time : 0.000 s
% 0.25/1.43 # Total time : 0.079 s
% 0.25/1.43 # Maximum resident set size: 4388 pages
%------------------------------------------------------------------------------