TSTP Solution File: SWC309+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC309+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 : n024.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:20 EDT 2022
% Result : Theorem 0.20s 0.56s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 13
% Syntax : Number of formulae : 59 ( 11 unt; 0 def)
% Number of atoms : 383 ( 167 equ)
% Maximal formula atoms : 34 ( 6 avg)
% Number of connectives : 508 ( 184 ~; 165 |; 132 &)
% ( 4 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 152 ( 102 !; 50 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f269,plain,
$false,
inference(avatar_sat_refutation,[],[f196,f256,f268]) ).
fof(f268,plain,
( ~ spl8_2
| ~ spl8_3 ),
inference(avatar_contradiction_clause,[],[f267]) ).
fof(f267,plain,
( $false
| ~ spl8_2
| ~ spl8_3 ),
inference(subsumption_resolution,[],[f266,f193]) ).
fof(f193,plain,
( ssList(nil)
| ~ spl8_2 ),
inference(avatar_component_clause,[],[f192]) ).
fof(f192,plain,
( spl8_2
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl8_2])]) ).
fof(f266,plain,
( ~ ssList(nil)
| ~ spl8_3 ),
inference(resolution,[],[f258,f184]) ).
fof(f184,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f180]) ).
fof(f180,plain,
! [X1] :
( ~ ssList(X1)
| ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f139]) ).
fof(f139,plain,
! [X0,X1] :
( ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f121]) ).
fof(f121,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( ( X0 != X1
| ~ neq(X0,X1) )
& ( neq(X0,X1)
| X0 = X1 ) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f100,plain,
! [X0] :
( ! [X1] :
( ~ ssList(X1)
| ( X0 != X1
<=> neq(X0,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(f258,plain,
( neq(nil,nil)
| ~ spl8_3 ),
inference(backward_demodulation,[],[f174,f199]) ).
fof(f199,plain,
( nil = sK3
| ~ spl8_3 ),
inference(avatar_component_clause,[],[f198]) ).
fof(f198,plain,
( spl8_3
<=> nil = sK3 ),
introduced(avatar_definition,[new_symbols(naming,[spl8_3])]) ).
fof(f174,plain,
neq(sK3,nil),
inference(definition_unfolding,[],[f151,f150]) ).
fof(f150,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f127]) ).
fof(f127,plain,
( ssList(sK0)
& neq(sK1,nil)
& sK1 = sK3
& ssList(sK3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != sK3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2 ) )
& sK2 = sK0
& ssList(sK2)
& ssList(sK1) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f122,f126,f125,f124,f123]) ).
fof(f123,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != X0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2 ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2 ) )
& sK0 = X2 )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f124,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2 ) )
& sK0 = X2 )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( neq(sK1,nil)
& sK1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2 ) )
& sK0 = X2 )
& ssList(X2) )
& ssList(sK1) ) ),
introduced(choice_axiom,[]) ).
fof(f125,plain,
( ? [X2] :
( ? [X3] :
( neq(sK1,nil)
& sK1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2 ) )
& sK0 = X2 )
& ssList(X2) )
=> ( ? [X3] :
( neq(sK1,nil)
& sK1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2 ) )
& sK2 = sK0 )
& ssList(sK2) ) ),
introduced(choice_axiom,[]) ).
fof(f126,plain,
( ? [X3] :
( neq(sK1,nil)
& sK1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = sK2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2 ) )
& sK2 = sK0 )
=> ( neq(sK1,nil)
& sK1 = sK3
& ssList(sK3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ) )
& ( nil != sK3
| nil = sK2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != sK3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2 ) )
& sK2 = sK0 ) ),
introduced(choice_axiom,[]) ).
fof(f122,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ssList(X3)
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X1
| app(X5,cons(X4,nil)) != X0
| ~ ssList(X5) ) )
& ( nil != X3
| nil = X2 )
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = X2 ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(rectify,[],[f109]) ).
fof(f109,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( neq(X1,nil)
& X1 = X3
& ssList(X3)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X1
| app(X7,cons(X6,nil)) != X0
| ~ ssList(X7) ) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X3
| ~ ssList(X5)
| app(X5,cons(X4,nil)) = X2 ) )
& X0 = X2 )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f108]) ).
fof(f108,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( app(cons(X6,nil),X7) != X1
| app(X7,cons(X6,nil)) != X0
| ~ ssList(X7) ) )
& X1 = X3
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( app(cons(X4,nil),X5) != X3
| ~ ssList(X5)
| app(X5,cons(X4,nil)) = X2 ) )
& X0 = X2
& ( nil != X3
| nil = X2 )
& neq(X1,nil)
& 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)
=> ( ? [X6] :
( ? [X7] :
( ssList(X7)
& app(cons(X6,nil),X7) = X1
& app(X7,cons(X6,nil)) = X0 )
& ssItem(X6) )
| X1 != X3
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(cons(X4,nil),X5) = X3
& ssList(X5)
& app(X5,cons(X4,nil)) != X2 ) )
| X0 != X2
| ( nil != X2
& nil = X3 )
| ~ neq(X1,nil) ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(cons(X6,nil),X7) = X3
& ssList(X7)
& app(X7,cons(X6,nil)) != X2 ) )
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(X5,cons(X4,nil)) = X0
& ssList(X5)
& app(cons(X4,nil),X5) = X1 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X0 != X2
| X1 != X3
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(cons(X6,nil),X7) = X3
& ssList(X7)
& app(X7,cons(X6,nil)) != X2 ) )
| ~ neq(X1,nil)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(X5,cons(X4,nil)) = X0
& ssList(X5)
& app(cons(X4,nil),X5) = X1 ) )
| ( nil != X2
& nil = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f151,plain,
neq(sK1,nil),
inference(cnf_transformation,[],[f127]) ).
fof(f256,plain,
spl8_3,
inference(avatar_split_clause,[],[f255,f198]) ).
fof(f255,plain,
nil = sK3,
inference(subsumption_resolution,[],[f251,f149]) ).
fof(f149,plain,
ssList(sK3),
inference(cnf_transformation,[],[f127]) ).
fof(f251,plain,
( ~ ssList(sK3)
| nil = sK3 ),
inference(equality_resolution,[],[f250]) ).
fof(f250,plain,
! [X0] :
( sK3 != X0
| nil = X0
| ~ ssList(X0) ),
inference(subsumption_resolution,[],[f249,f166]) ).
fof(f166,plain,
! [X0] :
( ssItem(sK7(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( nil = X0
| ( ssList(sK6(X0))
& ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7])],[f105,f134,f133]) ).
fof(f133,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
=> ( ssList(sK6(X0))
& ? [X2] :
( ssItem(X2)
& cons(X2,sK6(X0)) = X0 ) ) ),
introduced(choice_axiom,[]) ).
fof(f134,plain,
! [X0] :
( ? [X2] :
( ssItem(X2)
& cons(X2,sK6(X0)) = X0 )
=> ( ssItem(sK7(X0))
& cons(sK7(X0),sK6(X0)) = X0 ) ),
introduced(choice_axiom,[]) ).
fof(f105,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f104]) ).
fof(f104,plain,
! [X0] :
( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax20) ).
fof(f249,plain,
! [X0] :
( ~ ssItem(sK7(X0))
| ~ ssList(X0)
| nil = X0
| sK3 != X0 ),
inference(subsumption_resolution,[],[f248,f167]) ).
fof(f167,plain,
! [X0] :
( ssList(sK6(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f248,plain,
! [X0] :
( sK3 != X0
| ~ ssList(sK6(X0))
| ~ ssList(X0)
| nil = X0
| ~ ssItem(sK7(X0)) ),
inference(superposition,[],[f247,f165]) ).
fof(f165,plain,
! [X0] :
( cons(sK7(X0),sK6(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f135]) ).
fof(f247,plain,
! [X0,X1] :
( cons(X0,X1) != sK3
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f238]) ).
fof(f238,plain,
! [X0,X1] :
( ~ ssItem(X0)
| cons(X0,X1) != sK3
| ~ ssList(X1)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(superposition,[],[f206,f173]) ).
fof(f173,plain,
! [X0,X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssList(X0)
| ~ ssItem(X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax81) ).
fof(f206,plain,
! [X6,X7] :
( app(cons(X6,nil),X7) != sK3
| ~ ssItem(X6)
| ~ ssList(X7) ),
inference(subsumption_resolution,[],[f177,f175]) ).
fof(f175,plain,
! [X4,X5] :
( app(cons(X4,nil),X5) != sK3
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f148,f150]) ).
fof(f148,plain,
! [X4,X5] :
( ~ ssItem(X4)
| app(cons(X4,nil),X5) != sK1
| app(X5,cons(X4,nil)) != sK0
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f127]) ).
fof(f177,plain,
! [X6,X7] :
( app(cons(X6,nil),X7) != sK3
| app(X7,cons(X6,nil)) = sK0
| ~ ssList(X7)
| ~ ssItem(X6) ),
inference(definition_unfolding,[],[f146,f145]) ).
fof(f145,plain,
sK2 = sK0,
inference(cnf_transformation,[],[f127]) ).
fof(f146,plain,
! [X6,X7] :
( ~ ssItem(X6)
| app(cons(X6,nil),X7) != sK3
| ~ ssList(X7)
| app(X7,cons(X6,nil)) = sK2 ),
inference(cnf_transformation,[],[f127]) ).
fof(f196,plain,
spl8_2,
inference(avatar_split_clause,[],[f158,f192]) ).
fof(f158,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC309+1 : TPTP v8.1.0. Released v2.4.0.
% 0.11/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.35 % Computer : n024.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Aug 30 18:47:34 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.53 % (16296)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 % (16273)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.20/0.54 % (16281)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.54 % (16281)Instruction limit reached!
% 0.20/0.54 % (16281)------------------------------
% 0.20/0.54 % (16281)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (16281)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (16281)Termination reason: Unknown
% 0.20/0.54 % (16281)Termination phase: Preprocessing 3
% 0.20/0.54
% 0.20/0.54 % (16281)Memory used [KB]: 1535
% 0.20/0.54 % (16281)Time elapsed: 0.003 s
% 0.20/0.54 % (16281)Instructions burned: 3 (million)
% 0.20/0.54 % (16281)------------------------------
% 0.20/0.54 % (16281)------------------------------
% 0.20/0.54 % (16290)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.54 % (16296)Instruction limit reached!
% 0.20/0.54 % (16296)------------------------------
% 0.20/0.54 % (16296)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.54 % (16296)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.54 % (16296)Termination reason: Unknown
% 0.20/0.54 % (16296)Termination phase: Saturation
% 0.20/0.54
% 0.20/0.54 % (16296)Memory used [KB]: 6396
% 0.20/0.54 % (16296)Time elapsed: 0.132 s
% 0.20/0.54 % (16296)Instructions burned: 24 (million)
% 0.20/0.54 % (16296)------------------------------
% 0.20/0.54 % (16296)------------------------------
% 0.20/0.54 % (16275)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.55 % (16273)First to succeed.
% 0.20/0.55 % (16284)fmb+10_1:1_nm=2:i=3:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.20/0.55 % (16289)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.55 % (16274)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.56 % (16273)Refutation found. Thanks to Tanya!
% 0.20/0.56 % SZS status Theorem for theBenchmark
% 0.20/0.56 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.56 % (16273)------------------------------
% 0.20/0.56 % (16273)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.20/0.56 % (16273)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.20/0.56 % (16273)Termination reason: Refutation
% 0.20/0.56
% 0.20/0.56 % (16273)Memory used [KB]: 6140
% 0.20/0.56 % (16273)Time elapsed: 0.121 s
% 0.20/0.56 % (16273)Instructions burned: 7 (million)
% 0.20/0.56 % (16273)------------------------------
% 0.20/0.56 % (16273)------------------------------
% 0.20/0.56 % (16266)Success in time 0.197 s
%------------------------------------------------------------------------------