TSTP Solution File: SET573+3 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n020.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:41 EDT 2023
% Result : Theorem 0.14s 0.36s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 5 unt; 0 def)
% Number of atoms : 61 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 67 ( 27 ~; 19 |; 17 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 47 (; 38 !; 9 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [B,C] :
( disjoint(B,C)
<=> ~ intersect(B,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,conjecture,
! [B,C,D] :
( ( member(B,C)
& disjoint(C,D) )
=> ~ member(B,D) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,negated_conjecture,
~ ! [B,C,D] :
( ( member(B,C)
& disjoint(C,D) )
=> ~ member(B,D) ),
inference(negated_conjecture,[status(cth)],[f4]) ).
fof(f6,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)],[f1]) ).
fof(f7,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)],[f6]) ).
fof(f8,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)],[f7]) ).
fof(f11,plain,
! [X0,X1,X2] :
( intersect(X0,X1)
| ~ member(X2,X0)
| ~ member(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f8]) ).
fof(f12,plain,
! [B,C] :
( ( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ( disjoint(B,C)
| intersect(B,C) ) ),
inference(NNF_transformation,[status(esa)],[f2]) ).
fof(f13,plain,
( ! [B,C] :
( ~ disjoint(B,C)
| ~ intersect(B,C) )
& ! [B,C] :
( disjoint(B,C)
| intersect(B,C) ) ),
inference(miniscoping,[status(esa)],[f12]) ).
fof(f14,plain,
! [X0,X1] :
( ~ disjoint(X0,X1)
| ~ intersect(X0,X1) ),
inference(cnf_transformation,[status(esa)],[f13]) ).
fof(f18,plain,
? [B,C,D] :
( member(B,C)
& disjoint(C,D)
& member(B,D) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f19,plain,
? [B,D] :
( ? [C] :
( member(B,C)
& disjoint(C,D) )
& member(B,D) ),
inference(miniscoping,[status(esa)],[f18]) ).
fof(f20,plain,
( member(sk0_1,sk0_3)
& disjoint(sk0_3,sk0_2)
& member(sk0_1,sk0_2) ),
inference(skolemization,[status(esa)],[f19]) ).
fof(f21,plain,
member(sk0_1,sk0_3),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f22,plain,
disjoint(sk0_3,sk0_2),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f23,plain,
member(sk0_1,sk0_2),
inference(cnf_transformation,[status(esa)],[f20]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ~ member(X0,X1)
| ~ member(X0,X2)
| ~ disjoint(X1,X2) ),
inference(resolution,[status(thm)],[f11,f14]) ).
fof(f25,plain,
! [X0] :
( ~ member(sk0_1,X0)
| ~ disjoint(X0,sk0_2) ),
inference(resolution,[status(thm)],[f24,f23]) ).
fof(f29,plain,
~ member(sk0_1,sk0_3),
inference(resolution,[status(thm)],[f25,f22]) ).
fof(f30,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f29,f21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SET573+3 : TPTP v8.1.2. Released v2.2.0.
% 0.08/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue May 30 10:14:13 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.35 % Drodi V3.5.1
% 0.14/0.36 % Refutation found
% 0.14/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.14/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.20/0.58 % Elapsed time: 0.014532 seconds
% 0.20/0.58 % CPU time: 0.027442 seconds
% 0.20/0.58 % Memory used: 1.845 MB
%------------------------------------------------------------------------------