TSTP Solution File: SET629+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n009.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:52 EDT 2023
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 38 ( 10 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 117 ( 51 ~; 42 |; 19 &)
% ( 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 96 (; 91 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C,D] :
( member(D,difference(B,C))
<=> ( member(D,B)
& ~ member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f6,axiom,
! [B,C] :
( intersect(B,C)
=> intersect(C,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,conjecture,
! [B,C] : disjoint(intersection(B,C),difference(B,C)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ ! [B,C] : disjoint(intersection(B,C),difference(B,C)),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f10,plain,
! [B,C,D] :
( ( ~ member(D,intersection(B,C))
| ( member(D,B)
& member(D,C) ) )
& ( member(D,intersection(B,C))
| ~ member(D,B)
| ~ member(D,C) ) ),
inference(NNF_transformation,[status(esa)],[f1]) ).
fof(f11,plain,
( ! [B,C,D] :
( ~ member(D,intersection(B,C))
| ( member(D,B)
& member(D,C) ) )
& ! [B,C,D] :
( member(D,intersection(B,C))
| ~ member(D,B)
| ~ member(D,C) ) ),
inference(miniscoping,[status(esa)],[f10]) ).
fof(f13,plain,
! [X0,X1,X2] :
( ~ member(X0,intersection(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f11]) ).
fof(f15,plain,
! [B,C,D] :
( ( ~ member(D,difference(B,C))
| ( member(D,B)
& ~ member(D,C) ) )
& ( member(D,difference(B,C))
| ~ member(D,B)
| member(D,C) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f16,plain,
( ! [B,C,D] :
( ~ member(D,difference(B,C))
| ( member(D,B)
& ~ member(D,C) ) )
& ! [B,C,D] :
( member(D,difference(B,C))
| ~ member(D,B)
| member(D,C) ) ),
inference(miniscoping,[status(esa)],[f15]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ~ member(X0,difference(X1,X2))
| ~ member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f16]) ).
fof(f20,plain,
! [B,C] :
( ( ~ intersect(B,C)
| ? [D] :
( member(D,B)
& member(D,C) ) )
& ( intersect(B,C)
| ! [D] :
( ~ member(D,B)
| ~ member(D,C) ) ) ),
inference(NNF_transformation,[status(esa)],[f3]) ).
fof(f21,plain,
( ! [B,C] :
( ~ intersect(B,C)
| ? [D] :
( member(D,B)
& member(D,C) ) )
& ! [B,C] :
( intersect(B,C)
| ! [D] :
( ~ member(D,B)
| ~ member(D,C) ) ) ),
inference(miniscoping,[status(esa)],[f20]) ).
fof(f22,plain,
( ! [B,C] :
( ~ intersect(B,C)
| ( member(sk0_0(C,B),B)
& member(sk0_0(C,B),C) ) )
& ! [B,C] :
( intersect(B,C)
| ! [D] :
( ~ member(D,B)
| ~ member(D,C) ) ) ),
inference(skolemization,[status(esa)],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sk0_0(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| member(sk0_0(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f25,plain,
! [X0,X1,X2] :
( intersect(X0,X1)
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f22]) ).
fof(f26,plain,
! [B,C] :
( ( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ( disjoint(B,C)
| intersect(B,C) ) ),
inference(NNF_transformation,[status(esa)],[f4]) ).
fof(f27,plain,
( ! [B,C] :
( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ! [B,C] :
( disjoint(B,C)
| intersect(B,C) ) ),
inference(miniscoping,[status(esa)],[f26]) ).
fof(f29,plain,
! [X0,X1] :
( disjoint(X0,X1)
| intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f27]) ).
fof(f31,plain,
! [B,C] :
( ~ intersect(B,C)
| intersect(C,B) ),
inference(pre_NNF_transformation,[status(esa)],[f6]) ).
fof(f32,plain,
! [X0,X1] :
( ~ intersect(X0,X1)
| intersect(X1,X0) ),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f40,plain,
? [B,C] : ~ disjoint(intersection(B,C),difference(B,C)),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f41,plain,
~ disjoint(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3)),
inference(skolemization,[status(esa)],[f40]) ).
fof(f42,plain,
~ disjoint(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3)),
inference(cnf_transformation,[status(esa)],[f41]) ).
fof(f43,plain,
intersect(intersection(sk0_2,sk0_3),difference(sk0_2,sk0_3)),
inference(resolution,[status(thm)],[f29,f42]) ).
fof(f52,plain,
! [X0,X1,X2] :
( ~ intersect(difference(X0,X1),X2)
| ~ member(sk0_0(X2,difference(X0,X1)),X1) ),
inference(resolution,[status(thm)],[f23,f18]) ).
fof(f54,plain,
! [X0,X1,X2] :
( ~ intersect(intersection(X0,X1),X2)
| member(sk0_0(X2,intersection(X0,X1)),X1) ),
inference(resolution,[status(thm)],[f23,f13]) ).
fof(f64,plain,
! [X0,X1] :
( ~ intersect(difference(X0,X1),X1)
| ~ intersect(difference(X0,X1),X1) ),
inference(resolution,[status(thm)],[f24,f52]) ).
fof(f65,plain,
! [X0,X1] : ~ intersect(difference(X0,X1),X1),
inference(duplicate_literals_removal,[status(esa)],[f64]) ).
fof(f71,plain,
! [X0,X1,X2] :
( intersect(X0,X1)
| ~ member(sk0_0(X1,X2),X0)
| ~ intersect(X2,X1) ),
inference(resolution,[status(thm)],[f25,f24]) ).
fof(f107,plain,
! [X0,X1,X2] :
( ~ intersect(intersection(X0,X1),X2)
| intersect(X1,X2)
| ~ intersect(intersection(X0,X1),X2) ),
inference(resolution,[status(thm)],[f54,f71]) ).
fof(f108,plain,
! [X0,X1,X2] :
( ~ intersect(intersection(X0,X1),X2)
| intersect(X1,X2) ),
inference(duplicate_literals_removal,[status(esa)],[f107]) ).
fof(f118,plain,
intersect(sk0_3,difference(sk0_2,sk0_3)),
inference(resolution,[status(thm)],[f108,f43]) ).
fof(f130,plain,
intersect(difference(sk0_2,sk0_3),sk0_3),
inference(resolution,[status(thm)],[f118,f32]) ).
fof(f131,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f130,f65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET629+3 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue May 30 10:11:16 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.5.1
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.63 % Elapsed time: 0.066712 seconds
% 0.21/0.63 % CPU time: 0.024733 seconds
% 0.21/0.63 % Memory used: 3.670 MB
%------------------------------------------------------------------------------