%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU128+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n007.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:19:18 PM UTC 2026
% Result : Theorem 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 39 ( 6 unt; 2 def)
% Number of atoms : 133 ( 8 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 149 ( 55 ~; 57 |; 28 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 75 ( 68 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] :
( C = set_intersection2(A,B)
<=> ! [D] :
( in(D,C)
<=> ( in(D,B)
& in(D,A) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A,B,C] :
( ( subset(A,C)
& subset(A,B) )
=> subset(A,set_intersection2(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,C)
& subset(A,B) )
=> subset(A,set_intersection2(B,C)) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f21,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,B)
| ~ in(C,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f22,plain,
! [A,B] :
( ( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f21]) ).
fof(f23,plain,
( ! [A,B] :
( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ! [A,B] :
( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(miniscoping,[status(thm)],[f22]) ).
fof(f24,plain,
( ! [A,B] :
( ( ~ in(sK0_skl(B,A),B)
& in(sK0_skl(B,A),A) )
| subset(A,B) )
& ! [A,B] :
( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f23]) ).
fof(f25,plain,
! [X0,X1,X2] :
( in(X2,X1)
| ~ in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f26,plain,
! [X0,X1] :
( in(sK0_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f27,plain,
! [X0,X1] :
( ~ in(sK0_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f28,plain,
! [A,B,C] :
( ( ? [D] :
( ( ( in(D,B)
& in(D,A) )
| in(D,C) )
& ( ~ in(D,B)
| ~ in(D,A)
| ~ in(D,C) ) )
| C = set_intersection2(A,B) )
& ( ! [D] :
( ( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f29,plain,
( ! [A,B,C] :
( ? [D] :
( ( ( in(D,B)
& in(D,A) )
| in(D,C) )
& ( ~ in(D,B)
| ~ in(D,A)
| ~ in(D,C) ) )
| C = set_intersection2(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ! [D] :
( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(miniscoping,[status(thm)],[f28]) ).
fof(f30,plain,
( ! [A,B,C] :
( ( ( ( in(sK1_skl(C,B,A),B)
& in(sK1_skl(C,B,A),A) )
| in(sK1_skl(C,B,A),C) )
& ( ~ in(sK1_skl(C,B,A),B)
| ~ in(sK1_skl(C,B,A),A)
| ~ in(sK1_skl(C,B,A),C) ) )
| C = set_intersection2(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ~ in(D,B)
| ~ in(D,A)
| in(D,C) )
& ! [D] :
( ( in(D,B)
& in(D,A) )
| ~ in(D,C) ) )
| C != set_intersection2(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(D,sK1_skl(C,B,A))],[f29]) ).
fof(f33,plain,
! [X0,X1,X2,X3] :
( ~ in(X3,X2)
| ~ in(X3,X1)
| in(X3,X0)
| X0 != set_intersection2(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f30]) ).
fof(f46,plain,
? [A,B,C] :
( ~ subset(A,set_intersection2(B,C))
& subset(A,C)
& subset(A,B) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f47,plain,
( ~ subset(sK4_skl,set_intersection2(sK5_skl,sK6_skl))
& subset(sK4_skl,sK6_skl)
& subset(sK4_skl,sK5_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4_skl,sK5_skl,sK6_skl]),skolemize(A,sK4_skl),skolemize(B,sK5_skl),skolemize(C,sK6_skl)],[f46]) ).
fof(f48,plain,
subset(sK4_skl,sK5_skl),
inference(cnf_transformation,[status(thm)],[f47]) ).
fof(f49,plain,
subset(sK4_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f47]) ).
fof(f50,plain,
~ subset(sK4_skl,set_intersection2(sK5_skl,sK6_skl)),
inference(cnf_transformation,[status(thm)],[f47]) ).
fof(f62,plain,
! [X0,X1,X2] :
( ~ in(X0,X2)
| ~ in(X0,X1)
| in(X0,set_intersection2(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f33]) ).
fof(f70,plain,
! [X0] :
( in(X0,sK6_skl)
| ~ in(X0,sK4_skl) ),
inference(resolution,[status(thm)],[f25,f49]) ).
fof(f71,plain,
! [X0] :
( in(X0,sK5_skl)
| ~ in(X0,sK4_skl) ),
inference(resolution,[status(thm)],[f25,f48]) ).
fof(f111,plain,
! [X0,X1,X2] :
( subset(X2,set_intersection2(X0,X1))
| ~ in(sK0_skl(set_intersection2(X0,X1),X2),X1)
| ~ in(sK0_skl(set_intersection2(X0,X1),X2),X0) ),
inference(resolution,[status(thm)],[f62,f27]) ).
fof(f256,plain,
( ~ in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK6_skl)
| ~ in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK5_skl) ),
inference(resolution,[status(thm)],[f111,f50]) ).
fof(f269,definition,
( sQ9_spl
<=> in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK5_skl) ),
introduced(definition,[new_symbols(definition,[sQ9_spl])],[split_symbol_definition]) ).
fof(f271,plain,
( sQ9_spl
| ~ in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK5_skl) ),
inference(component_clause,[status(thm)],[f269]) ).
fof(f272,definition,
( sQ10_spl
<=> in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK6_skl) ),
introduced(definition,[new_symbols(definition,[sQ10_spl])],[split_symbol_definition]) ).
fof(f274,plain,
( sQ10_spl
| ~ in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK6_skl) ),
inference(component_clause,[status(thm)],[f272]) ).
fof(f275,plain,
( ~ sQ10_spl
| ~ sQ9_spl ),
inference(split_clause,[status(thm)],[f256,f269,f272]) ).
fof(f543,plain,
( sQ9_spl
| ~ in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK4_skl) ),
inference(resolution,[status(thm)],[f271,f71]) ).
fof(f544,plain,
( sQ9_spl
| subset(sK4_skl,set_intersection2(sK5_skl,sK6_skl)) ),
inference(resolution,[status(thm)],[f543,f26]) ).
fof(f545,plain,
( sQ9_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f544,f50]) ).
fof(f546,plain,
sQ9_spl,
inference(contradiction_clause,[status(thm)],[f545]) ).
fof(f547,plain,
( sQ10_spl
| ~ in(sK0_skl(set_intersection2(sK5_skl,sK6_skl),sK4_skl),sK4_skl) ),
inference(resolution,[status(thm)],[f274,f70]) ).
fof(f549,plain,
( sQ10_spl
| subset(sK4_skl,set_intersection2(sK5_skl,sK6_skl)) ),
inference(resolution,[status(thm)],[f547,f26]) ).
fof(f550,plain,
( sQ10_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f549,f50]) ).
fof(f551,plain,
sQ10_spl,
inference(contradiction_clause,[status(thm)],[f550]) ).
fof(f552,plain,
$false,
inference(sat_refutation,[status(thm)],[f275,f546,f551]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU128+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n007.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 21 05:49:51 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.14/0.37 % Drodi V4.1.1
% 0.14/0.44 % Refutation found
% 0.14/0.44 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.47 % Elapsed time: 0.098848 seconds
% 0.14/0.47 % CPU time: 0.547996 seconds
% 0.14/0.47 % Total memory used: 109.099 MB
% 0.14/0.47 % Net memory used: 107.842 MB
%------------------------------------------------------------------------------