TSTP Solution File: SWC387+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC387+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 : n014.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:40:52 EDT 2022
% Result : Theorem 0.20s 0.53s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 59 ( 10 unt; 0 def)
% Number of atoms : 340 ( 146 equ)
% Maximal formula atoms : 34 ( 5 avg)
% Number of connectives : 426 ( 145 ~; 121 |; 129 &)
% ( 9 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 76 ( 38 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f842,plain,
$false,
inference(avatar_sat_refutation,[],[f613,f627,f636,f651,f662,f667,f785,f802]) ).
fof(f802,plain,
( ~ spl60_2
| ~ spl60_5
| ~ spl60_13 ),
inference(avatar_split_clause,[],[f730,f664,f624,f610]) ).
fof(f610,plain,
( spl60_2
<=> sF58 = sK21 ),
introduced(avatar_definition,[new_symbols(naming,[spl60_2])]) ).
fof(f624,plain,
( spl60_5
<=> memberP(sK24,sK25) ),
introduced(avatar_definition,[new_symbols(naming,[spl60_5])]) ).
fof(f664,plain,
( spl60_13
<=> ssItem(sK25) ),
introduced(avatar_definition,[new_symbols(naming,[spl60_13])]) ).
fof(f730,plain,
( ~ ssItem(sK25)
| ~ memberP(sK24,sK25)
| sF58 != sK21 ),
inference(superposition,[],[f597,f685]) ).
fof(f685,plain,
sF59(sK25) = sF58,
inference(backward_demodulation,[],[f594,f596]) ).
fof(f596,plain,
! [X5] : cons(X5,nil) = sF59(X5),
introduced(function_definition,[]) ).
fof(f594,plain,
cons(sK25,nil) = sF58,
introduced(function_definition,[]) ).
fof(f597,plain,
! [X5] :
( sF59(X5) != sK21
| ~ memberP(sK24,X5)
| ~ ssItem(X5) ),
inference(definition_folding,[],[f564,f596]) ).
fof(f564,plain,
! [X5] :
( ~ memberP(sK24,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) ),
inference(definition_unfolding,[],[f443,f441]) ).
fof(f441,plain,
sK22 = sK24,
inference(cnf_transformation,[],[f284]) ).
fof(f284,plain,
( ssList(sK22)
& ssList(sK23)
& ( ~ neq(sK24,nil)
| ( ssItem(sK25)
& cons(sK25,nil) = sK23
& memberP(sK24,sK25) ) )
& ! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(sK24)
& sK22 = sK24
& ( nil != sK24
| nil = sK23 )
& ( nil != sK21
| nil != sK22 )
& sK23 = sK21
& ssList(sK21) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK21,sK22,sK23,sK24,sK25])],[f198,f283,f282,f281,f280,f279]) ).
fof(f279,plain,
( ? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& ssList(X3)
& X1 = X3
& ( nil != X3
| nil = X2 )
& ( nil != X0
| nil != X1 )
& X0 = X2 ) ) )
& ssList(X0) )
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(X3)
& X1 = X3
& ( nil != X3
| nil = X2 )
& ( nil != sK21
| nil != X1 )
& sK21 = X2 ) ) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f280,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(X3)
& X1 = X3
& ( nil != X3
| nil = X2 )
& ( nil != sK21
| nil != X1 )
& sK21 = X2 ) ) )
=> ( ssList(sK22)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(X3)
& sK22 = X3
& ( nil != X3
| nil = X2 )
& ( nil != sK21
| nil != sK22 )
& sK21 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f281,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(X3)
& sK22 = X3
& ( nil != X3
| nil = X2 )
& ( nil != sK21
| nil != sK22 )
& sK21 = X2 ) )
=> ( ssList(sK23)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = sK23
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(X3)
& sK22 = X3
& ( nil != X3
| nil = sK23 )
& ( nil != sK21
| nil != sK22 )
& sK23 = sK21 ) ) ),
introduced(choice_axiom,[]) ).
fof(f282,plain,
( ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = sK23
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(X3)
& sK22 = X3
& ( nil != X3
| nil = sK23 )
& ( nil != sK21
| nil != sK22 )
& sK23 = sK21 )
=> ( ( ~ neq(sK24,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = sK23
& memberP(sK24,X4) ) )
& ! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) )
& ssList(sK24)
& sK22 = sK24
& ( nil != sK24
| nil = sK23 )
& ( nil != sK21
| nil != sK22 )
& sK23 = sK21 ) ),
introduced(choice_axiom,[]) ).
fof(f283,plain,
( ? [X4] :
( ssItem(X4)
& cons(X4,nil) = sK23
& memberP(sK24,X4) )
=> ( ssItem(sK25)
& cons(sK25,nil) = sK23
& memberP(sK24,sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f198,plain,
? [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X4] :
( ssItem(X4)
& cons(X4,nil) = X2
& memberP(X3,X4) ) )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& ssList(X3)
& X1 = X3
& ( nil != X3
| nil = X2 )
& ( nil != X0
| nil != X1 )
& X0 = X2 ) ) )
& ssList(X0) ),
inference(flattening,[],[f197]) ).
fof(f197,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X0
| nil != X1 )
& ( ~ neq(X3,nil)
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ssItem(X4) ) )
& ( nil != X3
| nil = X2 )
& ! [X5] :
( ~ memberP(X1,X5)
| cons(X5,nil) != X0
| ~ ssItem(X5) )
& X1 = X3
& X0 = X2
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X1
& nil = X0 )
| ( neq(X3,nil)
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2 ) ) )
| ( nil != X2
& nil = X3 )
| ? [X5] :
( memberP(X1,X5)
& cons(X5,nil) = X0
& ssItem(X5) )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
& neq(X3,nil) )
| ? [X4] :
( ssItem(X4)
& memberP(X1,X4)
& cons(X4,nil) = X0 )
| X1 != X3
| X0 != X2 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil != X2
& nil = X3 )
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssItem(X5)
=> ( ~ memberP(X3,X5)
| cons(X5,nil) != X2 ) )
& neq(X3,nil) )
| ? [X4] :
( ssItem(X4)
& memberP(X1,X4)
& cons(X4,nil) = X0 )
| X1 != X3
| X0 != X2 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f443,plain,
! [X5] :
( ~ memberP(sK22,X5)
| cons(X5,nil) != sK21
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f284]) ).
fof(f785,plain,
( spl60_1
| ~ spl60_4
| spl60_7 ),
inference(avatar_contradiction_clause,[],[f784]) ).
fof(f784,plain,
( $false
| spl60_1
| ~ spl60_4
| spl60_7 ),
inference(subsumption_resolution,[],[f783,f635]) ).
fof(f635,plain,
( nil != sK24
| spl60_7 ),
inference(avatar_component_clause,[],[f633]) ).
fof(f633,plain,
( spl60_7
<=> nil = sK24 ),
introduced(avatar_definition,[new_symbols(naming,[spl60_7])]) ).
fof(f783,plain,
( nil = sK24
| spl60_1
| ~ spl60_4 ),
inference(subsumption_resolution,[],[f782,f620]) ).
fof(f620,plain,
( ssList(nil)
| ~ spl60_4 ),
inference(avatar_component_clause,[],[f619]) ).
fof(f619,plain,
( spl60_4
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl60_4])]) ).
fof(f782,plain,
( ~ ssList(nil)
| nil = sK24
| spl60_1 ),
inference(subsumption_resolution,[],[f777,f442]) ).
fof(f442,plain,
ssList(sK24),
inference(cnf_transformation,[],[f284]) ).
fof(f777,plain,
( ~ ssList(sK24)
| ~ ssList(nil)
| nil = sK24
| spl60_1 ),
inference(resolution,[],[f469,f608]) ).
fof(f608,plain,
( ~ neq(sK24,nil)
| spl60_1 ),
inference(avatar_component_clause,[],[f606]) ).
fof(f606,plain,
( spl60_1
<=> neq(sK24,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl60_1])]) ).
fof(f469,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X0)
| X0 = X1
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f296]) ).
fof(f296,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f181]) ).
fof(f181,plain,
! [X0] :
( ! [X1] :
( ( X0 != X1
<=> neq(X0,X1) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
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(f667,plain,
( ~ spl60_1
| spl60_13 ),
inference(avatar_split_clause,[],[f446,f664,f606]) ).
fof(f446,plain,
( ssItem(sK25)
| ~ neq(sK24,nil) ),
inference(cnf_transformation,[],[f284]) ).
fof(f662,plain,
( ~ spl60_7
| ~ spl60_6 ),
inference(avatar_split_clause,[],[f566,f629,f633]) ).
fof(f629,plain,
( spl60_6
<=> nil = sK21 ),
introduced(avatar_definition,[new_symbols(naming,[spl60_6])]) ).
fof(f566,plain,
( nil != sK21
| nil != sK24 ),
inference(definition_unfolding,[],[f439,f441]) ).
fof(f439,plain,
( nil != sK21
| nil != sK22 ),
inference(cnf_transformation,[],[f284]) ).
fof(f651,plain,
spl60_4,
inference(avatar_split_clause,[],[f508,f619]) ).
fof(f508,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f636,plain,
( spl60_6
| ~ spl60_7 ),
inference(avatar_split_clause,[],[f565,f633,f629]) ).
fof(f565,plain,
( nil != sK24
| nil = sK21 ),
inference(definition_unfolding,[],[f440,f438]) ).
fof(f438,plain,
sK23 = sK21,
inference(cnf_transformation,[],[f284]) ).
fof(f440,plain,
( nil != sK24
| nil = sK23 ),
inference(cnf_transformation,[],[f284]) ).
fof(f627,plain,
( spl60_5
| ~ spl60_1 ),
inference(avatar_split_clause,[],[f444,f606,f624]) ).
fof(f444,plain,
( ~ neq(sK24,nil)
| memberP(sK24,sK25) ),
inference(cnf_transformation,[],[f284]) ).
fof(f613,plain,
( ~ spl60_1
| spl60_2 ),
inference(avatar_split_clause,[],[f595,f610,f606]) ).
fof(f595,plain,
( sF58 = sK21
| ~ neq(sK24,nil) ),
inference(definition_folding,[],[f563,f594]) ).
fof(f563,plain,
( ~ neq(sK24,nil)
| cons(sK25,nil) = sK21 ),
inference(definition_unfolding,[],[f445,f438]) ).
fof(f445,plain,
( ~ neq(sK24,nil)
| cons(sK25,nil) = sK23 ),
inference(cnf_transformation,[],[f284]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWC387+1 : TPTP v8.1.0. Released v2.4.0.
% 0.03/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.13/0.34 % Computer : n014.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 18:53:33 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.50 % (8556)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 0.20/0.50 % (8564)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.20/0.51 % (8560)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.20/0.51 % (8580)dis+21_1:1_ep=RS:nwc=10.0:s2a=on:s2at=1.5:i=50:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/50Mi)
% 0.20/0.51 % (8563)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.20/0.52 % (8556)First to succeed.
% 0.20/0.52 % (8557)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.20/0.52 % (8568)lrs+10_1:4_av=off:bs=unit_only:bsr=unit_only:ep=RS:s2a=on:sos=on:sp=frequency:to=lpo:i=16:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/16Mi)
% 0.20/0.52 % (8578)dis+1010_2:3_fs=off:fsr=off:nm=0:nwc=5.0:s2a=on:s2agt=32:i=82:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/82Mi)
% 0.20/0.52 % (8579)dis+10_1:1_av=off:sos=on:sp=reverse_arity:ss=included:st=2.0:to=lpo:urr=ec_only:i=45:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/45Mi)
% 0.20/0.53 % (8584)dis+2_3:1_aac=none:abs=on:ep=R:lcm=reverse:nwc=10.0:sos=on:sp=const_frequency:spb=units:urr=ec_only:i=8:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/8Mi)
% 0.20/0.53 % (8570)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.20/0.53 % (8585)lrs-11_1:1_nm=0:sac=on:sd=4:ss=axioms:st=3.0:i=24:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/24Mi)
% 0.20/0.53 % (8582)lrs+1011_1:1_fd=preordered:fsd=on:sos=on:thsq=on:thsqc=64:thsqd=32:uwa=ground:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.20/0.53 % (8576)dis+1010_1:1_bs=on:ep=RS:erd=off:newcnf=on:nwc=10.0:s2a=on:sgt=32:ss=axioms:i=30:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/30Mi)
% 0.20/0.53 % (8583)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.20/0.53 % (8561)dis+21_1:1_av=off:sos=on:sp=frequency:ss=included:to=lpo:i=15:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/15Mi)
% 0.20/0.53 % (8558)dis+1002_1:1_aac=none:bd=off:sac=on:sos=on:spb=units:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.53 % (8571)lrs+10_1:1_drc=off:sp=reverse_frequency:spb=goal:to=lpo:i=7:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/7Mi)
% 0.20/0.53 % (8570)Instruction limit reached!
% 0.20/0.53 % (8570)------------------------------
% 0.20/0.53 % (8570)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (8570)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (8570)Termination reason: Unknown
% 0.20/0.53 % (8570)Termination phase: shuffling
% 0.20/0.53
% 0.20/0.53 % (8570)Memory used [KB]: 1535
% 0.20/0.53 % (8556)Refutation found. Thanks to Tanya!
% 0.20/0.53 % SZS status Theorem for theBenchmark
% 0.20/0.53 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.53 % (8556)------------------------------
% 0.20/0.53 % (8556)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.53 % (8556)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.53 % (8556)Termination reason: Refutation
% 0.20/0.53
% 0.20/0.53 % (8556)Memory used [KB]: 6524
% 0.20/0.53 % (8556)Time elapsed: 0.117 s
% 0.20/0.53 % (8556)Instructions burned: 18 (million)
% 0.20/0.53 % (8556)------------------------------
% 0.20/0.53 % (8556)------------------------------
% 0.20/0.53 % (8555)Success in time 0.185 s
%------------------------------------------------------------------------------