%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET629+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 : n018.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:10:17 PM UTC 2026
% Result : Theorem 0.14s 10.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 8 unt; 0 def)
% Number of atoms : 85 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 98 ( 42 ~; 33 |; 19 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 80 ( 75 !; 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,D] :
( member(D,difference(B,C))
<=> ( ~ member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,C)
& member(D,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,conjecture,
! [B,C] : disjoint(intersection(B,C),difference(B,C)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ ! [B,C] : disjoint(intersection(B,C),difference(B,C)),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,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(f11,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)],[f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f15,plain,
! [B,C,D] :
( ( member(D,C)
| ~ member(D,B)
| member(D,difference(B,C)) )
& ( ( ~ member(D,C)
& member(D,B) )
| ~ member(D,difference(B,C)) ) ),
inference(NNF_transformation,[status(thm)],[f2]) ).
fof(f16,plain,
( ! [B,C,D] :
( member(D,C)
| ~ member(D,B)
| member(D,difference(B,C)) )
& ! [B,C,D] :
( ( ~ member(D,C)
& member(D,B) )
| ~ member(D,difference(B,C)) ) ),
inference(miniscoping,[status(thm)],[f15]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ member(X0,X2)
| ~ member(X0,difference(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f20,plain,
! [B,C] :
( ( ! [D] :
( ~ member(D,C)
| ~ member(D,B) )
| intersect(B,C) )
& ( ? [D] :
( member(D,C)
& member(D,B) )
| ~ intersect(B,C) ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f21,plain,
( ! [B,C] :
( ! [D] :
( ~ member(D,C)
| ~ member(D,B) )
| intersect(B,C) )
& ! [B,C] :
( ? [D] :
( member(D,C)
& member(D,B) )
| ~ intersect(B,C) ) ),
inference(miniscoping,[status(thm)],[f20]) ).
fof(f22,plain,
( ! [B,C] :
( ! [D] :
( ~ member(D,C)
| ~ member(D,B) )
| intersect(B,C) )
& ! [B,C] :
( ( member(sK0_skl(C,B),C)
& member(sK0_skl(C,B),B) )
| ~ intersect(B,C) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B))],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f26,plain,
! [B,C] :
( ( intersect(B,C)
| disjoint(B,C) )
& ( ~ intersect(B,C)
| ~ disjoint(B,C) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f27,plain,
( ! [B,C] :
( intersect(B,C)
| disjoint(B,C) )
& ! [B,C] :
( ~ intersect(B,C)
| ~ disjoint(B,C) ) ),
inference(miniscoping,[status(thm)],[f26]) ).
fof(f29,plain,
! [X0,X1] :
( intersect(X0,X1)
| disjoint(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f27]) ).
fof(f40,plain,
? [B,C] : ~ disjoint(intersection(B,C),difference(B,C)),
inference(pre_NNF_transformation,[status(thm)],[f9]) ).
fof(f41,plain,
~ disjoint(intersection(sK2_skl,sK3_skl),difference(sK2_skl,sK3_skl)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(B,sK2_skl),skolemize(C,sK3_skl)],[f40]) ).
fof(f42,plain,
~ disjoint(intersection(sK2_skl,sK3_skl),difference(sK2_skl,sK3_skl)),
inference(cnf_transformation,[status(thm)],[f41]) ).
fof(f43,plain,
intersect(intersection(sK2_skl,sK3_skl),difference(sK2_skl,sK3_skl)),
inference(resolution,[status(thm)],[f29,f42]) ).
fof(f61,plain,
! [X0,X1,X2] :
( member(sK0_skl(X2,intersection(X0,X1)),X1)
| ~ intersect(intersection(X0,X1),X2) ),
inference(resolution,[status(thm)],[f23,f13]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ~ member(sK0_skl(difference(X1,X2),X0),X2)
| ~ intersect(X0,difference(X1,X2)) ),
inference(resolution,[status(thm)],[f24,f18]) ).
fof(f105,plain,
! [X0,X1,X2] :
( ~ intersect(intersection(X0,X1),difference(X2,X1))
| ~ intersect(intersection(X0,X1),difference(X2,X1)) ),
inference(resolution,[status(thm)],[f63,f61]) ).
fof(f111,plain,
! [X0,X1,X2] : ~ intersect(intersection(X0,X1),difference(X2,X1)),
inference(duplicate_literals_removal,[status(thm)],[f105]) ).
fof(f119,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f43,f111]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET629+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/10.38 % Computer : n018.cluster.edu
% 0.09/10.38 % Model : x86_64 x86_64
% 0.09/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/10.38 % Memory : 8046.5625MB
% 0.09/10.38 % OS : Linux 6.8.0-71-generic
% 0.09/10.38 % CPULimit : 300
% 0.09/10.38 % WCLimit : 300
% 0.09/10.38 % DateTime : Mon Sep 21 05:32:38 UTC 2026
% 0.09/10.38 % CPUTime :
% 0.09/10.39 % Drodi V4.1.1
% 0.14/10.42 % Refutation found
% 0.14/10.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/10.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/10.45 % Elapsed time: 0.056290 seconds
% 0.14/10.45 % CPU time: 0.162788 seconds
% 0.14/10.45 % Total memory used: 101.988 MB
% 0.14/10.45 % Net memory used: 101.538 MB
%------------------------------------------------------------------------------