%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET602+3 : TPTP v9.2.1. Released v2.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 : n005.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:06 PM UTC 2026
% Result : Theorem 0.25s 1.62s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 32)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(empty_defn,axiom,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_defn) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
fof(prove_self_difference_is_empty_set,conjecture,
! [X1] : difference(X1,X1) = empty_set,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_self_difference_is_empty_set) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X1,X2)
& subset(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(difference_empty_set,axiom,
! [X1,X2] :
( difference(X1,X2) = empty_set
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_empty_set) ).
fof(reflexivity_of_subset,axiom,
! [X1] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_of_subset) ).
fof(i_0_8,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( member(X3,X1)
& ~ member(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[difference_defn]) ).
fof(i_0_9,plain,
! [X1] :
( empty(X1)
<=> ! [X2] : ~ member(X2,X1) ),
inference(fof_simplification,[status(thm)],[empty_defn]) ).
fof(i_0_10,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(i_0_11,negated_conjecture,
~ ! [X1] : difference(X1,X1) = empty_set,
inference(assume_negation,[status(cth)],[prove_self_difference_is_empty_set]) ).
fof(i_0_12,plain,
! [X22,X23,X24] :
( ( member(X24,X22)
| ~ member(X24,difference(X22,X23)) )
& ( ~ member(X24,X23)
| ~ member(X24,difference(X22,X23)) )
& ( ~ member(X24,X22)
| member(X24,X23)
| member(X24,difference(X22,X23)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_8])])]) ).
fof(i_0_13,plain,
! [X27,X28,X29,X30,X31] :
( ( ~ subset(X27,X28)
| ~ member(X29,X27)
| member(X29,X28) )
& ( member(esk1_2(X30,X31),X30)
| subset(X30,X31) )
& ( ~ member(esk1_2(X30,X31),X31)
| subset(X30,X31) ) ),
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)],[subset_defn])])])])])]) ).
fof(i_0_14,plain,
! [X25,X26] :
( ( subset(X25,X26)
| X25 != X26 )
& ( subset(X26,X25)
| X25 != X26 )
& ( ~ subset(X25,X26)
| ~ subset(X26,X25)
| X25 = X26 ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])]) ).
fof(i_0_15,plain,
! [X19,X20] :
( ( difference(X19,X20) != empty_set
| subset(X19,X20) )
& ( ~ subset(X19,X20)
| difference(X19,X20) = empty_set ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[difference_empty_set])]) ).
fof(i_0_16,plain,
! [X34,X35,X36] :
( ( ~ empty(X34)
| ~ member(X35,X34) )
& ( member(esk2_1(X36),X36)
| empty(X36) ) ),
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_9])])])])]) ).
fof(i_0_17,plain,
! [X21] : ~ member(X21,empty_set),
inference(variable_rename,[status(thm)],[i_0_10]) ).
fof(i_0_18,negated_conjecture,
difference(esk3_0,esk3_0) != empty_set,
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_11])])]) ).
fof(i_0_19,plain,
! [X33] : subset(X33,X33),
inference(variable_rename,[status(thm)],[reflexivity_of_subset]) ).
cnf(i_0_20,plain,
( ~ member(X1,X2)
| ~ member(X1,difference(X3,X2)) ),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_21,plain,
( subset(X1,X2)
| ~ member(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_22,plain,
( member(X1,X2)
| ~ member(X1,difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_23,plain,
( member(X1,X3)
| member(X1,difference(X2,X3))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_12]),
[final] ).
cnf(i_0_24,plain,
( member(X3,X2)
| ~ subset(X1,X2)
| ~ member(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_25,plain,
( member(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_13]),
[final] ).
cnf(i_0_26,plain,
( X1 = X2
| ~ subset(X1,X2)
| ~ subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_27,plain,
( subset(X1,X2)
| difference(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[i_0_15]),
[final] ).
cnf(i_0_28,plain,
( difference(X1,X2) = empty_set
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_15]),
[final] ).
cnf(i_0_29,plain,
( ~ empty(X1)
| ~ member(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_16]),
[final] ).
cnf(i_0_30,plain,
( member(esk2_1(X1),X1)
| empty(X1) ),
inference(split_conjunct,[status(thm)],[i_0_16]),
[final] ).
cnf(i_0_31,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[i_0_17]),
[final] ).
cnf(i_0_32,plain,
( subset(X1,X2)
| X1 != X2 ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_33,plain,
( subset(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[i_0_14]),
[final] ).
cnf(i_0_34,negated_conjecture,
difference(esk3_0,esk3_0) != empty_set,
inference(split_conjunct,[status(thm)],[i_0_18]),
[final] ).
cnf(i_0_35,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_19]),
[final] ).
cnf(i_0_36,axiom,
X1 = X1 ).
cnf(i_0_37,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_38,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_39,axiom,
( X1 != X2
| difference(X1,X3) = difference(X2,X3) ) ).
cnf(i_0_40,axiom,
( X1 != X2
| difference(X3,X1) = difference(X3,X2) ) ).
cnf(i_0_41,axiom,
( X1 != X2
| ~ member(X1,X3)
| member(X2,X3) ) ).
cnf(i_0_42,axiom,
( X1 != X2
| ~ member(X3,X1)
| member(X3,X2) ) ).
cnf(i_0_43,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_44,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_45,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_36_001,axiom,
X1 = X1 ).
cnf(i_0_37_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_38_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_39_004,axiom,
( X1 != X2
| difference(X1,X3) = difference(X2,X3) ) ).
cnf(i_0_40_005,axiom,
( X1 != X2
| difference(X3,X1) = difference(X3,X2) ) ).
cnf(i_0_41_006,axiom,
( X1 != X2
| ~ member(X1,X3)
| member(X2,X3) ) ).
cnf(i_0_42_007,axiom,
( X1 != X2
| ~ member(X3,X1)
| member(X3,X2) ) ).
cnf(i_0_43_008,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_44_009,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_45_010,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_46,plain,
subset(X1,X1),
inference(equality_inference,[],[32]) ).
cnf(i_0_47,plain,
subset(X1,X1),
inference(equality_inference,[],[33]) ).
cnf(i_0_48,plain,
$false,
inference(scs_inference,[],[i_0_34,i_0_35,i_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET602+3 : TPTP v9.2.1. Released v2.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.33 % Computer : n005.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:29:15 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.19/0.34 % start to proof: theBenchmark
% 0.25/1.62 % Version : CSE_E---1.7
% 0.25/1.62 % Problem : theBenchmark.p
% 0.25/1.62 % SZS status Theorem for theBenchmark.p
% 0.25/1.62 % SZS output start CNFRefutation
% See solution above
% 0.25/1.63 % Total time : 1.272s
%------------------------------------------------------------------------------