%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU159+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 : n012.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:27 PM UTC 2026
% Result : Theorem 0.03s 0.32s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 10
% Syntax : Number of formulae : 59 ( 4 unt; 6 def)
% Number of atoms : 193 ( 50 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 210 ( 76 ~; 92 |; 28 &)
% ( 12 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 89 ( 79 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [A,B] : unordered_pair(A,B) = unordered_pair(B,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,conjecture,
! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
~ ! [A,B,C] :
( subset(unordered_pair(A,B),C)
<=> ( in(B,C)
& in(A,C) ) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f11,plain,
! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f12,plain,
! [A,B,C] :
( ( ? [D] :
( ( D = B
| D = A
| in(D,C) )
& ( ( D != B
& D != A )
| ~ in(D,C) ) )
| C = unordered_pair(A,B) )
& ( ! [D] :
( ( ( D != B
& D != A )
| in(D,C) )
& ( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f13,plain,
( ! [A,B,C] :
( ? [D] :
( ( D = B
| D = A
| in(D,C) )
& ( ( D != B
& D != A )
| ~ in(D,C) ) )
| C = unordered_pair(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ( D != B
& D != A )
| in(D,C) )
& ! [D] :
( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(miniscoping,[status(thm)],[f12]) ).
fof(f14,plain,
( ! [A,B,C] :
( ( ( sK0_skl(C,B,A) = B
| sK0_skl(C,B,A) = A
| in(sK0_skl(C,B,A),C) )
& ( ( sK0_skl(C,B,A) != B
& sK0_skl(C,B,A) != A )
| ~ in(sK0_skl(C,B,A),C) ) )
| C = unordered_pair(A,B) )
& ! [A,B,C] :
( ( ! [D] :
( ( D != B
& D != A )
| in(D,C) )
& ! [D] :
( D = B
| D = A
| ~ in(D,C) ) )
| C != unordered_pair(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(D,sK0_skl(C,B,A))],[f13]) ).
fof(f15,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| X3 = X1
| ~ in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f17,plain,
! [X0,X1,X2,X3] :
( X3 != X2
| in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f14]) ).
fof(f21,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,B)
| ~ in(C,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
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(sK1_skl(B,A),B)
& in(sK1_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,[sK1_skl]),skolemize(C,sK1_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(sK1_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f27,plain,
! [X0,X1] :
( ~ in(sK1_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f24]) ).
fof(f30,plain,
? [A,B,C] :
( subset(unordered_pair(A,B),C)
<~> ( in(B,C)
& in(A,C) ) ),
inference(pre_NNF_transformation,[status(thm)],[f8]) ).
fof(f31,plain,
? [A,B,C] :
( ( ~ in(B,C)
| ~ in(A,C)
| ~ subset(unordered_pair(A,B),C) )
& ( ( in(B,C)
& in(A,C) )
| subset(unordered_pair(A,B),C) ) ),
inference(NNF_transformation,[status(thm)],[f30]) ).
fof(f32,plain,
( ( ~ in(sK3_skl,sK4_skl)
| ~ in(sK2_skl,sK4_skl)
| ~ subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) )
& ( ( in(sK3_skl,sK4_skl)
& in(sK2_skl,sK4_skl) )
| subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl,sK4_skl]),skolemize(A,sK2_skl),skolemize(B,sK3_skl),skolemize(C,sK4_skl)],[f31]) ).
fof(f33,plain,
( in(sK2_skl,sK4_skl)
| subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ),
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f34,plain,
( in(sK3_skl,sK4_skl)
| subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ),
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f35,plain,
( ~ in(sK3_skl,sK4_skl)
| ~ in(sK2_skl,sK4_skl)
| ~ subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ),
inference(cnf_transformation,[status(thm)],[f32]) ).
fof(f36,definition,
( sQ0_spl
<=> subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f37,plain,
( ~ sQ0_spl
| subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f38,plain,
( sQ0_spl
| ~ subset(unordered_pair(sK2_skl,sK3_skl),sK4_skl) ),
inference(component_clause,[status(thm)],[f36]) ).
fof(f39,definition,
( sQ1_spl
<=> in(sK2_skl,sK4_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f41,plain,
( sQ1_spl
| ~ in(sK2_skl,sK4_skl) ),
inference(component_clause,[status(thm)],[f39]) ).
fof(f42,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f33,f36,f39]) ).
fof(f43,definition,
( sQ2_spl
<=> in(sK3_skl,sK4_skl) ),
introduced(definition,[new_symbols(definition,[sQ2_spl])],[split_symbol_definition]) ).
fof(f46,plain,
( sQ2_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f34,f36,f43]) ).
fof(f47,plain,
( ~ sQ2_spl
| ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f35,f36,f39,f43]) ).
fof(f48,plain,
! [X0,X1,X2] :
( X0 = X2
| X0 = X1
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f15]) ).
fof(f50,plain,
! [X0,X1] : in(X0,unordered_pair(X1,X0)),
inference(destructive_equality_resolution,[status(thm)],[f17]) ).
fof(f57,plain,
( ~ sQ0_spl
| subset(unordered_pair(sK3_skl,sK2_skl),sK4_skl) ),
inference(paramodulation,[status(thm)],[f11,f37]) ).
fof(f71,plain,
! [X0,X1,X2] :
( in(X1,X2)
| ~ subset(unordered_pair(X0,X1),X2) ),
inference(resolution,[status(thm)],[f25,f50]) ).
fof(f73,plain,
( ~ sQ0_spl
| in(sK2_skl,sK4_skl) ),
inference(resolution,[status(thm)],[f71,f57]) ).
fof(f74,plain,
( ~ sQ0_spl
| in(sK3_skl,sK4_skl) ),
inference(resolution,[status(thm)],[f71,f37]) ).
fof(f78,plain,
( ~ sQ0_spl
| sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f73,f41]) ).
fof(f79,plain,
( ~ sQ0_spl
| sQ1_spl ),
inference(contradiction_clause,[status(thm)],[f78]) ).
fof(f84,plain,
( sQ0_spl
| ~ subset(unordered_pair(sK3_skl,sK2_skl),sK4_skl) ),
inference(paramodulation,[status(thm)],[f11,f38]) ).
fof(f88,plain,
! [X0,X1,X2] :
( sK1_skl(X2,unordered_pair(X0,X1)) = X1
| sK1_skl(X2,unordered_pair(X0,X1)) = X0
| subset(unordered_pair(X0,X1),X2) ),
inference(resolution,[status(thm)],[f26,f48]) ).
fof(f102,plain,
( sQ0_spl
| sK1_skl(sK4_skl,unordered_pair(sK3_skl,sK2_skl)) = sK2_skl
| sK1_skl(sK4_skl,unordered_pair(sK3_skl,sK2_skl)) = sK3_skl ),
inference(resolution,[status(thm)],[f88,f84]) ).
fof(f109,definition,
( sQ3_spl
<=> sK1_skl(sK4_skl,unordered_pair(sK3_skl,sK2_skl)) = sK3_skl ),
introduced(definition,[new_symbols(definition,[sQ3_spl])],[split_symbol_definition]) ).
fof(f110,plain,
( ~ sQ3_spl
| sK1_skl(sK4_skl,unordered_pair(sK3_skl,sK2_skl)) = sK3_skl ),
inference(component_clause,[status(thm)],[f109]) ).
fof(f112,definition,
( sQ4_spl
<=> sK1_skl(sK4_skl,unordered_pair(sK3_skl,sK2_skl)) = sK2_skl ),
introduced(definition,[new_symbols(definition,[sQ4_spl])],[split_symbol_definition]) ).
fof(f113,plain,
( ~ sQ4_spl
| sK1_skl(sK4_skl,unordered_pair(sK3_skl,sK2_skl)) = sK2_skl ),
inference(component_clause,[status(thm)],[f112]) ).
fof(f115,plain,
( sQ0_spl
| sQ4_spl
| sQ3_spl ),
inference(split_clause,[status(thm)],[f102,f109,f112,f36]) ).
fof(f123,plain,
( ~ sQ0_spl
| sQ2_spl ),
inference(split_clause,[status(thm)],[f74,f43,f36]) ).
fof(f170,plain,
( ~ sQ3_spl
| ~ in(sK3_skl,sK4_skl)
| subset(unordered_pair(sK3_skl,sK2_skl),sK4_skl) ),
inference(paramodulation,[status(thm)],[f110,f27]) ).
fof(f172,definition,
( sQ7_spl
<=> subset(unordered_pair(sK3_skl,sK2_skl),sK4_skl) ),
introduced(definition,[new_symbols(definition,[sQ7_spl])],[split_symbol_definition]) ).
fof(f173,plain,
( ~ sQ7_spl
| subset(unordered_pair(sK3_skl,sK2_skl),sK4_skl) ),
inference(component_clause,[status(thm)],[f172]) ).
fof(f179,plain,
( ~ sQ3_spl
| ~ sQ2_spl
| sQ7_spl ),
inference(split_clause,[status(thm)],[f170,f172,f43,f109]) ).
fof(f184,plain,
( ~ sQ7_spl
| sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f173,f84]) ).
fof(f185,plain,
( ~ sQ7_spl
| sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f184]) ).
fof(f205,plain,
( ~ sQ4_spl
| ~ in(sK2_skl,sK4_skl)
| subset(unordered_pair(sK3_skl,sK2_skl),sK4_skl) ),
inference(paramodulation,[status(thm)],[f113,f27]) ).
fof(f211,plain,
( ~ sQ4_spl
| ~ sQ1_spl
| sQ7_spl ),
inference(split_clause,[status(thm)],[f205,f172,f39,f112]) ).
fof(f216,plain,
$false,
inference(sat_refutation,[status(thm)],[f42,f46,f47,f79,f115,f123,f179,f185,f211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SEU159+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.02 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.29 % Computer : n012.cluster.edu
% 0.03/0.29 % Model : x86_64 x86_64
% 0.03/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.29 % Memory : 8046.5625MB
% 0.03/0.29 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Mon Sep 21 05:53:06 UTC 2026
% 0.03/0.30 % CPUTime :
% 0.03/0.30 % Drodi V4.1.1
% 0.03/0.32 % Refutation found
% 0.03/0.32 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.03/0.32 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.33 % Elapsed time: 0.033954 seconds
% 0.08/0.33 % CPU time: 0.098359 seconds
% 0.08/0.33 % Total memory used: 102.304 MB
% 0.08/0.33 % Net memory used: 101.833 MB
%------------------------------------------------------------------------------