%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET947+1 : TPTP v9.2.1. Released v3.2.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 : n016.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:09:01 PM UTC 2026
% Result : Theorem 1.28s 1.71s
% Output : CNFRefutation 1.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 50 ( 6 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 21 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
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(l50_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(t100_zfmisc_1,conjecture,
! [X1] : subset(X1,powerset(union(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(c_0_4,plain,
! [X21,X22,X23,X24,X25,X26] :
( ( ~ in(X23,X22)
| subset(X23,X21)
| X22 != powerset(X21) )
& ( ~ subset(X24,X21)
| in(X24,X22)
| X22 != powerset(X21) )
& ( ~ in(esk1_2(X25,X26),X26)
| ~ subset(esk1_2(X25,X26),X25)
| X26 = powerset(X25) )
& ( in(esk1_2(X25,X26),X26)
| subset(esk1_2(X25,X26),X25)
| X26 = powerset(X25) ) ),
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_5,plain,
! [X28,X29,X30,X31,X32] :
( ( ~ subset(X28,X29)
| ~ in(X30,X28)
| in(X30,X29) )
& ( in(esk2_2(X31,X32),X31)
| subset(X31,X32) )
& ( ~ in(esk2_2(X31,X32),X32)
| subset(X31,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)],[d3_tarski])])])])])]) ).
cnf(c_0_6,plain,
( in(X1,X3)
| ~ subset(X1,X2)
| X3 != powerset(X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( in(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(er,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X34,X35] :
( ~ in(X34,X35)
| subset(X34,union(X35)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] : subset(X1,powerset(union(X1))),
inference(assume_negation,[status(cth)],[t100_zfmisc_1]) ).
cnf(c_0_11,plain,
( subset(X1,powerset(X2))
| ~ subset(esk2_2(X1,powerset(X2)),X2) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ subset(esk5_0,powerset(union(esk5_0))),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_14,plain,
( subset(X1,powerset(union(X2)))
| ~ in(esk2_2(X1,powerset(union(X2))),X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk5_0,powerset(union(esk5_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(X1,powerset(union(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET947+1 : TPTP v9.2.1. Released v3.2.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.32 % Computer : n016.cluster.edu
% 0.15/0.32 % Model : x86_64 x86_64
% 0.15/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.32 % Memory : 8042.1875MB
% 0.15/0.32 % 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:40:21 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.28/1.71 % Version : CSE_E---1.7
% 1.28/1.71 % Problem : theBenchmark.p
% 1.28/1.71 % SZS status Theorem for theBenchmark.p
% 1.28/1.71 % SZS output start CNFRefutation
% See solution above
% 1.28/1.71 % Total time : 1.372s
%------------------------------------------------------------------------------