TSTP Solution File: SYN417+1 by SnakeForV-SAT---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV-SAT---1.0
% Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.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 : n020.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 19:37:50 EDT 2022
% Result : Theorem 1.43s 0.54s
% Output : Refutation 1.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of formulae : 80 ( 1 unt; 0 def)
% Number of atoms : 331 ( 176 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 461 ( 210 ~; 198 |; 31 &)
% ( 11 <=>; 10 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 9 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-1 aty)
% Number of variables : 70 ( 50 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f163,plain,
$false,
inference(avatar_sat_refutation,[],[f26,f33,f37,f41,f42,f47,f52,f53,f67,f133,f146,f162]) ).
fof(f162,plain,
( ~ spl4_2
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f161]) ).
fof(f161,plain,
( $false
| ~ spl4_2
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f160]) ).
fof(f160,plain,
( g(sK2) != g(sK2)
| ~ spl4_2
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(forward_demodulation,[],[f159,f46]) ).
fof(f46,plain,
( sK2 = f(g(sK2))
| ~ spl4_7 ),
inference(avatar_component_clause,[],[f44]) ).
fof(f44,plain,
( spl4_7
<=> sK2 = f(g(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_7])]) ).
fof(f159,plain,
( g(f(g(sK2))) != g(sK2)
| ~ spl4_2
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f158]) ).
fof(f158,plain,
( g(f(g(sK2))) != g(sK2)
| g(sK2) != g(sK2)
| ~ spl4_2
| ~ spl4_4
| ~ spl4_6
| ~ spl4_7 ),
inference(superposition,[],[f32,f154]) ).
fof(f154,plain,
( g(sK2) = sK1(g(sK2))
| ~ spl4_2
| ~ spl4_6
| ~ spl4_7 ),
inference(backward_demodulation,[],[f149,f152]) ).
fof(f152,plain,
( f(sK1(g(sK2))) = sK2
| ~ spl4_2
| ~ spl4_6
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f151]) ).
fof(f151,plain,
( f(sK1(g(sK2))) != f(sK1(g(sK2)))
| f(sK1(g(sK2))) = sK2
| ~ spl4_2
| ~ spl4_6
| ~ spl4_7 ),
inference(superposition,[],[f25,f149]) ).
fof(f25,plain,
( ! [X5] :
( f(g(X5)) != X5
| sK2 = X5 )
| ~ spl4_2 ),
inference(avatar_component_clause,[],[f24]) ).
fof(f24,plain,
( spl4_2
<=> ! [X5] :
( sK2 = X5
| f(g(X5)) != X5 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_2])]) ).
fof(f149,plain,
( g(f(sK1(g(sK2)))) = sK1(g(sK2))
| ~ spl4_6
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f148]) ).
fof(f148,plain,
( g(sK2) != g(sK2)
| g(f(sK1(g(sK2)))) = sK1(g(sK2))
| ~ spl4_6
| ~ spl4_7 ),
inference(superposition,[],[f40,f46]) ).
fof(f40,plain,
( ! [X2] :
( g(f(X2)) != X2
| sK1(X2) = g(f(sK1(X2))) )
| ~ spl4_6 ),
inference(avatar_component_clause,[],[f39]) ).
fof(f39,plain,
( spl4_6
<=> ! [X2] :
( g(f(X2)) != X2
| sK1(X2) = g(f(sK1(X2))) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_6])]) ).
fof(f32,plain,
( ! [X2] :
( sK1(X2) != X2
| g(f(X2)) != X2 )
| ~ spl4_4 ),
inference(avatar_component_clause,[],[f31]) ).
fof(f31,plain,
( spl4_4
<=> ! [X2] :
( g(f(X2)) != X2
| sK1(X2) != X2 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_4])]) ).
fof(f146,plain,
( ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f145]) ).
fof(f145,plain,
( $false
| ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f144]) ).
fof(f144,plain,
( f(sK3) != f(sK3)
| ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(forward_demodulation,[],[f143,f51]) ).
fof(f51,plain,
( sK3 = g(f(sK3))
| ~ spl4_8 ),
inference(avatar_component_clause,[],[f49]) ).
fof(f49,plain,
( spl4_8
<=> sK3 = g(f(sK3)) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_8])]) ).
fof(f143,plain,
( f(g(f(sK3))) != f(sK3)
| ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f142]) ).
fof(f142,plain,
( f(g(f(sK3))) != f(sK3)
| f(sK3) != f(sK3)
| ~ spl4_1
| ~ spl4_3
| ~ spl4_5
| ~ spl4_8 ),
inference(superposition,[],[f36,f138]) ).
fof(f138,plain,
( sK0(f(sK3)) = f(sK3)
| ~ spl4_1
| ~ spl4_3
| ~ spl4_8 ),
inference(backward_demodulation,[],[f69,f137]) ).
fof(f137,plain,
( sK3 = g(sK0(f(sK3)))
| ~ spl4_1
| ~ spl4_3
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f135]) ).
fof(f135,plain,
( sK3 = g(sK0(f(sK3)))
| g(sK0(f(sK3))) != g(sK0(f(sK3)))
| ~ spl4_1
| ~ spl4_3
| ~ spl4_8 ),
inference(superposition,[],[f22,f69]) ).
fof(f22,plain,
( ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 )
| ~ spl4_1 ),
inference(avatar_component_clause,[],[f21]) ).
fof(f21,plain,
( spl4_1
<=> ! [X7] :
( sK3 = X7
| g(f(X7)) != X7 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_1])]) ).
fof(f69,plain,
( sK0(f(sK3)) = f(g(sK0(f(sK3))))
| ~ spl4_3
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f68]) ).
fof(f68,plain,
( f(sK3) != f(sK3)
| sK0(f(sK3)) = f(g(sK0(f(sK3))))
| ~ spl4_3
| ~ spl4_8 ),
inference(superposition,[],[f29,f51]) ).
fof(f29,plain,
( ! [X0] :
( f(g(X0)) != X0
| sK0(X0) = f(g(sK0(X0))) )
| ~ spl4_3 ),
inference(avatar_component_clause,[],[f28]) ).
fof(f28,plain,
( spl4_3
<=> ! [X0] :
( sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_3])]) ).
fof(f36,plain,
( ! [X0] :
( sK0(X0) != X0
| f(g(X0)) != X0 )
| ~ spl4_5 ),
inference(avatar_component_clause,[],[f35]) ).
fof(f35,plain,
( spl4_5
<=> ! [X0] :
( sK0(X0) != X0
| f(g(X0)) != X0 ) ),
introduced(avatar_definition,[new_symbols(naming,[spl4_5])]) ).
fof(f133,plain,
( ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_8 ),
inference(avatar_contradiction_clause,[],[f132]) ).
fof(f132,plain,
( $false
| ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_8 ),
inference(subsumption_resolution,[],[f131,f51]) ).
fof(f131,plain,
( sK3 != g(f(sK3))
| ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f130]) ).
fof(f130,plain,
( sK3 != sK3
| sK3 != g(f(sK3))
| ~ spl4_1
| ~ spl4_4
| ~ spl4_6
| ~ spl4_8 ),
inference(superposition,[],[f32,f125]) ).
fof(f125,plain,
( sK3 = sK1(sK3)
| ~ spl4_1
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f121]) ).
fof(f121,plain,
( sK3 = sK1(sK3)
| sK1(sK3) != sK1(sK3)
| ~ spl4_1
| ~ spl4_6
| ~ spl4_8 ),
inference(superposition,[],[f22,f119]) ).
fof(f119,plain,
( sK1(sK3) = g(f(sK1(sK3)))
| ~ spl4_6
| ~ spl4_8 ),
inference(trivial_inequality_removal,[],[f115]) ).
fof(f115,plain,
( sK3 != sK3
| sK1(sK3) = g(f(sK1(sK3)))
| ~ spl4_6
| ~ spl4_8 ),
inference(superposition,[],[f40,f51]) ).
fof(f67,plain,
( ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(avatar_contradiction_clause,[],[f66]) ).
fof(f66,plain,
( $false
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(subsumption_resolution,[],[f65,f46]) ).
fof(f65,plain,
( sK2 != f(g(sK2))
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f64]) ).
fof(f64,plain,
( sK2 != sK2
| sK2 != f(g(sK2))
| ~ spl4_2
| ~ spl4_3
| ~ spl4_5
| ~ spl4_7 ),
inference(superposition,[],[f36,f60]) ).
fof(f60,plain,
( sK0(sK2) = sK2
| ~ spl4_2
| ~ spl4_3
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f58]) ).
fof(f58,plain,
( sK0(sK2) = sK2
| sK0(sK2) != sK0(sK2)
| ~ spl4_2
| ~ spl4_3
| ~ spl4_7 ),
inference(superposition,[],[f25,f56]) ).
fof(f56,plain,
( sK0(sK2) = f(g(sK0(sK2)))
| ~ spl4_3
| ~ spl4_7 ),
inference(trivial_inequality_removal,[],[f55]) ).
fof(f55,plain,
( sK2 != sK2
| sK0(sK2) = f(g(sK0(sK2)))
| ~ spl4_3
| ~ spl4_7 ),
inference(superposition,[],[f29,f46]) ).
fof(f53,plain,
( spl4_8
| spl4_7 ),
inference(avatar_split_clause,[],[f15,f44,f49]) ).
fof(f15,plain,
( sK2 = f(g(sK2))
| sK3 = g(f(sK3)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f11,plain,
( ( ! [X0] :
( f(g(X0)) != X0
| ( sK0(X0) != X0
& sK0(X0) = f(g(sK0(X0))) ) )
| ! [X2] :
( g(f(X2)) != X2
| ( sK1(X2) = g(f(sK1(X2)))
& sK1(X2) != X2 ) ) )
& ( ( sK2 = f(g(sK2))
& ! [X5] :
( sK2 = X5
| f(g(X5)) != X5 ) )
| ( sK3 = g(f(sK3))
& ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f6,f10,f9,f8,f7]) ).
fof(f7,plain,
! [X0] :
( ? [X1] :
( X0 != X1
& f(g(X1)) = X1 )
=> ( sK0(X0) != X0
& sK0(X0) = f(g(sK0(X0))) ) ),
introduced(choice_axiom,[]) ).
fof(f8,plain,
! [X2] :
( ? [X3] :
( g(f(X3)) = X3
& X2 != X3 )
=> ( sK1(X2) = g(f(sK1(X2)))
& sK1(X2) != X2 ) ),
introduced(choice_axiom,[]) ).
fof(f9,plain,
( ? [X4] :
( f(g(X4)) = X4
& ! [X5] :
( X4 = X5
| f(g(X5)) != X5 ) )
=> ( sK2 = f(g(sK2))
& ! [X5] :
( sK2 = X5
| f(g(X5)) != X5 ) ) ),
introduced(choice_axiom,[]) ).
fof(f10,plain,
( ? [X6] :
( g(f(X6)) = X6
& ! [X7] :
( g(f(X7)) != X7
| X6 = X7 ) )
=> ( sK3 = g(f(sK3))
& ! [X7] :
( g(f(X7)) != X7
| sK3 = X7 ) ) ),
introduced(choice_axiom,[]) ).
fof(f6,plain,
( ( ! [X0] :
( f(g(X0)) != X0
| ? [X1] :
( X0 != X1
& f(g(X1)) = X1 ) )
| ! [X2] :
( g(f(X2)) != X2
| ? [X3] :
( g(f(X3)) = X3
& X2 != X3 ) ) )
& ( ? [X4] :
( f(g(X4)) = X4
& ! [X5] :
( X4 = X5
| f(g(X5)) != X5 ) )
| ? [X6] :
( g(f(X6)) = X6
& ! [X7] :
( g(f(X7)) != X7
| X6 = X7 ) ) ) ),
inference(rectify,[],[f5]) ).
fof(f5,plain,
( ( ! [X2] :
( f(g(X2)) != X2
| ? [X3] :
( X2 != X3
& f(g(X3)) = X3 ) )
| ! [X0] :
( g(f(X0)) != X0
| ? [X1] :
( g(f(X1)) = X1
& X0 != X1 ) ) )
& ( ? [X2] :
( f(g(X2)) = X2
& ! [X3] :
( X2 = X3
| f(g(X3)) != X3 ) )
| ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( g(f(X1)) != X1
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f4,plain,
( ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( g(f(X1)) != X1
| X0 = X1 ) )
<~> ? [X2] :
( f(g(X2)) = X2
& ! [X3] :
( X2 = X3
| f(g(X3)) != X3 ) ) ),
inference(ennf_transformation,[],[f3]) ).
fof(f3,plain,
~ ( ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 ) )
<=> ? [X2] :
( f(g(X2)) = X2
& ! [X3] :
( f(g(X3)) = X3
=> X2 = X3 ) ) ),
inference(rectify,[],[f2]) ).
fof(f2,negated_conjecture,
~ ( ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 ) )
<=> ? [X0] :
( f(g(X0)) = X0
& ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 ) ) ),
inference(negated_conjecture,[],[f1]) ).
fof(f1,conjecture,
( ? [X0] :
( g(f(X0)) = X0
& ! [X1] :
( g(f(X1)) = X1
=> X0 = X1 ) )
<=> ? [X0] :
( f(g(X0)) = X0
& ! [X1] :
( f(g(X1)) = X1
=> X0 = X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cute) ).
fof(f52,plain,
( spl4_8
| spl4_2 ),
inference(avatar_split_clause,[],[f13,f24,f49]) ).
fof(f13,plain,
! [X5] :
( f(g(X5)) != X5
| sK3 = g(f(sK3))
| sK2 = X5 ),
inference(cnf_transformation,[],[f11]) ).
fof(f47,plain,
( spl4_7
| spl4_1 ),
inference(avatar_split_clause,[],[f14,f21,f44]) ).
fof(f14,plain,
! [X7] :
( g(f(X7)) != X7
| sK3 = X7
| sK2 = f(g(sK2)) ),
inference(cnf_transformation,[],[f11]) ).
fof(f42,plain,
( spl4_6
| spl4_5 ),
inference(avatar_split_clause,[],[f19,f35,f39]) ).
fof(f19,plain,
! [X2,X0] :
( sK0(X0) != X0
| f(g(X0)) != X0
| sK1(X2) = g(f(sK1(X2)))
| g(f(X2)) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f41,plain,
( spl4_3
| spl4_6 ),
inference(avatar_split_clause,[],[f17,f39,f28]) ).
fof(f17,plain,
! [X2,X0] :
( g(f(X2)) != X2
| f(g(X0)) != X0
| sK1(X2) = g(f(sK1(X2)))
| sK0(X0) = f(g(sK0(X0))) ),
inference(cnf_transformation,[],[f11]) ).
fof(f37,plain,
( spl4_4
| spl4_5 ),
inference(avatar_split_clause,[],[f18,f35,f31]) ).
fof(f18,plain,
! [X2,X0] :
( sK0(X0) != X0
| sK1(X2) != X2
| f(g(X0)) != X0
| g(f(X2)) != X2 ),
inference(cnf_transformation,[],[f11]) ).
fof(f33,plain,
( spl4_3
| spl4_4 ),
inference(avatar_split_clause,[],[f16,f31,f28]) ).
fof(f16,plain,
! [X2,X0] :
( g(f(X2)) != X2
| sK1(X2) != X2
| sK0(X0) = f(g(sK0(X0)))
| f(g(X0)) != X0 ),
inference(cnf_transformation,[],[f11]) ).
fof(f26,plain,
( spl4_1
| spl4_2 ),
inference(avatar_split_clause,[],[f12,f24,f21]) ).
fof(f12,plain,
! [X7,X5] :
( sK2 = X5
| sK3 = X7
| f(g(X5)) != X5
| g(f(X7)) != X7 ),
inference(cnf_transformation,[],[f11]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN417+1 : TPTP v8.1.0. Released v2.0.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_sat --cores 0 -t %d %s
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 21:55:15 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.51 % (14388)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 (3000ds/467Mi)
% 0.21/0.51 % (14380)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 (3000ds/75Mi)
% 0.21/0.51 % (14377)ott+10_1:28_bd=off:bs=on:tgt=ground:i=101:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/101Mi)
% 0.21/0.53 % (14372)dis+10_1:1_fsd=on:sp=occurrence:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/7Mi)
% 0.21/0.53 % (14365)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 (3000ds/191324Mi)
% 0.21/0.53 % (14388)First to succeed.
% 0.21/0.53 % (14367)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 (3000ds/37Mi)
% 0.21/0.53 TRYING [1]
% 0.21/0.53 % (14369)ott+33_1:4_s2a=on:tgt=ground:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.54 % (14368)ott+10_1:32_bd=off:fsr=off:newcnf=on:tgt=full:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/51Mi)
% 0.21/0.54 % (14387)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 (3000ds/498Mi)
% 0.21/0.54 % (14382)fmb+10_1:1_bce=on:i=59:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/59Mi)
% 0.21/0.54 TRYING [2]
% 0.21/0.54 TRYING [3]
% 0.21/0.54 % (14366)ott+10_1:32_abs=on:br=off:urr=ec_only:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (3000ds/50Mi)
% 0.21/0.54 % (14370)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 (3000ds/48Mi)
% 1.43/0.54 % (14388)Refutation found. Thanks to Tanya!
% 1.43/0.54 % SZS status Theorem for theBenchmark
% 1.43/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 1.43/0.54 % (14388)------------------------------
% 1.43/0.54 % (14388)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.43/0.54 % (14388)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.43/0.54 % (14388)Termination reason: Refutation
% 1.43/0.54
% 1.43/0.54 % (14388)Memory used [KB]: 5500
% 1.43/0.54 % (14388)Time elapsed: 0.129 s
% 1.43/0.54 % (14388)Instructions burned: 5 (million)
% 1.43/0.54 % (14388)------------------------------
% 1.43/0.54 % (14388)------------------------------
% 1.43/0.54 % (14364)Success in time 0.183 s
%------------------------------------------------------------------------------