%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET199+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n019.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:37 PM UTC 2026
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 37 ( 6 unt; 2 def)
% Number of atoms : 98 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 98 ( 37 ~; 36 |; 17 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 57 ( 52 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,conjecture,
! [B,C,D] :
( ( subset(B,D)
& subset(B,C) )
=> subset(B,intersection(C,D)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
~ ! [B,C,D] :
( ( subset(B,D)
& subset(B,C) )
=> subset(B,intersection(C,D)) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,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)],[f1]) ).
fof(f9,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)],[f8]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f13,plain,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,C)
| ~ member(D,B) ) ),
inference(pre_NNF_transformation,[status(thm)],[f2]) ).
fof(f14,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)],[f13]) ).
fof(f15,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)],[f14]) ).
fof(f16,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))],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f19,plain,
! [X0,X1] :
( ~ member(sK0_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f29,plain,
? [B,C,D] :
( ~ subset(B,intersection(C,D))
& subset(B,D)
& subset(B,C) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f30,plain,
( ~ subset(sK2_skl,intersection(sK3_skl,sK4_skl))
& subset(sK2_skl,sK4_skl)
& subset(sK2_skl,sK3_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl,sK4_skl]),skolemize(B,sK2_skl),skolemize(C,sK3_skl),skolemize(D,sK4_skl)],[f29]) ).
fof(f31,plain,
subset(sK2_skl,sK3_skl),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f32,plain,
subset(sK2_skl,sK4_skl),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f33,plain,
~ subset(sK2_skl,intersection(sK3_skl,sK4_skl)),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f46,plain,
! [X0] :
( member(X0,sK4_skl)
| ~ member(X0,sK2_skl) ),
inference(resolution,[status(thm)],[f17,f32]) ).
fof(f47,plain,
! [X0] :
( member(X0,sK3_skl)
| ~ member(X0,sK2_skl) ),
inference(resolution,[status(thm)],[f17,f31]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ~ member(sK0_skl(intersection(X1,X2),X0),X2)
| ~ member(sK0_skl(intersection(X1,X2),X0),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[status(thm)],[f19,f12]) ).
fof(f84,plain,
( ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK4_skl)
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f54,f33]) ).
fof(f88,definition,
( sQ2_spl
<=> member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK3_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f90,plain,
( sQ2_spl
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK3_skl) ),
inference(component_clause,[status(thm)],[f88]) ).
fof(f91,definition,
( sQ3_spl
<=> member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK4_skl) ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f93,plain,
( sQ3_spl
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK4_skl) ),
inference(component_clause,[status(thm)],[f91]) ).
fof(f94,plain,
( ~ sQ3_spl
| ~ sQ2_spl ),
inference(split_clause,[status(thm)],[f84,f88,f91]) ).
fof(f108,plain,
( sQ2_spl
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK2_skl) ),
inference(resolution,[status(thm)],[f90,f47]) ).
fof(f109,plain,
( sQ2_spl
| subset(sK2_skl,intersection(sK3_skl,sK4_skl)) ),
inference(resolution,[status(thm)],[f108,f18]) ).
fof(f110,plain,
( sQ2_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f109,f33]) ).
fof(f111,plain,
sQ2_spl,
inference(contradiction_clause,[status(thm)],[f110]) ).
fof(f112,plain,
( sQ3_spl
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK2_skl),sK2_skl) ),
inference(resolution,[status(thm)],[f93,f46]) ).
fof(f113,plain,
( sQ3_spl
| subset(sK2_skl,intersection(sK3_skl,sK4_skl)) ),
inference(resolution,[status(thm)],[f112,f18]) ).
fof(f114,plain,
( sQ3_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f113,f33]) ).
fof(f115,plain,
sQ3_spl,
inference(contradiction_clause,[status(thm)],[f114]) ).
fof(f116,plain,
$false,
inference(sat_refutation,[status(thm)],[f94,f111,f115]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET199+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n019.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 : Mon Sep 21 05:00:19 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.13/0.40 % Refutation found
% 0.13/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.43 % Elapsed time: 0.061149 seconds
% 0.13/0.43 % CPU time: 0.161660 seconds
% 0.13/0.43 % Total memory used: 102.014 MB
% 0.13/0.43 % Net memory used: 101.536 MB
%------------------------------------------------------------------------------