%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET692+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n026.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:10:28 PM UTC 2026
% Result : Theorem 0.17s 0.52s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 48 ( 4 unt; 0 def)
% Number of atoms : 138 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 155 ( 65 ~; 64 |; 18 &)
% ( 6 <=>; 1 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 81 ( 75 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] :
( equal_set(A,B)
<=> ( subset(B,A)
& subset(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,A,B] :
( member(X,intersection(A,B))
<=> ( member(X,B)
& member(X,A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A,B] :
( equal_set(A,intersection(A,B))
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A,B] :
( equal_set(A,intersection(A,B))
<=> subset(A,B) ),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,B)
| ~ member(X,A) ) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f15,plain,
! [A,B] :
( ( ? [X] :
( ~ member(X,B)
& member(X,A) )
| subset(A,B) )
& ( ! [X] :
( member(X,B)
| ~ member(X,A) )
| ~ subset(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f14]) ).
fof(f16,plain,
( ! [A,B] :
( ? [X] :
( ~ member(X,B)
& member(X,A) )
| subset(A,B) )
& ! [A,B] :
( ! [X] :
( member(X,B)
| ~ member(X,A) )
| ~ subset(A,B) ) ),
inference(miniscoping,[status(thm)],[f15]) ).
fof(f17,plain,
( ! [A,B] :
( ( ~ member(sK0_skl(B,A),B)
& member(sK0_skl(B,A),A) )
| subset(A,B) )
& ! [A,B] :
( ! [X] :
( member(X,B)
| ~ member(X,A) )
| ~ subset(A,B) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl]),skolemize(X,sK0_skl(B,A))],[f16]) ).
fof(f18,plain,
! [X0,X1,X2] :
( member(X2,X1)
| ~ member(X2,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f19,plain,
! [X0,X1] :
( member(sK0_skl(X1,X0),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f20,plain,
! [X0,X1] :
( ~ member(sK0_skl(X1,X0),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f17]) ).
fof(f21,plain,
! [A,B] :
( ( ~ subset(B,A)
| ~ subset(A,B)
| equal_set(A,B) )
& ( ( subset(B,A)
& subset(A,B) )
| ~ equal_set(A,B) ) ),
inference(NNF_transformation,[status(thm)],[f2]) ).
fof(f22,plain,
( ! [A,B] :
( ~ subset(B,A)
| ~ subset(A,B)
| equal_set(A,B) )
& ! [A,B] :
( ( subset(B,A)
& subset(A,B) )
| ~ equal_set(A,B) ) ),
inference(miniscoping,[status(thm)],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( subset(X1,X0)
| ~ equal_set(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f25,plain,
! [X0,X1] :
( ~ subset(X1,X0)
| ~ subset(X0,X1)
| equal_set(X0,X1) ),
inference(cnf_transformation,[status(thm)],[f22]) ).
fof(f30,plain,
! [X,A,B] :
( ( ~ member(X,B)
| ~ member(X,A)
| member(X,intersection(A,B)) )
& ( ( member(X,B)
& member(X,A) )
| ~ member(X,intersection(A,B)) ) ),
inference(NNF_transformation,[status(thm)],[f4]) ).
fof(f31,plain,
( ! [X,A,B] :
( ~ member(X,B)
| ~ member(X,A)
| member(X,intersection(A,B)) )
& ! [X,A,B] :
( ( member(X,B)
& member(X,A) )
| ~ member(X,intersection(A,B)) ) ),
inference(miniscoping,[status(thm)],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( member(X0,X1)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( member(X0,X2)
| ~ member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ member(X0,X2)
| ~ member(X0,X1)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[status(thm)],[f31]) ).
fof(f68,plain,
? [A,B] :
( equal_set(A,intersection(A,B))
<~> subset(A,B) ),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f69,plain,
? [A,B] :
( ( ~ subset(A,B)
| ~ equal_set(A,intersection(A,B)) )
& ( subset(A,B)
| equal_set(A,intersection(A,B)) ) ),
inference(NNF_transformation,[status(thm)],[f68]) ).
fof(f70,plain,
( ( ~ subset(sK3_skl,sK4_skl)
| ~ equal_set(sK3_skl,intersection(sK3_skl,sK4_skl)) )
& ( subset(sK3_skl,sK4_skl)
| equal_set(sK3_skl,intersection(sK3_skl,sK4_skl)) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl,sK4_skl]),skolemize(A,sK3_skl),skolemize(B,sK4_skl)],[f69]) ).
fof(f71,plain,
( subset(sK3_skl,sK4_skl)
| equal_set(sK3_skl,intersection(sK3_skl,sK4_skl)) ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f72,plain,
( ~ subset(sK3_skl,sK4_skl)
| ~ equal_set(sK3_skl,intersection(sK3_skl,sK4_skl)) ),
inference(cnf_transformation,[status(thm)],[f70]) ).
fof(f77,plain,
( subset(sK3_skl,sK4_skl)
| subset(sK3_skl,intersection(sK3_skl,sK4_skl)) ),
inference(resolution,[status(thm)],[f23,f71]) ).
fof(f78,plain,
( subset(sK3_skl,sK4_skl)
| subset(intersection(sK3_skl,sK4_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f24,f71]) ).
fof(f79,plain,
( ~ subset(sK3_skl,sK4_skl)
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl)
| ~ subset(sK3_skl,intersection(sK3_skl,sK4_skl)) ),
inference(resolution,[status(thm)],[f25,f72]) ).
fof(f85,plain,
! [X0,X1,X2] :
( member(sK0_skl(X2,intersection(X0,X1)),X0)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[status(thm)],[f19,f32]) ).
fof(f87,plain,
! [X0,X1,X2] :
( ~ member(sK0_skl(intersection(X1,X2),X0),X2)
| ~ member(sK0_skl(intersection(X1,X2),X0),X1)
| subset(X0,intersection(X1,X2)) ),
inference(resolution,[status(thm)],[f20,f34]) ).
fof(f95,plain,
( ~ subset(sK3_skl,sK4_skl)
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl)
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK3_skl),sK4_skl)
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK3_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f87,f79]) ).
fof(f97,plain,
( ~ subset(sK3_skl,sK4_skl)
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl)
| ~ member(sK0_skl(intersection(sK3_skl,sK4_skl),sK3_skl),sK3_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f95,f18]) ).
fof(f99,plain,
( subset(sK3_skl,intersection(sK3_skl,sK4_skl))
| ~ subset(sK3_skl,sK4_skl)
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f97,f19]) ).
fof(f100,plain,
( ~ subset(sK3_skl,sK4_skl)
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl) ),
inference(backward_subsumption_resolution,[status(thm)],[f79,f101]) ).
fof(f101,plain,
( subset(sK3_skl,intersection(sK3_skl,sK4_skl))
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl) ),
inference(forward_subsumption_resolution,[status(thm)],[f99,f77]) ).
fof(f102,plain,
! [X0] :
( member(X0,intersection(sK3_skl,sK4_skl))
| ~ member(X0,sK3_skl)
| ~ subset(intersection(sK3_skl,sK4_skl),sK3_skl) ),
inference(resolution,[status(thm)],[f101,f18]) ).
fof(f109,plain,
( member(sK0_skl(sK3_skl,intersection(sK3_skl,sK4_skl)),sK3_skl)
| ~ subset(sK3_skl,sK4_skl) ),
inference(resolution,[status(thm)],[f100,f85]) ).
fof(f115,plain,
( subset(intersection(sK3_skl,sK4_skl),sK3_skl)
| ~ subset(sK3_skl,sK4_skl) ),
inference(resolution,[status(thm)],[f109,f20]) ).
fof(f117,plain,
! [X0] :
( member(X0,intersection(sK3_skl,sK4_skl))
| ~ member(X0,sK3_skl) ),
inference(backward_subsumption_resolution,[status(thm)],[f102,f119]) ).
fof(f118,plain,
~ subset(sK3_skl,sK4_skl),
inference(backward_subsumption_resolution,[status(thm)],[f100,f119]) ).
fof(f119,plain,
subset(intersection(sK3_skl,sK4_skl),sK3_skl),
inference(forward_subsumption_resolution,[status(thm)],[f115,f78]) ).
fof(f126,plain,
! [X0] :
( member(X0,sK4_skl)
| ~ member(X0,sK3_skl) ),
inference(resolution,[status(thm)],[f117,f33]) ).
fof(f134,plain,
! [X0] :
( subset(X0,sK4_skl)
| ~ member(sK0_skl(sK4_skl,X0),sK3_skl) ),
inference(resolution,[status(thm)],[f126,f20]) ).
fof(f155,plain,
( subset(sK3_skl,sK4_skl)
| subset(sK3_skl,sK4_skl) ),
inference(resolution,[status(thm)],[f134,f19]) ).
fof(f156,plain,
subset(sK3_skl,sK4_skl),
inference(duplicate_literals_removal,[status(thm)],[f155]) ).
fof(f157,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f156,f118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET692+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.06 % Command : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.17/0.44 % Computer : n026.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 05:35:06 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.46 % Drodi V4.1.1
% 0.17/0.52 % Refutation found
% 0.17/0.52 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.17/0.52 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.17/0.57 % Elapsed time: 0.103881 seconds
% 0.17/0.57 % CPU time: 0.588684 seconds
% 0.17/0.57 % Total memory used: 87.319 MB
% 0.17/0.57 % Net memory used: 86.486 MB
%------------------------------------------------------------------------------