%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU150+3 : 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 : n018.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.49s 1.62s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 29)
% 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(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
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(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(i_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( singleton(X1) = unordered_pair(X2,X3)
=> X2 = X3 ),
inference(assume_negation,[status(cth)],[t9_zfmisc_1]) ).
fof(i_0_6,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_7,plain,
! [X18,X19,X20] :
( singleton(X18) != unordered_pair(X19,X20)
| X18 = X19 ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_zfmisc_1])]) ).
fof(i_0_8,plain,
! [X14,X15] : unordered_pair(X14,X15) = unordered_pair(X15,X14),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(i_0_9,negated_conjecture,
( singleton(esk3_0) = unordered_pair(esk4_0,esk5_0)
& esk4_0 != esk5_0 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_5])])]) ).
fof(i_0_10,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_6])]) ).
fof(i_0_11,plain,
empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_12,plain,
( X1 = X2
| singleton(X1) != unordered_pair(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_7]),
[final] ).
cnf(i_0_13,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[i_0_8]),
[final] ).
cnf(i_0_14,negated_conjecture,
singleton(esk3_0) = unordered_pair(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_15,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_16,plain,
empty(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_17,negated_conjecture,
esk4_0 != esk5_0,
inference(split_conjunct,[status(thm)],[i_0_9]),
[final] ).
cnf(i_0_18,axiom,
X1 = X1 ).
cnf(i_0_19,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_20,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_21,axiom,
( X1 != X2
| singleton(X1) = singleton(X2) ) ).
cnf(i_0_22,axiom,
( X1 != X2
| unordered_pair(X1,X3) = unordered_pair(X2,X3) ) ).
cnf(i_0_23,axiom,
( X1 != X2
| unordered_pair(X3,X1) = unordered_pair(X3,X2) ) ).
cnf(i_0_24,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_18_001,axiom,
X1 = X1 ).
cnf(i_0_19_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_20_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_21_004,axiom,
( X1 != X2
| singleton(X1) = singleton(X2) ) ).
cnf(i_0_22_005,axiom,
( X1 != X2
| unordered_pair(X1,X3) = unordered_pair(X2,X3) ) ).
cnf(i_0_23_006,axiom,
( X1 != X2
| unordered_pair(X3,X1) = unordered_pair(X3,X2) ) ).
cnf(i_0_24_007,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_25,plain,
esk3_0 = esk4_0,
inference(scs_inference,[],[i_0_14,i_0_12]) ).
cnf(i_0_26,plain,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_27,plain,
unordered_pair(esk4_0,esk5_0) = singleton(esk3_0),
inference(scs_inference,[],[i_0_14,i_0_12,i_0_19]) ).
cnf(i_0_28,plain,
esk1_0 != esk2_0,
inference(scs_inference,[],[i_0_14,i_0_15,i_0_16,i_0_12,i_0_19,i_0_24]) ).
cnf(i_0_29,plain,
( X1 = esk4_0
| X1 != esk3_0 ),
inference(scs_inference,[],[i_0_14,i_0_15,i_0_16,i_0_12,i_0_19,i_0_24,i_0_20]) ).
cnf(i_0_30,plain,
esk3_0 = esk4_0,
inference(equality_inference,[],[29]) ).
cnf(i_0_31,plain,
esk4_0 = esk3_0,
inference(scs_inference,[],[i_0_25,i_0_19]) ).
cnf(i_0_32,plain,
unordered_pair(esk5_0,esk4_0) = singleton(esk3_0),
inference(scs_inference,[],[i_0_13,i_0_27,i_0_20]) ).
cnf(i_0_33,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(rename_variables,[],[i_0_13]) ).
cnf(i_0_34,plain,
singleton(esk3_0) = unordered_pair(esk5_0,esk4_0),
inference(scs_inference,[],[i_0_13,i_0_27,i_0_20,i_0_19]) ).
cnf(i_0_35,plain,
esk3_0 = esk5_0,
inference(scs_inference,[],[i_0_13,i_0_27,i_0_20,i_0_19,i_0_12]) ).
cnf(i_0_36,plain,
( singleton(X1) != unordered_pair(X2,X3)
| X1 = X2 ),
inference(rename_variables,[],[i_0_12]) ).
cnf(i_0_37,plain,
esk5_0 = esk3_0,
inference(scs_inference,[],[i_0_35,i_0_19]) ).
cnf(i_0_38,plain,
$false,
inference(scs_inference,[],[i_0_35,i_0_17,i_0_31,i_0_19,i_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU150+3 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.12 % 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.16/0.34 % Computer : n018.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Tue May 5 02:45:32 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 0.49/1.62 % Version : CSE_E---1.7
% 0.49/1.62 % Problem : theBenchmark.p
% 0.49/1.62 % SZS status Theorem for theBenchmark.p
% 0.49/1.62 % SZS output start CNFRefutation
% See solution above
% 0.49/1.66 % Total time : 1.271s
%------------------------------------------------------------------------------