%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU164+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:45:16 AM UTC 2026
% Result : Theorem 0.13s 0.48s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 13 unt; 0 def)
% Number of atoms : 110 ( 27 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 123 ( 46 ~; 55 |; 16 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 1 con; 0-3 aty)
% Number of variables : 74 ( 1 sgn 40 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
! [A,B] :
( B = powerset(A)
<=> ! [C] :
( in(C,B)
<=> subset(C,A) ) ),
file('theBenchmark.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(d4_tarski,axiom,
! [A,B] :
( B = union(A)
<=> ! [C] :
( in(C,B)
<=> ? [D] :
( in(D,A)
& in(C,D) ) ) ),
file('theBenchmark.p',d4_tarski) ).
fof(reflexivity_r1_tarski,axiom,
! [A,B] : subset(A,A),
file('theBenchmark.p',reflexivity_r1_tarski) ).
fof(t99_zfmisc_1,conjecture,
! [A] : union(powerset(A)) = A,
file('theBenchmark.p',t99_zfmisc_1) ).
fof(t99_zfmisc_1_neg,negated_conjecture,
~ ! [A] : union(powerset(A)) = A,
inference(assume_negation,[status(cth)],[t99_zfmisc_1]) ).
cnf(c_17,plain,
( subset(C,A)
| ~ in(C,B)
| powerset(A) != B ),
inference(clausify,[status(thm)],[d1_zfmisc_1]) ).
cnf(c_18,plain,
( ~ subset(C,A)
| in(C,B)
| powerset(A) != B ),
inference(clausify,[status(thm)],[d1_zfmisc_1]) ).
cnf(c_21,plain,
( in(C,B)
| ~ in(C,A)
| ~ subset(A,B) ),
inference(clausify,[status(thm)],[d3_tarski]) ).
fof(nnf_5,plain,
! [A,B] :
( ( ? [C] :
( ( ! [D] :
( ~ in(D,A)
| ~ in(C,D) )
| ~ in(C,B) )
& ( ? [X0] :
( in(X0,A)
& in(C,X0) )
| in(C,B) ) )
| union(A) = B )
& ( ! [X1] :
( ( ! [X3] :
( ~ in(X3,A)
| ~ in(X1,X3) )
| in(X1,B) )
& ( ? [X2] :
( in(X2,A)
& in(X1,X2) )
| ~ in(X1,B) ) )
| union(A) != B ) ),
inference(fof_nnf,[status(thm)],[d4_tarski]) ).
fof(sk_d4_tarski_sk,plain,
! [A,B] :
( ( ( ( ! [D] :
( ~ in(D,A)
| ~ in(sK0(A,B),D) )
| ~ in(sK0(A,B),B) )
& ( ( in(sK1(A,B),A)
& in(sK0(A,B),sK1(A,B)) )
| in(sK0(A,B),B) ) )
| union(A) = B )
& ( ! [X1] :
( ( ! [X3] :
( ~ in(X3,A)
| ~ in(X1,X3) )
| in(X1,B) )
& ( ( in(sK5(A,B,X1),A)
& in(X1,sK5(A,B,X1)) )
| ~ in(X1,B) ) )
| union(A) != B ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5,sK0,sK1]),skolemize(X2,sK5(A,B,X1)),skolemize(C,sK0(A,B)),skolemize(X0,sK1(A,B))],[nnf_5]) ).
fof(sk_d4_tarski,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ~ in(VAR_2,VAR_0)
| ~ in(sK0(VAR_0,VAR_1),VAR_2)
| ~ in(sK0(VAR_0,VAR_1),VAR_1)
| union(VAR_0) = VAR_1 )
& ! [VAR_0,VAR_1] :
( in(sK1(VAR_0,VAR_1),VAR_0)
| in(sK0(VAR_0,VAR_1),VAR_1)
| union(VAR_0) = VAR_1 )
& ! [VAR_0,VAR_1] :
( in(sK0(VAR_0,VAR_1),sK1(VAR_0,VAR_1))
| in(sK0(VAR_0,VAR_1),VAR_1)
| union(VAR_0) = VAR_1 )
& ! [VAR_0,VAR_1,VAR_2,VAR_3] :
( ~ in(VAR_3,VAR_0)
| ~ in(VAR_2,VAR_3)
| in(VAR_2,VAR_1)
| union(VAR_0) != VAR_1 )
& ! [VAR_0,VAR_1,VAR_2] :
( in(sK5(VAR_0,VAR_1,VAR_2),VAR_0)
| ~ in(VAR_2,VAR_1)
| union(VAR_0) != VAR_1 )
& ! [VAR_0,VAR_1,VAR_2] :
( in(VAR_2,sK5(VAR_0,VAR_1,VAR_2))
| ~ in(VAR_2,VAR_1)
| union(VAR_0) != VAR_1 ) ),
inference(cnf_transformation,[status(thm)],[sk_d4_tarski_sk]) ).
cnf(c_27,plain,
( in(sK0(A,B),sK1(A,B))
| in(sK0(A,B),B)
| union(A) = B ),
inference(split_conjunct,[status(thm)],[sk_d4_tarski]) ).
cnf(c_28,plain,
( in(sK1(A,B),A)
| in(sK0(A,B),B)
| union(A) = B ),
inference(split_conjunct,[status(thm)],[sk_d4_tarski]) ).
cnf(c_29,plain,
( ~ in(C,A)
| ~ in(sK0(A,B),C)
| ~ in(sK0(A,B),B)
| union(A) = B ),
inference(split_conjunct,[status(thm)],[sk_d4_tarski]) ).
cnf(c_34,plain,
subset(A,A),
inference(clausify,[status(thm)],[reflexivity_r1_tarski]) ).
fof(nnf_11,plain,
? [A] : union(powerset(A)) != A,
inference(fof_nnf,[status(thm)],[t99_zfmisc_1_neg]) ).
fof(sk_t99_zfmisc_1_neg,plain,
union(powerset(sK2)) != sK2,
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(A,sK2)],[nnf_11]) ).
cnf(c_37,negated_conjecture,
union(powerset(sK2)) != sK2,
inference(split_conjunct,[status(thm)],[sk_t99_zfmisc_1_neg]) ).
cnf(c_40,plain,
( ~ in(B,A)
| ~ in(sK0(A,B),B)
| union(A) = B ),
inference(factor,[status(thm)],[c_29]) ).
cnf(c_46,plain,
( subset(A,B)
| ~ in(A,powerset(B)) ),
inference(xxres,[status(thm)],[c_17]) ).
cnf(c_48,plain,
( ~ subset(A,B)
| in(A,powerset(B)) ),
inference(xxres,[status(thm)],[c_18]) ).
cnf(c_66,plain,
( in(sK0(A,B),C)
| ~ subset(sK1(A,B),C)
| in(sK0(A,B),B)
| union(A) = B ),
inference(resolve,[status(thm)],[c_27,c_21]) ).
cnf(c_71,plain,
( ~ subset(sK1(A,B),B)
| in(sK0(A,B),B)
| union(A) = B ),
inference(factor,[status(thm)],[c_66]) ).
cnf(c_203,plain,
in(A,powerset(A)),
inference(resolve,[status(thm)],[c_48,c_34]) ).
cnf(c_1251,negated_conjecture,
( ~ in(sK2,powerset(sK2))
| ~ in(sK0(powerset(sK2),sK2),sK2) ),
inference(resolve,[status(thm)],[c_40,c_37]) ).
cnf(c_218,negated_conjecture,
~ in(sK0(powerset(sK2),sK2),sK2),
inference(resolve,[status(thm)],[c_1251,c_203]) ).
cnf(c_1252,plain,
( in(sK1(powerset(sK2),sK2),powerset(sK2))
| union(powerset(sK2)) = sK2 ),
inference(resolve,[status(thm)],[c_218,c_28]) ).
cnf(c_438,negated_conjecture,
in(sK1(powerset(sK2),sK2),powerset(sK2)),
inference(resolve,[status(thm)],[c_37,c_1252]) ).
cnf(c_610,plain,
subset(sK1(powerset(sK2),sK2),sK2),
inference(resolve,[status(thm)],[c_438,c_46]) ).
cnf(c_1253,plain,
( in(sK0(powerset(sK2),sK2),sK2)
| union(powerset(sK2)) = sK2 ),
inference(resolve,[status(thm)],[c_71,c_610]) ).
cnf(c_1254,negated_conjecture,
in(sK0(powerset(sK2),sK2),sK2),
inference(resolve,[status(thm)],[c_37,c_1253]) ).
cnf(c_1250,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_218,c_1254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU164+3 : TPTP v9.3.1. Bugfixed v4.0.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n008.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sat Sep 26 08:43:54 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.13/0.36 % Process 3239099 was started by sandbox2 on n008,
% 0.13/0.36 % Sat Sep 26 08:43:54 2026
% 0.13/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.13/0.37
% 0.13/0.37 % From the command line: assign(max_seconds, 300).
% 0.13/0.48
% 0.13/0.48 % SZS status Theorem for theBenchmark
% 0.13/0.48
% 0.13/0.48 % Proof 1 at 0.07 (+ 0.02) seconds.
% 0.13/0.48 % Length of proof is 23.
% 0.13/0.48 % Level of proof is 7.
% 0.13/0.48 % Maximum clause weight is 29.000.
% 0.13/0.48 % Given clauses 158.
% 0.13/0.48
% 0.13/0.48 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------