%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET884+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.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:54 PM UTC 2026
% Result : Theorem 0.14s 0.38s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 39 ( 8 unt; 2 def)
% Number of atoms : 157 ( 78 equ)
% Maximal formula atoms : 14 ( 4 avg)
% Number of connectives : 193 ( 75 ~; 69 |; 40 &)
% ( 8 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 95 ( 83 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [A,B] :
( B = singleton(A)
<=> ! [C] :
( in(C,B)
<=> C = A ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [A,B,C] :
( C = unordered_pair(A,B)
<=> ! [D] :
( in(D,C)
<=> ( D = B
| D = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,conjecture,
! [A,B,C] :
~ ( A != C
& A != B
& subset(singleton(A),unordered_pair(B,C)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f10,negated_conjecture,
~ ! [A,B,C] :
~ ( A != C
& A != B
& subset(singleton(A),unordered_pair(B,C)) ),
inference(negated_conjecture,[status(cth)],[f9]) ).
fof(f14,plain,
! [A,B] :
( ( ? [C] :
( ( C = A
| in(C,B) )
& ( C != A
| ~ in(C,B) ) )
| B = singleton(A) )
& ( ! [C] :
( ( C != A
| in(C,B) )
& ( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f15,plain,
( ! [A,B] :
( ? [C] :
( ( C = A
| in(C,B) )
& ( C != A
| ~ in(C,B) ) )
| B = singleton(A) )
& ! [A,B] :
( ( ! [C] :
( C != A
| in(C,B) )
& ! [C] :
( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(miniscoping,[status(thm)],[f14]) ).
fof(f16,plain,
( ! [A,B] :
( ( ( sK0_skl(B,A) = A
| in(sK0_skl(B,A),B) )
& ( sK0_skl(B,A) != A
| ~ in(sK0_skl(B,A),B) ) )
| B = singleton(A) )
& ! [A,B] :
( ( ! [C] :
( C != A
| in(C,B) )
& ! [C] :
( C = A
| ~ in(C,B) ) )
| B != singleton(A) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(C,sK0_skl(B,A))],[f15]) ).
fof(f18,plain,
! [X0,X1,X2] :
( X2 != X1
| in(X2,X0)
| X0 != singleton(X1) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f21,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)],[f4]) ).
fof(f22,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)],[f21]) ).
fof(f23,plain,
( ! [A,B,C] :
( ( ( sK1_skl(C,B,A) = B
| sK1_skl(C,B,A) = A
| in(sK1_skl(C,B,A),C) )
& ( ( sK1_skl(C,B,A) != B
& sK1_skl(C,B,A) != A )
| ~ in(sK1_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,[sK1_skl]),skolemize(D,sK1_skl(C,B,A))],[f22]) ).
fof(f24,plain,
! [X0,X1,X2,X3] :
( X3 = X2
| X3 = X1
| ~ in(X3,X0)
| X0 != unordered_pair(X1,X2) ),
inference(cnf_transformation,[status(thm)],[f23]) ).
fof(f30,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,B)
| ~ in(C,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f5]) ).
fof(f31,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)],[f30]) ).
fof(f32,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)],[f31]) ).
fof(f33,plain,
( ! [A,B] :
( ( ~ in(sK2_skl(B,A),B)
& in(sK2_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,[sK2_skl]),skolemize(C,sK2_skl(B,A))],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( in(X2,X1)
| ~ in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f43,plain,
? [A,B,C] :
( A != C
& A != B
& subset(singleton(A),unordered_pair(B,C)) ),
inference(pre_NNF_transformation,[status(thm)],[f10]) ).
fof(f44,plain,
? [A,C] :
( A != C
& ? [B] :
( A != B
& subset(singleton(A),unordered_pair(B,C)) ) ),
inference(miniscoping,[status(thm)],[f43]) ).
fof(f45,plain,
( sK5_skl != sK6_skl
& sK5_skl != sK7_skl
& subset(singleton(sK5_skl),unordered_pair(sK7_skl,sK6_skl)) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl,sK6_skl,sK7_skl]),skolemize(A,sK5_skl),skolemize(C,sK6_skl),skolemize(B,sK7_skl)],[f44]) ).
fof(f46,plain,
subset(singleton(sK5_skl),unordered_pair(sK7_skl,sK6_skl)),
inference(cnf_transformation,[status(thm)],[f45]) ).
fof(f47,plain,
sK5_skl != sK7_skl,
inference(cnf_transformation,[status(thm)],[f45]) ).
fof(f48,plain,
sK5_skl != sK6_skl,
inference(cnf_transformation,[status(thm)],[f45]) ).
fof(f50,plain,
! [X0] : in(X0,singleton(X0)),
inference(destructive_equality_resolution,[status(thm)],[f18]) ).
fof(f51,plain,
! [X0,X1,X2] :
( X0 = X2
| X0 = X1
| ~ in(X0,unordered_pair(X1,X2)) ),
inference(destructive_equality_resolution,[status(thm)],[f24]) ).
fof(f69,plain,
! [X0,X1] :
( in(X0,X1)
| ~ subset(singleton(X0),X1) ),
inference(resolution,[status(thm)],[f34,f50]) ).
fof(f70,plain,
in(sK5_skl,unordered_pair(sK7_skl,sK6_skl)),
inference(resolution,[status(thm)],[f69,f46]) ).
fof(f72,plain,
( sK5_skl = sK6_skl
| sK5_skl = sK7_skl ),
inference(resolution,[status(thm)],[f70,f51]) ).
fof(f74,definition,
( sQ0_spl
<=> sK5_skl = sK7_skl ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f75,plain,
( ~ sQ0_spl
| sK5_skl = sK7_skl ),
inference(component_clause,[status(thm)],[f74]) ).
fof(f77,definition,
( sQ1_spl
<=> sK5_skl = sK6_skl ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f78,plain,
( ~ sQ1_spl
| sK5_skl = sK6_skl ),
inference(component_clause,[status(thm)],[f77]) ).
fof(f80,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f72,f74,f77]) ).
fof(f81,plain,
( ~ sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f75,f47]) ).
fof(f82,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f81]) ).
fof(f83,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f78,f48]) ).
fof(f84,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f83]) ).
fof(f85,plain,
$false,
inference(sat_refutation,[status(thm)],[f80,f82,f84]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET884+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n002.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 05:45:32 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.14/0.38 % Drodi V4.1.1
% 0.14/0.38 % Refutation found
% 0.14/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/0.40 % Elapsed time: 0.033499 seconds
% 0.14/0.40 % CPU time: 0.070546 seconds
% 0.14/0.40 % Total memory used: 6.367 MB
% 0.14/0.40 % Net memory used: 6.359 MB
%------------------------------------------------------------------------------