%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SET148+4 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n017.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:29 PM UTC 2026
% Result : Theorem 0.15s 10.43s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 9 unt; 0 def)
% Number of atoms : 91 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 96 ( 37 ~; 38 |; 16 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% 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 : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 74 ( 71 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B] :
( equal_set(A,B)
<=> ( subset(B,A)
& subset(A,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,A,B] :
( member(X,intersection(A,B))
<=> ( member(X,B)
& member(X,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A] : equal_set(intersection(A,A),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A] : equal_set(intersection(A,A),A),
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(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(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(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] : ~ equal_set(intersection(A,A),A),
inference(pre_NNF_transformation,[status(thm)],[f13]) ).
fof(f69,plain,
~ equal_set(intersection(sK3_skl,sK3_skl),sK3_skl),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3_skl]),skolemize(A,sK3_skl)],[f68]) ).
fof(f70,plain,
~ equal_set(intersection(sK3_skl,sK3_skl),sK3_skl),
inference(cnf_transformation,[status(thm)],[f69]) ).
fof(f81,plain,
! [X0,X1,X2] :
( member(sK0_skl(X2,intersection(X0,X1)),X1)
| subset(intersection(X0,X1),X2) ),
inference(resolution,[status(thm)],[f19,f33]) ).
fof(f116,plain,
! [X0,X1] :
( subset(intersection(X0,X1),X1)
| subset(intersection(X0,X1),X1) ),
inference(resolution,[status(thm)],[f20,f81]) ).
fof(f119,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(f121,plain,
! [X0,X1] : subset(intersection(X0,X1),X1),
inference(duplicate_literals_removal,[status(thm)],[f116]) ).
fof(f194,plain,
! [X0,X1] :
( subset(X0,intersection(X1,X0))
| ~ member(sK0_skl(intersection(X1,X0),X0),X1)
| subset(X0,intersection(X1,X0)) ),
inference(resolution,[status(thm)],[f119,f19]) ).
fof(f202,plain,
! [X0,X1] :
( ~ member(sK0_skl(intersection(X1,X0),X0),X1)
| subset(X0,intersection(X1,X0)) ),
inference(duplicate_literals_removal,[status(thm)],[f194]) ).
fof(f232,plain,
! [X0] :
( subset(X0,intersection(X0,X0))
| subset(X0,intersection(X0,X0)) ),
inference(resolution,[status(thm)],[f202,f19]) ).
fof(f240,plain,
! [X0] : subset(X0,intersection(X0,X0)),
inference(duplicate_literals_removal,[status(thm)],[f232]) ).
fof(f274,plain,
! [X0] :
( ~ subset(intersection(X0,X0),X0)
| equal_set(intersection(X0,X0),X0) ),
inference(resolution,[status(thm)],[f240,f25]) ).
fof(f275,plain,
! [X0] : equal_set(intersection(X0,X0),X0),
inference(forward_subsumption_resolution,[status(thm)],[f274,f121]) ).
fof(f286,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[f70,f275]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET148+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/10.39 % Computer : n017.cluster.edu
% 0.11/10.39 % Model : x86_64 x86_64
% 0.11/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.39 % Memory : 8046.5625MB
% 0.11/10.39 % OS : Linux 6.8.0-71-generic
% 0.11/10.39 % CPULimit : 300
% 0.11/10.39 % WCLimit : 300
% 0.11/10.39 % DateTime : Mon Sep 21 04:52:39 UTC 2026
% 0.11/10.39 % CPUTime :
% 0.15/10.40 % Drodi V4.1.1
% 0.15/10.43 % Refutation found
% 0.15/10.43 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/10.43 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.15/10.45 % Elapsed time: 0.054614 seconds
% 0.15/10.45 % CPU time: 0.175354 seconds
% 0.15/10.45 % Total memory used: 81.795 MB
% 0.15/10.45 % Net memory used: 81.376 MB
%------------------------------------------------------------------------------