TSTP Solution File: KRS187+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : KRS187+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% Computer : n013.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 Aug 31 17:29:59 EDT 2022
% Result : Theorem 0.20s 0.48s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 9 unt; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 107 ( 38 ~; 29 |; 23 &)
% ( 7 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-2 aty)
% Number of variables : 94 ( 75 !; 19 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f328,plain,
$false,
inference(resolution,[],[f317,f309]) ).
fof(f309,plain,
~ status(sK18(tac,thm),sK17(tac,thm),thm),
inference(resolution,[],[f286,f242]) ).
fof(f242,plain,
! [X0,X1] :
( isa(X0,X1)
| ~ status(sK18(X0,X1),sK17(X0,X1),X1) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0,X1] :
( ( status(sK18(X0,X1),sK17(X0,X1),X0)
& ~ status(sK18(X0,X1),sK17(X0,X1),X1) )
| isa(X0,X1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK17,sK18])],[f123,f124]) ).
fof(f124,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X3,X2,X0)
& ~ status(X3,X2,X1) )
=> ( status(sK18(X0,X1),sK17(X0,X1),X0)
& ~ status(sK18(X0,X1),sK17(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
! [X0,X1] :
( ? [X2,X3] :
( status(X3,X2,X0)
& ~ status(X3,X2,X1) )
| isa(X0,X1) ),
inference(rectify,[],[f66]) ).
fof(f66,plain,
! [X0,X1] :
( ? [X3,X2] :
( status(X2,X3,X0)
& ~ status(X2,X3,X1) )
| isa(X0,X1) ),
inference(ennf_transformation,[],[f61]) ).
fof(f61,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
=> isa(X0,X1) ),
inference(unused_predicate_definition_removal,[],[f57]) ).
fof(f57,plain,
! [X0,X1] :
( ! [X2,X3] :
( status(X2,X3,X0)
=> status(X2,X3,X1) )
<=> isa(X0,X1) ),
inference(rectify,[],[f21]) ).
fof(f21,axiom,
! [X6,X7] :
( ! [X0,X1] :
( status(X0,X1,X6)
=> status(X0,X1,X7) )
<=> isa(X6,X7) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa) ).
fof(f286,plain,
~ isa(tac,thm),
inference(cnf_transformation,[],[f46]) ).
fof(f46,plain,
~ isa(tac,thm),
inference(flattening,[],[f34]) ).
fof(f34,negated_conjecture,
~ isa(tac,thm),
inference(negated_conjecture,[],[f33]) ).
fof(f33,conjecture,
isa(tac,thm),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',isa_tac_thm) ).
fof(f317,plain,
! [X7] : status(X7,sK17(tac,thm),thm),
inference(resolution,[],[f311,f238]) ).
fof(f238,plain,
! [X0,X1] :
( ~ model(sK14(X0,X1),X0)
| status(X1,X0,thm) ),
inference(cnf_transformation,[],[f116]) ).
fof(f116,plain,
! [X0,X1] :
( ( status(X1,X0,thm)
| ( ~ model(sK14(X0,X1),X0)
& model(sK14(X0,X1),X1) ) )
& ( ! [X3] :
( model(X3,X0)
| ~ model(X3,X1) )
| ~ status(X1,X0,thm) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK14])],[f114,f115]) ).
fof(f115,plain,
! [X0,X1] :
( ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) )
=> ( ~ model(sK14(X0,X1),X0)
& model(sK14(X0,X1),X1) ) ),
introduced(choice_axiom,[]) ).
fof(f114,plain,
! [X0,X1] :
( ( status(X1,X0,thm)
| ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) ) )
& ( ! [X3] :
( model(X3,X0)
| ~ model(X3,X1) )
| ~ status(X1,X0,thm) ) ),
inference(rectify,[],[f113]) ).
fof(f113,plain,
! [X0,X1] :
( ( status(X1,X0,thm)
| ? [X2] :
( ~ model(X2,X0)
& model(X2,X1) ) )
& ( ! [X2] :
( model(X2,X0)
| ~ model(X2,X1) )
| ~ status(X1,X0,thm) ) ),
inference(nnf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0,X1] :
( status(X1,X0,thm)
<=> ! [X2] :
( model(X2,X0)
| ~ model(X2,X1) ) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
! [X1,X0] :
( status(X1,X0,thm)
<=> ! [X2] :
( model(X2,X1)
=> model(X2,X0) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X1,X0] :
( status(X0,X1,thm)
<=> ! [X2] :
( model(X2,X0)
=> model(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm) ).
fof(f311,plain,
! [X0] : model(X0,sK17(tac,thm)),
inference(resolution,[],[f308,f219]) ).
fof(f219,plain,
! [X0,X1,X5] :
( ~ status(X1,X0,tac)
| model(X5,X0) ),
inference(cnf_transformation,[],[f88]) ).
fof(f88,plain,
! [X0,X1] :
( ( status(X1,X0,tac)
| ! [X2] : ~ model(X2,X1)
| ~ model(sK3(X0),X0) )
& ( ( model(sK4(X1),X1)
& ! [X5] : model(X5,X0) )
| ~ status(X1,X0,tac) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f85,f87,f86]) ).
fof(f86,plain,
! [X0] :
( ? [X3] : ~ model(X3,X0)
=> ~ model(sK3(X0),X0) ),
introduced(choice_axiom,[]) ).
fof(f87,plain,
! [X1] :
( ? [X4] : model(X4,X1)
=> model(sK4(X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f85,plain,
! [X0,X1] :
( ( status(X1,X0,tac)
| ! [X2] : ~ model(X2,X1)
| ? [X3] : ~ model(X3,X0) )
& ( ( ? [X4] : model(X4,X1)
& ! [X5] : model(X5,X0) )
| ~ status(X1,X0,tac) ) ),
inference(rectify,[],[f84]) ).
fof(f84,plain,
! [X1,X0] :
( ( status(X0,X1,tac)
| ! [X3] : ~ model(X3,X0)
| ? [X2] : ~ model(X2,X1) )
& ( ( ? [X3] : model(X3,X0)
& ! [X2] : model(X2,X1) )
| ~ status(X0,X1,tac) ) ),
inference(flattening,[],[f83]) ).
fof(f83,plain,
! [X1,X0] :
( ( status(X0,X1,tac)
| ! [X3] : ~ model(X3,X0)
| ? [X2] : ~ model(X2,X1) )
& ( ( ? [X3] : model(X3,X0)
& ! [X2] : model(X2,X1) )
| ~ status(X0,X1,tac) ) ),
inference(nnf_transformation,[],[f44]) ).
fof(f44,plain,
! [X1,X0] :
( status(X0,X1,tac)
<=> ( ? [X3] : model(X3,X0)
& ! [X2] : model(X2,X1) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X0,X1] :
( ( ! [X3] : model(X3,X1)
& ? [X2] : model(X2,X0) )
<=> status(X0,X1,tac) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',tac) ).
fof(f308,plain,
status(sK18(tac,thm),sK17(tac,thm),tac),
inference(resolution,[],[f286,f243]) ).
fof(f243,plain,
! [X0,X1] :
( isa(X0,X1)
| status(sK18(X0,X1),sK17(X0,X1),X0) ),
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS187+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.34 % Computer : n013.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 Aug 30 00:31:47 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.20/0.47 % (29951)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.48 % (29951)First to succeed.
% 0.20/0.48 % (29941)dis+1010_1:50_awrs=decay:awrsf=128:nwc=10.0:s2pl=no:sp=frequency:ss=axioms:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.20/0.48 % (29951)Refutation found. Thanks to Tanya!
% 0.20/0.48 % SZS status Theorem for theBenchmark
% 0.20/0.48 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.48 % (29951)------------------------------
% 0.20/0.48 % (29951)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.48 % (29951)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.48 % (29951)Termination reason: Refutation
% 0.20/0.48
% 0.20/0.48 % (29951)Memory used [KB]: 6140
% 0.20/0.48 % (29951)Time elapsed: 0.057 s
% 0.20/0.48 % (29951)Instructions burned: 6 (million)
% 0.20/0.48 % (29951)------------------------------
% 0.20/0.48 % (29951)------------------------------
% 0.20/0.48 % (29934)Success in time 0.13 s
%------------------------------------------------------------------------------