TSTP Solution File: SEU142+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU142+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n009.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:06 EDT 2022
% Result : Theorem 0.24s 1.42s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 20 ( 7 unt; 0 def)
% Number of atoms : 75 ( 56 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 82 ( 27 ~; 43 |; 8 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-3 aty)
% Number of variables : 50 ( 7 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d1_tarski) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',d2_tarski) ).
fof(t69_enumset1,conjecture,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',t69_enumset1) ).
fof(c_0_3,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk2_2(X4,X5),X5)
| esk2_2(X4,X5) = X4
| X5 = singleton(X4) ) ),
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)],[d1_tarski])])])])])])]) ).
fof(c_0_4,plain,
! [X5,X6,X7,X8,X8,X5,X6,X7] :
( ( ~ in(X8,X7)
| X8 = X5
| X8 = X6
| X7 != unordered_pair(X5,X6) )
& ( X8 != X5
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( X8 != X6
| in(X8,X7)
| X7 != unordered_pair(X5,X6) )
& ( esk3_3(X5,X6,X7) != X5
| ~ in(esk3_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( esk3_3(X5,X6,X7) != X6
| ~ in(esk3_3(X5,X6,X7),X7)
| X7 = unordered_pair(X5,X6) )
& ( in(esk3_3(X5,X6,X7),X7)
| esk3_3(X5,X6,X7) = X5
| esk3_3(X5,X6,X7) = X6
| X7 = unordered_pair(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)],[d2_tarski])])])])])])]) ).
cnf(c_0_5,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( X1 = unordered_pair(X2,X3)
| esk3_3(X2,X3,X1) = X3
| esk3_3(X2,X3,X1) = X2
| in(esk3_3(X2,X3,X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( esk3_3(X1,X2,X3) = X2
| esk3_3(X1,X2,X3) = X1
| X4 = esk3_3(X1,X2,X3)
| X3 = unordered_pair(X1,X2)
| X3 != singleton(X4) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( in(X3,X1)
| X1 != singleton(X2)
| X3 != X2 ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_9,plain,
( esk3_3(X1,X2,singleton(X3)) = X3
| esk3_3(X1,X2,singleton(X3)) = X1
| esk3_3(X1,X2,singleton(X3)) = X2
| singleton(X3) = unordered_pair(X1,X2) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( in(X1,X2)
| X2 != singleton(X1) ),
inference(er,[status(thm)],[c_0_8]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] : unordered_pair(X1,X1) = singleton(X1),
inference(assume_negation,[status(cth)],[t69_enumset1]) ).
cnf(c_0_12,plain,
( X1 = unordered_pair(X2,X3)
| ~ in(esk3_3(X2,X3,X1),X1)
| esk3_3(X2,X3,X1) != X2 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,plain,
( esk3_3(X1,X2,singleton(X1)) = X2
| esk3_3(X1,X2,singleton(X1)) = X1
| singleton(X1) = unordered_pair(X1,X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_9])]) ).
cnf(c_0_14,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[c_0_10]) ).
fof(c_0_15,negated_conjecture,
unordered_pair(esk1_0,esk1_0) != singleton(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
cnf(c_0_16,plain,
( esk3_3(X1,X2,singleton(X1)) = X2
| singleton(X1) = unordered_pair(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,negated_conjecture,
unordered_pair(esk1_0,esk1_0) != singleton(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
singleton(X1) = unordered_pair(X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_16])]),c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU142+2 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n009.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 : Sat Jun 18 21:05:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.24/1.42 # Running protocol protocol_eprover_2d86bd69119e7e9cc4417c0ee581499eaf828bb2 for 23 seconds:
% 0.24/1.42 # SinE strategy is GSinE(CountFormulas,,1.1,,02,500,1.0)
% 0.24/1.42 # Preprocessing time : 0.017 s
% 0.24/1.42
% 0.24/1.42 # Proof found!
% 0.24/1.42 # SZS status Theorem
% 0.24/1.42 # SZS output start CNFRefutation
% See solution above
% 0.24/1.42 # Proof object total steps : 20
% 0.24/1.42 # Proof object clause steps : 13
% 0.24/1.42 # Proof object formula steps : 7
% 0.24/1.42 # Proof object conjectures : 5
% 0.24/1.42 # Proof object clause conjectures : 2
% 0.24/1.42 # Proof object formula conjectures : 3
% 0.24/1.42 # Proof object initial clauses used : 5
% 0.24/1.42 # Proof object initial formulas used : 3
% 0.24/1.42 # Proof object generating inferences : 6
% 0.24/1.42 # Proof object simplifying inferences : 9
% 0.24/1.42 # Training examples: 0 positive, 0 negative
% 0.24/1.42 # Parsed axioms : 63
% 0.24/1.42 # Removed by relevancy pruning/SinE : 52
% 0.24/1.42 # Initial clauses : 38
% 0.24/1.42 # Removed in clause preprocessing : 0
% 0.24/1.42 # Initial clauses in saturation : 38
% 0.24/1.42 # Processed clauses : 124
% 0.24/1.42 # ...of these trivial : 3
% 0.24/1.42 # ...subsumed : 32
% 0.24/1.42 # ...remaining for further processing : 89
% 0.24/1.42 # Other redundant clauses eliminated : 45
% 0.24/1.42 # Clauses deleted for lack of memory : 0
% 0.24/1.42 # Backward-subsumed : 1
% 0.24/1.42 # Backward-rewritten : 23
% 0.24/1.42 # Generated clauses : 788
% 0.24/1.42 # ...of the previous two non-trivial : 736
% 0.24/1.42 # Contextual simplify-reflections : 0
% 0.24/1.42 # Paramodulations : 693
% 0.24/1.42 # Factorizations : 22
% 0.24/1.42 # Equation resolutions : 67
% 0.24/1.42 # Current number of processed clauses : 56
% 0.24/1.42 # Positive orientable unit clauses : 7
% 0.24/1.42 # Positive unorientable unit clauses: 1
% 0.24/1.42 # Negative unit clauses : 4
% 0.24/1.42 # Non-unit-clauses : 44
% 0.24/1.42 # Current number of unprocessed clauses: 426
% 0.24/1.42 # ...number of literals in the above : 1697
% 0.24/1.42 # Current number of archived formulas : 0
% 0.24/1.42 # Current number of archived clauses : 30
% 0.24/1.42 # Clause-clause subsumption calls (NU) : 1091
% 0.24/1.42 # Rec. Clause-clause subsumption calls : 810
% 0.24/1.42 # Non-unit clause-clause subsumptions : 21
% 0.24/1.42 # Unit Clause-clause subsumption calls : 244
% 0.24/1.42 # Rewrite failures with RHS unbound : 0
% 0.24/1.42 # BW rewrite match attempts : 12
% 0.24/1.42 # BW rewrite match successes : 7
% 0.24/1.42 # Condensation attempts : 0
% 0.24/1.42 # Condensation successes : 0
% 0.24/1.42 # Termbank termtop insertions : 10518
% 0.24/1.42
% 0.24/1.42 # -------------------------------------------------
% 0.24/1.42 # User time : 0.027 s
% 0.24/1.42 # System time : 0.005 s
% 0.24/1.42 # Total time : 0.032 s
% 0.24/1.42 # Maximum resident set size: 3560 pages
%------------------------------------------------------------------------------