TSTP Solution File: SEU160+3 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n012.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:18 EDT 2022
% Result : Theorem 0.28s 1.46s
% Output : CNFRefutation 0.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 4 unt; 0 def)
% Number of atoms : 41 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 43 ( 17 ~; 19 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 16 ( 3 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t39_zfmisc_1,conjecture,
! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t39_zfmisc_1) ).
fof(l4_zfmisc_1,axiom,
! [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(c_0_2,negated_conjecture,
~ ! [X1,X2] :
( subset(X1,singleton(X2))
<=> ( X1 = empty_set
| X1 = singleton(X2) ) ),
inference(assume_negation,[status(cth)],[t39_zfmisc_1]) ).
fof(c_0_3,negated_conjecture,
( ( esk1_0 != empty_set
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( esk1_0 != singleton(esk2_0)
| ~ subset(esk1_0,singleton(esk2_0)) )
& ( subset(esk1_0,singleton(esk2_0))
| esk1_0 = empty_set
| esk1_0 = singleton(esk2_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).
fof(c_0_4,plain,
! [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])])])])]) ).
cnf(c_0_5,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( subset(X1,singleton(X2))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( esk1_0 = singleton(esk2_0)
| esk1_0 = empty_set
| subset(esk1_0,singleton(esk2_0)) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_8,negated_conjecture,
esk1_0 != empty_set,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_9,plain,
( subset(X1,singleton(X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,negated_conjecture,
( ~ subset(esk1_0,singleton(esk2_0))
| esk1_0 != singleton(esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,negated_conjecture,
subset(esk1_0,singleton(esk2_0)),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_12,plain,
( X1 = singleton(X2)
| X1 = empty_set
| ~ subset(X1,singleton(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_13,negated_conjecture,
singleton(esk2_0) != esk1_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11])]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_8]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SEU160+3 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.15 % Command : run_ET %s %d
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jun 19 07:52:08 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.28/1.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.28/1.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.28/1.46 # Preprocessing time : 0.014 s
% 0.28/1.46
% 0.28/1.46 # Proof found!
% 0.28/1.46 # SZS status Theorem
% 0.28/1.46 # SZS output start CNFRefutation
% See solution above
% 0.28/1.46 # Proof object total steps : 15
% 0.28/1.46 # Proof object clause steps : 10
% 0.28/1.46 # Proof object formula steps : 5
% 0.28/1.46 # Proof object conjectures : 10
% 0.28/1.46 # Proof object clause conjectures : 7
% 0.28/1.46 # Proof object formula conjectures : 3
% 0.28/1.46 # Proof object initial clauses used : 6
% 0.28/1.46 # Proof object initial formulas used : 2
% 0.28/1.46 # Proof object generating inferences : 2
% 0.28/1.46 # Proof object simplifying inferences : 6
% 0.28/1.46 # Training examples: 0 positive, 0 negative
% 0.28/1.46 # Parsed axioms : 6
% 0.28/1.46 # Removed by relevancy pruning/SinE : 0
% 0.28/1.46 # Initial clauses : 10
% 0.28/1.46 # Removed in clause preprocessing : 0
% 0.28/1.46 # Initial clauses in saturation : 10
% 0.28/1.46 # Processed clauses : 15
% 0.28/1.46 # ...of these trivial : 0
% 0.28/1.46 # ...subsumed : 1
% 0.28/1.46 # ...remaining for further processing : 13
% 0.28/1.46 # Other redundant clauses eliminated : 0
% 0.28/1.46 # Clauses deleted for lack of memory : 0
% 0.28/1.46 # Backward-subsumed : 0
% 0.28/1.46 # Backward-rewritten : 2
% 0.28/1.46 # Generated clauses : 11
% 0.28/1.46 # ...of the previous two non-trivial : 9
% 0.28/1.46 # Contextual simplify-reflections : 1
% 0.28/1.46 # Paramodulations : 10
% 0.28/1.46 # Factorizations : 0
% 0.28/1.46 # Equation resolutions : 0
% 0.28/1.46 # Current number of processed clauses : 10
% 0.28/1.46 # Positive orientable unit clauses : 4
% 0.28/1.46 # Positive unorientable unit clauses: 0
% 0.28/1.46 # Negative unit clauses : 3
% 0.28/1.46 # Non-unit-clauses : 3
% 0.28/1.46 # Current number of unprocessed clauses: 0
% 0.28/1.46 # ...number of literals in the above : 0
% 0.28/1.46 # Current number of archived formulas : 0
% 0.28/1.46 # Current number of archived clauses : 3
% 0.28/1.46 # Clause-clause subsumption calls (NU) : 1
% 0.28/1.46 # Rec. Clause-clause subsumption calls : 1
% 0.28/1.46 # Non-unit clause-clause subsumptions : 1
% 0.28/1.46 # Unit Clause-clause subsumption calls : 2
% 0.28/1.46 # Rewrite failures with RHS unbound : 0
% 0.28/1.46 # BW rewrite match attempts : 1
% 0.28/1.46 # BW rewrite match successes : 1
% 0.28/1.46 # Condensation attempts : 0
% 0.28/1.46 # Condensation successes : 0
% 0.28/1.46 # Termbank termtop insertions : 468
% 0.28/1.46
% 0.28/1.46 # -------------------------------------------------
% 0.28/1.46 # User time : 0.014 s
% 0.28/1.46 # System time : 0.001 s
% 0.28/1.46 # Total time : 0.015 s
% 0.28/1.46 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------