TSTP Solution File: SWC207+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC207+1 : TPTP v8.1.0. Released v2.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 : n012.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 18:39:36 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 56 ( 10 unt; 0 def)
% Number of atoms : 331 ( 108 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 397 ( 122 ~; 115 |; 135 &)
% ( 6 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 37 !; 37 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f326,plain,
$false,
inference(avatar_sat_refutation,[],[f258,f262,f268,f291,f325]) ).
fof(f325,plain,
spl11_4,
inference(avatar_contradiction_clause,[],[f324]) ).
fof(f324,plain,
( $false
| spl11_4 ),
inference(subsumption_resolution,[],[f323,f160]) ).
fof(f160,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f323,plain,
( ~ ssList(nil)
| spl11_4 ),
inference(subsumption_resolution,[],[f322,f211]) ).
fof(f211,plain,
ssList(sK0),
inference(definition_unfolding,[],[f175,f163]) ).
fof(f163,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
( ssList(sK1)
& ssList(sK2)
& ~ neq(sK0,nil)
& sK3 = sK1
& ( ( nil = sK3
& nil = sK2 )
| ( memberP(sK3,sK4)
& ! [X5] :
( ~ ssItem(X5)
| sK4 = X5
| ~ leq(sK4,X5)
| ~ memberP(sK3,X5) )
& ssItem(sK4)
& sK2 = cons(sK4,nil) ) )
& neq(sK1,nil)
& sK2 = sK0
& ssList(sK3)
& ssList(sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4])],[f99,f134,f133,f132,f131,f130]) ).
fof(f130,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(X0,nil)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = X2 ) )
& neq(X1,nil)
& X0 = X2
& ssList(X3) ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK0,nil)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = X2 ) )
& neq(X1,nil)
& sK0 = X2
& ssList(X3) ) ) )
& ssList(sK0) ) ),
introduced(choice_axiom,[]) ).
fof(f131,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK0,nil)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = X2 ) )
& neq(X1,nil)
& sK0 = X2
& ssList(X3) ) ) )
=> ( ssList(sK1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK0,nil)
& sK1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = X2 ) )
& neq(sK1,nil)
& sK0 = X2
& ssList(X3) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(sK0,nil)
& sK1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = X2 ) )
& neq(sK1,nil)
& sK0 = X2
& ssList(X3) ) )
=> ( ssList(sK2)
& ? [X3] :
( ~ neq(sK0,nil)
& sK1 = X3
& ( ( nil = X3
& nil = sK2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = sK2 ) )
& neq(sK1,nil)
& sK2 = sK0
& ssList(X3) ) ) ),
introduced(choice_axiom,[]) ).
fof(f133,plain,
( ? [X3] :
( ~ neq(sK0,nil)
& sK1 = X3
& ( ( nil = X3
& nil = sK2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = sK2 ) )
& neq(sK1,nil)
& sK2 = sK0
& ssList(X3) )
=> ( ~ neq(sK0,nil)
& sK3 = sK1
& ( ( nil = sK3
& nil = sK2 )
| ? [X4] :
( memberP(sK3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(sK3,X5) )
& ssItem(X4)
& cons(X4,nil) = sK2 ) )
& neq(sK1,nil)
& sK2 = sK0
& ssList(sK3) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
( ? [X4] :
( memberP(sK3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(sK3,X5) )
& ssItem(X4)
& cons(X4,nil) = sK2 )
=> ( memberP(sK3,sK4)
& ! [X5] :
( ~ ssItem(X5)
| sK4 = X5
| ~ leq(sK4,X5)
| ~ memberP(sK3,X5) )
& ssItem(sK4)
& sK2 = cons(sK4,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ~ neq(X0,nil)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4)
& cons(X4,nil) = X2 ) )
& neq(X1,nil)
& X0 = X2
& ssList(X3) ) ) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ~ neq(X0,nil)
& neq(X1,nil)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X3,X5) )
& ssItem(X4) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| neq(X0,nil)
| ~ neq(X1,nil)
| X1 != X3
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ? [X5] :
( X4 != X5
& ssItem(X5)
& leq(X4,X5)
& memberP(X3,X5) ) ) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| neq(X0,nil)
| ~ neq(X1,nil)
| X1 != X3
| ( ( nil != X3
| nil != X2 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ? [X5] :
( X4 != X5
& ssItem(X5)
& leq(X4,X5)
& memberP(X3,X5) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f175,plain,
ssList(sK2),
inference(cnf_transformation,[],[f135]) ).
fof(f322,plain,
( ~ ssList(sK0)
| ~ ssList(nil)
| spl11_4 ),
inference(subsumption_resolution,[],[f319,f247]) ).
fof(f247,plain,
( nil != sK0
| spl11_4 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f246,plain,
( spl11_4
<=> nil = sK0 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_4])]) ).
fof(f319,plain,
( nil = sK0
| ~ ssList(sK0)
| ~ ssList(nil) ),
inference(resolution,[],[f181,f174]) ).
fof(f174,plain,
~ neq(sK0,nil),
inference(cnf_transformation,[],[f135]) ).
fof(f181,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) ) ),
inference(nnf_transformation,[],[f127]) ).
fof(f127,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,X1) ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( X0 != X1
<=> neq(X0,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f291,plain,
( ~ spl11_4
| ~ spl11_5
| ~ spl11_6 ),
inference(avatar_contradiction_clause,[],[f290]) ).
fof(f290,plain,
( $false
| ~ spl11_4
| ~ spl11_5
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f289,f252]) ).
fof(f252,plain,
( ssItem(sK4)
| ~ spl11_5 ),
inference(avatar_component_clause,[],[f250]) ).
fof(f250,plain,
( spl11_5
<=> ssItem(sK4) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_5])]) ).
fof(f289,plain,
( ~ ssItem(sK4)
| ~ spl11_4
| ~ spl11_6 ),
inference(subsumption_resolution,[],[f288,f160]) ).
fof(f288,plain,
( ~ ssList(nil)
| ~ ssItem(sK4)
| ~ spl11_4
| ~ spl11_6 ),
inference(trivial_inequality_removal,[],[f287]) ).
fof(f287,plain,
( ~ ssList(nil)
| nil != nil
| ~ ssItem(sK4)
| ~ spl11_4
| ~ spl11_6 ),
inference(superposition,[],[f156,f269]) ).
fof(f269,plain,
( nil = cons(sK4,nil)
| ~ spl11_4
| ~ spl11_6 ),
inference(forward_demodulation,[],[f257,f248]) ).
fof(f248,plain,
( nil = sK0
| ~ spl11_4 ),
inference(avatar_component_clause,[],[f246]) ).
fof(f257,plain,
( sK0 = cons(sK4,nil)
| ~ spl11_6 ),
inference(avatar_component_clause,[],[f255]) ).
fof(f255,plain,
( spl11_6
<=> sK0 = cons(sK4,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl11_6])]) ).
fof(f156,plain,
! [X0,X1] :
( cons(X1,X0) != X0
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) != X0
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f18]) ).
fof(f18,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) != X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax18) ).
fof(f268,plain,
( ~ spl11_2
| ~ spl11_4 ),
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f267,plain,
( $false
| ~ spl11_2
| ~ spl11_4 ),
inference(subsumption_resolution,[],[f266,f263]) ).
fof(f263,plain,
( ~ neq(nil,nil)
| ~ spl11_4 ),
inference(backward_demodulation,[],[f174,f248]) ).
fof(f266,plain,
( neq(nil,nil)
| ~ spl11_2 ),
inference(backward_demodulation,[],[f164,f239]) ).
fof(f239,plain,
( nil = sK1
| ~ spl11_2 ),
inference(avatar_component_clause,[],[f237]) ).
fof(f237,plain,
( spl11_2
<=> nil = sK1 ),
introduced(avatar_definition,[new_symbols(naming,[spl11_2])]) ).
fof(f164,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f135]) ).
fof(f262,plain,
( spl11_2
| spl11_5 ),
inference(avatar_split_clause,[],[f214,f250,f237]) ).
fof(f214,plain,
( ssItem(sK4)
| nil = sK1 ),
inference(definition_unfolding,[],[f170,f173]) ).
fof(f173,plain,
sK3 = sK1,
inference(cnf_transformation,[],[f135]) ).
fof(f170,plain,
( nil = sK3
| ssItem(sK4) ),
inference(cnf_transformation,[],[f135]) ).
fof(f258,plain,
( spl11_6
| spl11_2 ),
inference(avatar_split_clause,[],[f215,f237,f255]) ).
fof(f215,plain,
( nil = sK1
| sK0 = cons(sK4,nil) ),
inference(definition_unfolding,[],[f169,f173,f163]) ).
fof(f169,plain,
( nil = sK3
| sK2 = cons(sK4,nil) ),
inference(cnf_transformation,[],[f135]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWC207+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.14 % 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.35 % Computer : n012.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 18:33:35 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.21/0.47 % (10752)lrs+10_1:2_br=off:nm=4:ss=included:urr=on:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.21/0.48 % (10760)dis-10_3:2_amm=sco:ep=RS:fsr=off:nm=10:sd=2:sos=on:ss=axioms:st=3.0:i=11:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/11Mi)
% 0.21/0.49 % (10748)lrs+2_1:1_lcm=reverse:lma=on:sos=all:spb=goal_then_units:ss=included:urr=on:i=39:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/39Mi)
% 0.21/0.49 % (10752)Instruction limit reached!
% 0.21/0.49 % (10752)------------------------------
% 0.21/0.49 % (10752)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.49 % (10760)Refutation not found, incomplete strategy% (10760)------------------------------
% 0.21/0.49 % (10760)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.50 % (10768)dis+21_1:1_aac=none:abs=on:er=known:fde=none:fsr=off:nwc=5.0:s2a=on:s2at=4.0:sp=const_frequency:to=lpo:urr=ec_only:i=25:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/25Mi)
% 0.21/0.50 % (10760)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (10760)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.50
% 0.21/0.50 % (10760)Memory used [KB]: 6140
% 0.21/0.50 % (10760)Time elapsed: 0.093 s
% 0.21/0.50 % (10760)Instructions burned: 7 (million)
% 0.21/0.50 % (10760)------------------------------
% 0.21/0.50 % (10760)------------------------------
% 0.21/0.50 % (10752)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.50 % (10752)Termination reason: Unknown
% 0.21/0.50 % (10752)Termination phase: Saturation
% 0.21/0.50
% 0.21/0.50 % (10752)Memory used [KB]: 6140
% 0.21/0.50 % (10752)Time elapsed: 0.094 s
% 0.21/0.50 % (10752)Instructions burned: 8 (million)
% 0.21/0.50 % (10752)------------------------------
% 0.21/0.50 % (10752)------------------------------
% 0.21/0.51 % (10745)lrs+10_1:1024_nm=0:nwc=5.0:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.51 % (10742)lrs+10_1:1_gsp=on:sd=1:sgt=32:sos=on:ss=axioms:i=13:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/13Mi)
% 0.21/0.51 % (10750)lrs+10_1:1_br=off:sos=on:ss=axioms:st=2.0:urr=on:i=33:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/33Mi)
% 0.21/0.51 % (10745)First to succeed.
% 0.21/0.52 % (10755)lrs+10_1:1_ins=3:sp=reverse_frequency:spb=goal:to=lpo:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.52 % (10749)dis+10_1:1_newcnf=on:sgt=8:sos=on:ss=axioms:to=lpo:urr=on:i=49:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/49Mi)
% 0.21/0.52 % (10755)Instruction limit reached!
% 0.21/0.52 % (10755)------------------------------
% 0.21/0.52 % (10755)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.52 % (10755)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.52 % (10755)Termination reason: Unknown
% 0.21/0.52 % (10755)Termination phase: Preprocessing 3
% 0.21/0.52
% 0.21/0.52 % (10755)Memory used [KB]: 1663
% 0.21/0.52 % (10755)Time elapsed: 0.003 s
% 0.21/0.52 % (10755)Instructions burned: 5 (million)
% 0.21/0.52 % (10755)------------------------------
% 0.21/0.52 % (10755)------------------------------
% 0.21/0.52 % (10757)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.21/0.52 % (10766)lrs+11_1:1_plsq=on:plsqc=1:plsqr=32,1:ss=included:i=95:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/95Mi)
% 0.21/0.52 % (10758)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.53 % (10747)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.21/0.53 % (10768)Also succeeded, but the first one will report.
% 0.21/0.53 % (10745)Refutation found. Thanks to Tanya!
% 0.21/0.53 % SZS status Theorem for theBenchmark
% 0.21/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.53 % (10745)------------------------------
% 0.21/0.53 % (10745)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.21/0.53 % (10745)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.21/0.53 % (10745)Termination reason: Refutation
% 0.21/0.53
% 0.21/0.53 % (10745)Memory used [KB]: 6140
% 0.21/0.53 % (10745)Time elapsed: 0.122 s
% 0.21/0.53 % (10745)Instructions burned: 6 (million)
% 0.21/0.53 % (10745)------------------------------
% 0.21/0.53 % (10745)------------------------------
% 0.21/0.53 % (10740)Success in time 0.167 s
%------------------------------------------------------------------------------