%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU123+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 : 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:40 PM UTC 2026
% Result : Theorem 0.25s 1.61s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 27)
% 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(t3_xboole_1,conjecture,
! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
fof(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
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_11,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(i_0_12,negated_conjecture,
~ ! [X1] :
( subset(X1,empty_set)
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[t3_xboole_1]) ).
fof(i_0_13,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_14,plain,
! [X20,X21] :
( ( subset(X20,X21)
| X20 != X21 )
& ( subset(X21,X20)
| X20 != X21 )
& ( ~ subset(X20,X21)
| ~ subset(X21,X20)
| X20 = X21 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])]) ).
fof(i_0_15,plain,
! [X18,X19] :
( ~ in(X18,X19)
| ~ in(X19,X18) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_11])]) ).
fof(i_0_16,plain,
! [X28,X29] :
( ~ in(X28,X29)
| ~ empty(X29) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(i_0_17,plain,
! [X30,X31] :
( ~ empty(X30)
| X30 = X31
| ~ empty(X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(i_0_18,plain,
! [X24] : subset(X24,X24),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(i_0_19,plain,
! [X25] : subset(empty_set,X25),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
fof(i_0_20,negated_conjecture,
( subset(esk3_0,empty_set)
& esk3_0 != empty_set ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_12])])]) ).
fof(i_0_21,plain,
! [X27] :
( ~ empty(X27)
| X27 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(i_0_22,plain,
~ empty(esk2_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_13])]) ).
fof(i_0_23,plain,
empty(esk1_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_24,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_25,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_15]),
[final] ).
cnf(i_0_26,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[i_0_16]),
[final] ).
cnf(i_0_27,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_28,plain,
( subset(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_29,plain,
( X1 = X2
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[i_0_17]),
[final] ).
cnf(i_0_30,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_18]),
[final] ).
cnf(i_0_31,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[i_0_19]),
[final] ).
cnf(i_0_32,negated_conjecture,
subset(esk3_0,empty_set),
inference(split_conjunct,[status(thm)],[i_0_20]),
[final] ).
cnf(i_0_33,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[i_0_21]),
[final] ).
cnf(i_0_34,plain,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[i_0_22]),
[final] ).
cnf(i_0_35,plain,
empty(esk1_0),
inference(split_conjunct,[status(thm)],[i_0_23]),
[final] ).
cnf(i_0_36,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]),
[final] ).
cnf(i_0_37,negated_conjecture,
esk3_0 != empty_set,
inference(split_conjunct,[status(thm)],[i_0_20]),
[final] ).
cnf(i_0_38,axiom,
X1 = X1 ).
cnf(i_0_39,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_40,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_41,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_42,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_43,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_44,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_45,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_38_001,axiom,
X1 = X1 ).
cnf(i_0_39_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_40_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_41_004,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_42_005,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_43_006,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_44_007,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_45_008,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_46,plain,
subset(X1,X1),
inference(equality_inference,[],[27]) ).
cnf(i_0_47,plain,
subset(X1,X1),
inference(equality_inference,[],[28]) ).
cnf(i_0_48,plain,
$false,
inference(scs_inference,[],[i_0_37,i_0_32,i_0_31,i_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU123+1 : TPTP v9.2.1. Released v3.3.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.15/0.32 % Computer : n018.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.32 % CPULimit : 300
% 0.15/0.32 % WCLimit : 300
% 0.15/0.32 % DateTime : Tue May 5 02:43:47 EDT 2026
% 0.15/0.32 % CPUTime :
% 0.15/0.33 % start to proof: theBenchmark
% 0.25/1.61 % Version : CSE_E---1.7
% 0.25/1.61 % Problem : theBenchmark.p
% 0.25/1.61 % SZS status Theorem for theBenchmark.p
% 0.25/1.61 % SZS output start CNFRefutation
% See solution above
% 0.25/1.62 % Total time : 1.270s
%------------------------------------------------------------------------------