TSTP Solution File: SEU150+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU150+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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:11 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 32 ( 31 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 6 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn 18 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t9_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t9_zfmisc_1) ).
fof(t8_zfmisc_1,lemma,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_zfmisc_1) ).
fof(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t69_enumset1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[t9_zfmisc_1]) ).
fof(c_0_5,lemma,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X4 = X5 ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])])])]) ).
fof(c_0_6,lemma,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_7,negated_conjecture,
( singleton(esk1_0) = unordered_pair(esk2_0,esk3_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,lemma,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
singleton(esk1_0) = unordered_pair(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,lemma,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
unordered_pair(esk2_0,esk3_0) = unordered_pair(esk1_0,esk1_0),
inference(rw,[status(thm)],[c_0_10,c_0_9]) ).
fof(c_0_13,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_14,negated_conjecture,
( esk1_0 = X1
| unordered_pair(esk2_0,esk3_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_16,negated_conjecture,
esk1_0 = esk2_0,
inference(er,[status(thm)],[c_0_14]) ).
cnf(c_0_17,lemma,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
unordered_pair(esk2_0,esk3_0) = unordered_pair(esk2_0,esk2_0),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_16]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( X1 = esk3_0
| unordered_pair(X1,X1) != unordered_pair(esk2_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_19]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SEU150+2 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 00:22:09 EDT 2022
% 0.13/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.032 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 : 22
% 0.23/1.41 # Proof object clause steps : 13
% 0.23/1.41 # Proof object formula steps : 9
% 0.23/1.41 # Proof object conjectures : 11
% 0.23/1.41 # Proof object clause conjectures : 8
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 5
% 0.23/1.41 # Proof object initial formulas used : 4
% 0.23/1.41 # Proof object generating inferences : 5
% 0.23/1.41 # Proof object simplifying inferences : 5
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 73
% 0.23/1.41 # Removed by relevancy pruning/SinE : 27
% 0.23/1.41 # Initial clauses : 81
% 0.23/1.41 # Removed in clause preprocessing : 2
% 0.23/1.41 # Initial clauses in saturation : 79
% 0.23/1.41 # Processed clauses : 98
% 0.23/1.41 # ...of these trivial : 4
% 0.23/1.41 # ...subsumed : 10
% 0.23/1.41 # ...remaining for further processing : 84
% 0.23/1.41 # Other redundant clauses eliminated : 22
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 1
% 0.23/1.41 # Backward-rewritten : 3
% 0.23/1.41 # Generated clauses : 413
% 0.23/1.41 # ...of the previous two non-trivial : 299
% 0.23/1.41 # Contextual simplify-reflections : 0
% 0.23/1.41 # Paramodulations : 363
% 0.23/1.41 # Factorizations : 14
% 0.23/1.41 # Equation resolutions : 36
% 0.23/1.41 # Current number of processed clauses : 75
% 0.23/1.41 # Positive orientable unit clauses : 16
% 0.23/1.41 # Positive unorientable unit clauses: 3
% 0.23/1.41 # Negative unit clauses : 3
% 0.23/1.41 # Non-unit-clauses : 53
% 0.23/1.41 # Current number of unprocessed clauses: 266
% 0.23/1.41 # ...number of literals in the above : 683
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 6
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 211
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 162
% 0.23/1.41 # Non-unit clause-clause subsumptions : 8
% 0.23/1.41 # Unit Clause-clause subsumption calls : 87
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 22
% 0.23/1.41 # BW rewrite match successes : 18
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 7315
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.044 s
% 0.23/1.41 # System time : 0.002 s
% 0.23/1.41 # Total time : 0.046 s
% 0.23/1.41 # Maximum resident set size: 3380 pages
%------------------------------------------------------------------------------