TSTP Solution File: SWC392+1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWC392+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:54 EDT 2022
% Result : Theorem 1.45s 0.55s
% Output : Refutation 1.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 15
% Syntax : Number of formulae : 63 ( 11 unt; 0 def)
% Number of atoms : 424 ( 121 equ)
% Maximal formula atoms : 36 ( 6 avg)
% Number of connectives : 518 ( 157 ~; 156 |; 170 &)
% ( 7 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 109 ( 54 !; 55 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f531,plain,
$false,
inference(avatar_sat_refutation,[],[f238,f248,f249,f261,f502,f530]) ).
fof(f530,plain,
~ spl12_1,
inference(avatar_contradiction_clause,[],[f529]) ).
fof(f529,plain,
( $false
| ~ spl12_1 ),
inference(subsumption_resolution,[],[f528,f191]) ).
fof(f191,plain,
ssItem(sK10),
inference(cnf_transformation,[],[f150]) ).
fof(f150,plain,
( ssList(sK6)
& sK8 = sK6
& memberP(sK6,sK10)
& ssItem(sK10)
& ~ memberP(sK7,sK10)
& ssList(sK9)
& sK7 = sK9
& ( ( nil = sK9
& nil = sK8 )
| ( memberP(sK9,sK11)
& ssItem(sK11)
& ! [X6] :
( ~ memberP(sK9,X6)
| ~ ssItem(X6)
| sK11 = X6
| ~ leq(X6,sK11) )
& sK8 = cons(sK11,nil) ) )
& ssList(sK8)
& ssList(sK7) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11])],[f143,f149,f148,f147,f146,f145,f144]) ).
fof(f144,plain,
( ? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ? [X4] :
( memberP(X0,X4)
& ssItem(X4)
& ~ memberP(X1,X4) )
& ssList(X3)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) )
=> ( ssList(sK6)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( sK6 = X2
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(X1,X4) )
& ssList(X3)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f145,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( sK6 = X2
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(X1,X4) )
& ssList(X3)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = X2 ) ) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( sK6 = X2
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(sK7,X4) )
& ssList(X3)
& sK7 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = X2 ) ) )
& ssList(X2) )
& ssList(sK7) ) ),
introduced(choice_axiom,[]) ).
fof(f146,plain,
( ? [X2] :
( ? [X3] :
( sK6 = X2
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(sK7,X4) )
& ssList(X3)
& sK7 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = X2 ) ) )
& ssList(X2) )
=> ( ? [X3] :
( sK8 = sK6
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(sK7,X4) )
& ssList(X3)
& sK7 = X3
& ( ( nil = X3
& nil = sK8 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = sK8 ) ) )
& ssList(sK8) ) ),
introduced(choice_axiom,[]) ).
fof(f147,plain,
( ? [X3] :
( sK8 = sK6
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(sK7,X4) )
& ssList(X3)
& sK7 = X3
& ( ( nil = X3
& nil = sK8 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = sK8 ) ) )
=> ( sK8 = sK6
& ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(sK7,X4) )
& ssList(sK9)
& sK7 = sK9
& ( ( nil = sK9
& nil = sK8 )
| ? [X5] :
( memberP(sK9,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(sK9,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = sK8 ) ) ) ),
introduced(choice_axiom,[]) ).
fof(f148,plain,
( ? [X4] :
( memberP(sK6,X4)
& ssItem(X4)
& ~ memberP(sK7,X4) )
=> ( memberP(sK6,sK10)
& ssItem(sK10)
& ~ memberP(sK7,sK10) ) ),
introduced(choice_axiom,[]) ).
fof(f149,plain,
( ? [X5] :
( memberP(sK9,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(sK9,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = sK8 )
=> ( memberP(sK9,sK11)
& ssItem(sK11)
& ! [X6] :
( ~ memberP(sK9,X6)
| ~ ssItem(X6)
| sK11 = X6
| ~ leq(X6,sK11) )
& sK8 = cons(sK11,nil) ) ),
introduced(choice_axiom,[]) ).
fof(f143,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ? [X4] :
( memberP(X0,X4)
& ssItem(X4)
& ~ memberP(X1,X4) )
& ssList(X3)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X5] :
( memberP(X3,X5)
& ssItem(X5)
& ! [X6] :
( ~ memberP(X3,X6)
| ~ ssItem(X6)
| X5 = X6
| ~ leq(X6,X5) )
& cons(X5,nil) = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(rectify,[],[f113]) ).
fof(f113,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ? [X2] :
( ? [X3] :
( X0 = X2
& ? [X6] :
( memberP(X0,X6)
& ssItem(X6)
& ~ memberP(X1,X6) )
& ssList(X3)
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& ssItem(X4)
& ! [X5] :
( ~ memberP(X3,X5)
| ~ ssItem(X5)
| X4 = X5
| ~ leq(X5,X4) )
& cons(X4,nil) = X2 ) ) )
& ssList(X2) )
& ssList(X1) ) ),
inference(flattening,[],[f112]) ).
fof(f112,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X6] :
( memberP(X0,X6)
& ~ memberP(X1,X6)
& ssItem(X6) )
& X1 = X3
& ( ( nil = X3
& nil = X2 )
| ? [X4] :
( memberP(X3,X4)
& cons(X4,nil) = X2
& ! [X5] :
( ~ memberP(X3,X5)
| ~ ssItem(X5)
| X4 = X5
| ~ leq(X5,X4) )
& ssItem(X4) ) )
& 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)
=> ( ! [X6] :
( ssItem(X6)
=> ( ~ memberP(X0,X6)
| memberP(X1,X6) ) )
| X1 != X3
| ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X3,X4)
| cons(X4,nil) != X2
| ? [X5] :
( ssItem(X5)
& leq(X5,X4)
& memberP(X3,X5)
& X4 != X5 ) ) ) )
| X0 != X2 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( memberP(X3,X6)
& leq(X6,X5)
& ssItem(X6)
& X5 != X6 )
| cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& ( nil != X2
| nil != X3 ) )
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) ) ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ( ! [X5] :
( ssItem(X5)
=> ( ? [X6] :
( memberP(X3,X6)
& leq(X6,X5)
& ssItem(X6)
& X5 != X6 )
| cons(X5,nil) != X2
| ~ memberP(X3,X5) ) )
& ( nil != X2
| nil != X3 ) )
| ! [X4] :
( ssItem(X4)
=> ( ~ memberP(X0,X4)
| memberP(X1,X4) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f528,plain,
( ~ ssItem(sK10)
| ~ spl12_1 ),
inference(resolution,[],[f520,f165]) ).
fof(f165,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f124]) ).
fof(f124,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f520,plain,
( memberP(nil,sK10)
| ~ spl12_1 ),
inference(backward_demodulation,[],[f192,f224]) ).
fof(f224,plain,
( nil = sK6
| ~ spl12_1 ),
inference(avatar_component_clause,[],[f222]) ).
fof(f222,plain,
( spl12_1
<=> nil = sK6 ),
introduced(avatar_definition,[new_symbols(naming,[spl12_1])]) ).
fof(f192,plain,
memberP(sK6,sK10),
inference(cnf_transformation,[],[f150]) ).
fof(f502,plain,
( ~ spl12_4
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(avatar_contradiction_clause,[],[f501]) ).
fof(f501,plain,
( $false
| ~ spl12_4
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f498,f237]) ).
fof(f237,plain,
( memberP(sK9,sK11)
| ~ spl12_4 ),
inference(avatar_component_clause,[],[f235]) ).
fof(f235,plain,
( spl12_4
<=> memberP(sK9,sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_4])]) ).
fof(f498,plain,
( ~ memberP(sK9,sK11)
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(backward_demodulation,[],[f207,f493]) ).
fof(f493,plain,
( sK10 = sK11
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f479,f191]) ).
fof(f479,plain,
( ~ ssItem(sK10)
| sK10 = sK11
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(resolution,[],[f478,f192]) ).
fof(f478,plain,
( ! [X0] :
( ~ memberP(sK6,X0)
| ~ ssItem(X0)
| sK11 = X0 )
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f477,f165]) ).
fof(f477,plain,
( ! [X0] :
( memberP(nil,X0)
| ~ memberP(sK6,X0)
| ~ ssItem(X0)
| sK11 = X0 )
| ~ spl12_5
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f476,f242]) ).
fof(f242,plain,
( ssItem(sK11)
| ~ spl12_5 ),
inference(avatar_component_clause,[],[f240]) ).
fof(f240,plain,
( spl12_5
<=> ssItem(sK11) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_5])]) ).
fof(f476,plain,
( ! [X0] :
( ~ ssItem(sK11)
| memberP(nil,X0)
| sK11 = X0
| ~ ssItem(X0)
| ~ memberP(sK6,X0) )
| ~ spl12_6
| ~ spl12_7 ),
inference(subsumption_resolution,[],[f464,f254]) ).
fof(f254,plain,
( ssList(nil)
| ~ spl12_7 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f253,plain,
( spl12_7
<=> ssList(nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_7])]) ).
fof(f464,plain,
( ! [X0] :
( ~ memberP(sK6,X0)
| ~ ssList(nil)
| memberP(nil,X0)
| sK11 = X0
| ~ ssItem(sK11)
| ~ ssItem(X0) )
| ~ spl12_6 ),
inference(superposition,[],[f166,f247]) ).
fof(f247,plain,
( sK6 = cons(sK11,nil)
| ~ spl12_6 ),
inference(avatar_component_clause,[],[f245]) ).
fof(f245,plain,
( spl12_6
<=> sK6 = cons(sK11,nil) ),
introduced(avatar_definition,[new_symbols(naming,[spl12_6])]) ).
fof(f166,plain,
! [X2,X0,X1] :
( ~ memberP(cons(X1,X2),X0)
| ~ ssItem(X1)
| X0 = X1
| ~ ssItem(X0)
| ~ ssList(X2)
| memberP(X2,X0) ),
inference(cnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f136]) ).
fof(f136,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( X0 != X1
& ~ memberP(X2,X0) ) )
& ( X0 = X1
| memberP(X2,X0)
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f125]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( X0 = X1
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).
fof(f207,plain,
~ memberP(sK9,sK10),
inference(definition_unfolding,[],[f190,f188]) ).
fof(f188,plain,
sK7 = sK9,
inference(cnf_transformation,[],[f150]) ).
fof(f190,plain,
~ memberP(sK7,sK10),
inference(cnf_transformation,[],[f150]) ).
fof(f261,plain,
spl12_7,
inference(avatar_split_clause,[],[f170,f253]) ).
fof(f170,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f249,plain,
( spl12_5
| spl12_1 ),
inference(avatar_split_clause,[],[f210,f222,f240]) ).
fof(f210,plain,
( nil = sK6
| ssItem(sK11) ),
inference(definition_unfolding,[],[f182,f193]) ).
fof(f193,plain,
sK8 = sK6,
inference(cnf_transformation,[],[f150]) ).
fof(f182,plain,
( nil = sK8
| ssItem(sK11) ),
inference(cnf_transformation,[],[f150]) ).
fof(f248,plain,
( spl12_6
| spl12_1 ),
inference(avatar_split_clause,[],[f212,f222,f245]) ).
fof(f212,plain,
( nil = sK6
| sK6 = cons(sK11,nil) ),
inference(definition_unfolding,[],[f180,f193,f193]) ).
fof(f180,plain,
( nil = sK8
| sK8 = cons(sK11,nil) ),
inference(cnf_transformation,[],[f150]) ).
fof(f238,plain,
( spl12_4
| spl12_1 ),
inference(avatar_split_clause,[],[f209,f222,f235]) ).
fof(f209,plain,
( nil = sK6
| memberP(sK9,sK11) ),
inference(definition_unfolding,[],[f183,f193]) ).
fof(f183,plain,
( nil = sK8
| memberP(sK9,sK11) ),
inference(cnf_transformation,[],[f150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWC392+1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/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:54:03 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.19/0.51 % (10358)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.19/0.51 % (10350)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.19/0.52 % (10342)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.19/0.52 % (10350)Instruction limit reached!
% 0.19/0.52 % (10350)------------------------------
% 0.19/0.52 % (10350)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.19/0.52 % (10350)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.19/0.52 % (10350)Termination reason: Unknown
% 0.19/0.52 % (10350)Termination phase: Preprocessing 3
% 0.19/0.52
% 0.19/0.52 % (10350)Memory used [KB]: 1535
% 0.19/0.52 % (10350)Time elapsed: 0.006 s
% 0.19/0.52 % (10350)Instructions burned: 3 (million)
% 0.19/0.52 % (10350)------------------------------
% 0.19/0.52 % (10350)------------------------------
% 1.23/0.53 % (10338)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)
% 1.23/0.53 % (10338)Instruction limit reached!
% 1.23/0.53 % (10338)------------------------------
% 1.23/0.53 % (10338)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.23/0.53 % (10338)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.23/0.53 % (10338)Termination reason: Unknown
% 1.23/0.53 % (10338)Termination phase: Preprocessing 3
% 1.23/0.53
% 1.23/0.53 % (10338)Memory used [KB]: 1535
% 1.23/0.53 % (10338)Time elapsed: 0.003 s
% 1.23/0.53 % (10338)Instructions burned: 3 (million)
% 1.23/0.53 % (10338)------------------------------
% 1.23/0.53 % (10338)------------------------------
% 1.23/0.53 % (10337)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)
% 1.23/0.53 % (10336)dis+1002_1:12_drc=off:fd=preordered:tgt=full:i=99978:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/99978Mi)
% 1.23/0.53 % (10339)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.23/0.53 % (10362)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)
% 1.23/0.54 % (10355)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)
% 1.23/0.54 % (10340)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.23/0.54 % (10361)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)
% 1.23/0.54 % (10349)lrs+10_1:32_br=off:nm=16:sd=2:ss=axioms:st=2.0:urr=on:i=51:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/51Mi)
% 1.23/0.54 % (10363)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.23/0.54 % (10342)First to succeed.
% 1.23/0.54 % (10348)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)
% 1.23/0.54 % (10355)Refutation not found, incomplete strategy% (10355)------------------------------
% 1.23/0.54 % (10355)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.23/0.54 % (10357)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)
% 1.23/0.54 % (10359)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)
% 1.23/0.54 % (10343)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)
% 1.23/0.54 % (10351)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)
% 1.45/0.55 % (10342)Refutation found. Thanks to Tanya!
% 1.45/0.55 % SZS status Theorem for theBenchmark
% 1.45/0.55 % SZS output start Proof for theBenchmark
% See solution above
% 1.45/0.55 % (10342)------------------------------
% 1.45/0.55 % (10342)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 1.45/0.55 % (10342)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 1.45/0.55 % (10342)Termination reason: Refutation
% 1.45/0.55
% 1.45/0.55 % (10342)Memory used [KB]: 6268
% 1.45/0.55 % (10342)Time elapsed: 0.078 s
% 1.45/0.55 % (10342)Instructions burned: 14 (million)
% 1.45/0.55 % (10342)------------------------------
% 1.45/0.55 % (10342)------------------------------
% 1.45/0.55 % (10332)Success in time 0.19 s
%------------------------------------------------------------------------------