TSTP Solution File: SEU148+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU148+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n003.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:09 EDT 2022
% Result : Theorem 0.24s 1.43s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 25 ( 12 unt; 0 def)
% Number of atoms : 59 ( 30 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 56 ( 22 ~; 21 |; 7 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 9 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_zfmisc_1,conjecture,
! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t6_zfmisc_1) ).
fof(l2_zfmisc_1,lemma,
! [X1,X2] :
( subset(singleton(X1),X2)
<=> in(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l2_zfmisc_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(l4_zfmisc_1,lemma,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l4_zfmisc_1) ).
fof(l1_zfmisc_1,lemma,
! [X1] : singleton(X1) != empty_set,
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l1_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( subset(singleton(X1),singleton(X2))
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t6_zfmisc_1]) ).
fof(c_0_7,lemma,
! [X3,X4,X3,X4] :
( ( ~ subset(singleton(X3),X4)
| in(X3,X4) )
& ( ~ in(X3,X4)
| subset(singleton(X3),X4) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l2_zfmisc_1])])])]) ).
fof(c_0_8,plain,
! [X3] : subset(X3,X3),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(c_0_9,lemma,
! [X3,X4,X3,X4] :
( ( ~ subset(X3,singleton(X4))
| X3 = empty_set
| X3 = singleton(X4) )
& ( X3 != empty_set
| subset(X3,singleton(X4)) )
& ( X3 != singleton(X4)
| subset(X3,singleton(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)],[l4_zfmisc_1])])])])]) ).
fof(c_0_10,negated_conjecture,
( subset(singleton(esk1_0),singleton(esk2_0))
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
fof(c_0_11,lemma,
! [X2] : singleton(X2) != empty_set,
inference(variable_rename,[status(thm)],[l1_zfmisc_1]) ).
cnf(c_0_12,lemma,
( in(X1,X2)
| ~ subset(singleton(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,lemma,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
subset(singleton(esk1_0),singleton(esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,lemma,
singleton(X1) != empty_set,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X4,X5,X6,X6,X4,X5] :
( ( ~ in(X6,X5)
| X6 = X4
| X5 != singleton(X4) )
& ( X6 != X4
| in(X6,X5)
| X5 != singleton(X4) )
& ( ~ in(esk3_2(X4,X5),X5)
| esk3_2(X4,X5) != X4
| X5 = singleton(X4) )
& ( in(esk3_2(X4,X5),X5)
| esk3_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])])])])])])]) ).
cnf(c_0_18,lemma,
in(X1,singleton(X1)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
singleton(esk2_0) = singleton(esk1_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,lemma,
in(esk2_0,singleton(esk1_0)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,lemma,
( X1 = esk2_0
| singleton(esk1_0) != singleton(X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,lemma,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SEU148+2 : TPTP v8.1.0. Released v3.3.0.
% 0.04/0.13 % Command : run_ET %s %d
% 0.13/0.35 % Computer : n003.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 : Mon Jun 20 10:01:29 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.24/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.43 # Preprocessing time : 0.019 s
% 0.24/1.43
% 0.24/1.43 # Proof found!
% 0.24/1.43 # SZS status Theorem
% 0.24/1.43 # SZS output start CNFRefutation
% See solution above
% 0.24/1.43 # Proof object total steps : 25
% 0.24/1.43 # Proof object clause steps : 12
% 0.24/1.43 # Proof object formula steps : 13
% 0.24/1.43 # Proof object conjectures : 6
% 0.24/1.43 # Proof object clause conjectures : 3
% 0.24/1.43 # Proof object formula conjectures : 3
% 0.24/1.43 # Proof object initial clauses used : 7
% 0.24/1.43 # Proof object initial formulas used : 6
% 0.24/1.43 # Proof object generating inferences : 5
% 0.24/1.43 # Proof object simplifying inferences : 2
% 0.24/1.43 # Training examples: 0 positive, 0 negative
% 0.24/1.43 # Parsed axioms : 71
% 0.24/1.43 # Removed by relevancy pruning/SinE : 30
% 0.24/1.43 # Initial clauses : 71
% 0.24/1.43 # Removed in clause preprocessing : 1
% 0.24/1.43 # Initial clauses in saturation : 70
% 0.24/1.43 # Processed clauses : 79
% 0.24/1.43 # ...of these trivial : 2
% 0.24/1.43 # ...subsumed : 5
% 0.24/1.43 # ...remaining for further processing : 72
% 0.24/1.43 # Other redundant clauses eliminated : 17
% 0.24/1.43 # Clauses deleted for lack of memory : 0
% 0.24/1.43 # Backward-subsumed : 0
% 0.24/1.43 # Backward-rewritten : 4
% 0.24/1.43 # Generated clauses : 377
% 0.24/1.43 # ...of the previous two non-trivial : 277
% 0.24/1.43 # Contextual simplify-reflections : 0
% 0.24/1.43 # Paramodulations : 337
% 0.24/1.43 # Factorizations : 14
% 0.24/1.43 # Equation resolutions : 26
% 0.24/1.43 # Current number of processed clauses : 65
% 0.24/1.43 # Positive orientable unit clauses : 15
% 0.24/1.43 # Positive unorientable unit clauses: 2
% 0.24/1.43 # Negative unit clauses : 2
% 0.24/1.43 # Non-unit-clauses : 46
% 0.24/1.43 # Current number of unprocessed clauses: 253
% 0.24/1.43 # ...number of literals in the above : 665
% 0.24/1.43 # Current number of archived formulas : 0
% 0.24/1.43 # Current number of archived clauses : 5
% 0.24/1.43 # Clause-clause subsumption calls (NU) : 303
% 0.24/1.43 # Rec. Clause-clause subsumption calls : 234
% 0.24/1.43 # Non-unit clause-clause subsumptions : 4
% 0.24/1.43 # Unit Clause-clause subsumption calls : 28
% 0.24/1.43 # Rewrite failures with RHS unbound : 0
% 0.24/1.43 # BW rewrite match attempts : 16
% 0.24/1.43 # BW rewrite match successes : 11
% 0.24/1.43 # Condensation attempts : 0
% 0.24/1.43 # Condensation successes : 0
% 0.24/1.43 # Termbank termtop insertions : 6807
% 0.24/1.43
% 0.24/1.43 # -------------------------------------------------
% 0.24/1.43 # User time : 0.024 s
% 0.24/1.43 # System time : 0.002 s
% 0.24/1.43 # Total time : 0.026 s
% 0.24/1.43 # Maximum resident set size: 3360 pages
%------------------------------------------------------------------------------