%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n020.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:11 PM UTC 2026
% Result : Theorem 0.19s 0.65s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 35 ( 10 unt; 0 def)
% Number of atoms : 102 ( 32 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 106 ( 39 ~; 35 |; 25 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 60 ( 54 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] :
( subclass(X,Y)
<=> ! [U] :
( member(U,X)
=> member(U,Y) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [X] : subclass(X,universal_class),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p') ).
fof(f41,axiom,
! [X] :
( X != null_class
=> ? [U] :
( disjoint(U,X)
& member(U,X)
& member(U,universal_class) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,conjecture,
! [X,Y] :
( ( ~ member(Y,universal_class)
& ~ member(X,universal_class) )
=> unordered_pair(X,Y) = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [X,Y] :
( ( ~ member(Y,universal_class)
& ~ member(X,universal_class) )
=> unordered_pair(X,Y) = null_class ),
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(f53,plain,
! [X0] : subclass(X0,universal_class),
inference(cnf_transformation,[status(thm)],[f2]) ).
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(f181,plain,
! [X] :
( ? [U] :
( disjoint(U,X)
& member(U,X)
& member(U,universal_class) )
| X = null_class ),
inference(pre_NNF_transformation,[status(thm)],[f41]) ).
fof(f182,plain,
! [X] :
( ( disjoint(sK5_skl(X),X)
& member(sK5_skl(X),X)
& member(sK5_skl(X),universal_class) )
| X = null_class ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl]),skolemize(U,sK5_skl(X))],[f181]) ).
fof(f183,plain,
! [X0] :
( member(sK5_skl(X0),universal_class)
| X0 = null_class ),
inference(cnf_transformation,[status(thm)],[f182]) ).
fof(f184,plain,
! [X0] :
( member(sK5_skl(X0),X0)
| X0 = null_class ),
inference(cnf_transformation,[status(thm)],[f182]) ).
fof(f191,plain,
? [X,Y] :
( unordered_pair(X,Y) != null_class
& ~ member(Y,universal_class)
& ~ member(X,universal_class) ),
inference(pre_NNF_transformation,[status(thm)],[f45]) ).
fof(f192,plain,
( unordered_pair(sK7_skl,sK8_skl) != null_class
& ~ member(sK8_skl,universal_class)
& ~ member(sK7_skl,universal_class) ),
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,universal_class),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f194,plain,
~ member(sK8_skl,universal_class),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f195,plain,
unordered_pair(sK7_skl,sK8_skl) != null_class,
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f206,plain,
! [X0,X1] :
( member(X0,universal_class)
| ~ member(X0,X1) ),
inference(resolution,[status(thm)],[f50,f53]) ).
fof(f298,plain,
! [X0,X1] :
( sK5_skl(unordered_pair(X0,X1)) = X1
| sK5_skl(unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = null_class ),
inference(resolution,[status(thm)],[f184,f62]) ).
fof(f302,plain,
! [X0] : ~ member(sK8_skl,X0),
inference(resolution,[status(thm)],[f206,f194]) ).
fof(f303,plain,
! [X0] : ~ member(sK7_skl,X0),
inference(resolution,[status(thm)],[f206,f193]) ).
fof(f419,plain,
( sK5_skl(unordered_pair(sK7_skl,sK8_skl)) = sK8_skl
| sK5_skl(unordered_pair(sK7_skl,sK8_skl)) = sK7_skl ),
inference(resolution,[status(thm)],[f298,f195]) ).
fof(f527,plain,
( sK5_skl(unordered_pair(sK7_skl,sK8_skl)) = sK7_skl
| member(sK8_skl,universal_class)
| unordered_pair(sK7_skl,sK8_skl) = null_class ),
inference(paramodulation,[status(thm)],[f419,f183]) ).
fof(f532,plain,
( sK5_skl(unordered_pair(sK7_skl,sK8_skl)) = sK7_skl
| member(sK8_skl,universal_class) ),
inference(forward_subsumption_resolution,[status(thm)],[f527,f195]) ).
fof(f588,plain,
sK5_skl(unordered_pair(sK7_skl,sK8_skl)) = sK7_skl,
inference(forward_subsumption_resolution,[status(thm)],[f532,f302]) ).
fof(f592,plain,
( member(sK7_skl,universal_class)
| unordered_pair(sK7_skl,sK8_skl) = null_class ),
inference(paramodulation,[status(thm)],[f588,f183]) ).
fof(f599,plain,
member(sK7_skl,universal_class),
inference(forward_subsumption_resolution,[status(thm)],[f592,f195]) ).
fof(f602,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f599,f303]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET071+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.61 % Computer : n020.cluster.edu
% 0.13/0.61 % Model : x86_64 x86_64
% 0.13/0.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.61 % Memory : 8046.5625MB
% 0.13/0.61 % OS : Linux 6.8.0-71-generic
% 0.13/0.61 % CPULimit : 300
% 0.13/0.61 % WCLimit : 300
% 0.13/0.61 % DateTime : Mon Sep 21 04:50:34 UTC 2026
% 0.13/0.61 % CPUTime :
% 0.19/0.64 % Drodi V4.1.1
% 0.19/0.65 % Refutation found
% 0.19/0.65 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.19/0.65 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.72 % Elapsed time: 0.097028 seconds
% 0.19/0.72 % CPU time: 0.146717 seconds
% 0.19/0.72 % Total memory used: 23.524 MB
% 0.19/0.72 % Net memory used: 23.483 MB
%------------------------------------------------------------------------------