%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU150+1 : TPTP v9.2.1. Released v3.3.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 : n012.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:48 PM UTC 2026
% Result : Theorem 0.25s 1.73s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 20)
% Comments :
%------------------------------------------------------------------------------
fof(t9_zfmisc_1,conjecture,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t9_zfmisc_1) ).
fof(t8_zfmisc_1,axiom,
! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X1 = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_zfmisc_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(i_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[t9_zfmisc_1]) ).
fof(i_0_4,plain,
! [X14,X15,X16] :
( singleton(X14) != unordered_pair(X15,X16)
| X14 = X15 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])]) ).
fof(i_0_5,plain,
! [X12,X13] : unordered_pair(X12,X13) = unordered_pair(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(i_0_6,negated_conjecture,
( singleton(esk1_0) = unordered_pair(esk2_0,esk3_0)
& esk2_0 != esk3_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_3])])]) ).
cnf(i_0_7,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_8,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[i_0_5]),
[final] ).
cnf(i_0_9,negated_conjecture,
singleton(esk1_0) = unordered_pair(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_10,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[i_0_6]),
[final] ).
cnf(i_0_11,axiom,
X1 = X1 ).
cnf(i_0_12,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_13,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_14,axiom,
( X1 != X2
| singleton(X1) = singleton(X2) ) ).
cnf(i_0_15,axiom,
( X1 != X2
| unordered_pair(X1,X3) = unordered_pair(X2,X3) ) ).
cnf(i_0_16,axiom,
( X1 != X2
| unordered_pair(X3,X1) = unordered_pair(X3,X2) ) ).
cnf(i_0_11_001,axiom,
X1 = X1 ).
cnf(i_0_12_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_13_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_14_004,axiom,
( X1 != X2
| singleton(X1) = singleton(X2) ) ).
cnf(i_0_15_005,axiom,
( X1 != X2
| unordered_pair(X1,X3) = unordered_pair(X2,X3) ) ).
cnf(i_0_16_006,axiom,
( X1 != X2
| unordered_pair(X3,X1) = unordered_pair(X3,X2) ) ).
cnf(i_0_17,plain,
esk1_0 = esk2_0,
inference(scs_inference,[],[i_0_9,i_0_7]) ).
cnf(i_0_18,plain,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rename_variables,[],[i_0_7]) ).
cnf(i_0_19,plain,
unordered_pair(esk2_0,esk3_0) = singleton(esk1_0),
inference(scs_inference,[],[i_0_9,i_0_7,i_0_12]) ).
cnf(i_0_20,plain,
( X1 = esk2_0
| X1 != esk1_0 ),
inference(scs_inference,[],[i_0_9,i_0_7,i_0_12,i_0_13]) ).
cnf(i_0_21,plain,
esk1_0 = esk2_0,
inference(equality_inference,[],[20]) ).
cnf(i_0_22,plain,
esk2_0 = esk1_0,
inference(scs_inference,[],[i_0_17,i_0_12]) ).
cnf(i_0_23,plain,
unordered_pair(esk3_0,esk2_0) = singleton(esk1_0),
inference(scs_inference,[],[i_0_8,i_0_19,i_0_13]) ).
cnf(i_0_24,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(rename_variables,[],[i_0_8]) ).
cnf(i_0_25,plain,
singleton(esk1_0) = unordered_pair(esk3_0,esk2_0),
inference(scs_inference,[],[i_0_8,i_0_19,i_0_13,i_0_12]) ).
cnf(i_0_26,plain,
esk1_0 = esk3_0,
inference(scs_inference,[],[i_0_8,i_0_19,i_0_13,i_0_12,i_0_7]) ).
cnf(i_0_27,plain,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rename_variables,[],[i_0_7]) ).
cnf(i_0_28,plain,
esk3_0 = esk1_0,
inference(scs_inference,[],[i_0_26,i_0_12]) ).
cnf(i_0_29,plain,
$false,
inference(scs_inference,[],[i_0_26,i_0_10,i_0_22,i_0_12,i_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.18 % Problem : SEU150+1 : TPTP v9.2.1. Released v3.3.0.
% 0.03/0.18 % 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.07/0.43 % Computer : n012.cluster.edu
% 0.07/0.43 % Model : x86_64 x86_64
% 0.07/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.43 % Memory : 8042.1875MB
% 0.07/0.43 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.43 % CPULimit : 300
% 0.07/0.43 % WCLimit : 300
% 0.07/0.43 % DateTime : Tue May 5 02:45:31 EDT 2026
% 0.09/0.43 % CPUTime :
% 0.09/0.44 % start to proof: theBenchmark
% 0.25/1.73 % Version : CSE_E---1.7
% 0.25/1.73 % Problem : theBenchmark.p
% 0.25/1.73 % SZS status Theorem for theBenchmark.p
% 0.25/1.73 % SZS output start CNFRefutation
% See solution above
% 0.25/1.75 % Total time : 1.277s
%------------------------------------------------------------------------------