TSTP Solution File: SET171+4 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET171+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n021.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed May 31 12:34:11 EDT 2023
% Result : Theorem 0.21s 0.42s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 19
% Syntax : Number of formulae : 100 ( 7 unt; 0 def)
% Number of atoms : 256 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 260 ( 104 ~; 116 |; 20 &)
% ( 19 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 18 ( 17 usr; 15 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 90 (; 85 !; 5 ?)
% 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(A,B)
& subset(B,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [X,A,B] :
( member(X,intersection(A,B))
<=> ( member(X,A)
& member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [X,A,B] :
( member(X,union(A,B))
<=> ( member(X,A)
| member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A,B,C] : equal_set(union(A,intersection(B,C)),intersection(union(A,B),union(A,C))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A,B,C] : equal_set(union(A,intersection(B,C)),intersection(union(A,B),union(A,C))),
inference(negated_conjecture,[status(cth)],[f12]) ).
fof(f14,plain,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( ~ member(X,A)
| member(X,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f15,plain,
! [A,B] :
( ( ~ subset(A,B)
| ! [X] :
( ~ member(X,A)
| member(X,B) ) )
& ( subset(A,B)
| ? [X] :
( member(X,A)
& ~ member(X,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f14]) ).
fof(f16,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [X] :
( ~ member(X,A)
| member(X,B) ) )
& ! [A,B] :
( subset(A,B)
| ? [X] :
( member(X,A)
& ~ member(X,B) ) ) ),
inference(miniscoping,[status(esa)],[f15]) ).
fof(f17,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [X] :
( ~ member(X,A)
| member(X,B) ) )
& ! [A,B] :
( subset(A,B)
| ( member(sk0_0(B,A),A)
& ~ member(sk0_0(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f16]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sk0_0(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sk0_0(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f17]) ).
fof(f21,plain,
! [A,B] :
( ( ~ equal_set(A,B)
| ( subset(A,B)
& subset(B,A) ) )
& ( equal_set(A,B)
| ~ subset(A,B)
| ~ subset(B,A) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f22,plain,
( ! [A,B] :
( ~ equal_set(A,B)
| ( subset(A,B)
& subset(B,A) ) )
& ! [A,B] :
( equal_set(A,B)
| ~ subset(A,B)
| ~ subset(B,A) ) ),
inference(miniscoping,[status(esa)],[f21]) ).
fof(f25,plain,
! [X0,X1] :
( equal_set(X0,X1)
| ~ subset(X0,X1)
| ~ subset(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f30,plain,
! [X,A,B] :
( ( ~ member(X,intersection(A,B))
| ( member(X,A)
& member(X,B) ) )
& ( member(X,intersection(A,B))
| ~ member(X,A)
| ~ member(X,B) ) ),
inference(NNF_transformation,[status(esa)],[f4]) ).
fof(f31,plain,
( ! [X,A,B] :
( ~ member(X,intersection(A,B))
| ( member(X,A)
& member(X,B) ) )
& ! [X,A,B] :
( member(X,intersection(A,B))
| ~ member(X,A)
| ~ member(X,B) ) ),
inference(miniscoping,[status(esa)],[f30]) ).
fof(f32,plain,
! [X0,X1,X2] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f34,plain,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f35,plain,
! [X,A,B] :
( ( ~ member(X,union(A,B))
| member(X,A)
| member(X,B) )
& ( member(X,union(A,B))
| ( ~ member(X,A)
& ~ member(X,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f5]) ).
fof(f36,plain,
( ! [X,A,B] :
( ~ member(X,union(A,B))
| member(X,A)
| member(X,B) )
& ! [X,A,B] :
( member(X,union(A,B))
| ( ~ member(X,A)
& ~ member(X,B) ) ) ),
inference(miniscoping,[status(esa)],[f35]) ).
fof(f37,plain,
! [X0,X1,X2] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f38,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f39,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f68,plain,
? [A,B,C] : ~ equal_set(union(A,intersection(B,C)),intersection(union(A,B),union(A,C))),
inference(pre_NNF_transformation,[status(esa)],[f13]) ).
fof(f69,plain,
~ equal_set(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),
inference(skolemization,[status(esa)],[f68]) ).
fof(f70,plain,
~ equal_set(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f71,plain,
! [X0,X1] :
( member(sk0_0(X0,X1),X1)
| equal_set(X0,X1)
| ~ subset(X0,X1) ),
inference(resolution,[status(thm)],[f19,f25]) ).
fof(f84,plain,
( spl0_0
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))) ),
introduced(split_symbol_definition) ).
fof(f85,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| ~ spl0_0 ),
inference(component_clause,[status(thm)],[f84]) ).
fof(f87,plain,
( spl0_1
<=> member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_3) ),
introduced(split_symbol_definition) ).
fof(f88,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_3)
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f87]) ).
fof(f90,plain,
( spl0_2
<=> member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),intersection(sk0_4,sk0_5)) ),
introduced(split_symbol_definition) ).
fof(f91,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),intersection(sk0_4,sk0_5))
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f90]) ).
fof(f97,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_5)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f91,f33]) ).
fof(f98,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_4)
| ~ spl0_2 ),
inference(resolution,[status(thm)],[f91,f32]) ).
fof(f103,plain,
( spl0_3
<=> member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,intersection(sk0_4,sk0_5))) ),
introduced(split_symbol_definition) ).
fof(f104,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,intersection(sk0_4,sk0_5)))
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f103]) ).
fof(f106,plain,
( spl0_4
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_5)) ),
introduced(split_symbol_definition) ).
fof(f107,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_5))
| ~ spl0_4 ),
inference(component_clause,[status(thm)],[f106]) ).
fof(f108,plain,
( ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_5))
| spl0_4 ),
inference(component_clause,[status(thm)],[f106]) ).
fof(f113,plain,
( spl0_5
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_3) ),
introduced(split_symbol_definition) ).
fof(f114,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_3)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f113]) ).
fof(f116,plain,
( spl0_6
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_5) ),
introduced(split_symbol_definition) ).
fof(f119,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_3)
| member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_5)
| ~ spl0_4 ),
inference(resolution,[status(thm)],[f107,f37]) ).
fof(f120,plain,
( spl0_5
| spl0_6
| ~ spl0_4 ),
inference(split_clause,[status(thm)],[f119,f113,f116,f106]) ).
fof(f121,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_3)
| member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),intersection(sk0_4,sk0_5))
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f104,f37]) ).
fof(f122,plain,
( spl0_1
| spl0_2
| ~ spl0_3 ),
inference(split_clause,[status(thm)],[f121,f87,f90,f103]) ).
fof(f123,plain,
( spl0_7
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_4)) ),
introduced(split_symbol_definition) ).
fof(f124,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_4))
| ~ spl0_7 ),
inference(component_clause,[status(thm)],[f123]) ).
fof(f130,plain,
( spl0_8
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_4) ),
introduced(split_symbol_definition) ).
fof(f133,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_3)
| member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_4)
| ~ spl0_7 ),
inference(resolution,[status(thm)],[f124,f37]) ).
fof(f134,plain,
( spl0_5
| spl0_8
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f133,f113,f130,f123]) ).
fof(f142,plain,
! [X0,X1] :
( ~ member(sk0_0(X0,X1),X0)
| equal_set(X0,X1)
| ~ subset(X0,X1) ),
inference(resolution,[status(thm)],[f20,f25]) ).
fof(f143,plain,
( spl0_9
<=> member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,intersection(sk0_4,sk0_5))) ),
introduced(split_symbol_definition) ).
fof(f145,plain,
( ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,intersection(sk0_4,sk0_5)))
| spl0_9 ),
inference(component_clause,[status(thm)],[f143]) ).
fof(f146,plain,
( spl0_10
<=> subset(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))) ),
introduced(split_symbol_definition) ).
fof(f147,plain,
( subset(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f146]) ).
fof(f148,plain,
( ~ subset(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| spl0_10 ),
inference(component_clause,[status(thm)],[f146]) ).
fof(f149,plain,
( ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,intersection(sk0_4,sk0_5)))
| ~ subset(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))) ),
inference(resolution,[status(thm)],[f142,f70]) ).
fof(f150,plain,
( ~ spl0_9
| ~ spl0_10 ),
inference(split_clause,[status(thm)],[f149,f143,f146]) ).
fof(f152,plain,
( ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),intersection(sk0_4,sk0_5))
| spl0_9 ),
inference(resolution,[status(thm)],[f145,f39]) ).
fof(f153,plain,
( ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_3)
| spl0_9 ),
inference(resolution,[status(thm)],[f145,f38]) ).
fof(f154,plain,
( $false
| ~ spl0_5
| spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f153,f114]) ).
fof(f155,plain,
( ~ spl0_5
| spl0_9 ),
inference(contradiction_clause,[status(thm)],[f154]) ).
fof(f158,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| spl0_10 ),
inference(resolution,[status(thm)],[f148,f20]) ).
fof(f159,plain,
( spl0_11
<=> member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,sk0_4)) ),
introduced(split_symbol_definition) ).
fof(f161,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,sk0_4))
| spl0_11 ),
inference(component_clause,[status(thm)],[f159]) ).
fof(f162,plain,
( spl0_12
<=> member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,sk0_5)) ),
introduced(split_symbol_definition) ).
fof(f164,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,sk0_5))
| spl0_12 ),
inference(component_clause,[status(thm)],[f162]) ).
fof(f165,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,sk0_4))
| ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,sk0_5))
| spl0_10 ),
inference(resolution,[status(thm)],[f158,f34]) ).
fof(f166,plain,
( ~ spl0_11
| ~ spl0_12
| spl0_10 ),
inference(split_clause,[status(thm)],[f165,f159,f162,f146]) ).
fof(f167,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_5)
| spl0_12 ),
inference(resolution,[status(thm)],[f164,f39]) ).
fof(f168,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_3)
| spl0_12 ),
inference(resolution,[status(thm)],[f164,f38]) ).
fof(f169,plain,
( $false
| ~ spl0_1
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f168,f88]) ).
fof(f170,plain,
( ~ spl0_1
| spl0_12 ),
inference(contradiction_clause,[status(thm)],[f169]) ).
fof(f171,plain,
( ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_4)
| ~ member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),sk0_5)
| spl0_9 ),
inference(resolution,[status(thm)],[f152,f34]) ).
fof(f172,plain,
( ~ spl0_8
| ~ spl0_6
| spl0_9 ),
inference(split_clause,[status(thm)],[f171,f130,f116,f143]) ).
fof(f173,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_4)
| spl0_11 ),
inference(resolution,[status(thm)],[f161,f39]) ).
fof(f174,plain,
( $false
| ~ spl0_2
| spl0_11 ),
inference(forward_subsumption_resolution,[status(thm)],[f173,f98]) ).
fof(f175,plain,
( ~ spl0_2
| spl0_11 ),
inference(contradiction_clause,[status(thm)],[f174]) ).
fof(f176,plain,
( ~ member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),sk0_3)
| spl0_11 ),
inference(resolution,[status(thm)],[f161,f38]) ).
fof(f177,plain,
( ~ spl0_1
| spl0_11 ),
inference(split_clause,[status(thm)],[f176,f87,f159]) ).
fof(f178,plain,
( $false
| ~ spl0_2
| spl0_12 ),
inference(forward_subsumption_resolution,[status(thm)],[f167,f97]) ).
fof(f179,plain,
( ~ spl0_2
| spl0_12 ),
inference(contradiction_clause,[status(thm)],[f178]) ).
fof(f180,plain,
( member(sk0_0(intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)),union(sk0_3,intersection(sk0_4,sk0_5))),union(sk0_3,intersection(sk0_4,sk0_5)))
| spl0_10 ),
inference(resolution,[status(thm)],[f148,f19]) ).
fof(f181,plain,
( spl0_3
| spl0_10 ),
inference(split_clause,[status(thm)],[f180,f103,f146]) ).
fof(f186,plain,
( spl0_13
<=> equal_set(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))) ),
introduced(split_symbol_definition) ).
fof(f187,plain,
( equal_set(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| ~ spl0_13 ),
inference(component_clause,[status(thm)],[f186]) ).
fof(f189,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| equal_set(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5)))
| ~ spl0_10 ),
inference(resolution,[status(thm)],[f147,f71]) ).
fof(f190,plain,
( spl0_0
| spl0_13
| ~ spl0_10 ),
inference(split_clause,[status(thm)],[f189,f84,f186,f146]) ).
fof(f215,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_5))
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f85,f33]) ).
fof(f216,plain,
( member(sk0_0(union(sk0_3,intersection(sk0_4,sk0_5)),intersection(union(sk0_3,sk0_4),union(sk0_3,sk0_5))),union(sk0_3,sk0_4))
| ~ spl0_0 ),
inference(resolution,[status(thm)],[f85,f32]) ).
fof(f217,plain,
( spl0_7
| ~ spl0_0 ),
inference(split_clause,[status(thm)],[f216,f123,f84]) ).
fof(f218,plain,
( $false
| ~ spl0_0
| spl0_4 ),
inference(forward_subsumption_resolution,[status(thm)],[f108,f215]) ).
fof(f219,plain,
( ~ spl0_0
| spl0_4 ),
inference(contradiction_clause,[status(thm)],[f218]) ).
fof(f220,plain,
( $false
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[status(thm)],[f187,f70]) ).
fof(f221,plain,
~ spl0_13,
inference(contradiction_clause,[status(thm)],[f220]) ).
fof(f222,plain,
$false,
inference(sat_refutation,[status(thm)],[f120,f122,f134,f150,f155,f166,f170,f172,f175,f177,f179,f181,f190,f217,f219,f221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET171+4 : TPTP v8.1.2. Released v2.2.0.
% 0.04/0.14 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue May 30 10:14:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % Drodi V3.5.1
% 0.21/0.42 % Refutation found
% 0.21/0.42 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.42 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.43 % Elapsed time: 0.075098 seconds
% 0.21/0.43 % CPU time: 0.453467 seconds
% 0.21/0.43 % Memory used: 31.350 MB
%------------------------------------------------------------------------------