TSTP Solution File: SET880+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SET880+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n023.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:10 EDT 2022
% Result : Theorem 0.23s 1.42s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 14 ( 4 unt; 0 def)
% Number of atoms : 38 ( 26 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 14 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 25 ( 5 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = empty_set
=> X1 = X2 ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_zfmisc_1) ).
fof(l36_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = empty_set
<=> in(X1,X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',l36_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d1_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = empty_set
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t21_zfmisc_1]) ).
fof(c_0_4,plain,
! [X3,X4,X3,X4] :
( ( set_difference(singleton(X3),X4) != empty_set
| in(X3,X4) )
& ( ~ in(X3,X4)
| set_difference(singleton(X3),X4) = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l36_zfmisc_1])])])]) ).
fof(c_0_5,negated_conjecture,
( set_difference(singleton(esk1_0),singleton(esk2_0)) = empty_set
& esk1_0 != esk2_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_6,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_7,plain,
( in(X1,X2)
| set_difference(singleton(X1),X2) != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
set_difference(singleton(esk1_0),singleton(esk2_0)) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X3 = X2
| X1 != singleton(X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
in(esk1_0,singleton(esk2_0)),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
( X1 = esk1_0
| singleton(esk2_0) != singleton(X1) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,negated_conjecture,
esk1_0 != esk2_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET880+1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n023.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 : Sun Jul 10 04:18:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.23/1.42 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42 # Preprocessing time : 0.014 s
% 0.23/1.42
% 0.23/1.42 # Proof found!
% 0.23/1.42 # SZS status Theorem
% 0.23/1.42 # SZS output start CNFRefutation
% See solution above
% 0.23/1.42 # Proof object total steps : 14
% 0.23/1.42 # Proof object clause steps : 7
% 0.23/1.42 # Proof object formula steps : 7
% 0.23/1.42 # Proof object conjectures : 8
% 0.23/1.42 # Proof object clause conjectures : 5
% 0.23/1.42 # Proof object formula conjectures : 3
% 0.23/1.42 # Proof object initial clauses used : 4
% 0.23/1.42 # Proof object initial formulas used : 3
% 0.23/1.42 # Proof object generating inferences : 3
% 0.23/1.42 # Proof object simplifying inferences : 1
% 0.23/1.42 # Training examples: 0 positive, 0 negative
% 0.23/1.42 # Parsed axioms : 7
% 0.23/1.42 # Removed by relevancy pruning/SinE : 0
% 0.23/1.42 # Initial clauses : 12
% 0.23/1.42 # Removed in clause preprocessing : 0
% 0.23/1.42 # Initial clauses in saturation : 12
% 0.23/1.42 # Processed clauses : 17
% 0.23/1.42 # ...of these trivial : 0
% 0.23/1.42 # ...subsumed : 0
% 0.23/1.42 # ...remaining for further processing : 17
% 0.23/1.42 # Other redundant clauses eliminated : 1
% 0.23/1.42 # Clauses deleted for lack of memory : 0
% 0.23/1.42 # Backward-subsumed : 0
% 0.23/1.42 # Backward-rewritten : 0
% 0.23/1.42 # Generated clauses : 13
% 0.23/1.42 # ...of the previous two non-trivial : 10
% 0.23/1.42 # Contextual simplify-reflections : 0
% 0.23/1.42 # Paramodulations : 11
% 0.23/1.42 # Factorizations : 0
% 0.23/1.42 # Equation resolutions : 2
% 0.23/1.42 # Current number of processed clauses : 16
% 0.23/1.42 # Positive orientable unit clauses : 4
% 0.23/1.42 # Positive unorientable unit clauses: 0
% 0.23/1.42 # Negative unit clauses : 4
% 0.23/1.42 # Non-unit-clauses : 8
% 0.23/1.42 # Current number of unprocessed clauses: 5
% 0.23/1.42 # ...number of literals in the above : 15
% 0.23/1.42 # Current number of archived formulas : 0
% 0.23/1.42 # Current number of archived clauses : 0
% 0.23/1.42 # Clause-clause subsumption calls (NU) : 1
% 0.23/1.42 # Rec. Clause-clause subsumption calls : 1
% 0.23/1.42 # Non-unit clause-clause subsumptions : 0
% 0.23/1.42 # Unit Clause-clause subsumption calls : 7
% 0.23/1.42 # Rewrite failures with RHS unbound : 0
% 0.23/1.42 # BW rewrite match attempts : 0
% 0.23/1.42 # BW rewrite match successes : 0
% 0.23/1.42 # Condensation attempts : 0
% 0.23/1.42 # Condensation successes : 0
% 0.23/1.42 # Termbank termtop insertions : 624
% 0.23/1.42
% 0.23/1.42 # -------------------------------------------------
% 0.23/1.42 # User time : 0.014 s
% 0.23/1.42 # System time : 0.001 s
% 0.23/1.42 # Total time : 0.015 s
% 0.23/1.42 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------