%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET901+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n031.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:55 PM UTC 2026
% Result : Theorem 1.25s 1.71s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 8 unt; 0 def)
% Number of atoms : 89 ( 58 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 103 ( 41 ~; 42 |; 17 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 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 : 36 ( 11 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/sandbox/benchmark/theBenchmark.p',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/sandbox/benchmark/theBenchmark.p',l46_zfmisc_1) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(c_0_3,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_4,plain,
! [X24,X25,X26] :
( ( ~ subset(X24,unordered_pair(X25,X26))
| X24 = empty_set
| X24 = singleton(X25)
| X24 = singleton(X26)
| X24 = unordered_pair(X25,X26) )
& ( X24 != empty_set
| subset(X24,unordered_pair(X25,X26)) )
& ( X24 != singleton(X25)
| subset(X24,unordered_pair(X25,X26)) )
& ( X24 != singleton(X26)
| subset(X24,unordered_pair(X25,X26)) )
& ( X24 != unordered_pair(X25,X26)
| subset(X24,unordered_pair(X25,X26)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l46_zfmisc_1])])]) ).
fof(c_0_5,negated_conjecture,
( ( esk3_0 != empty_set
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) )
& ( esk3_0 != singleton(esk4_0)
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) )
& ( esk3_0 != singleton(esk5_0)
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) )
& ( esk3_0 != unordered_pair(esk4_0,esk5_0)
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) )
& ( subset(esk3_0,unordered_pair(esk4_0,esk5_0))
| esk3_0 = empty_set
| esk3_0 = singleton(esk4_0)
| esk3_0 = singleton(esk5_0)
| esk3_0 = unordered_pair(esk4_0,esk5_0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,plain,
( subset(X1,unordered_pair(X3,X2))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( X1 = empty_set
| X1 = singleton(X2)
| X1 = singleton(X3)
| X1 = unordered_pair(X2,X3)
| ~ subset(X1,unordered_pair(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( subset(esk3_0,unordered_pair(esk4_0,esk5_0))
| esk3_0 = empty_set
| esk3_0 = singleton(esk4_0)
| esk3_0 = singleton(esk5_0)
| esk3_0 = unordered_pair(esk4_0,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
subset(singleton(X1),unordered_pair(X2,X1)),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| singleton(esk5_0) = esk3_0
| esk3_0 = empty_set ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != singleton(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( esk3_0 != singleton(esk5_0)
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| esk3_0 = empty_set
| subset(esk3_0,unordered_pair(X1,esk5_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
subset(singleton(X1),unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| singleton(esk4_0) = esk3_0
| esk3_0 = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( esk3_0 != singleton(esk4_0)
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| esk3_0 = empty_set
| subset(esk3_0,unordered_pair(esk4_0,X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_18,plain,
! [X18] : subset(X18,X18),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_19,negated_conjecture,
( esk3_0 != unordered_pair(esk4_0,esk5_0)
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( unordered_pair(esk4_0,esk5_0) = esk3_0
| esk3_0 = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_15]) ).
cnf(c_0_21,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( subset(X1,unordered_pair(X2,X3))
| X1 != empty_set ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_23,negated_conjecture,
( esk3_0 != empty_set
| ~ subset(esk3_0,unordered_pair(esk4_0,esk5_0)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
esk3_0 = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).
cnf(c_0_25,plain,
subset(empty_set,unordered_pair(X1,X2)),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]),c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET901+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32 % Computer : n031.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Tue May 5 02:42:23 EDT 2026
% 0.13/0.32 % CPUTime :
% 0.13/0.33 % start to proof: theBenchmark
% 1.25/1.71 % Version : CSE_E---1.7
% 1.25/1.71 % Problem : theBenchmark.p
% 1.25/1.71 % SZS status Theorem for theBenchmark.p
% 1.25/1.71 % SZS output start CNFRefutation
% See solution above
% 1.25/1.71 % Total time : 1.369s
%------------------------------------------------------------------------------