TSTP Solution File: SEU126+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU126+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n020.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:57 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 47 ( 14 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 40 ( 17 ~; 14 |; 5 &)
% ( 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(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d10_xboole_0) ).
fof(t8_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X3,X2) )
=> subset(set_union2(X1,X3),X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_xboole_1) ).
fof(t7_xboole_1,lemma,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_xboole_1) ).
fof(commutativity_k2_xboole_0,axiom,
! [X1,X2] : set_union2(X1,X2) = set_union2(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_xboole_0) ).
fof(t12_xboole_1,conjecture,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t12_xboole_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',reflexivity_r1_tarski) ).
fof(c_0_6,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_7,lemma,
! [X4,X5,X6] :
( ~ subset(X4,X5)
| ~ subset(X6,X5)
| subset(set_union2(X4,X6),X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_xboole_1])]) ).
fof(c_0_8,lemma,
! [X3,X4] : subset(X3,set_union2(X3,X4)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
fof(c_0_9,plain,
! [X3,X4] : set_union2(X3,X4) = set_union2(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_xboole_0]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
inference(assume_negation,[status(cth)],[t12_xboole_1]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ subset(X2,X1)
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,lemma,
( subset(set_union2(X1,X2),X3)
| ~ subset(X2,X3)
| ~ subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,lemma,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
set_union2(X1,X2) = set_union2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_15,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_16,negated_conjecture,
( subset(esk1_0,esk2_0)
& set_union2(esk1_0,esk2_0) != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_17,lemma,
( X1 = set_union2(X2,X3)
| ~ subset(X1,set_union2(X2,X3))
| ~ subset(X3,X1)
| ~ subset(X2,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,lemma,
subset(X1,set_union2(X2,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_19,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
set_union2(esk1_0,esk2_0) != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,lemma,
( set_union2(X1,X2) = X2
| ~ subset(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_22,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU126+2 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.12 % Command : run_ET %s %d
% 0.11/0.33 % Computer : n020.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 20 10:31:33 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.22/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.40 # Preprocessing time : 0.016 s
% 0.22/1.40
% 0.22/1.40 # Proof found!
% 0.22/1.40 # SZS status Theorem
% 0.22/1.40 # SZS output start CNFRefutation
% See solution above
% 0.22/1.40 # Proof object total steps : 24
% 0.22/1.40 # Proof object clause steps : 11
% 0.22/1.40 # Proof object formula steps : 13
% 0.22/1.40 # Proof object conjectures : 6
% 0.22/1.40 # Proof object clause conjectures : 3
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 7
% 0.22/1.40 # Proof object initial formulas used : 6
% 0.22/1.40 # Proof object generating inferences : 4
% 0.22/1.40 # Proof object simplifying inferences : 4
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 33
% 0.22/1.40 # Removed by relevancy pruning/SinE : 10
% 0.22/1.40 # Initial clauses : 34
% 0.22/1.40 # Removed in clause preprocessing : 0
% 0.22/1.40 # Initial clauses in saturation : 34
% 0.22/1.40 # Processed clauses : 112
% 0.22/1.40 # ...of these trivial : 4
% 0.22/1.40 # ...subsumed : 29
% 0.22/1.40 # ...remaining for further processing : 79
% 0.22/1.40 # Other redundant clauses eliminated : 17
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 0
% 0.22/1.40 # Backward-rewritten : 7
% 0.22/1.40 # Generated clauses : 337
% 0.22/1.40 # ...of the previous two non-trivial : 237
% 0.22/1.40 # Contextual simplify-reflections : 4
% 0.22/1.40 # Paramodulations : 311
% 0.22/1.40 # Factorizations : 6
% 0.22/1.40 # Equation resolutions : 20
% 0.22/1.40 # Current number of processed clauses : 70
% 0.22/1.40 # Positive orientable unit clauses : 10
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 5
% 0.22/1.40 # Non-unit-clauses : 54
% 0.22/1.40 # Current number of unprocessed clauses: 145
% 0.22/1.40 # ...number of literals in the above : 490
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 7
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 513
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 488
% 0.22/1.40 # Non-unit clause-clause subsumptions : 30
% 0.22/1.40 # Unit Clause-clause subsumption calls : 64
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 12
% 0.22/1.40 # BW rewrite match successes : 9
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 4356
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.021 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.023 s
% 0.22/1.40 # Maximum resident set size: 3060 pages
%------------------------------------------------------------------------------