%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET879+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %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 : 300s
% DateTime : Tue May 5 05:08:53 PM UTC 2026
% Result : Theorem 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 4 unt; 0 def)
% Number of atoms : 51 ( 34 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 57 ( 25 ~; 21 |; 5 &)
% ( 6 <=>; 0 =>; 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l34_zfmisc_1,axiom,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l34_zfmisc_1) ).
fof(t20_zfmisc_1,conjecture,
! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = singleton(X1)
<=> X1 != X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_zfmisc_1) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
fof(c_0_3,plain,
! [X1,X2] :
( set_difference(singleton(X1),X2) = singleton(X1)
<=> ~ in(X1,X2) ),
inference(fof_simplification,[status(thm)],[l34_zfmisc_1]) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( set_difference(singleton(X1),singleton(X2)) = singleton(X1)
<=> X1 != X2 ),
inference(assume_negation,[status(cth)],[t20_zfmisc_1]) ).
fof(c_0_5,plain,
! [X17,X18,X19,X20,X21,X22] :
( ( ~ in(X19,X18)
| X19 = X17
| X18 != singleton(X17) )
& ( X20 != X17
| in(X20,X18)
| X18 != singleton(X17) )
& ( ~ in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) != X21
| X22 = singleton(X21) )
& ( in(esk1_2(X21,X22),X22)
| esk1_2(X21,X22) = X21
| X22 = singleton(X21) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])]) ).
fof(c_0_6,plain,
! [X24,X25] :
( ( set_difference(singleton(X24),X25) != singleton(X24)
| ~ in(X24,X25) )
& ( in(X24,X25)
| set_difference(singleton(X24),X25) = singleton(X24) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])]) ).
fof(c_0_7,negated_conjecture,
( ( set_difference(singleton(esk4_0),singleton(esk5_0)) != singleton(esk4_0)
| esk4_0 = esk5_0 )
& ( set_difference(singleton(esk4_0),singleton(esk5_0)) = singleton(esk4_0)
| esk4_0 != esk5_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_8,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( set_difference(singleton(X1),X2) != singleton(X1)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( set_difference(singleton(esk4_0),singleton(esk5_0)) = singleton(esk4_0)
| esk4_0 != esk5_0 ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( esk4_0 = esk5_0
| set_difference(singleton(esk4_0),singleton(esk5_0)) != singleton(esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( in(X1,X2)
| set_difference(singleton(X1),X2) = singleton(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_14,negated_conjecture,
~ in(esk4_0,singleton(esk5_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).
cnf(c_0_15,plain,
( in(X1,X3)
| X1 != X2
| X3 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
esk5_0 = esk4_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_17,plain,
in(X1,singleton(X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_15])]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_16]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET879+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33 % Computer : n023.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Tue May 5 02:39:39 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 1.24/1.71 % Version : CSE_E---1.7
% 1.24/1.71 % Problem : theBenchmark.p
% 1.24/1.71 % SZS status Theorem for theBenchmark.p
% 1.24/1.71 % SZS output start CNFRefutation
% See solution above
% 1.24/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------