TSTP Solution File: KRS086+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : KRS086+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% Computer : n010.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:30:46 EDT 2022
% Result : Unsatisfiable 1.41s 0.53s
% Output : Refutation 1.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 11 unt; 3 typ; 0 def)
% Number of atoms : 148 ( 10 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 168 ( 65 ~; 50 |; 42 &)
% ( 4 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 0 usr; 3 ari)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 9 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 86 ( 65 !; 21 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(pred_def_12,type,
sQ4_eqProxy: ( $int * $int ) > $o ).
tff(pred_def_13,type,
sQ5_eqProxy: ( $rat * $rat ) > $o ).
tff(pred_def_14,type,
sQ6_eqProxy: ( $real * $real ) > $o ).
fof(f239,plain,
$false,
inference(subsumption_resolution,[],[f238,f140]) ).
fof(f140,plain,
cUnsatisfiable(i2003_11_14_17_19_42328),
inference(literal_reordering,[],[f112]) ).
fof(f112,plain,
cUnsatisfiable(i2003_11_14_17_19_42328),
inference(cnf_transformation,[],[f22]) ).
fof(f22,axiom,
cUnsatisfiable(i2003_11_14_17_19_42328),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).
fof(f238,plain,
~ cUnsatisfiable(i2003_11_14_17_19_42328),
inference(resolution,[],[f234,f139]) ).
fof(f139,plain,
! [X0] :
( cp1(sK0(X0))
| ~ cUnsatisfiable(X0) ),
inference(literal_reordering,[],[f103]) ).
fof(f103,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| cp1(sK0(X0)) ),
inference(cnf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0] :
( ( ( cp1(sK0(X0))
& rinvF(sK0(X0),sK1(X0))
& rf(sK1(X0),sK2(X0))
& ~ cp1(sK2(X0))
& rf(X0,sK0(X0)) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X4] :
( ~ cp1(X4)
| ! [X5] :
( ~ rinvF(X4,X5)
| ! [X6] :
( ~ rf(X5,X6)
| cp1(X6) ) )
| ~ rf(X0,X4) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f73,f76,f75,f74]) ).
fof(f74,plain,
! [X0] :
( ? [X1] :
( cp1(X1)
& ? [X2] :
( rinvF(X1,X2)
& ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
& rf(X0,X1) )
=> ( cp1(sK0(X0))
& ? [X2] :
( rinvF(sK0(X0),X2)
& ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
& rf(X0,sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f75,plain,
! [X0] :
( ? [X2] :
( rinvF(sK0(X0),X2)
& ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
=> ( rinvF(sK0(X0),sK1(X0))
& ? [X3] :
( rf(sK1(X0),X3)
& ~ cp1(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f76,plain,
! [X0] :
( ? [X3] :
( rf(sK1(X0),X3)
& ~ cp1(X3) )
=> ( rf(sK1(X0),sK2(X0))
& ~ cp1(sK2(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f73,plain,
! [X0] :
( ( ? [X1] :
( cp1(X1)
& ? [X2] :
( rinvF(X1,X2)
& ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
& rf(X0,X1) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X4] :
( ~ cp1(X4)
| ! [X5] :
( ~ rinvF(X4,X5)
| ! [X6] :
( ~ rf(X5,X6)
| cp1(X6) ) )
| ~ rf(X0,X4) ) ) ),
inference(rectify,[],[f72]) ).
fof(f72,plain,
! [X0] :
( ( ? [X1] :
( cp1(X1)
& ? [X2] :
( rinvF(X1,X2)
& ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
& rf(X0,X1) )
| ~ cUnsatisfiable(X0) )
& ( cUnsatisfiable(X0)
| ! [X1] :
( ~ cp1(X1)
| ! [X2] :
( ~ rinvF(X1,X2)
| ! [X3] :
( ~ rf(X2,X3)
| cp1(X3) ) )
| ~ rf(X0,X1) ) ) ),
inference(nnf_transformation,[],[f33]) ).
fof(f33,plain,
! [X0] :
( ? [X1] :
( cp1(X1)
& ? [X2] :
( rinvF(X1,X2)
& ? [X3] :
( rf(X2,X3)
& ~ cp1(X3) ) )
& rf(X0,X1) )
<=> cUnsatisfiable(X0) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X3] :
( ? [X4] :
( ? [X5] :
( rinvF(X4,X5)
& ? [X6] :
( rf(X5,X6)
& ~ cp1(X6) ) )
& cp1(X4)
& rf(X3,X4) )
<=> cUnsatisfiable(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
fof(f234,plain,
~ cp1(sK0(i2003_11_14_17_19_42328)),
inference(subsumption_resolution,[],[f233,f140]) ).
fof(f233,plain,
( ~ cUnsatisfiable(i2003_11_14_17_19_42328)
| ~ cp1(sK0(i2003_11_14_17_19_42328)) ),
inference(superposition,[],[f159,f224]) ).
fof(f224,plain,
sK0(i2003_11_14_17_19_42328) = sK2(i2003_11_14_17_19_42328),
inference(resolution,[],[f212,f214]) ).
fof(f214,plain,
rf(sK1(i2003_11_14_17_19_42328),sK0(i2003_11_14_17_19_42328)),
inference(resolution,[],[f204,f140]) ).
fof(f204,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(sK1(X0),sK0(X0)) ),
inference(resolution,[],[f155,f142]) ).
fof(f142,plain,
! [X0,X1] :
( ~ rinvF(X1,X0)
| rf(X0,X1) ),
inference(literal_reordering,[],[f119]) ).
fof(f119,plain,
! [X0,X1] :
( ~ rinvF(X1,X0)
| rf(X0,X1) ),
inference(cnf_transformation,[],[f89]) ).
fof(f89,plain,
! [X0,X1] :
( ( rinvF(X1,X0)
| ~ rf(X0,X1) )
& ( rf(X0,X1)
| ~ rinvF(X1,X0) ) ),
inference(nnf_transformation,[],[f32]) ).
fof(f32,plain,
! [X0,X1] :
( rinvF(X1,X0)
<=> rf(X0,X1) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X4,X3] :
( rf(X4,X3)
<=> rinvF(X3,X4) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).
fof(f155,plain,
! [X0] :
( rinvF(sK0(X0),sK1(X0))
| ~ cUnsatisfiable(X0) ),
inference(literal_reordering,[],[f102]) ).
fof(f102,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rinvF(sK0(X0),sK1(X0)) ),
inference(cnf_transformation,[],[f77]) ).
fof(f212,plain,
! [X2] :
( ~ rf(sK1(i2003_11_14_17_19_42328),X2)
| sK2(i2003_11_14_17_19_42328) = X2 ),
inference(resolution,[],[f205,f206]) ).
fof(f206,plain,
! [X2,X0,X1] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 ),
inference(subsumption_resolution,[],[f145,f167]) ).
fof(f167,plain,
! [X0] : cowlThing(X0),
inference(literal_reordering,[],[f107]) ).
fof(f107,plain,
! [X0] : cowlThing(X0),
inference(cnf_transformation,[],[f36]) ).
fof(f36,plain,
! [X0] :
( ~ cowlNothing(X0)
& cowlThing(X0) ),
inference(rectify,[],[f15]) ).
fof(f15,axiom,
! [X3] :
( ~ cowlNothing(X3)
& cowlThing(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_0) ).
fof(f145,plain,
! [X2,X0,X1] :
( X1 = X2
| ~ rf(X0,X1)
| ~ cowlThing(X0)
| ~ rf(X0,X2) ),
inference(literal_reordering,[],[f93]) ).
fof(f93,plain,
! [X2,X0,X1] :
( ~ rf(X0,X1)
| ~ cowlThing(X0)
| ~ rf(X0,X2)
| X1 = X2 ),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
! [X0] :
( ! [X1,X2] :
( ~ rf(X0,X2)
| ~ rf(X0,X1)
| X1 = X2 )
| ~ cowlThing(X0) ),
inference(rectify,[],[f51]) ).
fof(f51,plain,
! [X0] :
( ! [X2,X1] :
( ~ rf(X0,X1)
| ~ rf(X0,X2)
| X1 = X2 )
| ~ cowlThing(X0) ),
inference(flattening,[],[f50]) ).
fof(f50,plain,
! [X0] :
( ! [X2,X1] :
( X1 = X2
| ~ rf(X0,X2)
| ~ rf(X0,X1) )
| ~ cowlThing(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0] :
( cowlThing(X0)
=> ! [X2,X1] :
( ( rf(X0,X2)
& rf(X0,X1) )
=> X1 = X2 ) ),
inference(rectify,[],[f18]) ).
fof(f18,axiom,
! [X3] :
( cowlThing(X3)
=> ! [X7,X8] :
( ( rf(X3,X8)
& rf(X3,X7) )
=> X7 = X8 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).
fof(f205,plain,
rf(sK1(i2003_11_14_17_19_42328),sK2(i2003_11_14_17_19_42328)),
inference(resolution,[],[f164,f140]) ).
fof(f164,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(sK1(X0),sK2(X0)) ),
inference(literal_reordering,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| rf(sK1(X0),sK2(X0)) ),
inference(cnf_transformation,[],[f77]) ).
fof(f159,plain,
! [X0] :
( ~ cp1(sK2(X0))
| ~ cUnsatisfiable(X0) ),
inference(literal_reordering,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ~ cUnsatisfiable(X0)
| ~ cp1(sK2(X0)) ),
inference(cnf_transformation,[],[f77]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS086+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 30 00:25:14 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.51 % (21568)ins+10_1:1_awrs=decay:awrsf=30:bsr=unit_only:foolp=on:igrr=8/457:igs=10:igwr=on:nwc=1.5:sp=weighted_frequency:to=lpo:uhcvi=on:i=68:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/68Mi)
% 1.27/0.52 % (21560)fmb+10_1:1_fmbsr=2.0:nm=4:skr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.27/0.52 % (21568)First to succeed.
% 1.27/0.53 % (21561)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 1.41/0.53 % (21558)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.41/0.53 % (21568)Refutation found. Thanks to Tanya!
% 1.41/0.53 % SZS status Unsatisfiable for theBenchmark
% 1.41/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 1.41/0.53 % (21568)------------------------------
% 1.41/0.53 % (21568)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.41/0.53 % (21568)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.41/0.53 % (21568)Termination reason: Refutation
% 1.41/0.53
% 1.41/0.53 % (21568)Memory used [KB]: 5884
% 1.41/0.53 % (21568)Time elapsed: 0.007 s
% 1.41/0.53 % (21568)Instructions burned: 5 (million)
% 1.41/0.53 % (21568)------------------------------
% 1.41/0.53 % (21568)------------------------------
% 1.41/0.53 % (21553)Success in time 0.179 s
%------------------------------------------------------------------------------