%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU155+2 : 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 : n026.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.31s 1.74s
% Output : CNFRefutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 58 ( 8 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 64 ( 23 ~; 26 |; 9 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 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 : 36 ( 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,
! [X226,X227,X228,X230,X231,X232,X233,X235] :
( ( in(X228,esk8_3(X226,X227,X228))
| ~ in(X228,X227)
| X227 != union(X226) )
& ( in(esk8_3(X226,X227,X228),X226)
| ~ in(X228,X227)
| X227 != union(X226) )
& ( ~ in(X230,X231)
| ~ in(X231,X226)
| in(X230,X227)
| X227 != union(X226) )
& ( ~ in(esk9_2(X232,X233),X233)
| ~ in(esk9_2(X232,X233),X235)
| ~ in(X235,X232)
| X233 = union(X232) )
& ( in(esk9_2(X232,X233),esk10_2(X232,X233))
| in(esk9_2(X232,X233),X233)
| X233 = union(X232) )
& ( in(esk10_2(X232,X233),X232)
| in(esk9_2(X232,X233),X233)
| X233 = union(X232) ) ),
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(esk12_0,esk13_0)
& ~ subset(esk12_0,union(esk13_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_7,plain,
! [X211,X212,X213,X214,X215] :
( ( ~ subset(X211,X212)
| ~ in(X213,X211)
| in(X213,X212) )
& ( in(esk6_2(X214,X215),X214)
| subset(X214,X215) )
& ( ~ in(esk6_2(X214,X215),X215)
| subset(X214,X215) ) ),
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_8,plain,
( in(X1,union(X2))
| ~ in(X3,X2)
| ~ in(X1,X3) ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
in(esk12_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ subset(esk12_0,union(esk13_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( in(esk6_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
( in(X1,union(esk13_0))
| ~ in(X1,esk12_0) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,negated_conjecture,
in(esk6_2(esk12_0,union(esk13_0)),esk12_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( subset(X1,X2)
| ~ in(esk6_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
in(esk6_2(esk12_0,union(esk13_0)),union(esk13_0)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_10]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU155+2 : 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.15/0.33 % Computer : n026.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 02:45:38 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.31/1.74 % Version : CSE_E---1.7
% 1.31/1.74 % Problem : theBenchmark.p
% 1.31/1.74 % SZS status Theorem for theBenchmark.p
% 1.31/1.74 % SZS output start CNFRefutation
% See solution above
% 1.31/1.74 % Total time : 1.373s
%------------------------------------------------------------------------------