TSTP Solution File: SWC353+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC353+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 : n021.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:39 EDT 2022
% Result : Theorem 0.18s 0.52s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 13
% Syntax : Number of formulae : 46 ( 11 unt; 0 def)
% Number of atoms : 356 ( 111 equ)
% Maximal formula atoms : 38 ( 7 avg)
% Number of connectives : 479 ( 169 ~; 145 |; 139 &)
% ( 6 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 9 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 136 ( 88 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1068,plain,
$false,
inference(avatar_sat_refutation,[],[f649,f651,f655,f1046,f1058]) ).
fof(f1058,plain,
~ spl52_38,
inference(avatar_contradiction_clause,[],[f1056]) ).
fof(f1056,plain,
( $false
| ~ spl52_38 ),
inference(resolution,[],[f1045,f540]) ).
fof(f540,plain,
~ frontsegP(sK23,sK22),
inference(definition_unfolding,[],[f436,f433,f434]) ).
fof(f434,plain,
sK20 = sK22,
inference(cnf_transformation,[],[f273]) ).
fof(f273,plain,
( ssList(sK20)
& ssList(sK22)
& ( nil = sK23
| nil != sK22 )
& ~ frontsegP(sK21,sK20)
& ssList(sK23)
& sK20 = sK22
& sK21 = sK23
& ssList(sK24)
& app(sK22,sK24) = sK23
& totalorderedP(sK22)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK24
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK22 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& ssList(sK21) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23,sK24])],[f186,f272,f271,f270,f269,f268]) ).
fof(f268,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(X1,X0)
& ssList(X3)
& X0 = X2
& X1 = X3
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) ) )
=> ( ssList(sK20)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(X1,sK20)
& ssList(X3)
& sK20 = X2
& X1 = X3
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f269,plain,
( ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(X1,sK20)
& ssList(X3)
& sK20 = X2
& X1 = X3
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) )
=> ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(sK21,sK20)
& ssList(X3)
& sK20 = X2
& sK21 = X3
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(sK21) ) ),
introduced(choice_axiom,[]) ).
fof(f270,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(sK21,sK20)
& ssList(X3)
& sK20 = X2
& sK21 = X3
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) )
=> ( ssList(sK22)
& ? [X3] :
( ( nil = X3
| nil != sK22 )
& ~ frontsegP(sK21,sK20)
& ssList(X3)
& sK20 = sK22
& sK21 = X3
& ? [X4] :
( ssList(X4)
& app(sK22,X4) = X3
& totalorderedP(sK22)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK22 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f271,plain,
( ? [X3] :
( ( nil = X3
| nil != sK22 )
& ~ frontsegP(sK21,sK20)
& ssList(X3)
& sK20 = sK22
& sK21 = X3
& ? [X4] :
( ssList(X4)
& app(sK22,X4) = X3
& totalorderedP(sK22)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK22 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) )
=> ( ( nil = sK23
| nil != sK22 )
& ~ frontsegP(sK21,sK20)
& ssList(sK23)
& sK20 = sK22
& sK21 = sK23
& ? [X4] :
( ssList(X4)
& app(sK22,X4) = sK23
& totalorderedP(sK22)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK22 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f272,plain,
( ? [X4] :
( ssList(X4)
& app(sK22,X4) = sK23
& totalorderedP(sK22)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK22 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) )
=> ( ssList(sK24)
& app(sK22,sK24) = sK23
& totalorderedP(sK22)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != sK24
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != sK22 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ),
introduced(choice_axiom,[]) ).
fof(f186,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( nil = X3
| nil != X2 )
& ~ frontsegP(X1,X0)
& ssList(X3)
& X0 = X2
& X1 = X3
& ? [X4] :
( ssList(X4)
& app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) ) ) ) )
& ssList(X1) ) ),
inference(flattening,[],[f185]) ).
fof(f185,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( app(X2,X4) = X3
& totalorderedP(X2)
& ! [X5] :
( ! [X6] :
( ~ ssList(X6)
| app(cons(X5,nil),X6) != X4
| ! [X7] :
( ! [X8] :
( ~ ssList(X8)
| ~ leq(X7,X5)
| app(X8,cons(X7,nil)) != X2 )
| ~ ssItem(X7) ) )
| ~ ssItem(X5) )
& ssList(X4) )
& ( nil = X3
| nil != X2 )
& ~ frontsegP(X1,X0)
& 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)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) ) )
& ssList(X6) ) ) ) )
| ( nil = X2
& nil != X3 )
| frontsegP(X1,X0) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ( app(X2,X4) != X3
| ~ totalorderedP(X2)
| ? [X5] :
( ssItem(X5)
& ? [X6] :
( app(cons(X5,nil),X6) = X4
& ? [X7] :
( ssItem(X7)
& ? [X8] :
( leq(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) ) )
& ssList(X6) ) ) ) )
| ( nil = X2
& nil != X3 )
| frontsegP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f433,plain,
sK21 = sK23,
inference(cnf_transformation,[],[f273]) ).
fof(f436,plain,
~ frontsegP(sK21,sK20),
inference(cnf_transformation,[],[f273]) ).
fof(f1045,plain,
( frontsegP(sK23,sK22)
| ~ spl52_38 ),
inference(avatar_component_clause,[],[f1043]) ).
fof(f1043,plain,
( spl52_38
<=> frontsegP(sK23,sK22) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_38])]) ).
fof(f1046,plain,
( spl52_38
| ~ spl52_12
| ~ spl52_13
| ~ spl52_14 ),
inference(avatar_split_clause,[],[f1036,f646,f642,f638,f1043]) ).
fof(f638,plain,
( spl52_12
<=> ssList(sK24) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_12])]) ).
fof(f642,plain,
( spl52_13
<=> ssList(sK23) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_13])]) ).
fof(f646,plain,
( spl52_14
<=> ssList(sK22) ),
introduced(avatar_definition,[new_symbols(naming,[spl52_14])]) ).
fof(f1036,plain,
( ~ ssList(sK22)
| ~ ssList(sK23)
| ~ ssList(sK24)
| frontsegP(sK23,sK22) ),
inference(superposition,[],[f564,f431]) ).
fof(f431,plain,
app(sK22,sK24) = sK23,
inference(cnf_transformation,[],[f273]) ).
fof(f564,plain,
! [X2,X1] :
( frontsegP(app(X1,X2),X1)
| ~ ssList(app(X1,X2))
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(equality_resolution,[],[f495]) ).
fof(f495,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| frontsegP(X0,X1)
| app(X1,X2) != X0
| ~ ssList(X2)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f311]) ).
fof(f311,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ( app(X1,sK40(X0,X1)) = X0
& ssList(sK40(X0,X1)) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK40])],[f309,f310]) ).
fof(f310,plain,
! [X0,X1] :
( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
=> ( app(X1,sK40(X0,X1)) = X0
& ssList(sK40(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f309,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X3] :
( app(X1,X3) = X0
& ssList(X3) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(rectify,[],[f308]) ).
fof(f308,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( ( frontsegP(X0,X1)
| ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) ) )
& ( ? [X2] :
( app(X1,X2) = X0
& ssList(X2) )
| ~ frontsegP(X0,X1) ) )
| ~ ssList(X1) ) ),
inference(nnf_transformation,[],[f163]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
| ~ ssList(X1) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax5) ).
fof(f655,plain,
spl52_14,
inference(avatar_contradiction_clause,[],[f653]) ).
fof(f653,plain,
( $false
| spl52_14 ),
inference(resolution,[],[f648,f438]) ).
fof(f438,plain,
ssList(sK22),
inference(cnf_transformation,[],[f273]) ).
fof(f648,plain,
( ~ ssList(sK22)
| spl52_14 ),
inference(avatar_component_clause,[],[f646]) ).
fof(f651,plain,
spl52_12,
inference(avatar_contradiction_clause,[],[f650]) ).
fof(f650,plain,
( $false
| spl52_12 ),
inference(resolution,[],[f640,f432]) ).
fof(f432,plain,
ssList(sK24),
inference(cnf_transformation,[],[f273]) ).
fof(f640,plain,
( ~ ssList(sK24)
| spl52_12 ),
inference(avatar_component_clause,[],[f638]) ).
fof(f649,plain,
( ~ spl52_12
| spl52_13
| ~ spl52_14 ),
inference(avatar_split_clause,[],[f630,f646,f642,f638]) ).
fof(f630,plain,
( ~ ssList(sK22)
| ssList(sK23)
| ~ ssList(sK24) ),
inference(superposition,[],[f356,f431]) ).
fof(f356,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ssList(app(X0,X1)) ) ),
inference(ennf_transformation,[],[f26]) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax26) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC353+1 : TPTP v8.1.0. Released v2.4.0.
% 0.12/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.12/0.33 % Computer : n021.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Aug 30 18:46:26 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.50 % (11566)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.18/0.50 % (11558)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.18/0.50 % (11558)Instruction limit reached!
% 0.18/0.50 % (11558)------------------------------
% 0.18/0.50 % (11558)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.50 % (11558)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.50 % (11558)Termination reason: Unknown
% 0.18/0.50 % (11558)Termination phase: Preprocessing 3
% 0.18/0.50
% 0.18/0.50 % (11558)Memory used [KB]: 1535
% 0.18/0.50 % (11558)Time elapsed: 0.004 s
% 0.18/0.50 % (11558)Instructions burned: 3 (million)
% 0.18/0.50 % (11558)------------------------------
% 0.18/0.50 % (11558)------------------------------
% 0.18/0.50 % (11544)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.18/0.50 % (11550)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.18/0.51 % (11555)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.18/0.51 % (11561)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.18/0.51 % (11555)Instruction limit reached!
% 0.18/0.51 % (11555)------------------------------
% 0.18/0.51 % (11555)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.51 % (11573)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.18/0.51 % (11555)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.51 % (11555)Termination reason: Unknown
% 0.18/0.51 % (11555)Termination phase: Saturation
% 0.18/0.52 % (11565)ott+21_1:1_erd=off:s2a=on:sac=on:sd=1:sgt=64:sos=on:ss=included:st=3.0:to=lpo:urr=on:i=99:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99Mi)
% 0.18/0.52
% 0.18/0.52 % (11555)Memory used [KB]: 6140
% 0.18/0.52 % (11555)Time elapsed: 0.106 s
% 0.18/0.52 % (11555)Instructions burned: 8 (million)
% 0.18/0.52 % (11555)------------------------------
% 0.18/0.52 % (11555)------------------------------
% 0.18/0.52 % (11566)First to succeed.
% 0.18/0.52 % (11566)Refutation found. Thanks to Tanya!
% 0.18/0.52 % SZS status Theorem for theBenchmark
% 0.18/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.52 % (11566)------------------------------
% 0.18/0.52 % (11566)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.18/0.52 % (11566)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.18/0.52 % (11566)Termination reason: Refutation
% 0.18/0.52
% 0.18/0.52 % (11566)Memory used [KB]: 6652
% 0.18/0.52 % (11566)Time elapsed: 0.075 s
% 0.18/0.52 % (11566)Instructions burned: 20 (million)
% 0.18/0.52 % (11566)------------------------------
% 0.18/0.52 % (11566)------------------------------
% 0.18/0.52 % (11543)Success in time 0.176 s
%------------------------------------------------------------------------------