%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET071-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n006.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 : Unsatisfiable 0.18s 0.55s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 12
% Syntax : Number of formulae : 43 ( 14 unt; 5 def)
% Number of atoms : 83 ( 23 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 73 ( 33 ~; 35 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 28 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y,U] :
( member(U,Y)
| ~ member(U,X)
| ~ subclass(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X] : subclass(X,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,axiom,
! [U,X,Y] :
( U = Y
| U = X
| ~ member(U,unordered_pair(X,Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f66,axiom,
! [X] :
( member(regular(X),X)
| X = null_class ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f92,negated_conjecture,
unordered_pair(x,y) != null_class,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f93,negated_conjecture,
~ member(x,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f94,negated_conjecture,
~ member(y,universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f95,plain,
! [Y,U] :
( member(U,Y)
| ! [X] :
( ~ member(U,X)
| ~ subclass(X,Y) ) ),
inference(miniscoping,[status(thm)],[f1]) ).
fof(f96,plain,
! [X0,X1,X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subclass(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f95]) ).
fof(f99,plain,
! [X0] : subclass(X0,universal_class),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f103,plain,
! [U,Y] :
( U = Y
| ! [X] :
( U = X
| ~ member(U,unordered_pair(X,Y)) ) ),
inference(miniscoping,[status(thm)],[f8]) ).
fof(f104,plain,
! [X0,X1,X2] :
( X0 = X2
| X0 = X1
| ~ member(X0,unordered_pair(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f103]) ).
fof(f169,plain,
! [X0] :
( member(regular(X0),X0)
| X0 = null_class ),
inference(cnf_transformation,[status(thm)],[f66]) ).
fof(f200,plain,
unordered_pair(x,y) != null_class,
inference(cnf_transformation,[status(thm)],[f92]) ).
fof(f201,plain,
~ member(x,universal_class),
inference(cnf_transformation,[status(thm)],[f93]) ).
fof(f202,plain,
~ member(y,universal_class),
inference(cnf_transformation,[status(thm)],[f94]) ).
fof(f237,plain,
! [X0,X1] :
( member(X0,universal_class)
| ~ member(X0,X1) ),
inference(resolution,[status(thm)],[f96,f99]) ).
fof(f333,plain,
! [X0,X1] :
( regular(unordered_pair(X0,X1)) = X1
| regular(unordered_pair(X0,X1)) = X0
| unordered_pair(X0,X1) = null_class ),
inference(resolution,[status(thm)],[f169,f104]) ).
fof(f570,plain,
( regular(unordered_pair(x,y)) = y
| regular(unordered_pair(x,y)) = x ),
inference(resolution,[status(thm)],[f333,f200]) ).
fof(f584,definition,
( sQ14_spl
<=> regular(unordered_pair(x,y)) = x ),
introduced(definition,[new_symbols(definition,[sQ14_spl])],[split_symbol_definition]) ).
fof(f585,plain,
( ~ sQ14_spl
| regular(unordered_pair(x,y)) = x ),
inference(component_clause,[status(thm)],[f584]) ).
fof(f587,definition,
( sQ15_spl
<=> regular(unordered_pair(x,y)) = y ),
introduced(definition,[new_symbols(definition,[sQ15_spl])],[split_symbol_definition]) ).
fof(f588,plain,
( ~ sQ15_spl
| regular(unordered_pair(x,y)) = y ),
inference(component_clause,[status(thm)],[f587]) ).
fof(f590,plain,
( sQ15_spl
| sQ14_spl ),
inference(split_clause,[status(thm)],[f570,f584,f587]) ).
fof(f615,plain,
! [X0] : ~ member(y,X0),
inference(resolution,[status(thm)],[f237,f202]) ).
fof(f616,plain,
! [X0] : ~ member(x,X0),
inference(resolution,[status(thm)],[f237,f201]) ).
fof(f693,plain,
( ~ sQ14_spl
| member(x,unordered_pair(x,y))
| unordered_pair(x,y) = null_class ),
inference(paramodulation,[status(thm)],[f585,f169]) ).
fof(f698,definition,
( sQ31_spl
<=> unordered_pair(x,y) = null_class ),
introduced(definition,[new_symbols(definition,[sQ31_spl])],[split_symbol_definition]) ).
fof(f699,plain,
( ~ sQ31_spl
| unordered_pair(x,y) = null_class ),
inference(component_clause,[status(thm)],[f698]) ).
fof(f701,definition,
( sQ32_spl
<=> member(x,unordered_pair(x,y)) ),
introduced(definition,[new_symbols(definition,[sQ32_spl])],[split_symbol_definition]) ).
fof(f702,plain,
( ~ sQ32_spl
| member(x,unordered_pair(x,y)) ),
inference(component_clause,[status(thm)],[f701]) ).
fof(f704,plain,
( ~ sQ14_spl
| sQ32_spl
| sQ31_spl ),
inference(split_clause,[status(thm)],[f693,f698,f701,f584]) ).
fof(f705,plain,
( ~ sQ32_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f702,f616]) ).
fof(f706,plain,
~ sQ32_spl,
inference(contradiction_clause,[status(thm)],[f705]) ).
fof(f707,plain,
( ~ sQ31_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f699,f200]) ).
fof(f708,plain,
~ sQ31_spl,
inference(contradiction_clause,[status(thm)],[f707]) ).
fof(f710,plain,
( ~ sQ15_spl
| member(y,unordered_pair(x,y))
| unordered_pair(x,y) = null_class ),
inference(paramodulation,[status(thm)],[f588,f169]) ).
fof(f715,definition,
( sQ34_spl
<=> member(y,unordered_pair(x,y)) ),
introduced(definition,[new_symbols(definition,[sQ34_spl])],[split_symbol_definition]) ).
fof(f716,plain,
( ~ sQ34_spl
| member(y,unordered_pair(x,y)) ),
inference(component_clause,[status(thm)],[f715]) ).
fof(f718,plain,
( ~ sQ15_spl
| sQ34_spl
| sQ31_spl ),
inference(split_clause,[status(thm)],[f710,f698,f715,f587]) ).
fof(f719,plain,
( ~ sQ34_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f716,f615]) ).
fof(f720,plain,
~ sQ34_spl,
inference(contradiction_clause,[status(thm)],[f719]) ).
fof(f721,plain,
$false,
inference(sat_refutation,[status(thm)],[f590,f704,f706,f708,f718,f720]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET071-6 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46 % Computer : n006.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 04:49:42 UTC 2026
% 0.18/0.47 % CPUTime :
% 0.18/0.51 % Drodi V4.1.1
% 0.18/0.55 % Refutation found
% 0.18/0.55 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.18/0.55 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.22/0.61 % Elapsed time: 0.128183 seconds
% 0.22/0.61 % CPU time: 0.230651 seconds
% 0.22/0.61 % Total memory used: 34.598 MB
% 0.22/0.61 % Net memory used: 34.482 MB
%------------------------------------------------------------------------------