%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU149+1 : TPTP v9.2.1. Released v3.3.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 : n008.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:10:47 PM UTC 2026
% Result : Theorem 1.24s 1.71s
% Output : CNFRefutation 1.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 8 unt; 0 def)
% Number of atoms : 65 ( 46 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 71 ( 26 ~; 30 |; 9 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 46 ( 2 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(t8_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(d2_tarski,axiom,
! [X1,X2,X3] :
( X3 = unordered_pair(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( X4 = X1
| X4 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(c_0_4,plain,
! [X23,X24,X25,X26,X27,X28] :
( ( ~ in(X25,X24)
| X25 = X23
| X24 != singleton(X23) )
& ( X26 != X23
| in(X26,X24)
| X24 != singleton(X23) )
& ( ~ in(esk1_2(X27,X28),X28)
| esk1_2(X27,X28) != X27
| X28 = singleton(X27) )
& ( in(esk1_2(X27,X28),X28)
| esk1_2(X27,X28) = X27
| X28 = singleton(X27) ) ),
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_5,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
inference(assume_negation,[status(cth)],[t8_zfmisc_1]) ).
cnf(c_0_6,plain,
( X1 = X3
| ~ in(X1,X2)
| X2 != singleton(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_7,negated_conjecture,
( singleton(esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk3_0 != esk4_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X30,X31,X32,X33,X34,X35,X36,X37] :
( ( ~ in(X33,X32)
| X33 = X30
| X33 = X31
| X32 != unordered_pair(X30,X31) )
& ( X34 != X30
| in(X34,X32)
| X32 != unordered_pair(X30,X31) )
& ( X34 != X31
| in(X34,X32)
| X32 != unordered_pair(X30,X31) )
& ( esk2_3(X35,X36,X37) != X35
| ~ in(esk2_3(X35,X36,X37),X37)
| X37 = unordered_pair(X35,X36) )
& ( esk2_3(X35,X36,X37) != X36
| ~ in(esk2_3(X35,X36,X37),X37)
| X37 = unordered_pair(X35,X36) )
& ( in(esk2_3(X35,X36,X37),X37)
| esk2_3(X35,X36,X37) = X35
| esk2_3(X35,X36,X37) = X36
| X37 = unordered_pair(X35,X36) ) ),
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)],[d2_tarski])])])])])]) ).
cnf(c_0_9,plain,
( X1 = X2
| ~ in(X1,singleton(X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
singleton(esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( in(X1,X3)
| X1 != X2
| X3 != unordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,negated_conjecture,
( X1 = esk3_0
| ~ in(X1,unordered_pair(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
in(X1,unordered_pair(X2,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_11])]) ).
fof(c_0_14,plain,
! [X21,X22] : unordered_pair(X21,X22) = unordered_pair(X22,X21),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_15,negated_conjecture,
esk5_0 = esk3_0,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_17,negated_conjecture,
( X1 = esk3_0
| ~ in(X1,unordered_pair(esk3_0,esk4_0)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_15]),c_0_16]) ).
cnf(c_0_18,negated_conjecture,
esk3_0 != esk4_0,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU149+1 : TPTP v9.2.1. Released v3.3.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.16/0.33 % Computer : n008.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:45:43 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/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.368s
%------------------------------------------------------------------------------