%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET014+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 : n010.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:08:50 PM UTC 2026
% Result : Theorem 0.15s 10.62s
% Output : CNFRefutation 0.15s
% 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 : 97 ( 36 ~; 37 |; 16 &)
% ( 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 : 58 ( 53 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( member(D,union(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(D,C)
& subset(B,C) )
=> subset(union(B,D),C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
~ ! [B,C,D] :
( ( subset(D,C)
& subset(B,C) )
=> subset(union(B,D),C) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,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(f9,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)],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] :
( member(X0,X2)
| member(X0,X1)
| ~ member(X0,union(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(union(B,D),C)
& subset(D,C)
& subset(B,C) ),
inference(pre_NNF_transformation,[status(thm)],[f7]) ).
fof(f30,plain,
( ~ subset(union(sK2_skl,sK4_skl),sK3_skl)
& subset(sK4_skl,sK3_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(sK4_skl,sK3_skl),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f33,plain,
~ subset(union(sK2_skl,sK4_skl),sK3_skl),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f46,plain,
! [X0] :
( member(X0,sK3_skl)
| ~ member(X0,sK4_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(f50,plain,
! [X0,X1,X2] :
( member(sK0_skl(X2,union(X0,X1)),X1)
| member(sK0_skl(X2,union(X0,X1)),X0)
| subset(union(X0,X1),X2) ),
inference(resolution,[status(thm)],[f18,f10]) ).
fof(f52,plain,
! [X0] :
( ~ member(sK0_skl(sK3_skl,X0),sK2_skl)
| subset(X0,sK3_skl) ),
inference(resolution,[status(thm)],[f19,f47]) ).
fof(f62,plain,
( member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK4_skl)
| member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK2_skl) ),
inference(resolution,[status(thm)],[f50,f33]) ).
fof(f66,definition,
( sQ0_spl
<=> member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK2_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f67,plain,
( ~ sQ0_spl
| member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK2_skl) ),
inference(component_clause,[status(thm)],[f66]) ).
fof(f69,definition,
( sQ1_spl
<=> member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK4_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f70,plain,
( ~ sQ1_spl
| member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK4_skl) ),
inference(component_clause,[status(thm)],[f69]) ).
fof(f72,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f62,f66,f69]) ).
fof(f83,plain,
( ~ sQ0_spl
| subset(union(sK2_skl,sK4_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f67,f52]) ).
fof(f84,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f83,f33]) ).
fof(f85,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f84]) ).
fof(f86,plain,
( ~ sQ1_spl
| member(sK0_skl(sK3_skl,union(sK2_skl,sK4_skl)),sK3_skl) ),
inference(resolution,[status(thm)],[f70,f46]) ).
fof(f87,plain,
( ~ sQ1_spl
| subset(union(sK2_skl,sK4_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f86,f19]) ).
fof(f88,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f87,f33]) ).
fof(f89,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f88]) ).
fof(f90,plain,
$false,
inference(sat_refutation,[status(thm)],[f72,f85,f89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET014+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/10.59 % Computer : n010.cluster.edu
% 0.11/10.59 % Model : x86_64 x86_64
% 0.11/10.59 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.59 % Memory : 8046.5625MB
% 0.11/10.59 % OS : Linux 6.8.0-71-generic
% 0.11/10.59 % CPULimit : 300
% 0.11/10.59 % WCLimit : 300
% 0.11/10.59 % DateTime : Mon Sep 21 04:42:22 UTC 2026
% 0.11/10.59 % CPUTime :
% 0.15/10.60 % Drodi V4.1.1
% 0.15/10.62 % Refutation found
% 0.15/10.62 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/10.62 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/10.64 % Elapsed time: 0.046948 seconds
% 0.15/10.64 % CPU time: 0.133595 seconds
% 0.15/10.64 % Total memory used: 73.192 MB
% 0.15/10.64 % Net memory used: 72.866 MB
%------------------------------------------------------------------------------