TSTP Solution File: SWC069+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC069+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 : n028.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:38:34 EDT 2022
% Result : Theorem 1.57s 0.57s
% Output : Refutation 1.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of formulae : 66 ( 6 unt; 0 def)
% Number of atoms : 386 ( 104 equ)
% Maximal formula atoms : 38 ( 5 avg)
% Number of connectives : 486 ( 166 ~; 142 |; 145 &)
% ( 11 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 10 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% Number of variables : 73 ( 35 !; 38 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f291,plain,
$false,
inference(avatar_sat_refutation,[],[f165,f170,f181,f191,f197,f203,f206,f214,f223,f290]) ).
fof(f290,plain,
( ~ spl7_1
| ~ spl7_3
| ~ spl7_4
| ~ spl7_8 ),
inference(avatar_contradiction_clause,[],[f289]) ).
fof(f289,plain,
( $false
| ~ spl7_1
| ~ spl7_3
| ~ spl7_4
| ~ spl7_8 ),
inference(subsumption_resolution,[],[f277,f176]) ).
fof(f176,plain,
( segmentP(sK3,sK6)
| ~ spl7_4 ),
inference(avatar_component_clause,[],[f174]) ).
fof(f174,plain,
( spl7_4
<=> segmentP(sK3,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_4])]) ).
fof(f277,plain,
( ~ segmentP(sK3,sK6)
| ~ spl7_1
| ~ spl7_3
| ~ spl7_8 ),
inference(unit_resulting_resolution,[],[f196,f169,f224,f141]) ).
fof(f141,plain,
! [X5] :
( ~ segmentP(sK3,X5)
| ~ segmentP(sK2,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f125]) ).
fof(f125,plain,
( ssList(sK2)
& ssList(sK3)
& ssList(sK4)
& ( ( segmentP(sK5,sK6)
& segmentP(sK4,sK6)
& neq(sK6,nil)
& ssList(sK6) )
| ~ neq(sK5,nil) )
& ( nil != sK3
| nil != sK2 )
& ssList(sK5)
& sK3 = sK5
& ! [X5] :
( ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = sK4
| nil != sK5 )
& sK4 = sK2 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4,sK5,sK6])],[f103,f124,f123,f122,f121,f120]) ).
fof(f120,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != X0 )
& ssList(X3)
& X1 = X3
& ! [X5] :
( ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(X0,X5) )
& ( nil = X2
| nil != X3 )
& X0 = X2 ) ) ) )
=> ( ssList(sK2)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != sK2 )
& ssList(X3)
& X1 = X3
& ! [X5] :
( ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = X2
| nil != X3 )
& sK2 = X2 ) ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f121,plain,
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != sK2 )
& ssList(X3)
& X1 = X3
& ! [X5] :
( ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = X2
| nil != X3 )
& sK2 = X2 ) ) )
=> ( ssList(sK3)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ssList(X3)
& sK3 = X3
& ! [X5] :
( ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = X2
| nil != X3 )
& sK2 = X2 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
( ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ssList(X3)
& sK3 = X3
& ! [X5] :
( ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = X2
| nil != X3 )
& sK2 = X2 ) )
=> ( ssList(sK4)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(sK4,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ssList(X3)
& sK3 = X3
& ! [X5] :
( ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = sK4
| nil != X3 )
& sK4 = sK2 ) ) ),
introduced(choice_axiom,[]) ).
fof(f123,plain,
( ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(sK4,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != sK3
| nil != sK2 )
& ssList(X3)
& sK3 = X3
& ! [X5] :
( ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = sK4
| nil != X3 )
& sK4 = sK2 )
=> ( ( ? [X4] :
( segmentP(sK5,X4)
& segmentP(sK4,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(sK5,nil) )
& ( nil != sK3
| nil != sK2 )
& ssList(sK5)
& sK3 = sK5
& ! [X5] :
( ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(sK2,X5) )
& ( nil = sK4
| nil != sK5 )
& sK4 = sK2 ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X4] :
( segmentP(sK5,X4)
& segmentP(sK4,X4)
& neq(X4,nil)
& ssList(X4) )
=> ( segmentP(sK5,sK6)
& segmentP(sK4,sK6)
& neq(sK6,nil)
& ssList(sK6) ) ),
introduced(choice_axiom,[]) ).
fof(f103,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ? [X4] :
( segmentP(X3,X4)
& segmentP(X2,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X3,nil) )
& ( nil != X1
| nil != X0 )
& ssList(X3)
& X1 = X3
& ! [X5] :
( ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(X0,X5) )
& ( nil = X2
| nil != X3 )
& X0 = X2 ) ) ) ),
inference(flattening,[],[f102]) ).
fof(f102,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil = X2
| nil != X3 )
& X0 = X2
& ( ? [X4] :
( segmentP(X3,X4)
& neq(X4,nil)
& segmentP(X2,X4)
& ssList(X4) )
| ~ neq(X3,nil) )
& ! [X5] :
( ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| ~ segmentP(X0,X5) )
& ( nil != X1
| nil != X0 )
& X1 = X3
& 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 = X3
& nil != X2 )
| X0 != X2
| ( ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X3,X4)
| ~ neq(X4,nil)
| ~ segmentP(X2,X4) ) )
& neq(X3,nil) )
| ? [X5] :
( neq(X5,nil)
& segmentP(X0,X5)
& segmentP(X1,X5)
& ssList(X5) )
| ( nil = X1
& nil = X0 )
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X3
& nil != X2 )
| X1 != X3
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ neq(X5,nil)
| ~ segmentP(X3,X5) ) )
& neq(X3,nil) )
| X0 != X2
| ? [X4] :
( segmentP(X1,X4)
& ssList(X4)
& segmentP(X0,X4)
& neq(X4,nil) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X3
& nil != X2 )
| X1 != X3
| ( nil = X1
& nil = X0 )
| ( ! [X5] :
( ssList(X5)
=> ( ~ segmentP(X2,X5)
| ~ neq(X5,nil)
| ~ segmentP(X3,X5) ) )
& neq(X3,nil) )
| X0 != X2
| ? [X4] :
( segmentP(X1,X4)
& ssList(X4)
& segmentP(X0,X4)
& neq(X4,nil) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f224,plain,
( segmentP(sK2,sK6)
| ~ spl7_1 ),
inference(forward_demodulation,[],[f160,f139]) ).
fof(f139,plain,
sK4 = sK2,
inference(cnf_transformation,[],[f125]) ).
fof(f160,plain,
( segmentP(sK4,sK6)
| ~ spl7_1 ),
inference(avatar_component_clause,[],[f158]) ).
fof(f158,plain,
( spl7_1
<=> segmentP(sK4,sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_1])]) ).
fof(f169,plain,
( neq(sK6,nil)
| ~ spl7_3 ),
inference(avatar_component_clause,[],[f167]) ).
fof(f167,plain,
( spl7_3
<=> neq(sK6,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_3])]) ).
fof(f196,plain,
( ssList(sK6)
| ~ spl7_8 ),
inference(avatar_component_clause,[],[f194]) ).
fof(f194,plain,
( spl7_8
<=> ssList(sK6) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_8])]) ).
fof(f223,plain,
( spl7_7
| ~ spl7_9 ),
inference(avatar_contradiction_clause,[],[f222]) ).
fof(f222,plain,
( $false
| spl7_7
| ~ spl7_9 ),
inference(subsumption_resolution,[],[f216,f190]) ).
fof(f190,plain,
( nil != sK5
| spl7_7 ),
inference(avatar_component_clause,[],[f188]) ).
fof(f188,plain,
( spl7_7
<=> nil = sK5 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_7])]) ).
fof(f216,plain,
( nil = sK5
| ~ spl7_9 ),
inference(backward_demodulation,[],[f142,f201]) ).
fof(f201,plain,
( nil = sK3
| ~ spl7_9 ),
inference(avatar_component_clause,[],[f200]) ).
fof(f200,plain,
( spl7_9
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_9])]) ).
fof(f142,plain,
sK3 = sK5,
inference(cnf_transformation,[],[f125]) ).
fof(f214,plain,
( spl7_9
| spl7_5 ),
inference(avatar_split_clause,[],[f213,f178,f200]) ).
fof(f178,plain,
( spl7_5
<=> neq(sK3,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_5])]) ).
fof(f213,plain,
( nil = sK3
| spl7_5 ),
inference(unit_resulting_resolution,[],[f132,f150,f180,f129]) ).
fof(f129,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X0)
| ~ ssList(X1) ),
inference(cnf_transformation,[],[f113]) ).
fof(f113,plain,
! [X0] :
( ! [X1] :
( ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f104]) ).
fof(f104,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/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f180,plain,
( ~ neq(sK3,nil)
| spl7_5 ),
inference(avatar_component_clause,[],[f178]) ).
fof(f150,plain,
ssList(sK3),
inference(cnf_transformation,[],[f125]) ).
fof(f132,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f206,plain,
( ~ spl7_5
| spl7_2 ),
inference(avatar_split_clause,[],[f205,f162,f178]) ).
fof(f162,plain,
( spl7_2
<=> neq(sK5,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl7_2])]) ).
fof(f205,plain,
( ~ neq(sK3,nil)
| spl7_2 ),
inference(forward_demodulation,[],[f164,f142]) ).
fof(f164,plain,
( ~ neq(sK5,nil)
| spl7_2 ),
inference(avatar_component_clause,[],[f162]) ).
fof(f203,plain,
( ~ spl7_6
| ~ spl7_9 ),
inference(avatar_split_clause,[],[f144,f200,f184]) ).
fof(f184,plain,
( spl7_6
<=> nil = sK2 ),
introduced(avatar_definition,[new_symbols(naming,[spl7_6])]) ).
fof(f144,plain,
( nil != sK3
| nil != sK2 ),
inference(cnf_transformation,[],[f125]) ).
fof(f197,plain,
( ~ spl7_5
| spl7_8 ),
inference(avatar_split_clause,[],[f192,f194,f178]) ).
fof(f192,plain,
( ssList(sK6)
| ~ neq(sK3,nil) ),
inference(forward_demodulation,[],[f145,f142]) ).
fof(f145,plain,
( ssList(sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f191,plain,
( spl7_6
| ~ spl7_7 ),
inference(avatar_split_clause,[],[f182,f188,f184]) ).
fof(f182,plain,
( nil != sK5
| nil = sK2 ),
inference(forward_demodulation,[],[f140,f139]) ).
fof(f140,plain,
( nil != sK5
| nil = sK4 ),
inference(cnf_transformation,[],[f125]) ).
fof(f181,plain,
( spl7_4
| ~ spl7_5 ),
inference(avatar_split_clause,[],[f172,f178,f174]) ).
fof(f172,plain,
( ~ neq(sK3,nil)
| segmentP(sK3,sK6) ),
inference(forward_demodulation,[],[f171,f142]) ).
fof(f171,plain,
( segmentP(sK3,sK6)
| ~ neq(sK5,nil) ),
inference(forward_demodulation,[],[f148,f142]) ).
fof(f148,plain,
( segmentP(sK5,sK6)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f170,plain,
( ~ spl7_2
| spl7_3 ),
inference(avatar_split_clause,[],[f146,f167,f162]) ).
fof(f146,plain,
( neq(sK6,nil)
| ~ neq(sK5,nil) ),
inference(cnf_transformation,[],[f125]) ).
fof(f165,plain,
( spl7_1
| ~ spl7_2 ),
inference(avatar_split_clause,[],[f147,f162,f158]) ).
fof(f147,plain,
( ~ neq(sK5,nil)
| segmentP(sK4,sK6) ),
inference(cnf_transformation,[],[f125]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWC069+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/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 : n028.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:16:04 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.49 % (22766)lrs+10_1:1_ep=R:lcm=predicate:lma=on:sos=all:spb=goal:ss=included:i=12:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/12Mi)
% 0.19/0.54 % (22766)Instruction limit reached!
% 0.19/0.54 % (22766)------------------------------
% 0.19/0.54 % (22766)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.54 % (22766)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.54 % (22766)Termination reason: Unknown
% 0.19/0.54 % (22766)Termination phase: Saturation
% 0.19/0.54
% 0.19/0.54 % (22766)Memory used [KB]: 6140
% 0.19/0.54 % (22766)Time elapsed: 0.125 s
% 0.19/0.54 % (22766)Instructions burned: 12 (million)
% 0.19/0.54 % (22766)------------------------------
% 0.19/0.54 % (22766)------------------------------
% 1.43/0.54 % (22759)lrs+10_5:1_br=off:fde=none:nwc=3.0:sd=1:sgt=10:sos=on:ss=axioms:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.57/0.56 % (22767)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)
% 1.57/0.56 % (22774)ott+1010_1:1_sd=2:sos=on:sp=occurrence:ss=axioms:urr=on:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 1.57/0.56 % (22759)First to succeed.
% 1.57/0.56 % (22774)Instruction limit reached!
% 1.57/0.56 % (22774)------------------------------
% 1.57/0.56 % (22774)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.56 % (22774)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.56 % (22774)Termination reason: Unknown
% 1.57/0.56 % (22774)Termination phase: SInE selection
% 1.57/0.56
% 1.57/0.56 % (22774)Memory used [KB]: 1407
% 1.57/0.56 % (22774)Time elapsed: 0.004 s
% 1.57/0.56 % (22774)Instructions burned: 2 (million)
% 1.57/0.56 % (22774)------------------------------
% 1.57/0.56 % (22774)------------------------------
% 1.57/0.57 % (22760)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)
% 1.57/0.57 % (22783)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)
% 1.57/0.57 % (22767)Instruction limit reached!
% 1.57/0.57 % (22767)------------------------------
% 1.57/0.57 % (22767)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.57 % (22767)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.57 % (22767)Termination reason: Unknown
% 1.57/0.57 % (22759)Refutation found. Thanks to Tanya!
% 1.57/0.57 % SZS status Theorem for theBenchmark
% 1.57/0.57 % SZS output start Proof for theBenchmark
% See solution above
% 1.57/0.57 % (22759)------------------------------
% 1.57/0.57 % (22759)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.57/0.57 % (22759)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.57/0.57 % (22759)Termination reason: Refutation
% 1.57/0.57
% 1.57/0.57 % (22759)Memory used [KB]: 6140
% 1.57/0.57 % (22759)Time elapsed: 0.158 s
% 1.57/0.57 % (22759)Instructions burned: 7 (million)
% 1.57/0.57 % (22759)------------------------------
% 1.57/0.57 % (22759)------------------------------
% 1.57/0.57 % (22755)Success in time 0.224 s
%------------------------------------------------------------------------------