%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET625+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 : n008.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.09s 0.39s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 6 unt; 0 def)
% Number of atoms : 95 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 105 ( 42 ~; 35 |; 21 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 65 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( 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(f3,axiom,
! [B,C] :
( intersect(B,C)
=> intersect(C,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
! [B,C,D] :
( ( subset(C,D)
& intersect(B,C) )
=> intersect(B,D) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ! [B,C,D] :
( ( subset(C,D)
& intersect(B,C) )
=> intersect(B,D) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,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)],[f1]) ).
fof(f8,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)],[f7]) ).
fof(f9,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))],[f8]) ).
fof(f10,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f9]) ).
fof(f12,plain,
! [X0,X1,X2] :
( ~ member(X2,X1)
| ~ member(X2,X0)
| intersect(X0,X1) ),
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(sK1_skl(C,B),C)
& member(sK1_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,[sK1_skl]),skolemize(D,sK1_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(f20,plain,
! [B,C] :
( intersect(C,B)
| ~ intersect(B,C) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f21,plain,
! [X0,X1] :
( intersect(X1,X0)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f20]) ).
fof(f23,plain,
? [B,C,D] :
( ~ intersect(B,D)
& subset(C,D)
& intersect(B,C) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f24,plain,
? [B,D] :
( ~ intersect(B,D)
& ? [C] :
( subset(C,D)
& intersect(B,C) ) ),
inference(miniscoping,[status(thm)],[f23]) ).
fof(f25,plain,
( ~ intersect(sK2_skl,sK3_skl)
& subset(sK4_skl,sK3_skl)
& intersect(sK2_skl,sK4_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl,sK4_skl]),skolemize(B,sK2_skl),skolemize(D,sK3_skl),skolemize(C,sK4_skl)],[f24]) ).
fof(f26,plain,
intersect(sK2_skl,sK4_skl),
inference(cnf_transformation,[status(thm)],[f25]) ).
fof(f27,plain,
subset(sK4_skl,sK3_skl),
inference(cnf_transformation,[status(thm)],[f25]) ).
fof(f28,plain,
~ intersect(sK2_skl,sK3_skl),
inference(cnf_transformation,[status(thm)],[f25]) ).
fof(f29,plain,
~ intersect(sK3_skl,sK2_skl),
inference(resolution,[status(thm)],[f21,f28]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ~ member(sK0_skl(X1,X0),X2)
| intersect(X2,X0)
| ~ intersect(X0,X1) ),
inference(resolution,[status(thm)],[f10,f12]) ).
fof(f45,plain,
! [X0,X1,X2] :
( member(sK0_skl(X1,X0),X2)
| ~ subset(X1,X2)
| ~ intersect(X0,X1) ),
inference(resolution,[status(thm)],[f11,f17]) ).
fof(f67,plain,
! [X0] :
( member(sK0_skl(sK4_skl,X0),sK3_skl)
| ~ intersect(X0,sK4_skl) ),
inference(resolution,[status(thm)],[f45,f27]) ).
fof(f77,plain,
! [X0] :
( intersect(sK3_skl,X0)
| ~ intersect(X0,sK4_skl)
| ~ intersect(X0,sK4_skl) ),
inference(resolution,[status(thm)],[f67,f32]) ).
fof(f84,plain,
! [X0] :
( intersect(sK3_skl,X0)
| ~ intersect(X0,sK4_skl) ),
inference(duplicate_literals_removal,[status(thm)],[f77]) ).
fof(f85,plain,
~ intersect(sK2_skl,sK4_skl),
inference(resolution,[status(thm)],[f84,f29]) ).
fof(f86,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f85,f26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET625+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/0.36 % Computer : n008.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:30:39 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 0.09/0.39 % Refutation found
% 0.09/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.41 % Elapsed time: 0.036937 seconds
% 0.09/0.41 % CPU time: 0.101224 seconds
% 0.09/0.41 % Total memory used: 13.137 MB
% 0.09/0.41 % Net memory used: 12.811 MB
%------------------------------------------------------------------------------