%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET175+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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 : Thu Sep 24 02:09:34 PM UTC 2026
% Result : Theorem 0.38s 0.60s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 7 unt; 4 def)
% Number of atoms : 147 ( 11 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 155 ( 61 ~; 64 |; 20 &)
% ( 9 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 81 ( 77 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,C)
| member(D,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] :
( B = C
<=> ( subset(C,B)
& subset(B,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,conjecture,
! [B,C] : union(B,intersection(B,C)) = B,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
~ ! [B,C] : union(B,intersection(B,C)) = B,
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f11,plain,
! [B,C,D] :
( ( ( ~ member(D,C)
& ~ member(D,B) )
| member(D,union(B,C)) )
& ( member(D,C)
| member(D,B)
| ~ member(D,union(B,C)) ) ),
inference(NNF_transformation,[status(thm)],[f1]) ).
fof(f12,plain,
( ! [B,C,D] :
( ( ~ member(D,C)
& ~ member(D,B) )
| member(D,union(B,C)) )
& ! [B,C,D] :
( member(D,C)
| member(D,B)
| ~ member(D,union(B,C)) ) ),
inference(miniscoping,[status(thm)],[f11]) ).
fof(f13,plain,
! [X0,X1,X2] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f14,plain,
! [X0,X1,X2] :
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f12]) ).
fof(f16,plain,
! [B,C,D] :
( ( ~ member(D,C)
| ~ member(D,B)
| member(D,intersection(B,C)) )
& ( ( member(D,C)
& member(D,B) )
| ~ member(D,intersection(B,C)) ) ),
inference(NNF_transformation,[status(thm)],[f2]) ).
fof(f17,plain,
( ! [B,C,D] :
( ~ member(D,C)
| ~ member(D,B)
| member(D,intersection(B,C)) )
& ! [B,C,D] :
( ( member(D,C)
& member(D,B) )
| ~ member(D,intersection(B,C)) ) ),
inference(miniscoping,[status(thm)],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f21,plain,
! [B,C] :
( ( ~ subset(C,B)
| ~ subset(B,C)
| B = C )
& ( ( subset(C,B)
& subset(B,C) )
| B != C ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f22,plain,
( ! [B,C] :
( ~ subset(C,B)
| ~ subset(B,C)
| B = C )
& ! [B,C] :
( ( subset(C,B)
& subset(B,C) )
| B != C ) ),
inference(miniscoping,[status(thm)],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f28,plain,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,C)
| ~ member(D,B) ) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f29,plain,
! [B,C] :
( ( ? [D] :
( ~ member(D,C)
& member(D,B) )
| subset(B,C) )
& ( ! [D] :
( member(D,C)
| ~ member(D,B) )
| ~ subset(B,C) ) ),
inference(NNF_transformation,[status(thm)],[f28]) ).
fof(f30,plain,
( ! [B,C] :
( ? [D] :
( ~ member(D,C)
& member(D,B) )
| subset(B,C) )
& ! [B,C] :
( ! [D] :
( member(D,C)
| ~ member(D,B) )
| ~ subset(B,C) ) ),
inference(miniscoping,[status(thm)],[f29]) ).
fof(f31,plain,
( ! [B,C] :
( ( ~ member(sK0_skl(C,B),C)
& member(sK0_skl(C,B),B) )
| subset(B,C) )
& ! [B,C] :
( ! [D] :
( member(D,C)
| ~ member(D,B) )
| ~ subset(B,C) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B))],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f34,plain,
! [X0,X1] :
( ~ member(sK0_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f43,plain,
? [B,C] : union(B,intersection(B,C)) != B,
inference(pre_NNF_transformation,[status(thm)],[f10]) ).
fof(f44,plain,
union(sK2_skl,intersection(sK2_skl,sK3_skl)) != sK2_skl,
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(B,sK2_skl),skolemize(C,sK3_skl)],[f43]) ).
fof(f45,plain,
union(sK2_skl,intersection(sK2_skl,sK3_skl)) != sK2_skl,
inference(cnf_transformation,[status(thm)],[f44]) ).
fof(f60,plain,
( ~ subset(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl)))
| ~ subset(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl) ),
inference(resolution,[status(thm)],[f25,f45]) ).
fof(f62,definition,
( sQ0_spl
<=> subset(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f64,plain,
( sQ0_spl
| ~ subset(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl) ),
inference(component_clause,[status(thm)],[f62]) ).
fof(f65,definition,
( sQ1_spl
<=> subset(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f67,plain,
( sQ1_spl
| ~ subset(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))) ),
inference(component_clause,[status(thm)],[f65]) ).
fof(f68,plain,
( ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f60,f62,f65]) ).
fof(f72,plain,
( sQ0_spl
| ~ member(sK0_skl(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))),sK2_skl) ),
inference(resolution,[status(thm)],[f64,f34]) ).
fof(f73,plain,
! [X0] :
( sQ0_spl
| member(sK0_skl(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))),X0)
| ~ member(sK0_skl(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))),union(sK2_skl,X0)) ),
inference(resolution,[status(thm)],[f72,f13]) ).
fof(f74,plain,
! [X0] :
( sQ0_spl
| ~ member(sK0_skl(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))),X0)
| ~ subset(X0,sK2_skl) ),
inference(resolution,[status(thm)],[f72,f32]) ).
fof(f78,plain,
! [X0] :
( sQ0_spl
| ~ member(sK0_skl(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))),union(sK2_skl,X0))
| ~ subset(X0,sK2_skl) ),
inference(resolution,[status(thm)],[f74,f73]) ).
fof(f103,plain,
( sQ1_spl
| ~ member(sK0_skl(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl),union(sK2_skl,intersection(sK2_skl,sK3_skl))) ),
inference(resolution,[status(thm)],[f67,f34]) ).
fof(f156,plain,
( sQ1_spl
| ~ member(sK0_skl(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl),sK2_skl) ),
inference(resolution,[status(thm)],[f103,f14]) ).
fof(f166,definition,
( sQ5_spl
<=> member(sK0_skl(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl),sK2_skl) ),
introduced(definition,[new_symbols(definition,[sQ5_spl])],[split_symbol_definition]) ).
fof(f168,plain,
( sQ5_spl
| ~ member(sK0_skl(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl),sK2_skl) ),
inference(component_clause,[status(thm)],[f166]) ).
fof(f232,plain,
( sQ5_spl
| subset(sK2_skl,union(sK2_skl,intersection(sK2_skl,sK3_skl))) ),
inference(resolution,[status(thm)],[f168,f33]) ).
fof(f237,plain,
( sQ5_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f232,f65,f166]) ).
fof(f251,plain,
( sQ1_spl
| ~ sQ5_spl ),
inference(split_clause,[status(thm)],[f156,f166,f65]) ).
fof(f260,plain,
( sQ0_spl
| subset(union(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl)
| ~ subset(intersection(sK2_skl,sK3_skl),sK2_skl) ),
inference(resolution,[status(thm)],[f78,f33]) ).
fof(f269,definition,
( sQ9_spl
<=> subset(intersection(sK2_skl,sK3_skl),sK2_skl) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f271,plain,
( sQ9_spl
| ~ subset(intersection(sK2_skl,sK3_skl),sK2_skl) ),
inference(component_clause,[status(thm)],[f269]) ).
fof(f272,plain,
( sQ0_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f260,f269,f62]) ).
fof(f376,plain,
( sQ9_spl
| ~ member(sK0_skl(sK2_skl,intersection(sK2_skl,sK3_skl)),sK2_skl) ),
inference(resolution,[status(thm)],[f271,f34]) ).
fof(f396,plain,
! [X0] :
( sQ9_spl
| ~ member(sK0_skl(sK2_skl,intersection(sK2_skl,sK3_skl)),intersection(sK2_skl,X0)) ),
inference(resolution,[status(thm)],[f376,f18]) ).
fof(f495,plain,
( sQ9_spl
| subset(intersection(sK2_skl,sK3_skl),sK2_skl) ),
inference(resolution,[status(thm)],[f396,f33]) ).
fof(f503,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f495,f271]) ).
fof(f504,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f503]) ).
fof(f505,plain,
$false,
inference(sat_refutation,[status(thm)],[f68,f237,f251,f272,f504]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET175+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.43 % Computer : n002.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 05:01:16 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.45 % Drodi V4.1.1
% 0.38/0.60 % Refutation found
% 0.38/0.60 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.38/0.60 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.38/0.63 % Elapsed time: 0.180923 seconds
% 0.38/0.63 % CPU time: 1.137318 seconds
% 0.38/0.63 % Total memory used: 112.809 MB
% 0.38/0.63 % Net memory used: 111.250 MB
%------------------------------------------------------------------------------