%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET925+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n001.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:59 PM UTC 2026
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 1 unt; 2 def)
% Number of atoms : 58 ( 20 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 56 ( 23 ~; 23 |; 4 &)
% ( 5 <=>; 0 =>; 0 <=; 1 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 20 ( 16 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,conjecture,
! [A,B] :
( set_difference(singleton(A),B) = empty_set
<=> in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ! [A,B] :
( set_difference(singleton(A),B) = empty_set
<=> in(A,B) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,axiom,
! [A,B] :
( set_difference(singleton(A),B) = empty_set
<=> in(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,plain,
? [A,B] :
( set_difference(singleton(A),B) = empty_set
<~> in(A,B) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f16,plain,
? [A,B] :
( ( ~ in(A,B)
| set_difference(singleton(A),B) != empty_set )
& ( in(A,B)
| set_difference(singleton(A),B) = empty_set ) ),
inference(NNF_transformation,[status(thm)],[f15]) ).
fof(f17,plain,
( ( ~ in(sK2_skl,sK3_skl)
| set_difference(singleton(sK2_skl),sK3_skl) != empty_set )
& ( in(sK2_skl,sK3_skl)
| set_difference(singleton(sK2_skl),sK3_skl) = empty_set ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2_skl,sK3_skl]),skolemize(A,sK2_skl),skolemize(B,sK3_skl)],[f16]) ).
fof(f18,plain,
( in(sK2_skl,sK3_skl)
| set_difference(singleton(sK2_skl),sK3_skl) = empty_set ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f19,plain,
( ~ in(sK2_skl,sK3_skl)
| set_difference(singleton(sK2_skl),sK3_skl) != empty_set ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f20,plain,
! [A,B] :
( ( ~ in(A,B)
| set_difference(singleton(A),B) = empty_set )
& ( in(A,B)
| set_difference(singleton(A),B) != empty_set ) ),
inference(NNF_transformation,[status(thm)],[f7]) ).
fof(f21,plain,
( ! [A,B] :
( ~ in(A,B)
| set_difference(singleton(A),B) = empty_set )
& ! [A,B] :
( in(A,B)
| set_difference(singleton(A),B) != empty_set ) ),
inference(miniscoping,[status(thm)],[f20]) ).
fof(f22,plain,
! [X0,X1] :
( in(X0,X1)
| set_difference(singleton(X0),X1) != empty_set ),
inference(cnf_transformation,[status(thm)],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ in(X0,X1)
| set_difference(singleton(X0),X1) = empty_set ),
inference(cnf_transformation,[status(thm)],[f21]) ).
fof(f24,definition,
( sQ0_spl
<=> set_difference(singleton(sK2_skl),sK3_skl) = empty_set ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f25,plain,
( ~ sQ0_spl
| set_difference(singleton(sK2_skl),sK3_skl) = empty_set ),
inference(component_clause,[status(thm)],[f24]) ).
fof(f26,plain,
( sQ0_spl
| set_difference(singleton(sK2_skl),sK3_skl) != empty_set ),
inference(component_clause,[status(thm)],[f24]) ).
fof(f27,definition,
( sQ1_spl
<=> in(sK2_skl,sK3_skl) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f28,plain,
( ~ sQ1_spl
| in(sK2_skl,sK3_skl) ),
inference(component_clause,[status(thm)],[f27]) ).
fof(f30,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f18,f24,f27]) ).
fof(f31,plain,
( ~ sQ1_spl
| ~ sQ0_spl ),
inference(split_clause,[status(thm)],[f19,f24,f27]) ).
fof(f33,plain,
( ~ sQ1_spl
| set_difference(singleton(sK2_skl),sK3_skl) = empty_set ),
inference(resolution,[status(thm)],[f23,f28]) ).
fof(f34,plain,
( ~ sQ1_spl
| sQ0_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f33,f26]) ).
fof(f35,plain,
( ~ sQ1_spl
| sQ0_spl ),
inference(contradiction_clause,[status(thm)],[f34]) ).
fof(f36,plain,
( ~ sQ0_spl
| in(sK2_skl,sK3_skl) ),
inference(resolution,[status(thm)],[f25,f22]) ).
fof(f38,plain,
( ~ sQ0_spl
| sQ1_spl ),
inference(split_clause,[status(thm)],[f36,f27,f24]) ).
fof(f43,plain,
$false,
inference(sat_refutation,[status(thm)],[f30,f31,f35,f38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET925+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n001.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:58 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.13/0.37 % Drodi V4.1.1
% 0.13/0.39 % Refutation found
% 0.13/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41 % Elapsed time: 0.049653 seconds
% 0.13/0.41 % CPU time: 0.133874 seconds
% 0.13/0.41 % Total memory used: 79.768 MB
% 0.13/0.41 % Net memory used: 79.197 MB
%------------------------------------------------------------------------------