%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU133+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.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:43 PM UTC 2026
% Result : Theorem 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 6 unt; 0 def)
% Number of atoms : 55 ( 9 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 61 ( 22 ~; 24 |; 9 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-3 aty)
% Number of variables : 44 ( 3 sgn 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(t36_xboole_1,conjecture,
! [X1,X2] : subset(set_difference(X1,X2),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
fof(c_0_3,plain,
! [X1,X2,X3] :
( X3 = set_difference(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& ~ in(X4,X2) ) ) ),
inference(fof_simplification,[status(thm)],[d4_xboole_0]) ).
fof(c_0_4,plain,
! [X35,X36,X37,X38,X39,X40,X41,X42] :
( ( in(X38,X35)
| ~ in(X38,X37)
| X37 != set_difference(X35,X36) )
& ( ~ in(X38,X36)
| ~ in(X38,X37)
| X37 != set_difference(X35,X36) )
& ( ~ in(X39,X35)
| in(X39,X36)
| in(X39,X37)
| X37 != set_difference(X35,X36) )
& ( ~ in(esk2_3(X40,X41,X42),X42)
| ~ in(esk2_3(X40,X41,X42),X40)
| in(esk2_3(X40,X41,X42),X41)
| X42 = set_difference(X40,X41) )
& ( in(esk2_3(X40,X41,X42),X40)
| in(esk2_3(X40,X41,X42),X42)
| X42 = set_difference(X40,X41) )
& ( ~ in(esk2_3(X40,X41,X42),X41)
| in(esk2_3(X40,X41,X42),X42)
| X42 = set_difference(X40,X41) ) ),
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)],[c_0_3])])])])])]) ).
cnf(c_0_5,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_difference(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X29,X30,X31,X32,X33] :
( ( ~ subset(X29,X30)
| ~ in(X31,X29)
| in(X31,X30) )
& ( in(esk1_2(X32,X33),X32)
| subset(X32,X33) )
& ( ~ in(esk1_2(X32,X33),X33)
| subset(X32,X33) ) ),
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)],[d3_tarski])])])])])]) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2] : subset(set_difference(X1,X2),X1),
inference(assume_negation,[status(cth)],[t36_xboole_1]) ).
cnf(c_0_8,plain,
( in(X1,X2)
| ~ in(X1,set_difference(X2,X3)) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ subset(set_difference(esk5_0,esk6_0),esk5_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
cnf(c_0_11,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( subset(set_difference(X1,X2),X3)
| in(esk1_2(set_difference(X1,X2),X3),X1) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ subset(set_difference(esk5_0,esk6_0),esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
subset(set_difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU133+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n002.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:45:01 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Theorem for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.374s
%------------------------------------------------------------------------------