TSTP Solution File: SEU156+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU156+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n022.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:15 EDT 2022
% Result : Theorem 0.22s 1.40s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 61 ( 17 unt; 0 def)
% Number of atoms : 126 ( 125 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 101 ( 36 ~; 56 |; 5 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 86 ( 11 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t33_zfmisc_1,conjecture,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d5_tarski) ).
fof(t69_enumset1,axiom,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_k2_tarski) ).
fof(t10_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
~ ( unordered_pair(X1,X2) = unordered_pair(X3,X4)
& X1 != X3
& X1 != X4 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t10_zfmisc_1) ).
fof(t8_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_zfmisc_1) ).
fof(t9_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t9_zfmisc_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
inference(assume_negation,[status(cth)],[t33_zfmisc_1]) ).
fof(c_0_8,plain,
! [X3,X4] : ordered_pair(X3,X4) = unordered_pair(unordered_pair(X3,X4),singleton(X3)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,plain,
! [X2] : unordered_pair(X2,X2) = singleton(X2),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_10,negated_conjecture,
( ordered_pair(esk1_0,esk2_0) = ordered_pair(esk3_0,esk4_0)
& ( esk1_0 != esk3_0
| esk2_0 != esk4_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
ordered_pair(esk1_0,esk2_0) = ordered_pair(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_15,plain,
! [X3,X4] : unordered_pair(X3,X4) = unordered_pair(X4,X3),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_16,plain,
! [X5,X6,X7,X8] :
( unordered_pair(X5,X6) != unordered_pair(X7,X8)
| X5 = X7
| X5 = X8 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t10_zfmisc_1])]) ).
cnf(c_0_17,negated_conjecture,
unordered_pair(unordered_pair(esk3_0,esk4_0),unordered_pair(esk3_0,esk3_0)) = unordered_pair(unordered_pair(esk1_0,esk2_0),unordered_pair(esk1_0,esk1_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_18,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_19,plain,
! [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])])])]) ).
cnf(c_0_20,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X1,X4) != unordered_pair(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,negated_conjecture,
unordered_pair(unordered_pair(esk2_0,esk1_0),unordered_pair(esk1_0,esk1_0)) = unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_22,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = X1
| unordered_pair(esk2_0,esk1_0) = X2
| unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X2,X3) ),
inference(rw,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(esk3_0,esk3_0) = unordered_pair(esk2_0,esk1_0)
| unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0) ),
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| esk3_0 = X1
| unordered_pair(esk2_0,esk1_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( X1 = X2
| X1 = X3
| unordered_pair(X4,X1) != unordered_pair(X2,X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| esk3_0 = esk2_0 ),
inference(er,[status(thm)],[c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( esk3_0 = esk2_0
| X1 = esk1_0
| X1 = esk2_0
| unordered_pair(X2,X1) != unordered_pair(esk4_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_30,plain,
( X1 = X2
| unordered_pair(X1,X1) != unordered_pair(X3,X2) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_31,negated_conjecture,
( esk2_0 != esk4_0
| esk1_0 != esk3_0 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
( esk1_0 = esk3_0
| esk3_0 = esk2_0 ),
inference(er,[status(thm)],[c_0_29]) ).
cnf(c_0_33,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| esk3_0 = X1
| unordered_pair(esk2_0,esk1_0) != unordered_pair(X2,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_34,negated_conjecture,
( esk3_0 = esk2_0
| esk2_0 = X1
| esk2_0 = X2
| unordered_pair(esk4_0,esk3_0) != unordered_pair(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_35,negated_conjecture,
( esk3_0 = esk2_0
| esk2_0 != esk4_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_36,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| esk1_0 = esk3_0 ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_37,negated_conjecture,
esk3_0 = esk2_0,
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_34]),c_0_35]) ).
cnf(c_0_38,negated_conjecture,
( X1 = unordered_pair(esk2_0,esk1_0)
| X1 = unordered_pair(esk1_0,esk1_0)
| unordered_pair(X1,X2) != unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_39,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk2_0)
| esk1_0 = esk2_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk2_0,esk1_0) = unordered_pair(esk2_0,esk2_0)
| esk2_0 != esk4_0 ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
fof(c_0_41,plain,
! [X4,X5,X6] :
( singleton(X4) != unordered_pair(X5,X6)
| X5 = X6 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t9_zfmisc_1])]) ).
cnf(c_0_42,negated_conjecture,
( unordered_pair(esk1_0,esk1_0) = X1
| unordered_pair(esk1_0,esk1_0) = X2
| unordered_pair(unordered_pair(esk4_0,esk3_0),unordered_pair(esk3_0,esk3_0)) != unordered_pair(X2,X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_43,negated_conjecture,
( unordered_pair(esk1_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk3_0) ),
inference(er,[status(thm)],[c_0_38]) ).
cnf(c_0_44,negated_conjecture,
( esk1_0 = esk2_0
| X1 = esk2_0
| X1 = esk1_0
| unordered_pair(X1,X2) != unordered_pair(esk4_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_20,c_0_39]) ).
cnf(c_0_45,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk2_0,esk2_0) = unordered_pair(esk4_0,esk3_0)
| esk2_0 != esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_40]),c_0_31]) ).
cnf(c_0_46,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk2_0,esk2_0) != unordered_pair(esk4_0,esk2_0) ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_40]),c_0_24]) ).
cnf(c_0_47,plain,
( X1 = X2
| singleton(X3) != unordered_pair(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_48,negated_conjecture,
( unordered_pair(esk1_0,esk1_0) = unordered_pair(esk4_0,esk3_0)
| unordered_pair(esk1_0,esk1_0) = unordered_pair(esk3_0,esk3_0) ),
inference(er,[status(thm)],[c_0_42]) ).
cnf(c_0_49,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk2_0)
| unordered_pair(esk1_0,esk1_0) = unordered_pair(esk4_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_37]),c_0_37]) ).
cnf(c_0_50,negated_conjecture,
( esk1_0 = esk4_0
| esk2_0 = esk4_0
| esk1_0 = esk2_0 ),
inference(er,[status(thm)],[c_0_44]) ).
cnf(c_0_51,negated_conjecture,
( unordered_pair(esk2_0,esk1_0) = unordered_pair(esk4_0,esk2_0)
| esk2_0 != esk4_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_37]),c_0_46]) ).
cnf(c_0_52,plain,
( X1 = X2
| unordered_pair(X1,X2) != unordered_pair(X3,X3) ),
inference(rw,[status(thm)],[c_0_47,c_0_12]) ).
cnf(c_0_53,negated_conjecture,
( unordered_pair(esk1_0,esk1_0) = unordered_pair(esk2_0,esk2_0)
| unordered_pair(esk1_0,esk1_0) = unordered_pair(esk4_0,esk2_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_37]),c_0_37]),c_0_37]) ).
cnf(c_0_54,negated_conjecture,
( esk2_0 = esk4_0
| esk1_0 = esk4_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_24]) ).
cnf(c_0_55,negated_conjecture,
( X1 = esk1_0
| unordered_pair(X1,X1) != unordered_pair(esk4_0,esk2_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_51]),c_0_52]) ).
cnf(c_0_56,negated_conjecture,
esk2_0 = esk4_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_30]),c_0_30]) ).
cnf(c_0_57,negated_conjecture,
( esk1_0 != esk2_0
| esk2_0 != esk4_0 ),
inference(rw,[status(thm)],[c_0_31,c_0_37]) ).
cnf(c_0_58,negated_conjecture,
( X1 = esk1_0
| unordered_pair(X1,X1) != unordered_pair(esk4_0,esk4_0) ),
inference(rw,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_59,negated_conjecture,
esk1_0 != esk4_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_56]),c_0_56])]) ).
cnf(c_0_60,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_58]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU156+3 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jun 19 01:46:47 EDT 2022
% 0.12/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.014 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 : 61
% 0.22/1.40 # Proof object clause steps : 46
% 0.22/1.40 # Proof object formula steps : 15
% 0.22/1.40 # Proof object conjectures : 38
% 0.22/1.40 # Proof object clause conjectures : 35
% 0.22/1.40 # Proof object formula conjectures : 3
% 0.22/1.40 # Proof object initial clauses used : 8
% 0.22/1.40 # Proof object initial formulas used : 7
% 0.22/1.40 # Proof object generating inferences : 26
% 0.22/1.40 # Proof object simplifying inferences : 29
% 0.22/1.40 # Training examples: 0 positive, 0 negative
% 0.22/1.40 # Parsed axioms : 12
% 0.22/1.40 # Removed by relevancy pruning/SinE : 2
% 0.22/1.40 # Initial clauses : 11
% 0.22/1.40 # Removed in clause preprocessing : 2
% 0.22/1.40 # Initial clauses in saturation : 9
% 0.22/1.40 # Processed clauses : 1172
% 0.22/1.40 # ...of these trivial : 17
% 0.22/1.40 # ...subsumed : 954
% 0.22/1.40 # ...remaining for further processing : 201
% 0.22/1.40 # Other redundant clauses eliminated : 0
% 0.22/1.40 # Clauses deleted for lack of memory : 0
% 0.22/1.40 # Backward-subsumed : 19
% 0.22/1.40 # Backward-rewritten : 162
% 0.22/1.40 # Generated clauses : 2940
% 0.22/1.40 # ...of the previous two non-trivial : 2958
% 0.22/1.40 # Contextual simplify-reflections : 421
% 0.22/1.40 # Paramodulations : 2916
% 0.22/1.40 # Factorizations : 5
% 0.22/1.40 # Equation resolutions : 19
% 0.22/1.40 # Current number of processed clauses : 20
% 0.22/1.40 # Positive orientable unit clauses : 5
% 0.22/1.40 # Positive unorientable unit clauses: 1
% 0.22/1.40 # Negative unit clauses : 8
% 0.22/1.40 # Non-unit-clauses : 6
% 0.22/1.40 # Current number of unprocessed clauses: 99
% 0.22/1.40 # ...number of literals in the above : 186
% 0.22/1.40 # Current number of archived formulas : 0
% 0.22/1.40 # Current number of archived clauses : 183
% 0.22/1.40 # Clause-clause subsumption calls (NU) : 13208
% 0.22/1.40 # Rec. Clause-clause subsumption calls : 11636
% 0.22/1.40 # Non-unit clause-clause subsumptions : 1173
% 0.22/1.40 # Unit Clause-clause subsumption calls : 28
% 0.22/1.40 # Rewrite failures with RHS unbound : 0
% 0.22/1.40 # BW rewrite match attempts : 15
% 0.22/1.40 # BW rewrite match successes : 15
% 0.22/1.40 # Condensation attempts : 0
% 0.22/1.40 # Condensation successes : 0
% 0.22/1.40 # Termbank termtop insertions : 51792
% 0.22/1.40
% 0.22/1.40 # -------------------------------------------------
% 0.22/1.40 # User time : 0.104 s
% 0.22/1.40 # System time : 0.002 s
% 0.22/1.40 # Total time : 0.106 s
% 0.22/1.40 # Maximum resident set size: 4096 pages
%------------------------------------------------------------------------------