%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU159+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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:14 AM UTC 2026
% Result : Theorem 9.90s 1.63s
% Output : CNFRefutation 9.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of formulae : 46 ( 14 unt; 0 def)
% Number of atoms : 122 ( 24 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 123 ( 47 ~; 56 |; 14 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 64 ( 4 sgn 28 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(commutativity_k2_tarski,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('theBenchmark.p',commutativity_k2_tarski) ).
fof(d2_tarski,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('theBenchmark.p',d2_tarski) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(t38_zfmisc_1,conjecture,
! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
file('theBenchmark.p',t38_zfmisc_1) ).
fof(t38_zfmisc_1_neg,negated_conjecture,
~ ! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
inference(assume_negation,[status(cth)],[t38_zfmisc_1]) ).
cnf(c_9,plain,
unordered_pair(A,B) = unordered_pair(B,A),
inference(clausify,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_10,plain,
( D = B
| D = A
| ~ in(D,C)
| unordered_pair(A,B) != C ),
inference(clausify,[status(thm)],[d2_tarski]) ).
cnf(c_11,plain,
( D != A
| in(D,C)
| unordered_pair(A,B) != C ),
inference(clausify,[status(thm)],[d2_tarski]) ).
fof(nnf_4,plain,
! [A,B] :
( ( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ( ! [X0] :
( in(X0,B)
| ~ in(X0,A) )
| ~ subset(A,B) ) ),
inference(fof_nnf,[status(thm)],[d3_tarski]) ).
fof(sk_d3_tarski_sk,plain,
! [A,B] :
( ( ( ~ in(sK0(A,B),B)
& in(sK0(A,B),A) )
| subset(A,B) )
& ( ! [X0] :
( in(X0,B)
| ~ in(X0,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(C,sK0(A,B))],[nnf_4]) ).
fof(sk_d3_tarski,plain,
( ! [VAR_0,VAR_1] :
( ~ in(sK0(VAR_0,VAR_1),VAR_1)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( in(sK0(VAR_0,VAR_1),VAR_0)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( in(VAR_2,VAR_1)
| ~ in(VAR_2,VAR_0)
| ~ subset(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_d3_tarski_sk]) ).
cnf(c_16,plain,
( in(C,B)
| ~ in(C,A)
| ~ subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
cnf(c_17,plain,
( in(sK0(A,B),A)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
cnf(c_18,plain,
( ~ in(sK0(A,B),B)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
fof(nnf_7,plain,
? [A,B,C] :
( ( ~ in(B,C)
| ~ in(A,C)
| ~ subset(unordered_pair(A,B),C) )
& ( ( in(B,C)
& in(A,C) )
| subset(unordered_pair(A,B),C) ) ),
inference(fof_nnf,[status(thm)],[t38_zfmisc_1_neg]) ).
fof(sk_t38_zfmisc_1_neg_sk,plain,
( ( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) )
& ( ( in(sK2,sK3)
& in(sK1,sK3) )
| subset(unordered_pair(sK1,sK2),sK3) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(A,sK1),skolemize(B,sK2),skolemize(C,sK3)],[nnf_7]) ).
fof(sk_t38_zfmisc_1_neg,plain,
( ( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) )
& ( in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3) )
& ( in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ) ),
inference(cnf_transformation,[status(thm)],[sk_t38_zfmisc_1_neg_sk]) ).
cnf(c_20,negated_conjecture,
( in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ),
inference(split_conjunct,[status(thm)],[sk_t38_zfmisc_1_neg]) ).
cnf(c_21,negated_conjecture,
( in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3) ),
inference(split_conjunct,[status(thm)],[sk_t38_zfmisc_1_neg]) ).
cnf(c_22,negated_conjecture,
( ~ in(sK2,sK3)
| ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) ),
inference(split_conjunct,[status(thm)],[sk_t38_zfmisc_1_neg]) ).
cnf(c_28,plain,
( A = B
| A = C
| ~ in(A,unordered_pair(B,C)) ),
inference(resolve,[status(thm)],[c_10,c_9]) ).
cnf(c_30,plain,
( A != C
| in(A,unordered_pair(B,C)) ),
inference(resolve,[status(thm)],[c_11,c_9]) ).
cnf(c_51,plain,
( in(A,sK3)
| ~ in(A,unordered_pair(sK1,sK2))
| in(sK1,sK3) ),
inference(resolve,[status(thm)],[c_20,c_16]) ).
cnf(c_56,plain,
( ~ in(sK1,unordered_pair(sK1,sK2))
| in(sK1,sK3) ),
inference(factor,[status(thm)],[c_51]) ).
cnf(c_58,plain,
( in(A,sK3)
| ~ in(A,unordered_pair(sK1,sK2))
| in(sK2,sK3) ),
inference(resolve,[status(thm)],[c_21,c_16]) ).
cnf(c_63,plain,
( ~ in(sK2,unordered_pair(sK1,sK2))
| in(sK2,sK3) ),
inference(factor,[status(thm)],[c_58]) ).
cnf(c_102,plain,
( subset(unordered_pair(A,B),C)
| sK0(unordered_pair(A,B),C) = A
| sK0(unordered_pair(A,B),C) = B ),
inference(resolve,[status(thm)],[c_28,c_17]) ).
cnf(c_143,plain,
in(A,unordered_pair(B,A)),
inference(xxres,[status(thm)],[c_30]) ).
cnf(c_145,plain,
in(sK2,sK3),
inference(resolve,[status(thm)],[c_143,c_63]) ).
cnf(c_150,negated_conjecture,
( ~ in(sK1,sK3)
| ~ subset(unordered_pair(sK1,sK2),sK3) ),
inference(resolve,[status(thm)],[c_145,c_22]) ).
cnf(c_186,plain,
in(A,unordered_pair(A,B)),
inference(paramod,[status(thm)],[c_9,c_143]) ).
cnf(c_190,plain,
in(sK1,sK3),
inference(resolve,[status(thm)],[c_186,c_56]) ).
cnf(c_191,negated_conjecture,
~ subset(unordered_pair(sK1,sK2),sK3),
inference(resolve,[status(thm)],[c_190,c_150]) ).
cnf(c_300,negated_conjecture,
~ in(sK0(unordered_pair(sK1,sK2),sK3),sK3),
inference(resolve,[status(thm)],[c_18,c_191]) ).
cnf(c_3147,plain,
( ~ in(sK2,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| sK0(unordered_pair(sK1,sK2),sK3) = sK1 ),
inference(paramod,[status(thm)],[c_102,c_300]) ).
cnf(c_3148,negated_conjecture,
( ~ in(sK2,sK3)
| sK0(unordered_pair(sK1,sK2),sK3) = sK1 ),
inference(resolve,[status(thm)],[c_191,c_3147]) ).
cnf(c_3089,negated_conjecture,
sK0(unordered_pair(sK1,sK2),sK3) = sK1,
inference(resolve,[status(thm)],[c_145,c_3148]) ).
cnf(c_3149,plain,
( ~ in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| sK0(unordered_pair(sK1,sK2),sK3) = sK2 ),
inference(paramod,[status(thm)],[c_102,c_300]) ).
cnf(c_3150,plain,
( ~ in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| sK1 = sK2 ),
inference(paramod,[status(thm)],[c_3089,c_3149]) ).
cnf(c_3151,plain,
( ~ in(sK1,sK3)
| subset(unordered_pair(sK1,sK2),sK3)
| sK2 = sK1 ),
inference(copy,[status(thm)],[c_3150]) ).
cnf(c_3152,negated_conjecture,
( ~ in(sK1,sK3)
| sK2 = sK1 ),
inference(resolve,[status(thm)],[c_191,c_3151]) ).
cnf(c_3090,negated_conjecture,
sK2 = sK1,
inference(resolve,[status(thm)],[c_190,c_3152]) ).
cnf(c_3123,negated_conjecture,
~ in(sK0(unordered_pair(sK1,sK1),sK3),sK3),
inference(paramod,[status(thm)],[c_3090,c_300]) ).
cnf(c_3125,negated_conjecture,
sK0(unordered_pair(sK1,sK1),sK3) = sK1,
inference(paramod,[status(thm)],[c_3090,c_3089]) ).
cnf(c_3153,negated_conjecture,
~ in(sK1,sK3),
inference(paramod,[status(thm)],[c_3125,c_3123]) ).
cnf(c_3146,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_190,c_3153]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU159+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.33 % Computer : n001.cluster.edu
% 0.09/0.33 % Model : x86_64 x86_64
% 0.09/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.33 % Memory : 8046.5625MB
% 0.09/0.33 % OS : Linux 6.8.0-71-generic
% 0.09/0.33 % CPULimit : 300
% 0.09/0.33 % WCLimit : 300
% 0.09/0.33 % DateTime : Sat Sep 26 08:47:42 UTC 2026
% 0.09/0.33 % CPUTime :
% 0.09/0.33 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.09/0.33 % Process 1402972 was started by sandbox on n001,
% 0.09/0.33 % Sat Sep 26 08:47:42 2026
% 0.09/0.33 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.09/0.34
% 0.09/0.34 % From the command line: assign(max_seconds, 300).
% 9.90/1.63
% 9.90/1.63 % SZS status Theorem for theBenchmark
% 9.90/1.63
% 9.90/1.63 % Proof 1 at 0.81 (+ 0.33) seconds.
% 9.90/1.63 % Length of proof is 32.
% 9.90/1.63 % Level of proof is 11.
% 9.90/1.63 % Maximum clause weight is 25.000.
% 9.90/1.63 % Given clauses 228.
% 9.90/1.63
% 9.90/1.63 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------