%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET576+3 : TPTP v9.3.1. Released v2.2.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:36:30 AM UTC 2026
% Result : Theorem 0.08s 5.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 19 ( 5 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 60 ( 28 ~; 17 |; 9 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(intersect_defn,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,C)
& member(D,B) ) ),
file('theBenchmark.p',intersect_defn) ).
fof(disjoint_defn,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('theBenchmark.p',disjoint_defn) ).
fof(prove_th17,conjecture,
! [B,C] :
( ! [D] :
( member(D,B)
=> ~ member(D,C) )
=> disjoint(B,C) ),
file('theBenchmark.p',prove_th17) ).
fof(prove_th17_neg,negated_conjecture,
~ ! [B,C] :
( ! [D] :
( member(D,B)
=> ~ member(D,C) )
=> disjoint(B,C) ),
inference(assume_negation,[status(cth)],[prove_th17]) ).
cnf(c_5,plain,
( intersect(A,B)
| disjoint(A,B) ),
inference(clausify,[status(thm)],[disjoint_defn]) ).
fof(nnf_4,plain,
? [B,C] :
( ~ disjoint(B,C)
& ! [D] :
( ~ member(D,C)
| ~ member(D,B) ) ),
inference(fof_nnf,[status(thm)],[prove_th17_neg]) ).
fof(sk_prove_th17_neg,plain,
( ~ disjoint(sK0,sK1)
& ! [D] :
( ~ member(D,sK1)
| ~ member(D,sK0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(B,sK0),skolemize(C,sK1)],[nnf_4]) ).
cnf(c_7,negated_conjecture,
~ disjoint(sK0,sK1),
inference(split_conjunct,[status(thm)],[sk_prove_th17_neg]) ).
cnf(c_8,negated_conjecture,
intersect(sK0,sK1),
inference(resolve,[status(thm)],[c_7,c_5]) ).
cnf(c_9,negated_conjecture,
( ~ member(A,sK1)
| ~ member(A,sK0) ),
inference(split_conjunct,[status(thm)],[sk_prove_th17_neg]) ).
fof(nnf_1,plain,
! [B,C] :
( ( ! [D] :
( ~ member(D,C)
| ~ member(D,B) )
| intersect(B,C) )
& ( ? [X0] :
( member(X0,C)
& member(X0,B) )
| ~ intersect(B,C) ) ),
inference(fof_nnf,[status(thm)],[intersect_defn]) ).
fof(sk_intersect_defn_sk,plain,
! [B,C] :
( ( ! [D] :
( ~ member(D,C)
| ~ member(D,B) )
| intersect(B,C) )
& ( ( member(sK2(B,C),C)
& member(sK2(B,C),B) )
| ~ intersect(B,C) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X0,sK2(B,C))],[nnf_1]) ).
fof(sk_intersect_defn,plain,
( ! [VAR_0,VAR_1,VAR_2] :
( ~ member(VAR_2,VAR_1)
| ~ member(VAR_2,VAR_0)
| intersect(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( member(sK2(VAR_0,VAR_1),VAR_1)
| ~ intersect(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( member(sK2(VAR_0,VAR_1),VAR_0)
| ~ intersect(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_intersect_defn_sk]) ).
cnf(c_12,plain,
( member(sK2(A,B),B)
| ~ intersect(A,B) ),
inference(split_conjunct,[status(thm)],[sk_intersect_defn]) ).
cnf(c_13,plain,
( member(sK2(A,B),A)
| ~ intersect(A,B) ),
inference(split_conjunct,[status(thm)],[sk_intersect_defn]) ).
cnf(c_15,plain,
( ~ member(sK2(A,sK1),sK0)
| ~ intersect(A,sK1) ),
inference(resolve,[status(thm)],[c_12,c_9]) ).
cnf(c_20,negated_conjecture,
member(sK2(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_13,c_8]) ).
cnf(c_26,negated_conjecture,
~ member(sK2(sK0,sK1),sK0),
inference(resolve,[status(thm)],[c_15,c_8]) ).
cnf(c_25,negated_conjecture,
$false,
inference(resolve,[status(thm)],[c_20,c_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET576+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/5.36 % Computer : n001.cluster.edu
% 0.08/5.36 % Model : x86_64 x86_64
% 0.08/5.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/5.36 % Memory : 8046.5625MB
% 0.08/5.36 % OS : Linux 6.8.0-71-generic
% 0.08/5.36 % CPULimit : 300
% 0.08/5.36 % WCLimit : 300
% 0.08/5.36 % DateTime : Sat Sep 26 08:02:47 UTC 2026
% 0.08/5.36 % CPUTime :
% 0.08/5.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/5.36 % Process 1316753 was started by sandbox on n001,
% 0.08/5.36 % Sat Sep 26 08:02:47 2026
% 0.08/5.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.08/5.37
% 0.08/5.37 % From the command line: assign(max_seconds, 300).
% 0.08/5.38
% 0.08/5.38 % SZS status Theorem for theBenchmark
% 0.08/5.38
% 0.08/5.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.08/5.38 % Length of proof is 12.
% 0.08/5.38 % Level of proof is 4.
% 0.08/5.38 % Maximum clause weight is 8.000.
% 0.08/5.38 % Given clauses 8.
% 0.08/5.38
% 0.08/5.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------