%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET867+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 : 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:52 PM UTC 2026
% Result : Theorem 0.27s 1.61s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 18)
% Comments :
%------------------------------------------------------------------------------
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(t2_zfmisc_1,conjecture,
union(empty_set) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_zfmisc_1) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(i_0_7,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(i_0_8,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(i_0_9,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_10,plain,
! [X21,X22,X23,X25,X26,X27,X28,X30] :
( ( in(X23,esk2_3(X21,X22,X23))
| ~ in(X23,X22)
| X22 != union(X21) )
& ( in(esk2_3(X21,X22,X23),X21)
| ~ in(X23,X22)
| X22 != union(X21) )
& ( ~ in(X25,X26)
| ~ in(X26,X21)
| in(X25,X22)
| X22 != union(X21) )
& ( ~ in(esk3_2(X27,X28),X28)
| ~ in(esk3_2(X27,X28),X30)
| ~ in(X30,X27)
| X28 = union(X27) )
& ( in(esk3_2(X27,X28),esk4_2(X27,X28))
| in(esk3_2(X27,X28),X28)
| X28 = union(X27) )
& ( in(esk4_2(X27,X28),X27)
| in(esk3_2(X27,X28),X28)
| X28 = union(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)],[d4_tarski])])])])])]) ).
fof(i_0_11,plain,
! [X15,X16] :
( ~ in(X15,X16)
| ~ in(X16,X15) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_7])]) ).
fof(i_0_12,plain,
! [X17,X18,X19] :
( ( X17 != empty_set
| ~ in(X18,X17) )
& ( in(esk1_1(X19),X19)
| X19 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_8])])])])]) ).
fof(i_0_13,plain,
~ empty(esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_9])]) ).
fof(i_0_14,negated_conjecture,
union(empty_set) != empty_set,
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t2_zfmisc_1])]) ).
fof(i_0_15,plain,
empty(esk5_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_16,plain,
( X2 = union(X1)
| ~ in(esk3_2(X1,X2),X2)
| ~ in(esk3_2(X1,X2),X3)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_17,plain,
( in(esk2_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_18,plain,
( in(X1,esk2_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_19,plain,
( in(esk3_2(X1,X2),esk4_2(X1,X2))
| in(esk3_2(X1,X2),X2)
| X2 = union(X1) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_20,plain,
( in(esk4_2(X1,X2),X1)
| in(esk3_2(X1,X2),X2)
| X2 = union(X1) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_21,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X2,X3)
| X4 != union(X3) ),
inference(split_conjunct,[status(thm)],[i_0_10]),
[final] ).
cnf(i_0_22,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_11]),
[final] ).
cnf(i_0_23,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_24,plain,
( in(esk1_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_25,plain,
~ empty(esk6_0),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_26,negated_conjecture,
union(empty_set) != empty_set,
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_27,plain,
empty(esk5_0),
inference(split_conjunct,[status(thm)],[i_0_15]),
[final] ).
cnf(i_0_28,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]),
[final] ).
cnf(i_0_29,axiom,
X1 = X1 ).
cnf(i_0_30,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_31,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_32,axiom,
( X1 != X2
| union(X1) = union(X2) ) ).
cnf(i_0_33,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_34,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_35,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_29_001,axiom,
X1 = X1 ).
cnf(i_0_30_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_31_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_32_004,axiom,
( X1 != X2
| union(X1) = union(X2) ) ).
cnf(i_0_33_005,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_34_006,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_35_007,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_36,plain,
( ~ in(X1,union(X2))
| in(esk2_3(X2,union(X2),X1),X2) ),
inference(equality_inference,[],[17]) ).
cnf(i_0_37,plain,
( ~ in(X1,union(X2))
| in(X1,esk2_3(X2,union(X2),X1)) ),
inference(equality_inference,[],[18]) ).
cnf(i_0_38,plain,
( in(X1,union(X2))
| ~ in(X1,X3)
| ~ in(X3,X2) ),
inference(equality_inference,[],[21]) ).
cnf(i_0_39,plain,
~ in(X1,empty_set),
inference(equality_inference,[],[23]) ).
cnf(i_0_40,plain,
in(esk1_1(union(empty_set)),union(empty_set)),
inference(scs_inference,[],[i_0_26,i_0_24]) ).
cnf(i_0_41,plain,
( X1 = empty_set
| in(esk1_1(X1),X1) ),
inference(rename_variables,[],[i_0_24]) ).
cnf(i_0_42,plain,
~ in(union(empty_set),esk1_1(union(empty_set))),
inference(scs_inference,[],[i_0_26,i_0_24,i_0_22]) ).
cnf(i_0_43,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(rename_variables,[],[i_0_22]) ).
cnf(i_0_44,plain,
$false,
inference(scs_inference,[],[i_0_26,i_0_39,i_0_24,i_0_22,i_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET867+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.14/0.32 % Computer : n023.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 02:38:54 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.27/1.61 % Version : CSE_E---1.7
% 0.27/1.61 % Problem : theBenchmark.p
% 0.27/1.61 % SZS status Theorem for theBenchmark.p
% 0.27/1.61 % SZS output start CNFRefutation
% See solution above
% 0.27/1.63 % Total time : 1.270s
%------------------------------------------------------------------------------