TSTP Solution File: SEU121+1 by Drodi---3.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.5.1
% Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.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 : Wed May 31 12:35:52 EDT 2023
% Result : Theorem 0.13s 0.35s
% Output : CNFRefutation 0.13s
% 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 : 66 ( 25 ~; 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(f2,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f8,conjecture,
! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).
fof(f9,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
fof(f15,plain,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( ~ in(C,A)
| in(C,B) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f16,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)],[f15]) ).
fof(f17,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)],[f16]) ).
fof(f18,plain,
( ! [A,B] :
( ~ subset(A,B)
| ! [C] :
( ~ in(C,A)
| in(C,B) ) )
& ! [A,B] :
( subset(A,B)
| ( in(sk0_0(B,A),A)
& ~ in(sk0_0(B,A),B) ) ) ),
inference(skolemization,[status(esa)],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ~ subset(X0,X1)
| ~ in(X2,X0)
| in(X2,X1) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( subset(X0,X1)
| in(sk0_0(X1,X0),X0) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f21,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ in(sk0_0(X1,X0),X1) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f29,plain,
? [A,B,C] :
( subset(A,B)
& subset(B,C)
& ~ subset(A,C) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f30,plain,
? [A,C] :
( ? [B] :
( subset(A,B)
& subset(B,C) )
& ~ subset(A,C) ),
inference(miniscoping,[status(esa)],[f29]) ).
fof(f31,plain,
( subset(sk0_3,sk0_5)
& subset(sk0_5,sk0_4)
& ~ subset(sk0_3,sk0_4) ),
inference(skolemization,[status(esa)],[f30]) ).
fof(f32,plain,
subset(sk0_3,sk0_5),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f33,plain,
subset(sk0_5,sk0_4),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f34,plain,
~ subset(sk0_3,sk0_4),
inference(cnf_transformation,[status(esa)],[f31]) ).
fof(f43,plain,
! [X0] :
( ~ in(X0,sk0_5)
| in(X0,sk0_4) ),
inference(resolution,[status(thm)],[f19,f33]) ).
fof(f44,plain,
! [X0] :
( ~ in(X0,sk0_3)
| in(X0,sk0_5) ),
inference(resolution,[status(thm)],[f19,f32]) ).
fof(f45,plain,
! [X0] :
( ~ in(X0,sk0_3)
| in(X0,sk0_4) ),
inference(resolution,[status(thm)],[f44,f43]) ).
fof(f79,plain,
! [X0] :
( subset(X0,sk0_4)
| ~ in(sk0_0(sk0_4,X0),sk0_3) ),
inference(resolution,[status(thm)],[f21,f45]) ).
fof(f87,plain,
( spl0_3
<=> subset(sk0_3,sk0_4) ),
introduced(split_symbol_definition) ).
fof(f88,plain,
( subset(sk0_3,sk0_4)
| ~ spl0_3 ),
inference(component_clause,[status(thm)],[f87]) ).
fof(f90,plain,
( subset(sk0_3,sk0_4)
| subset(sk0_3,sk0_4) ),
inference(resolution,[status(thm)],[f79,f20]) ).
fof(f91,plain,
spl0_3,
inference(split_clause,[status(thm)],[f90,f87]) ).
fof(f92,plain,
( $false
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f88,f34]) ).
fof(f93,plain,
~ spl0_3,
inference(contradiction_clause,[status(thm)],[f92]) ).
fof(f94,plain,
$false,
inference(sat_refutation,[status(thm)],[f91,f93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU121+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.12 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.33 % Computer : n008.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Tue May 30 09:19:53 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % Drodi V3.5.1
% 0.13/0.35 % Refutation found
% 0.13/0.35 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.35 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.19/0.56 % Elapsed time: 0.012643 seconds
% 0.19/0.56 % CPU time: 0.027699 seconds
% 0.19/0.56 % Memory used: 11.420 MB
%------------------------------------------------------------------------------