TSTP Solution File: SET581+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET581+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n003.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:42 EDT 2023
% Result : Theorem 0.07s 0.28s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 23 ( 8 unt; 0 def)
% Number of atoms : 58 ( 7 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 60 ( 25 ~; 16 |; 15 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 41 (; 35 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C,D] :
( member(D,intersection(B,C))
<=> ( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B] : ~ member(B,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
! [B,C] :
( not_equal(B,C)
<=> B != C ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,conjecture,
! [B,C,D] :
( ( member(B,C)
& member(B,D) )
=> not_equal(intersection(C,D),empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f8,negated_conjecture,
~ ! [B,C,D] :
( ( member(B,C)
& member(B,D) )
=> not_equal(intersection(C,D),empty_set) ),
inference(negated_conjecture,[status(cth)],[f7]) ).
fof(f9,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(f10,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)],[f9]) ).
fof(f13,plain,
! [X0,X1,X2] :
( member(X0,intersection(X1,X2))
| ~ member(X0,X1)
| ~ member(X0,X2) ),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f14,plain,
! [X0] : ~ member(X0,empty_set),
inference(cnf_transformation,[status(esa)],[f2]) ).
fof(f22,plain,
! [B,C] :
( ( ~ not_equal(B,C)
| B != C )
& ( not_equal(B,C)
| B = C ) ),
inference(NNF_transformation,[status(esa)],[f4]) ).
fof(f23,plain,
( ! [B,C] :
( ~ not_equal(B,C)
| B != C )
& ! [B,C] :
( not_equal(B,C)
| B = C ) ),
inference(miniscoping,[status(esa)],[f22]) ).
fof(f25,plain,
! [X0,X1] :
( not_equal(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f23]) ).
fof(f32,plain,
? [B,C,D] :
( member(B,C)
& member(B,D)
& ~ not_equal(intersection(C,D),empty_set) ),
inference(pre_NNF_transformation,[status(esa)],[f8]) ).
fof(f33,plain,
? [C,D] :
( ? [B] :
( member(B,C)
& member(B,D) )
& ~ not_equal(intersection(C,D),empty_set) ),
inference(miniscoping,[status(esa)],[f32]) ).
fof(f34,plain,
( member(sk0_4,sk0_2)
& member(sk0_4,sk0_3)
& ~ not_equal(intersection(sk0_2,sk0_3),empty_set) ),
inference(skolemization,[status(esa)],[f33]) ).
fof(f35,plain,
member(sk0_4,sk0_2),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f36,plain,
member(sk0_4,sk0_3),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f37,plain,
~ not_equal(intersection(sk0_2,sk0_3),empty_set),
inference(cnf_transformation,[status(esa)],[f34]) ).
fof(f39,plain,
intersection(sk0_2,sk0_3) = empty_set,
inference(resolution,[status(thm)],[f25,f37]) ).
fof(f47,plain,
! [X0] :
( member(X0,empty_set)
| ~ member(X0,sk0_2)
| ~ member(X0,sk0_3) ),
inference(paramodulation,[status(thm)],[f39,f13]) ).
fof(f48,plain,
! [X0] :
( ~ member(X0,sk0_2)
| ~ member(X0,sk0_3) ),
inference(forward_subsumption_resolution,[status(thm)],[f47,f14]) ).
fof(f51,plain,
~ member(sk0_4,sk0_2),
inference(resolution,[status(thm)],[f48,f36]) ).
fof(f52,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f51,f35]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SET581+3 : TPTP v8.1.2. Released v2.2.0.
% 0.00/0.07 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.07/0.26 % Computer : n003.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Tue May 30 10:14:08 EDT 2023
% 0.07/0.26 % CPUTime :
% 0.07/0.27 % Drodi V3.5.1
% 0.07/0.28 % Refutation found
% 0.07/0.28 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.07/0.28 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.07/0.28 % Elapsed time: 0.014681 seconds
% 0.07/0.28 % CPU time: 0.019903 seconds
% 0.07/0.28 % Memory used: 14.253 MB
%------------------------------------------------------------------------------