TSTP Solution File: SEU121+2 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU121+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n015.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:35:52 EDT 2023
% Result : Theorem 0.11s 0.35s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 6 unt; 0 def)
% Number of atoms : 68 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 64 ( 23 ~; 21 |; 14 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 44 (; 36 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f15,conjecture,
! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f16,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f30,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( ~ in(C,A)
| in(C,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f4]) ).
fof(f31,plain,
! [A,B] :
( ( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ( subset(A,B)
| ? [C] :
( in(C,A)
& ~ in(C,B) ) ) ),
inference(NNF_transformation,[status(esa)],[f30]) ).
fof(f32,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ? [C] :
( in(C,A)
& ~ in(C,B) ) ) ),
inference(miniscoping,[status(esa)],[f31]) ).
fof(f33,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ( in(sk0_1(B,A),A)
& ~ in(sk0_1(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f32]) ).
fof(f34,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sk0_1(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f36,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sk0_1(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f33]) ).
fof(f61,plain,
? [A,B,C] :
( subset(A,B)
& subset(B,C)
& ~ subset(A,C) ),
inference(pre_NNF_transformation,[status(esa)],[f16]) ).
fof(f62,plain,
? [A,C] :
( ? [B] :
( subset(A,B)
& subset(B,C) )
& ~ subset(A,C) ),
inference(miniscoping,[status(esa)],[f61]) ).
fof(f63,plain,
( subset(sk0_5,sk0_7)
& subset(sk0_7,sk0_6)
& ~ subset(sk0_5,sk0_6) ),
inference(skolemization,[status(esa)],[f62]) ).
fof(f64,plain,
subset(sk0_5,sk0_7),
inference(cnf_transformation,[status(esa)],[f63]) ).
fof(f65,plain,
subset(sk0_7,sk0_6),
inference(cnf_transformation,[status(esa)],[f63]) ).
fof(f66,plain,
~ subset(sk0_5,sk0_6),
inference(cnf_transformation,[status(esa)],[f63]) ).
fof(f90,plain,
! [X0] :
( ~ in(X0,sk0_7)
| in(X0,sk0_6) ),
inference(resolution,[status(thm)],[f34,f65]) ).
fof(f91,plain,
! [X0] :
( ~ in(X0,sk0_5)
| in(X0,sk0_7) ),
inference(resolution,[status(thm)],[f34,f64]) ).
fof(f133,plain,
! [X0] :
( subset(sk0_5,X0)
| in(sk0_1(X0,sk0_5),sk0_7) ),
inference(resolution,[status(thm)],[f35,f91]) ).
fof(f181,plain,
! [X0] :
( subset(sk0_5,X0)
| in(sk0_1(X0,sk0_5),sk0_6) ),
inference(resolution,[status(thm)],[f133,f90]) ).
fof(f205,plain,
( spl0_10
<=> subset(sk0_5,sk0_6) ),
introduced(split_symbol_definition) ).
fof(f206,plain,
( subset(sk0_5,sk0_6)
| ~ spl0_10 ),
inference(component_clause,[status(thm)],[f205]) ).
fof(f208,plain,
( subset(sk0_5,sk0_6)
| subset(sk0_5,sk0_6) ),
inference(resolution,[status(thm)],[f181,f36]) ).
fof(f209,plain,
spl0_10,
inference(split_clause,[status(thm)],[f208,f205]) ).
fof(f213,plain,
( $false
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[status(thm)],[f206,f66]) ).
fof(f214,plain,
~ spl0_10,
inference(contradiction_clause,[status(thm)],[f213]) ).
fof(f215,plain,
$false,
inference(sat_refutation,[status(thm)],[f209,f214]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : SEU121+2 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.11 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.11/0.32 % Computer : n015.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue May 30 09:27:04 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.11/0.33 % Drodi V3.5.1
% 0.11/0.35 % Refutation found
% 0.11/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.11/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.11/0.35 % Elapsed time: 0.024087 seconds
% 0.11/0.35 % CPU time: 0.039278 seconds
% 0.11/0.35 % Memory used: 14.497 MB
%------------------------------------------------------------------------------