%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n012.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:05 AM UTC 2026
% Result : Theorem 4.26s 1.04s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 21 ( 12 unt; 0 def)
% Number of atoms : 47 ( 7 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 15 |; 7 &)
% ( 3 <=>; 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 43 ( 4 sgn 26 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(commutativity_k3_xboole_0,axiom,
! [A,B] : set_intersection2(A,B) = set_intersection2(B,A),
file('theBenchmark.p',commutativity_k3_xboole_0) ).
fof(d3_tarski,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('theBenchmark.p',d3_tarski) ).
fof(d3_xboole_0,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
& in(D,A) ) ) ),
file('theBenchmark.p',d3_xboole_0) ).
fof(t17_xboole_1,conjecture,
! [A,B] : subset(set_intersection2(A,B),A),
file('theBenchmark.p',t17_xboole_1) ).
fof(t17_xboole_1_neg,negated_conjecture,
~ ! [A,B] : subset(set_intersection2(A,B),A),
inference(assume_negation,[status(cth)],[t17_xboole_1]) ).
cnf(c_37,plain,
set_intersection2(A,B) = set_intersection2(B,A),
inference(clausify,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(nnf_7,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_7]) ).
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_50,plain,
( in(sK0(A,B),A)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
cnf(c_51,plain,
( ~ in(sK0(A,B),B)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_d3_tarski]) ).
cnf(c_53,plain,
( in(D,B)
| ~ in(D,C)
| set_intersection2(A,B) != C ),
inference(clausify,[status(thm)],[d3_xboole_0]) ).
fof(nnf_34,plain,
? [A,B] : ~ subset(set_intersection2(A,B),A),
inference(fof_nnf,[status(thm)],[t17_xboole_1_neg]) ).
fof(sk_t17_xboole_1_neg,plain,
~ subset(set_intersection2(sK1,sK2),sK1),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(A,sK1),skolemize(B,sK2)],[nnf_34]) ).
cnf(c_85,negated_conjecture,
~ subset(set_intersection2(sK1,sK2),sK1),
inference(split_conjunct,[status(thm)],[sk_t17_xboole_1_neg]) ).
cnf(c_386,plain,
in(sK0(set_intersection2(sK1,sK2),sK1),set_intersection2(sK1,sK2)),
inference(resolve,[status(thm)],[c_85,c_50]) ).
cnf(c_389,negated_conjecture,
~ in(sK0(set_intersection2(sK1,sK2),sK1),sK1),
inference(resolve,[status(thm)],[c_51,c_85]) ).
cnf(c_4476,plain,
( in(sK0(set_intersection2(sK1,sK2),sK1),B)
| set_intersection2(A,B) != set_intersection2(sK1,sK2) ),
inference(resolve,[status(thm)],[c_53,c_386]) ).
cnf(c_4477,plain,
set_intersection2(A,sK1) != set_intersection2(sK1,sK2),
inference(resolve,[status(thm)],[c_4476,c_389]) ).
cnf(c_4474,plain,
set_intersection2(sK1,sK2) != set_intersection2(A,sK1),
inference(copy,[status(thm)],[c_4477]) ).
cnf(c_4475,plain,
$false,
inference(resolve,[status(thm)],[c_4474,c_37]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU127+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.04/0.29 % Computer : n012.cluster.edu
% 0.04/0.29 % Model : x86_64 x86_64
% 0.04/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.29 % Memory : 8046.5625MB
% 0.04/0.29 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Sat Sep 26 08:37:34 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.04/0.30 % Process 159502 was started by sandbox2 on n012,
% 0.04/0.30 % Sat Sep 26 08:37:34 2026
% 0.04/0.30 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.04/0.31
% 0.04/0.31 % From the command line: assign(max_seconds, 300).
% 4.26/1.04
% 4.26/1.04 % SZS status Theorem for theBenchmark
% 4.26/1.04
% 4.26/1.04 % Proof 1 at 0.46 (+ 0.22) seconds.
% 4.26/1.04 % Length of proof is 13.
% 4.26/1.04 % Level of proof is 4.
% 4.26/1.04 % Maximum clause weight is 11.000.
% 4.26/1.04 % Given clauses 366.
% 4.26/1.04
% 4.26/1.04 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------