TSTP Solution File: SET584+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET584+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n016.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:43 EDT 2023
% Result : Theorem 0.15s 0.38s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 9 unt; 0 def)
% Number of atoms : 92 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 94 ( 40 ~; 33 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 63 (; 55 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( member(D,union(B,C))
<=> ( member(D,B)
| member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,conjecture,
! [B,C,D] :
( subset(B,C)
=> subset(union(B,D),union(C,D)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,negated_conjecture,
~ ! [B,C,D] :
( subset(B,C)
=> subset(union(B,D),union(C,D)) ),
inference(negated_conjecture,[status(cth)],[f6]) ).
fof(f8,plain,
! [B,C,D] :
( ( ~ member(D,union(B,C))
| member(D,B)
| member(D,C) )
& ( member(D,union(B,C))
| ( ~ member(D,B)
& ~ member(D,C) ) ) ),
inference(NNF_transformation,[status(esa)],[f1]) ).
fof(f9,plain,
( ! [B,C,D] :
( ~ member(D,union(B,C))
| member(D,B)
| member(D,C) )
& ! [B,C,D] :
( member(D,union(B,C))
| ( ~ member(D,B)
& ~ member(D,C) ) ) ),
inference(miniscoping,[status(esa)],[f8]) ).
fof(f10,plain,
! [X0,X1,X2] :
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f11,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
| ~ member(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f12,plain,
! [X0,X1,X2] :
( member(X0,union(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f9]) ).
fof(f13,plain,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( ~ member(D,B)
| member(D,C) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f14,plain,
! [B,C] :
( ( ~ subset(B,C)
| ! [D] :
( ~ member(D,B)
| member(D,C) ) )
& ( subset(B,C)
| ? [D] :
( member(D,B)
& ~ member(D,C) ) ) ),
inference(NNF_transformation,[status(esa)],[f13]) ).
fof(f15,plain,
( ! [B,C] :
( ~ subset(B,C)
| ! [D] :
( ~ member(D,B)
| member(D,C) ) )
& ! [B,C] :
( subset(B,C)
| ? [D] :
( member(D,B)
& ~ member(D,C) ) ) ),
inference(miniscoping,[status(esa)],[f14]) ).
fof(f16,plain,
( ! [B,C] :
( ~ subset(B,C)
| ! [D] :
( ~ member(D,B)
| member(D,C) ) )
& ! [B,C] :
( subset(B,C)
| ( member(sk0_0(C,B),B)
& ~ member(sk0_0(C,B),C) ) ) ),
inference(skolemization,[status(esa)],[f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ member(X2,X0)
| member(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f18,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sk0_0(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f19,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sk0_0(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f29,plain,
? [B,C,D] :
( subset(B,C)
& ~ subset(union(B,D),union(C,D)) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f30,plain,
? [B,C] :
( subset(B,C)
& ? [D] : ~ subset(union(B,D),union(C,D)) ),
inference(miniscoping,[status(esa)],[f29]) ).
fof(f31,plain,
( subset(sk0_2,sk0_3)
& ~ subset(union(sk0_2,sk0_4),union(sk0_3,sk0_4)) ),
inference(skolemization,[status(esa)],[f30]) ).
fof(f32,plain,
subset(sk0_2,sk0_3),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f33,plain,
~ subset(union(sk0_2,sk0_4),union(sk0_3,sk0_4)),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f38,plain,
~ member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),union(sk0_3,sk0_4)),
inference(resolution,[status(thm)],[f19,f33]) ).
fof(f39,plain,
~ member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),sk0_4),
inference(resolution,[status(thm)],[f38,f12]) ).
fof(f40,plain,
~ member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),sk0_3),
inference(resolution,[status(thm)],[f38,f11]) ).
fof(f43,plain,
! [X0] :
( ~ member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),union(X0,sk0_4))
| member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),X0) ),
inference(resolution,[status(thm)],[f39,f10]) ).
fof(f46,plain,
! [X0] :
( ~ subset(X0,sk0_3)
| ~ member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),X0) ),
inference(resolution,[status(thm)],[f40,f17]) ).
fof(f49,plain,
~ member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),sk0_2),
inference(resolution,[status(thm)],[f46,f32]) ).
fof(f163,plain,
( spl0_1
<=> subset(union(sk0_2,sk0_4),union(sk0_3,sk0_4)) ),
introduced(split_symbol_definition) ).
fof(f164,plain,
( subset(union(sk0_2,sk0_4),union(sk0_3,sk0_4))
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f163]) ).
fof(f201,plain,
( spl0_3
<=> member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),sk0_2) ),
introduced(split_symbol_definition) ).
fof(f202,plain,
( member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),sk0_2)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f201]) ).
fof(f204,plain,
( member(sk0_0(union(sk0_3,sk0_4),union(sk0_2,sk0_4)),sk0_2)
| subset(union(sk0_2,sk0_4),union(sk0_3,sk0_4)) ),
inference(resolution,[status(thm)],[f43,f18]) ).
fof(f205,plain,
( spl0_3
| spl0_1 ),
inference(split_clause,[status(thm)],[f204,f201,f163]) ).
fof(f218,plain,
( $false
| ~ spl0_1 ),
inference(forward_subsumption_resolution,[status(thm)],[f164,f33]) ).
fof(f219,plain,
~ spl0_1,
inference(contradiction_clause,[status(thm)],[f218]) ).
fof(f220,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f202,f49]) ).
fof(f221,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f220]) ).
fof(f222,plain,
$false,
inference(sat_refutation,[status(thm)],[f205,f219,f221]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET584+3 : TPTP v8.1.2. Released v2.2.0.
% 0.05/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.10/0.31 % Computer : n016.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue May 30 10:41:44 EDT 2023
% 0.15/0.31 % CPUTime :
% 0.15/0.32 % Drodi V3.5.1
% 0.15/0.38 % Refutation found
% 0.15/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.15/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.24/0.61 % Elapsed time: 0.079307 seconds
% 0.24/0.61 % CPU time: 0.154996 seconds
% 0.24/0.61 % Memory used: 26.541 MB
%------------------------------------------------------------------------------