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