%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SEU121+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n010.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:19:16 PM UTC 2026
% Result : Theorem 0.08s 0.39s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 2
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 22 ~; 19 |; 14 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 44 ( 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f15,conjecture,
! [A,B,C] :
( ( subset(B,C)
& subset(A,B) )
=> subset(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
~ ! [A,B,C] :
( ( subset(B,C)
& subset(A,B) )
=> subset(A,C) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f30,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,B)
| ~ in(C,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
fof(f31,plain,
! [A,B] :
( ( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f30]) ).
fof(f32,plain,
( ! [A,B] :
( ? [C] :
( ~ in(C,B)
& in(C,A) )
| subset(A,B) )
& ! [A,B] :
( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(miniscoping,[status(thm)],[f31]) ).
fof(f33,plain,
( ! [A,B] :
( ( ~ in(sK1_skl(B,A),B)
& in(sK1_skl(B,A),A) )
| subset(A,B) )
& ! [A,B] :
( ! [C] :
( in(C,B)
| ~ in(C,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1_skl]),skolemize(C,sK1_skl(B,A))],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( in(X2,X1)
| ~ in(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( in(sK1_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f36,plain,
! [X0,X1] :
( ~ in(sK1_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f33]) ).
fof(f61,plain,
? [A,B,C] :
( ~ subset(A,C)
& subset(B,C)
& subset(A,B) ),
inference(pre_NNF_transformation,[status(thm)],[f16]) ).
fof(f62,plain,
? [A,C] :
( ~ subset(A,C)
& ? [B] :
( subset(B,C)
& subset(A,B) ) ),
inference(miniscoping,[status(thm)],[f61]) ).
fof(f63,plain,
( ~ subset(sK5_skl,sK6_skl)
& subset(sK7_skl,sK6_skl)
& subset(sK5_skl,sK7_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK5_skl,sK6_skl,sK7_skl]),skolemize(A,sK5_skl),skolemize(C,sK6_skl),skolemize(B,sK7_skl)],[f62]) ).
fof(f64,plain,
subset(sK5_skl,sK7_skl),
inference(cnf_transformation,[status(thm)],[f63]) ).
fof(f65,plain,
subset(sK7_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f63]) ).
fof(f66,plain,
~ subset(sK5_skl,sK6_skl),
inference(cnf_transformation,[status(thm)],[f63]) ).
fof(f90,plain,
! [X0] :
( in(X0,sK6_skl)
| ~ in(X0,sK7_skl) ),
inference(resolution,[status(thm)],[f34,f65]) ).
fof(f91,plain,
! [X0] :
( in(X0,sK7_skl)
| ~ in(X0,sK5_skl) ),
inference(resolution,[status(thm)],[f34,f64]) ).
fof(f93,plain,
! [X0] :
( in(X0,sK6_skl)
| ~ in(X0,sK5_skl) ),
inference(resolution,[status(thm)],[f91,f90]) ).
fof(f117,plain,
! [X0] :
( ~ in(sK1_skl(sK6_skl,X0),sK5_skl)
| subset(X0,sK6_skl) ),
inference(resolution,[status(thm)],[f36,f93]) ).
fof(f174,plain,
( subset(sK5_skl,sK6_skl)
| subset(sK5_skl,sK6_skl) ),
inference(resolution,[status(thm)],[f117,f35]) ).
fof(f175,plain,
subset(sK5_skl,sK6_skl),
inference(duplicate_literals_removal,[status(thm)],[f174]) ).
fof(f176,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f175,f66]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU121+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35 % Computer : n010.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 05:51:25 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.08/0.39 % Refutation found
% 0.08/0.39 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.08/0.39 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.41 % Elapsed time: 0.042901 seconds
% 0.13/0.41 % CPU time: 0.112957 seconds
% 0.13/0.41 % Total memory used: 48.207 MB
% 0.13/0.41 % Net memory used: 48.096 MB
%------------------------------------------------------------------------------