%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET117+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 : n004.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:24 PM UTC 2026
% Result : Theorem 0.13s 0.40s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 12 unt; 0 def)
% Number of atoms : 49 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 44 ( 18 ~; 13 |; 8 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 42 ( 39 !; 3 ?)
% 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(f5,axiom,
! [X,Y] : member(unordered_pair(X,Y),universal_class),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X,Y] : ordered_pair(X,Y) = unordered_pair(singleton(X),unordered_pair(X,singleton(Y))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f44,conjecture,
! [X] :
( ordered_pair(first(X),second(X)) = X
=> member(X,universal_class) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f45,negated_conjecture,
~ ! [X] :
( ordered_pair(first(X),second(X)) = X
=> member(X,universal_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(f65,plain,
! [X0,X1] : member(unordered_pair(X0,X1),universal_class),
inference(cnf_transformation,[status(thm)],[f5]) ).
fof(f67,plain,
! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(singleton(X0),unordered_pair(X0,singleton(X1))),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f191,plain,
? [X] :
( ~ member(X,universal_class)
& ordered_pair(first(X),second(X)) = X ),
inference(pre_NNF_transformation,[status(thm)],[f45]) ).
fof(f192,plain,
( ~ member(sK7_skl,universal_class)
& ordered_pair(first(sK7_skl),second(sK7_skl)) = sK7_skl ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK7_skl]),skolemize(X,sK7_skl)],[f191]) ).
fof(f193,plain,
ordered_pair(first(sK7_skl),second(sK7_skl)) = sK7_skl,
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f194,plain,
~ member(sK7_skl,universal_class),
inference(cnf_transformation,[status(thm)],[f192]) ).
fof(f204,plain,
! [X0,X1] :
( member(X0,universal_class)
| ~ member(X0,X1) ),
inference(resolution,[status(thm)],[f50,f53]) ).
fof(f236,plain,
! [X0] : ~ member(sK7_skl,X0),
inference(resolution,[status(thm)],[f204,f194]) ).
fof(f264,plain,
! [X0,X1] : member(ordered_pair(X0,X1),universal_class),
inference(paramodulation,[status(thm)],[f67,f65]) ).
fof(f269,plain,
member(sK7_skl,universal_class),
inference(paramodulation,[status(thm)],[f193,f264]) ).
fof(f270,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f269,f236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET117+1 : TPTP v9.3.1. Bugfixed v5.4.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.36 % Computer : n004.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 04:54:34 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.13/0.40 % Refutation found
% 0.13/0.40 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.43 % Elapsed time: 0.059158 seconds
% 0.13/0.43 % CPU time: 0.150394 seconds
% 0.13/0.43 % Total memory used: 88.320 MB
% 0.13/0.43 % Net memory used: 88.235 MB
%------------------------------------------------------------------------------