%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SET199+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n005.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:01 AM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 25 ( 9 unt; 0 def)
% Number of atoms : 62 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 61 ( 24 ~; 19 |; 13 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 41 ( 0 sgn 25 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(intersection_defn,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,C)
& member(D,B) ) ),
file('theBenchmark.p',intersection_defn) ).
fof(subset_defn,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('theBenchmark.p',subset_defn) ).
fof(prove_intersection_of_subsets,conjecture,
! [B,C,D] :
( ( subset(B,D)
& subset(B,C) )
=> subset(B,intersection(C,D)) ),
file('theBenchmark.p',prove_intersection_of_subsets) ).
fof(prove_intersection_of_subsets_neg,negated_conjecture,
~ ! [B,C,D] :
( ( subset(B,D)
& subset(B,C) )
=> subset(B,intersection(C,D)) ),
inference(assume_negation,[status(cth)],[prove_intersection_of_subsets]) ).
cnf(c_9,plain,
( ~ member(A,C)
| ~ member(A,B)
| member(A,intersection(B,C)) ),
inference(clausify,[status(thm)],[intersection_defn]) ).
fof(nnf_2,plain,
! [B,C] :
( ( ? [D] :
( ~ member(D,C)
& member(D,B) )
| subset(B,C) )
& ( ! [X0] :
( member(X0,C)
| ~ member(X0,B) )
| ~ subset(B,C) ) ),
inference(fof_nnf,[status(thm)],[subset_defn]) ).
fof(sk_subset_defn_sk,plain,
! [B,C] :
( ( ( ~ member(sK0(B,C),C)
& member(sK0(B,C),B) )
| subset(B,C) )
& ( ! [X0] :
( member(X0,C)
| ~ member(X0,B) )
| ~ subset(B,C) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(D,sK0(B,C))],[nnf_2]) ).
fof(sk_subset_defn,plain,
( ! [VAR_0,VAR_1] :
( ~ member(sK0(VAR_0,VAR_1),VAR_1)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1] :
( member(sK0(VAR_0,VAR_1),VAR_0)
| subset(VAR_0,VAR_1) )
& ! [VAR_0,VAR_1,VAR_2] :
( member(VAR_2,VAR_1)
| ~ member(VAR_2,VAR_0)
| ~ subset(VAR_0,VAR_1) ) ),
inference(cnf_transformation,[status(thm)],[sk_subset_defn_sk]) ).
cnf(c_10,plain,
( member(C,B)
| ~ member(C,A)
| ~ subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_subset_defn]) ).
cnf(c_11,plain,
( member(sK0(A,B),A)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_subset_defn]) ).
cnf(c_12,plain,
( ~ member(sK0(A,B),B)
| subset(A,B) ),
inference(split_conjunct,[status(thm)],[sk_subset_defn]) ).
fof(nnf_6,plain,
? [B,C,D] :
( ~ subset(B,intersection(C,D))
& subset(B,D)
& subset(B,C) ),
inference(fof_nnf,[status(thm)],[prove_intersection_of_subsets_neg]) ).
fof(sk_prove_intersection_of_subsets_neg,plain,
( ~ subset(sK1,intersection(sK2,sK3))
& subset(sK1,sK3)
& subset(sK1,sK2) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(B,sK1),skolemize(C,sK2),skolemize(D,sK3)],[nnf_6]) ).
cnf(c_19,negated_conjecture,
subset(sK1,sK2),
inference(split_conjunct,[status(thm)],[sk_prove_intersection_of_subsets_neg]) ).
cnf(c_20,negated_conjecture,
subset(sK1,sK3),
inference(split_conjunct,[status(thm)],[sk_prove_intersection_of_subsets_neg]) ).
cnf(c_21,negated_conjecture,
~ subset(sK1,intersection(sK2,sK3)),
inference(split_conjunct,[status(thm)],[sk_prove_intersection_of_subsets_neg]) ).
cnf(c_46,plain,
( member(A,sK2)
| ~ member(A,sK1) ),
inference(resolve,[status(thm)],[c_19,c_10]) ).
cnf(c_47,plain,
( member(A,sK3)
| ~ member(A,sK1) ),
inference(resolve,[status(thm)],[c_20,c_10]) ).
cnf(c_48,plain,
member(sK0(sK1,intersection(sK2,sK3)),sK1),
inference(resolve,[status(thm)],[c_21,c_11]) ).
cnf(c_49,negated_conjecture,
~ member(sK0(sK1,intersection(sK2,sK3)),intersection(sK2,sK3)),
inference(resolve,[status(thm)],[c_12,c_21]) ).
cnf(c_74,plain,
member(sK0(sK1,intersection(sK2,sK3)),sK3),
inference(resolve,[status(thm)],[c_48,c_47]) ).
cnf(c_75,plain,
member(sK0(sK1,intersection(sK2,sK3)),sK2),
inference(resolve,[status(thm)],[c_48,c_46]) ).
cnf(c_102,plain,
( ~ member(sK0(sK1,intersection(sK2,sK3)),sK3)
| ~ member(sK0(sK1,intersection(sK2,sK3)),sK2) ),
inference(resolve,[status(thm)],[c_9,c_49]) ).
cnf(c_103,plain,
~ member(sK0(sK1,intersection(sK2,sK3)),sK2),
inference(resolve,[status(thm)],[c_102,c_74]) ).
cnf(c_101,plain,
$false,
inference(resolve,[status(thm)],[c_75,c_103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET199+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n005.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sat Sep 26 07:18:47 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.08/0.36 % Process 1540784 was started by sandbox2 on n005,
% 0.08/0.36 % Sat Sep 26 07:18:47 2026
% 0.08/0.36 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.08/0.36
% 0.08/0.36 % From the command line: assign(max_seconds, 300).
% 0.13/0.39
% 0.13/0.39 % SZS status Theorem for theBenchmark
% 0.13/0.39
% 0.13/0.39 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.13/0.39 % Length of proof is 17.
% 0.13/0.39 % Level of proof is 4.
% 0.13/0.39 % Maximum clause weight is 11.000.
% 0.13/0.39 % Given clauses 25.
% 0.13/0.39
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------