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