%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU173+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 : n011.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:56 PM UTC 2026
% Result : Theorem 1.43s 1.76s
% Output : CNFRefutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 4 unt; 0 def)
% Number of atoms : 86 ( 6 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 96 ( 35 ~; 33 |; 12 &)
% ( 7 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 51 ( 1 sgn 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(l71_subset_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l71_subset_1) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_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_5,plain,
! [X1,X2] :
( ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) )
& ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> in(X3,X2) )
=> element(X1,powerset(X2)) ),
inference(assume_negation,[status(cth)],[l71_subset_1]) ).
fof(c_0_7,plain,
! [X282,X283] :
( ( ~ element(X283,X282)
| in(X283,X282)
| empty(X282) )
& ( ~ in(X283,X282)
| element(X283,X282)
| empty(X282) )
& ( ~ element(X283,X282)
| empty(X283)
| ~ empty(X282) )
& ( ~ empty(X283)
| element(X283,X282)
| ~ empty(X282) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X520,X521] :
( ~ in(X520,X521)
| ~ empty(X521) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_9,negated_conjecture,
! [X405] :
( ( ~ in(X405,esk18_0)
| in(X405,esk19_0) )
& ~ element(esk18_0,powerset(esk19_0)) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_10,plain,
( element(X1,X2)
| empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X275,X276,X277,X278,X279,X280] :
( ( ~ in(X277,X276)
| subset(X277,X275)
| X276 != powerset(X275) )
& ( ~ subset(X278,X275)
| in(X278,X276)
| X276 != powerset(X275) )
& ( ~ in(esk3_2(X279,X280),X280)
| ~ subset(esk3_2(X279,X280),X279)
| X280 = powerset(X279) )
& ( in(esk3_2(X279,X280),X280)
| subset(esk3_2(X279,X280),X279)
| X280 = powerset(X279) ) ),
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)],[d1_zfmisc_1])])])])])]) ).
fof(c_0_13,plain,
! [X319,X320,X321,X322,X323] :
( ( ~ subset(X319,X320)
| ~ in(X321,X319)
| in(X321,X320) )
& ( in(esk11_2(X322,X323),X322)
| subset(X322,X323) )
& ( ~ in(esk11_2(X322,X323),X323)
| subset(X322,X323) ) ),
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_14,negated_conjecture,
~ element(esk18_0,powerset(esk19_0)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(csr,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
( in(X1,esk19_0)
| ~ in(X1,esk18_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( in(esk11_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ in(esk18_0,powerset(esk19_0)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
( subset(X1,X2)
| ~ in(esk11_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
( subset(esk18_0,X1)
| in(esk11_2(esk18_0,X1),esk19_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,negated_conjecture,
~ subset(esk18_0,esk19_0),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU173+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.16/0.33 % Computer : n011.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:46:17 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.35 % start to proof: theBenchmark
% 1.43/1.76 % Version : CSE_E---1.7
% 1.43/1.76 % Problem : theBenchmark.p
% 1.43/1.76 % SZS status Theorem for theBenchmark.p
% 1.43/1.76 % SZS output start CNFRefutation
% See solution above
% 1.43/1.76 % Total time : 1.375s
%------------------------------------------------------------------------------