%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET095+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n018.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:09:18 PM UTC 2026
% Result : Theorem 0.17s 0.49s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 104 ( 28 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 112 ( 42 ~; 43 |; 20 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 76 ( 72 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( subclass(X,Y)
<=> ! [U] :
( member(U,X)
=> member(U,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,Y] :
( X = Y
<=> ( subclass(Y,X)
& subclass(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [U,X,Y] :
( member(U,unordered_pair(X,Y))
<=> ( ( U = Y
| U = X )
& member(U,universal_class) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [X] : singleton(X) = unordered_pair(X,X),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f44,conjecture,
! [X,Y] :
( member(X,Y)
=> subclass(singleton(X),Y) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [X,Y] :
( member(X,Y)
=> subclass(singleton(X),Y) ),
inference(negated_conjecture,[status(cth)],[f44]) ).
fof(f46,plain,
! [X,Y] :
( subclass(X,Y)
<=> ! [U] :
( member(U,Y)
| ~ member(U,X) ) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f47,plain,
! [X,Y] :
( ( ? [U] :
( ~ member(U,Y)
& member(U,X) )
| subclass(X,Y) )
& ( ! [U] :
( member(U,Y)
| ~ member(U,X) )
| ~ subclass(X,Y) ) ),
inference(NNF_transformation,[status(thm)],[f46]) ).
fof(f48,plain,
( ! [X,Y] :
( ? [U] :
( ~ member(U,Y)
& member(U,X) )
| subclass(X,Y) )
& ! [X,Y] :
( ! [U] :
( member(U,Y)
| ~ member(U,X) )
| ~ subclass(X,Y) ) ),
inference(miniscoping,[status(thm)],[f47]) ).
fof(f49,plain,
( ! [X,Y] :
( ( ~ member(sK0_skl(Y,X),Y)
& member(sK0_skl(Y,X),X) )
| subclass(X,Y) )
& ! [X,Y] :
( ! [U] :
( member(U,Y)
| ~ member(U,X) )
| ~ subclass(X,Y) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(U,sK0_skl(Y,X))],[f48]) ).
fof(f50,plain,
! [X0,X1,X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f49]) ).
fof(f51,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X0)
| subclass(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f49]) ).
fof(f52,plain,
! [X0,X1] :
( ~ member(sK0_skl(X1,X0),X1)
| subclass(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f49]) ).
fof(f54,plain,
! [X,Y] :
( ( ~ subclass(Y,X)
| ~ subclass(X,Y)
| X = Y )
& ( ( subclass(Y,X)
& subclass(X,Y) )
| X != Y ) ),
inference(NNF_transformation,[status(thm)],[f3]) ).
fof(f55,plain,
( ! [X,Y] :
( ~ subclass(Y,X)
| ~ subclass(X,Y)
| X = Y )
& ! [X,Y] :
( ( subclass(Y,X)
& subclass(X,Y) )
| X != Y ) ),
inference(miniscoping,[status(thm)],[f54]) ).
fof(f56,plain,
! [X0,X1] :
( subclass(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[status(thm)],[f55]) ).
fof(f59,plain,
! [U,X,Y] :
( ( ( U != Y
& U != X )
| ~ member(U,universal_class)
| member(U,unordered_pair(X,Y)) )
& ( ( ( U = Y
| U = X )
& member(U,universal_class) )
| ~ member(U,unordered_pair(X,Y)) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f60,plain,
( ! [U,X,Y] :
( ( U != Y
& U != X )
| ~ member(U,universal_class)
| member(U,unordered_pair(X,Y)) )
& ! [U,X,Y] :
( ( ( U = Y
| U = X )
& member(U,universal_class) )
| ~ member(U,unordered_pair(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f59]) ).
fof(f62,plain,
! [X0,X1,X2] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f60]) ).
fof(f66,plain,
! [X0] : singleton(X0) = unordered_pair(X0,X0),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f191,plain,
? [X,Y] :
( ~ subclass(singleton(X),Y)
& member(X,Y) ),
inference(pre_NNF_transformation,[status(thm)],[f45]) ).
fof(f192,plain,
( ~ subclass(singleton(sK7_skl),sK8_skl)
& member(sK7_skl,sK8_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl,sK8_skl]),skolemize(X,sK7_skl),skolemize(Y,sK8_skl)],[f191]) ).
fof(f193,plain,
member(sK7_skl,sK8_skl),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f194,plain,
~ subclass(singleton(sK7_skl),sK8_skl),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f195,plain,
! [X0] : subclass(X0,X0),
inference(destructive_equality_resolution,[status(thm)],[f56]) ).
fof(f213,plain,
! [X0,X1,X2,X3] :
( ~ member(X0,X3)
| ~ subclass(X3,unordered_pair(X1,X2))
| X0 = X2
| X0 = X1 ),
inference(resolution,[status(thm)],[f62,f50]) ).
fof(f225,plain,
! [X0,X1,X2] :
( ~ member(X0,X2)
| ~ subclass(X2,singleton(X1))
| X0 = X1
| X0 = X1 ),
inference(paramodulation,[status(thm)],[f66,f213]) ).
fof(f226,plain,
! [X0,X1,X2] :
( ~ member(X0,X2)
| ~ subclass(X2,singleton(X1))
| X0 = X1 ),
inference(duplicate_literals_removal,[status(thm)],[f225]) ).
fof(f228,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(resolution,[status(thm)],[f226,f195]) ).
fof(f229,plain,
! [X0,X1] :
( subclass(singleton(X1),X0)
| sK0_skl(X0,singleton(X1)) = X1 ),
inference(resolution,[status(thm)],[f228,f51]) ).
fof(f231,plain,
sK0_skl(sK8_skl,singleton(sK7_skl)) = sK7_skl,
inference(resolution,[status(thm)],[f229,f194]) ).
fof(f265,plain,
( ~ member(sK7_skl,sK8_skl)
| subclass(singleton(sK7_skl),sK8_skl) ),
inference(paramodulation,[status(thm)],[f231,f52]) ).
fof(f269,plain,
~ member(sK7_skl,sK8_skl),
inference(forward_subsumption_resolution,[status(thm)],[f265,f194]) ).
fof(f271,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f269,f193]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET095+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.07 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n018.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 04:54:29 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.47 % Drodi V4.1.1
% 0.17/0.49 % Refutation found
% 0.17/0.49 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.49 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.54 % Elapsed time: 0.086971 seconds
% 0.17/0.54 % CPU time: 0.141561 seconds
% 0.17/0.54 % Total memory used: 39.780 MB
% 0.17/0.54 % Net memory used: 39.692 MB
%------------------------------------------------------------------------------