TSTP Solution File: SET351+4 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : SET351+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n008.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 : Tue Apr 30 20:39:35 EDT 2024
% Result : Theorem 0.20s 0.44s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 66 ( 8 unt; 0 def)
% Number of atoms : 176 ( 13 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 183 ( 73 ~; 79 |; 20 &)
% ( 10 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 95 ( 89 !; 6 ?)
% 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(f8,axiom,
! [X,A] :
( member(X,singleton(A))
<=> X = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
! [X,A] :
( member(X,sum(A))
<=> ? [Y] :
( member(Y,A)
& member(X,Y) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,conjecture,
! [A] : equal_set(sum(singleton(A)),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f13,negated_conjecture,
~ ! [A] : equal_set(sum(singleton(A)),A),
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(f46,plain,
! [X,A] :
( ( ~ member(X,singleton(A))
| X = A )
& ( member(X,singleton(A))
| X != A ) ),
inference(NNF_transformation,[status(esa)],[f8]) ).
fof(f47,plain,
( ! [X,A] :
( ~ member(X,singleton(A))
| X = A )
& ! [X,A] :
( member(X,singleton(A))
| X != A ) ),
inference(miniscoping,[status(esa)],[f46]) ).
fof(f48,plain,
! [X0,X1] :
( ~ member(X0,singleton(X1))
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f49,plain,
! [X0,X1] :
( member(X0,singleton(X1))
| X0 != X1 ),
inference(cnf_transformation,[status(esa)],[f47]) ).
fof(f55,plain,
! [X,A] :
( ( ~ member(X,sum(A))
| ? [Y] :
( member(Y,A)
& member(X,Y) ) )
& ( member(X,sum(A))
| ! [Y] :
( ~ member(Y,A)
| ~ member(X,Y) ) ) ),
inference(NNF_transformation,[status(esa)],[f10]) ).
fof(f56,plain,
( ! [X,A] :
( ~ member(X,sum(A))
| ? [Y] :
( member(Y,A)
& member(X,Y) ) )
& ! [X,A] :
( member(X,sum(A))
| ! [Y] :
( ~ member(Y,A)
| ~ member(X,Y) ) ) ),
inference(miniscoping,[status(esa)],[f55]) ).
fof(f57,plain,
( ! [X,A] :
( ~ member(X,sum(A))
| ( member(sk0_1(A,X),A)
& member(X,sk0_1(A,X)) ) )
& ! [X,A] :
( member(X,sum(A))
| ! [Y] :
( ~ member(Y,A)
| ~ member(X,Y) ) ) ),
inference(skolemization,[status(esa)],[f56]) ).
fof(f58,plain,
! [X0,X1] :
( ~ member(X0,sum(X1))
| member(sk0_1(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f57]) ).
fof(f59,plain,
! [X0,X1] :
( ~ member(X0,sum(X1))
| member(X0,sk0_1(X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f57]) ).
fof(f60,plain,
! [X0,X1,X2] :
( member(X0,sum(X1))
| ~ member(X2,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f57]) ).
fof(f68,plain,
? [A] : ~ equal_set(sum(singleton(A)),A),
inference(pre_NNF_transformation,[status(esa)],[f13]) ).
fof(f69,plain,
~ equal_set(sum(singleton(sk0_3)),sk0_3),
inference(skolemization,[status(esa)],[f68]) ).
fof(f70,plain,
~ equal_set(sum(singleton(sk0_3)),sk0_3),
inference(cnf_transformation,[status(esa)],[f69]) ).
fof(f71,plain,
! [X0] : member(X0,singleton(X0)),
inference(destructive_equality_resolution,[status(esa)],[f49]) ).
fof(f91,plain,
! [X0,X1,X2] :
( subset(X0,sum(X1))
| ~ member(X2,X1)
| ~ member(sk0_0(sum(X1),X0),X2) ),
inference(resolution,[status(thm)],[f20,f60]) ).
fof(f105,plain,
! [X0,X1] :
( ~ member(X0,sum(singleton(X1)))
| sk0_1(singleton(X1),X0) = X1 ),
inference(resolution,[status(thm)],[f58,f48]) ).
fof(f119,plain,
! [X0,X1,X2] :
( sk0_1(singleton(X0),X1) = X0
| ~ member(X2,singleton(X0))
| ~ member(X1,X2) ),
inference(resolution,[status(thm)],[f105,f60]) ).
fof(f136,plain,
! [X0,X1] :
( sk0_1(singleton(X0),X1) = X0
| ~ member(X1,X0) ),
inference(resolution,[status(thm)],[f119,f71]) ).
fof(f139,plain,
! [X0,X1] :
( sk0_1(singleton(X0),sk0_0(X1,X0)) = X0
| subset(X0,X1) ),
inference(resolution,[status(thm)],[f136,f19]) ).
fof(f153,plain,
! [X0,X1] :
( subset(X0,sum(X1))
| ~ member(X0,X1)
| subset(X0,sum(X1)) ),
inference(resolution,[status(thm)],[f91,f19]) ).
fof(f154,plain,
! [X0,X1] :
( subset(X0,sum(X1))
| ~ member(X0,X1) ),
inference(duplicate_literals_removal,[status(esa)],[f153]) ).
fof(f167,plain,
! [X0,X1] :
( ~ member(X0,X1)
| equal_set(sum(X1),X0)
| ~ subset(sum(X1),X0) ),
inference(resolution,[status(thm)],[f154,f25]) ).
fof(f186,plain,
( spl0_0
<=> member(sk0_3,singleton(sk0_3)) ),
introduced(split_symbol_definition) ).
fof(f188,plain,
( ~ member(sk0_3,singleton(sk0_3))
| spl0_0 ),
inference(component_clause,[status(thm)],[f186]) ).
fof(f189,plain,
( spl0_1
<=> subset(sum(singleton(sk0_3)),sk0_3) ),
introduced(split_symbol_definition) ).
fof(f191,plain,
( ~ subset(sum(singleton(sk0_3)),sk0_3)
| spl0_1 ),
inference(component_clause,[status(thm)],[f189]) ).
fof(f192,plain,
( ~ member(sk0_3,singleton(sk0_3))
| ~ subset(sum(singleton(sk0_3)),sk0_3) ),
inference(resolution,[status(thm)],[f167,f70]) ).
fof(f193,plain,
( ~ spl0_0
| ~ spl0_1 ),
inference(split_clause,[status(thm)],[f192,f186,f189]) ).
fof(f195,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f188,f71]) ).
fof(f196,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f195]) ).
fof(f197,plain,
( sk0_1(singleton(sum(singleton(sk0_3))),sk0_0(sk0_3,sum(singleton(sk0_3)))) = sum(singleton(sk0_3))
| spl0_1 ),
inference(resolution,[status(thm)],[f191,f139]) ).
fof(f198,plain,
( spl0_2
<=> member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sum(singleton(sk0_3))))) ),
introduced(split_symbol_definition) ).
fof(f200,plain,
( ~ member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sum(singleton(sk0_3)))))
| spl0_2 ),
inference(component_clause,[status(thm)],[f198]) ).
fof(f201,plain,
( spl0_3
<=> member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sk0_3))) ),
introduced(split_symbol_definition) ).
fof(f202,plain,
( member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sk0_3)))
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f201]) ).
fof(f204,plain,
( ~ member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sum(singleton(sk0_3)))))
| member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sk0_3)))
| spl0_1 ),
inference(paramodulation,[status(thm)],[f197,f59]) ).
fof(f205,plain,
( ~ spl0_2
| spl0_3
| spl0_1 ),
inference(split_clause,[status(thm)],[f204,f198,f201,f189]) ).
fof(f211,plain,
! [X0] :
( ~ member(X0,singleton(sum(singleton(sk0_3))))
| ~ member(sk0_0(sk0_3,sum(singleton(sk0_3))),X0)
| spl0_2 ),
inference(resolution,[status(thm)],[f200,f60]) ).
fof(f215,plain,
( ~ member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sk0_3)))
| spl0_2 ),
inference(resolution,[status(thm)],[f211,f71]) ).
fof(f222,plain,
( subset(sum(singleton(sk0_3)),sk0_3)
| spl0_2 ),
inference(resolution,[status(thm)],[f215,f19]) ).
fof(f223,plain,
( $false
| spl0_1
| spl0_2 ),
inference(forward_subsumption_resolution,[status(thm)],[f222,f191]) ).
fof(f224,plain,
( spl0_1
| spl0_2 ),
inference(contradiction_clause,[status(thm)],[f223]) ).
fof(f225,plain,
( sk0_1(singleton(sk0_3),sk0_0(sk0_3,sum(singleton(sk0_3)))) = sk0_3
| ~ spl0_3 ),
inference(resolution,[status(thm)],[f202,f105]) ).
fof(f228,plain,
( spl0_5
<=> member(sk0_0(sk0_3,sum(singleton(sk0_3))),sk0_3) ),
introduced(split_symbol_definition) ).
fof(f229,plain,
( member(sk0_0(sk0_3,sum(singleton(sk0_3))),sk0_3)
| ~ spl0_5 ),
inference(component_clause,[status(thm)],[f228]) ).
fof(f231,plain,
( ~ member(sk0_0(sk0_3,sum(singleton(sk0_3))),sum(singleton(sk0_3)))
| member(sk0_0(sk0_3,sum(singleton(sk0_3))),sk0_3)
| ~ spl0_3 ),
inference(paramodulation,[status(thm)],[f225,f59]) ).
fof(f232,plain,
( ~ spl0_3
| spl0_5 ),
inference(split_clause,[status(thm)],[f231,f201,f228]) ).
fof(f235,plain,
( subset(sum(singleton(sk0_3)),sk0_3)
| ~ spl0_5 ),
inference(resolution,[status(thm)],[f229,f20]) ).
fof(f236,plain,
( $false
| spl0_1
| ~ spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f235,f191]) ).
fof(f237,plain,
( spl0_1
| ~ spl0_5 ),
inference(contradiction_clause,[status(thm)],[f236]) ).
fof(f238,plain,
$false,
inference(sat_refutation,[status(thm)],[f193,f196,f205,f224,f232,f237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET351+4 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.12/0.34 % Computer : n008.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 29 21:49:42 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.35 % Drodi V3.6.0
% 0.20/0.44 % Refutation found
% 0.20/0.44 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.20/0.44 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.48 % Elapsed time: 0.118738 seconds
% 0.20/0.48 % CPU time: 0.767727 seconds
% 0.20/0.48 % Total memory used: 59.590 MB
% 0.20/0.48 % Net memory used: 59.187 MB
%------------------------------------------------------------------------------