TSTP Solution File: GRA010+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.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 : n005.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 16:13:32 EDT 2022
% Result : Theorem 0.20s 0.55s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 36 ( 5 unt; 0 def)
% Number of atoms : 160 ( 35 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 189 ( 65 ~; 59 |; 49 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 117 ( 86 !; 31 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f306,plain,
$false,
inference(trivial_inequality_removal,[],[f304]) ).
fof(f304,plain,
number_of_in(sequential_pairs,sK2) != number_of_in(sequential_pairs,sK2),
inference(superposition,[],[f111,f300]) ).
fof(f300,plain,
number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2),
inference(resolution,[],[f299,f113]) ).
fof(f113,plain,
path(sK4,sK3,sK2),
inference(cnf_transformation,[],[f70]) ).
fof(f70,plain,
( path(sK4,sK3,sK2)
& ! [X3,X4] :
( triangle(X3,X4,sK5(X3,X4))
| ~ on_path(X4,sK2)
| ~ on_path(X3,sK2)
| ~ sequential(X3,X4) )
& number_of_in(sequential_pairs,sK2) != number_of_in(triangles,sK2)
& complete ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5])],[f67,f69,f68]) ).
fof(f68,plain,
( ? [X0,X1,X2] :
( path(X2,X1,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| ~ sequential(X3,X4) )
& number_of_in(triangles,X0) != number_of_in(sequential_pairs,X0) )
=> ( path(sK4,sK3,sK2)
& ! [X4,X3] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X4,sK2)
| ~ on_path(X3,sK2)
| ~ sequential(X3,X4) )
& number_of_in(sequential_pairs,sK2) != number_of_in(triangles,sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f69,plain,
! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
=> triangle(X3,X4,sK5(X3,X4)) ),
introduced(choice_axiom,[]) ).
fof(f67,plain,
( ? [X0,X1,X2] :
( path(X2,X1,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| ~ sequential(X3,X4) )
& number_of_in(triangles,X0) != number_of_in(sequential_pairs,X0) )
& complete ),
inference(rectify,[],[f47]) ).
fof(f47,plain,
( ? [X0,X2,X1] :
( path(X1,X2,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X4,X0)
| ~ on_path(X3,X0)
| ~ sequential(X3,X4) )
& number_of_in(triangles,X0) != number_of_in(sequential_pairs,X0) )
& complete ),
inference(flattening,[],[f46]) ).
fof(f46,plain,
( ? [X2,X0,X1] :
( number_of_in(triangles,X0) != number_of_in(sequential_pairs,X0)
& path(X1,X2,X0)
& ! [X3,X4] :
( ? [X5] : triangle(X3,X4,X5)
| ~ on_path(X3,X0)
| ~ sequential(X3,X4)
| ~ on_path(X4,X0) ) )
& complete ),
inference(ennf_transformation,[],[f33]) ).
fof(f33,plain,
~ ( complete
=> ! [X2,X0,X1] :
( ( path(X1,X2,X0)
& ! [X3,X4] :
( ( on_path(X3,X0)
& sequential(X3,X4)
& on_path(X4,X0) )
=> ? [X5] : triangle(X3,X4,X5) ) )
=> number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ) ),
inference(rectify,[],[f19]) ).
fof(f19,negated_conjecture,
~ ( complete
=> ! [X3,X1,X2] :
( ( path(X1,X2,X3)
& ! [X6,X7] :
( ( on_path(X6,X3)
& sequential(X6,X7)
& on_path(X7,X3) )
=> ? [X8] : triangle(X6,X7,X8) ) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ) ),
inference(negated_conjecture,[],[f18]) ).
fof(f18,conjecture,
( complete
=> ! [X3,X1,X2] :
( ( path(X1,X2,X3)
& ! [X6,X7] :
( ( on_path(X6,X3)
& sequential(X6,X7)
& on_path(X7,X3) )
=> ? [X8] : triangle(X6,X7,X8) ) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complete_means_sequential_pairs_and_triangles) ).
fof(f299,plain,
! [X6,X7] :
( ~ path(X6,X7,sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(duplicate_literal_removal,[],[f298]) ).
fof(f298,plain,
! [X6,X7] :
( number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2)
| ~ path(X6,X7,sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(resolution,[],[f295,f105]) ).
fof(f105,plain,
! [X2,X0,X1] :
( on_path(sK0(X0),X0)
| number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1,X2] :
( ( ! [X5] : ~ triangle(sK1(X0),sK0(X0),X5)
& on_path(sK1(X0),X0)
& on_path(sK0(X0),X0)
& sequential(sK1(X0),sK0(X0)) )
| ~ path(X1,X2,X0)
| number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f63,f64]) ).
fof(f64,plain,
! [X0] :
( ? [X3,X4] :
( ! [X5] : ~ triangle(X4,X3,X5)
& on_path(X4,X0)
& on_path(X3,X0)
& sequential(X4,X3) )
=> ( ! [X5] : ~ triangle(sK1(X0),sK0(X0),X5)
& on_path(sK1(X0),X0)
& on_path(sK0(X0),X0)
& sequential(sK1(X0),sK0(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f63,plain,
! [X0,X1,X2] :
( ? [X3,X4] :
( ! [X5] : ~ triangle(X4,X3,X5)
& on_path(X4,X0)
& on_path(X3,X0)
& sequential(X4,X3) )
| ~ path(X1,X2,X0)
| number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ),
inference(rectify,[],[f41]) ).
fof(f41,plain,
! [X2,X0,X1] :
( ? [X4,X3] :
( ! [X5] : ~ triangle(X3,X4,X5)
& on_path(X3,X2)
& on_path(X4,X2)
& sequential(X3,X4) )
| ~ path(X0,X1,X2)
| number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) ),
inference(flattening,[],[f40]) ).
fof(f40,plain,
! [X0,X1,X2] :
( number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2)
| ~ path(X0,X1,X2)
| ? [X4,X3] :
( ! [X5] : ~ triangle(X3,X4,X5)
& on_path(X3,X2)
& on_path(X4,X2)
& sequential(X3,X4) ) ),
inference(ennf_transformation,[],[f24]) ).
fof(f24,plain,
! [X0,X1,X2] :
( ( path(X0,X1,X2)
& ! [X4,X3] :
( ( on_path(X3,X2)
& on_path(X4,X2)
& sequential(X3,X4) )
=> ? [X5] : triangle(X3,X4,X5) ) )
=> number_of_in(triangles,X2) = number_of_in(sequential_pairs,X2) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X1,X2,X3] :
( ( ! [X6,X7] :
( ( on_path(X6,X3)
& sequential(X6,X7)
& on_path(X7,X3) )
=> ? [X8] : triangle(X6,X7,X8) )
& path(X1,X2,X3) )
=> number_of_in(sequential_pairs,X3) = number_of_in(triangles,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sequential_pairs_and_triangles) ).
fof(f295,plain,
( ~ on_path(sK0(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(resolution,[],[f294,f113]) ).
fof(f294,plain,
! [X6,X7] :
( ~ path(X6,X7,sK2)
| ~ on_path(sK0(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(duplicate_literal_removal,[],[f293]) ).
fof(f293,plain,
! [X6,X7] :
( number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2)
| ~ on_path(sK0(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2)
| ~ path(X6,X7,sK2) ),
inference(resolution,[],[f290,f106]) ).
fof(f106,plain,
! [X2,X0,X1] :
( on_path(sK1(X0),X0)
| number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f290,plain,
( ~ on_path(sK1(sK2),sK2)
| ~ on_path(sK0(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(resolution,[],[f289,f113]) ).
fof(f289,plain,
! [X0,X1] :
( ~ path(X0,X1,sK2)
| ~ on_path(sK0(sK2),sK2)
| ~ on_path(sK1(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(duplicate_literal_removal,[],[f284]) ).
fof(f284,plain,
! [X0,X1] :
( number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2)
| ~ path(X0,X1,sK2)
| ~ on_path(sK1(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2)
| ~ on_path(sK0(sK2),sK2) ),
inference(resolution,[],[f283,f104]) ).
fof(f104,plain,
! [X2,X0,X1] :
( sequential(sK1(X0),sK0(X0))
| number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0)
| ~ path(X1,X2,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f283,plain,
( ~ sequential(sK1(sK2),sK0(sK2))
| ~ on_path(sK1(sK2),sK2)
| ~ on_path(sK0(sK2),sK2)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(resolution,[],[f280,f112]) ).
fof(f112,plain,
! [X3,X4] :
( triangle(X3,X4,sK5(X3,X4))
| ~ sequential(X3,X4)
| ~ on_path(X4,sK2)
| ~ on_path(X3,sK2) ),
inference(cnf_transformation,[],[f70]) ).
fof(f280,plain,
! [X0] :
( ~ triangle(sK1(sK2),sK0(sK2),X0)
| number_of_in(sequential_pairs,sK2) = number_of_in(triangles,sK2) ),
inference(resolution,[],[f107,f113]) ).
fof(f107,plain,
! [X2,X0,X1,X5] :
( ~ path(X1,X2,X0)
| ~ triangle(sK1(X0),sK0(X0),X5)
| number_of_in(triangles,X0) = number_of_in(sequential_pairs,X0) ),
inference(cnf_transformation,[],[f65]) ).
fof(f111,plain,
number_of_in(sequential_pairs,sK2) != number_of_in(triangles,sK2),
inference(cnf_transformation,[],[f70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRA010+1 : TPTP v8.1.0. Bugfixed v3.2.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 : n005.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 : Mon Aug 29 22:00:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.51 % (1695)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=48:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/48Mi)
% 0.20/0.51 % (1708)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/59Mi)
% 0.20/0.51 % (1712)ott+3_1:1_gsp=on:lcm=predicate:i=138:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/138Mi)
% 0.20/0.52 % (1698)dis+2_1:64_add=large:bce=on:bd=off:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.20/0.52 % (1696)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)
% 0.20/0.52 % (1698)Instruction limit reached!
% 0.20/0.52 % (1698)------------------------------
% 0.20/0.52 % (1698)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.52 % (1698)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.52 % (1698)Termination reason: Unknown
% 0.20/0.52 % (1698)Termination phase: Property scanning
% 0.20/0.52
% 0.20/0.52 % (1698)Memory used [KB]: 1023
% 0.20/0.52 % (1698)Time elapsed: 0.003 s
% 0.20/0.52 % (1698)Instructions burned: 3 (million)
% 0.20/0.52 % (1698)------------------------------
% 0.20/0.52 % (1698)------------------------------
% 0.20/0.52 % (1693)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (1690)fmb+10_1:1_bce=on:fmbsr=1.5:nm=4:skr=on:i=191324:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/191324Mi)
% 0.20/0.52 % (1699)ott-1_1:6_av=off:cond=on:fsr=off:nwc=3.0:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.52 % (1706)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=75:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/75Mi)
% 0.20/0.53 TRYING [1]
% 0.20/0.53 TRYING [2]
% 0.20/0.53 % (1691)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.53 % (1692)ott+4_1:1_av=off:bd=off:nwc=5.0:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=37:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.20/0.53 % (1710)ott+4_1:1_av=off:bd=off:nwc=5.0:rp=on:s2a=on:s2at=2.0:slsq=on:slsqc=2:slsql=off:slsqr=1,2:sp=frequency:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.53 % (1711)ott+10_1:8_bsd=on:fsd=on:lcm=predicate:nwc=5.0:s2a=on:s2at=1.5:spb=goal_then_units:i=176:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/176Mi)
% 0.20/0.53 % (1715)ott+10_1:1_kws=precedence:tgt=ground:i=482:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/482Mi)
% 0.20/0.53 % (1720)ott+10_7:2_awrs=decay:awrsf=8:bd=preordered:drc=off:fd=preordered:fde=unused:fsr=off:slsq=on:slsqc=2:slsqr=5,8:sp=const_min:spb=units:to=lpo:i=355:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/355Mi)
% 0.20/0.53 % (1719)ott+33_1:4_s2a=on:tgt=ground:i=439:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/439Mi)
% 0.20/0.53 % (1697)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (1699)First to succeed.
% 0.20/0.54 % (1718)ott+11_2:3_av=off:fde=unused:nwc=5.0:tgt=ground:i=177:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/177Mi)
% 0.20/0.54 % (1704)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)
% 0.20/0.54 % (1714)ott+11_1:1_drc=off:nwc=5.0:slsq=on:slsqc=1:spb=goal_then_units:to=lpo:i=467:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/467Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 TRYING [2]
% 0.20/0.54 % (1691)Refutation not found, incomplete strategy% (1691)------------------------------
% 0.20/0.54 % (1691)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (1707)dis+34_1:32_abs=on:add=off:bsr=on:gsp=on:sp=weighted_frequency:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.54 TRYING [1]
% 0.20/0.54 % (1691)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (1691)Termination reason: Refutation not found, incomplete strategy
% 0.20/0.54
% 0.20/0.54 % (1691)Memory used [KB]: 5628
% 0.20/0.54 % (1691)Time elapsed: 0.139 s
% 0.20/0.54 % (1691)Instructions burned: 7 (million)
% 0.20/0.54 % (1691)------------------------------
% 0.20/0.54 % (1691)------------------------------
% 0.20/0.54 TRYING [2]
% 0.20/0.54 % (1716)ott+10_1:5_bd=off:tgt=full:i=500:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/500Mi)
% 0.20/0.54 % (1700)ott+2_1:1_fsr=off:gsp=on:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.54 % (1702)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/101Mi)
% 0.20/0.54 % (1713)dis+21_1:1_av=off:er=filter:slsq=on:slsqc=0:slsqr=1,1:sp=frequency:to=lpo:i=498:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/498Mi)
% 0.20/0.55 % (1703)ott+10_1:5_bd=off:tgt=full:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.55 % (1709)ott+10_1:1_tgt=ground:i=100:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/100Mi)
% 0.20/0.55 % (1694)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 0.20/0.55 TRYING [3]
% 0.20/0.55 TRYING [3]
% 0.20/0.55 % (1697)Instruction limit reached!
% 0.20/0.55 % (1697)------------------------------
% 0.20/0.55 % (1697)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.55 % (1697)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.55 % (1697)Termination reason: Unknown
% 0.20/0.55 % (1697)Termination phase: Saturation
% 0.20/0.55
% 0.20/0.55 % (1697)Memory used [KB]: 5628
% 0.20/0.55 % (1697)Time elapsed: 0.100 s
% 0.20/0.55 % (1697)Instructions burned: 8 (million)
% 0.20/0.55 % (1697)------------------------------
% 0.20/0.55 % (1697)------------------------------
% 0.20/0.55 % (1699)Refutation found. Thanks to Tanya!
% 0.20/0.55 % SZS status Theorem for theBenchmark
% 0.20/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (1699)------------------------------
% 0.20/0.56 % (1699)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (1699)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (1699)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (1699)Memory used [KB]: 1279
% 0.20/0.56 % (1699)Time elapsed: 0.126 s
% 0.20/0.56 % (1699)Instructions burned: 18 (million)
% 0.20/0.56 % (1699)------------------------------
% 0.20/0.56 % (1699)------------------------------
% 0.20/0.56 % (1689)Success in time 0.199 s
%------------------------------------------------------------------------------