%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU155+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 : n028.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:50 PM UTC 2026
% Result : Theorem 1.25s 1.70s
% Output : CNFRefutation 1.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 3 unt; 0 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 65 ( 23 ~; 27 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 37 ( 0 sgn 23 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(l50_zfmisc_1,conjecture,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
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(c_0_3,plain,
! [X26,X27,X28,X30,X31,X32,X33,X35] :
( ( in(X28,esk2_3(X26,X27,X28))
| ~ in(X28,X27)
| X27 != union(X26) )
& ( in(esk2_3(X26,X27,X28),X26)
| ~ in(X28,X27)
| X27 != union(X26) )
& ( ~ in(X30,X31)
| ~ in(X31,X26)
| in(X30,X27)
| X27 != union(X26) )
& ( ~ in(esk3_2(X32,X33),X33)
| ~ in(esk3_2(X32,X33),X35)
| ~ in(X35,X32)
| X33 = union(X32) )
& ( in(esk3_2(X32,X33),esk4_2(X32,X33))
| in(esk3_2(X32,X33),X33)
| X33 = union(X32) )
& ( in(esk4_2(X32,X33),X32)
| in(esk3_2(X32,X33),X33)
| X33 = union(X32) ) ),
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(c_0_4,negated_conjecture,
~ ! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
inference(assume_negation,[status(cth)],[l50_zfmisc_1]) ).
cnf(c_0_5,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X2,X3)
| X4 != union(X3) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
fof(c_0_6,negated_conjecture,
( in(esk5_0,esk6_0)
& ~ subset(esk5_0,union(esk6_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
in(esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X20,X21,X22,X23,X24] :
( ( ~ subset(X20,X21)
| ~ in(X22,X20)
| in(X22,X21) )
& ( in(esk1_2(X23,X24),X23)
| subset(X23,X24) )
& ( ~ in(esk1_2(X23,X24),X24)
| subset(X23,X24) ) ),
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])])])])])]) ).
cnf(c_0_10,negated_conjecture,
( in(X1,union(esk6_0))
| ~ in(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( in(esk1_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| ~ in(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
( subset(esk5_0,X1)
| in(esk1_2(esk5_0,X1),union(esk6_0)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
~ subset(esk5_0,union(esk6_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU155+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.11 % 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.14/0.31 % Computer : n028.cluster.edu
% 0.14/0.31 % Model : x86_64 x86_64
% 0.14/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.31 % Memory : 8042.1875MB
% 0.14/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.31 % CPULimit : 300
% 0.14/0.31 % WCLimit : 300
% 0.14/0.31 % DateTime : Tue May 5 02:45:31 EDT 2026
% 0.14/0.31 % CPUTime :
% 0.14/0.32 % start to proof: theBenchmark
% 1.25/1.70 % Version : CSE_E---1.7
% 1.25/1.70 % Problem : theBenchmark.p
% 1.25/1.70 % SZS status Theorem for theBenchmark.p
% 1.25/1.70 % SZS output start CNFRefutation
% See solution above
% 1.25/1.70 % Total time : 1.370s
%------------------------------------------------------------------------------