TSTP Solution File: SWW679_1 by SnakeForV---1.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SnakeForV---1.0
% Problem : SWW679_1 : TPTP v8.1.0. Released v6.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 : n013.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 19:09:29 EDT 2022
% Result : Theorem 0.22s 0.52s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 58 ( 6 unt; 13 typ; 0 def)
% Number of atoms : 272 ( 69 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 345 ( 118 ~; 77 |; 97 &)
% ( 9 <=>; 44 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 85 ( 50 atm; 0 fun; 0 num; 35 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 12 ( 9 >; 3 *; 0 +; 0 <<)
% Number of predicates : 11 ( 5 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 80 ( 58 !; 22 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
'Tree': $tType ).
tff(func_def_0,type,
'empty:Tree': 'Tree' ).
tff(func_def_1,type,
'left:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_2,type,
'val:(Tree)>Int': 'Tree' > $int ).
tff(func_def_3,type,
'node:(Int*Tree*Tree)>Tree': ( $int * 'Tree' * 'Tree' ) > 'Tree' ).
tff(func_def_4,type,
'right:(Tree)>Tree': 'Tree' > 'Tree' ).
tff(func_def_5,type,
sK1: $int ).
tff(func_def_6,type,
sK2: 'Tree' ).
tff(func_def_7,type,
sK3: 'Tree' > $int ).
tff(func_def_8,type,
sK4: 'Tree' > $int ).
tff(pred_def_1,type,
searchtree: 'Tree' > $o ).
tff(pred_def_2,type,
in: ( $int * 'Tree' ) > $o ).
tff(pred_def_6,type,
sP0: 'Tree' > $o ).
tff(f119,plain,
$false,
inference(avatar_sat_refutation,[],[f94,f109,f117]) ).
tff(f117,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f116]) ).
tff(f116,plain,
( $false
| spl5_1 ),
inference(subsumption_resolution,[],[f115,f52]) ).
tff(f52,plain,
'empty:Tree' != sK2,
inference(cnf_transformation,[],[f33]) ).
tff(f33,plain,
( searchtree(sK2)
& ( ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(sK2) != X2 )
| ~ searchtree(X2) )
& $less(sK1,'val:(Tree)>Int'(sK2)) )
| ( ! [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(sK2) != X3 )
| ~ searchtree(X3) )
& ~ $less(sK1,'val:(Tree)>Int'(sK2)) ) )
& ( sK1 != 'val:(Tree)>Int'(sK2) )
& ( 'empty:Tree' != sK2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f26,f32]) ).
tff(f32,plain,
( ? [X0: $int,X1: 'Tree'] :
( searchtree(X1)
& ( ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X1) != X2 )
| ~ searchtree(X2) )
& $less(X0,'val:(Tree)>Int'(X1)) )
| ( ! [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(X1) != X3 )
| ~ searchtree(X3) )
& ~ $less(X0,'val:(Tree)>Int'(X1)) ) )
& ( 'val:(Tree)>Int'(X1) != X0 )
& ( 'empty:Tree' != X1 ) )
=> ( searchtree(sK2)
& ( ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(sK2) != X2 )
| ~ searchtree(X2) )
& $less(sK1,'val:(Tree)>Int'(sK2)) )
| ( ! [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(sK2) != X3 )
| ~ searchtree(X3) )
& ~ $less(sK1,'val:(Tree)>Int'(sK2)) ) )
& ( sK1 != 'val:(Tree)>Int'(sK2) )
& ( 'empty:Tree' != sK2 ) ) ),
introduced(choice_axiom,[]) ).
tff(f26,plain,
? [X0: $int,X1: 'Tree'] :
( searchtree(X1)
& ( ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X1) != X2 )
| ~ searchtree(X2) )
& $less(X0,'val:(Tree)>Int'(X1)) )
| ( ! [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(X1) != X3 )
| ~ searchtree(X3) )
& ~ $less(X0,'val:(Tree)>Int'(X1)) ) )
& ( 'val:(Tree)>Int'(X1) != X0 )
& ( 'empty:Tree' != X1 ) ),
inference(flattening,[],[f25]) ).
tff(f25,plain,
? [X0: $int,X1: 'Tree'] :
( ( ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X1) != X2 )
| ~ searchtree(X2) )
& $less(X0,'val:(Tree)>Int'(X1)) )
| ( ! [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(X1) != X3 )
| ~ searchtree(X3) )
& ~ $less(X0,'val:(Tree)>Int'(X1)) ) )
& ( 'val:(Tree)>Int'(X1) != X0 )
& ( 'empty:Tree' != X1 )
& searchtree(X1) ),
inference(ennf_transformation,[],[f19]) ).
tff(f19,plain,
~ ! [X0: $int,X1: 'Tree'] :
( searchtree(X1)
=> ( ( 'empty:Tree' != X1 )
=> ( ( 'val:(Tree)>Int'(X1) != X0 )
=> ( ( $less(X0,'val:(Tree)>Int'(X1))
=> ? [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X1) = X2 )
& searchtree(X2) ) )
& ( ~ $less(X0,'val:(Tree)>Int'(X1))
=> ? [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(X1) = X3 )
& searchtree(X3) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f18]) ).
tff(f18,plain,
~ ! [X0: $int,X1: 'Tree'] :
( searchtree(X1)
=> ( ( ( 'empty:Tree' = X1 )
=> $true )
& ( ( 'empty:Tree' != X1 )
=> ( ( ( 'val:(Tree)>Int'(X1) != X0 )
=> ( ( $less(X0,'val:(Tree)>Int'(X1))
=> ? [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X1) = X2 )
& searchtree(X2) ) )
& ( ~ $less(X0,'val:(Tree)>Int'(X1))
=> ? [X3: 'Tree'] :
( ( 'right:(Tree)>Tree'(X1) = X3 )
& searchtree(X3) ) ) ) )
& ( ( 'val:(Tree)>Int'(X1) = X0 )
=> $true ) ) ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X4: $int,X5: 'Tree'] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' = X5 )
=> $true )
& ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) )
& ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( ( 'right:(Tree)>Tree'(X5) = X7 )
& searchtree(X7) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X4: $int,X5: 'Tree'] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' = X5 )
=> $true )
& ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) )
& ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( ( 'right:(Tree)>Tree'(X5) = X7 )
& searchtree(X7) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_007) ).
tff(f115,plain,
( ( 'empty:Tree' = sK2 )
| spl5_1 ),
inference(subsumption_resolution,[],[f112,f97]) ).
tff(f97,plain,
sP0(sK2),
inference(resolution,[],[f72,f58]) ).
tff(f58,plain,
searchtree(sK2),
inference(cnf_transformation,[],[f33]) ).
tff(f72,plain,
! [X0: 'Tree'] :
( ~ searchtree(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f43]) ).
tff(f43,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ~ searchtree(X0) )
& ( searchtree(X0)
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f28]) ).
tff(f28,plain,
! [X0: 'Tree'] :
( sP0(X0)
<=> searchtree(X0) ),
inference(definition_folding,[],[f24,f27]) ).
tff(f27,plain,
! [X0: 'Tree'] :
( sP0(X0)
<=> ( ( 'empty:Tree' = X0 )
| ( searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) )
& ! [X1: $int] :
( ~ in(X1,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X1) )
& searchtree('left:(Tree)>Tree'(X0)) ) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f24,plain,
! [X0: 'Tree'] :
( ( ( 'empty:Tree' = X0 )
| ( searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) )
& ! [X1: $int] :
( ~ in(X1,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X1) )
& searchtree('left:(Tree)>Tree'(X0)) ) )
<=> searchtree(X0) ),
inference(ennf_transformation,[],[f16]) ).
tff(f16,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( 'empty:Tree' != X0 )
=> ( searchtree('left:(Tree)>Tree'(X0))
& ! [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0)) ) ) ),
inference(true_and_false_elimination,[],[f15]) ).
tff(f15,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( 'empty:Tree' = X0 )
=> $true )
& ( ( 'empty:Tree' != X0 )
=> ( searchtree('left:(Tree)>Tree'(X0))
& ! [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X1) )
& ! [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X2) )
& searchtree('right:(Tree)>Tree'(X0)) ) ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' = X5 )
=> $true )
& ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> ~ $less('val:(Tree)>Int'(X5),X4) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5))
& ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $less('val:(Tree)>Int'(X5),X4) ) ) ) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,axiom,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' = X5 )
=> $true )
& ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> $lesseq(X4,'val:(Tree)>Int'(X5)) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5))
& ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $greater(X4,'val:(Tree)>Int'(X5)) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',formula_006) ).
tff(f112,plain,
( ~ sP0(sK2)
| ( 'empty:Tree' = sK2 )
| spl5_1 ),
inference(resolution,[],[f65,f84]) ).
tff(f84,plain,
( ~ searchtree('right:(Tree)>Tree'(sK2))
| spl5_1 ),
inference(avatar_component_clause,[],[f82]) ).
tff(f82,plain,
( spl5_1
<=> searchtree('right:(Tree)>Tree'(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_1])]) ).
tff(f65,plain,
! [X0: 'Tree'] :
( searchtree('right:(Tree)>Tree'(X0))
| ~ sP0(X0)
| ( 'empty:Tree' = X0 ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f42,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ~ searchtree('right:(Tree)>Tree'(X0))
| ( in(sK3(X0),'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),sK3(X0)) )
| ( in(sK4(X0),'left:(Tree)>Tree'(X0))
& $less('val:(Tree)>Int'(X0),sK4(X0)) )
| ~ searchtree('left:(Tree)>Tree'(X0)) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( searchtree('right:(Tree)>Tree'(X0))
& ! [X3: $int] :
( ~ in(X3,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X3) )
& ! [X4: $int] :
( ~ in(X4,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X4) )
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP0(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f39,f41,f40]) ).
tff(f40,plain,
! [X0: 'Tree'] :
( ? [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X1) )
=> ( in(sK3(X0),'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),sK3(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f41,plain,
! [X0: 'Tree'] :
( ? [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
& $less('val:(Tree)>Int'(X0),X2) )
=> ( in(sK4(X0),'left:(Tree)>Tree'(X0))
& $less('val:(Tree)>Int'(X0),sK4(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f39,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ~ searchtree('right:(Tree)>Tree'(X0))
| ? [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X1) )
| ? [X2: $int] :
( in(X2,'left:(Tree)>Tree'(X0))
& $less('val:(Tree)>Int'(X0),X2) )
| ~ searchtree('left:(Tree)>Tree'(X0)) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( searchtree('right:(Tree)>Tree'(X0))
& ! [X3: $int] :
( ~ in(X3,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X3) )
& ! [X4: $int] :
( ~ in(X4,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X4) )
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f38]) ).
tff(f38,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ~ searchtree('right:(Tree)>Tree'(X0))
| ? [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X2) )
| ? [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
& $less('val:(Tree)>Int'(X0),X1) )
| ~ searchtree('left:(Tree)>Tree'(X0)) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) )
& ! [X1: $int] :
( ~ in(X1,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X1) )
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f37]) ).
tff(f37,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ~ searchtree('right:(Tree)>Tree'(X0))
| ? [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X2) )
| ? [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
& $less('val:(Tree)>Int'(X0),X1) )
| ~ searchtree('left:(Tree)>Tree'(X0)) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) )
& ! [X1: $int] :
( ~ in(X1,'left:(Tree)>Tree'(X0))
| ~ $less('val:(Tree)>Int'(X0),X1) )
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f27]) ).
tff(f109,plain,
spl5_3,
inference(avatar_contradiction_clause,[],[f108]) ).
tff(f108,plain,
( $false
| spl5_3 ),
inference(subsumption_resolution,[],[f107,f52]) ).
tff(f107,plain,
( ( 'empty:Tree' = sK2 )
| spl5_3 ),
inference(subsumption_resolution,[],[f103,f97]) ).
tff(f103,plain,
( ~ sP0(sK2)
| ( 'empty:Tree' = sK2 )
| spl5_3 ),
inference(resolution,[],[f62,f93]) ).
tff(f93,plain,
( ~ searchtree('left:(Tree)>Tree'(sK2))
| spl5_3 ),
inference(avatar_component_clause,[],[f91]) ).
tff(f91,plain,
( spl5_3
<=> searchtree('left:(Tree)>Tree'(sK2)) ),
introduced(avatar_definition,[new_symbols(naming,[spl5_3])]) ).
tff(f62,plain,
! [X0: 'Tree'] :
( searchtree('left:(Tree)>Tree'(X0))
| ~ sP0(X0)
| ( 'empty:Tree' = X0 ) ),
inference(cnf_transformation,[],[f42]) ).
tff(f94,plain,
( ~ spl5_3
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f77,f82,f91]) ).
tff(f77,plain,
( ~ searchtree('right:(Tree)>Tree'(sK2))
| ~ searchtree('left:(Tree)>Tree'(sK2)) ),
inference(equality_resolution,[],[f76]) ).
tff(f76,plain,
! [X3: 'Tree'] :
( ~ searchtree('left:(Tree)>Tree'(sK2))
| ( 'right:(Tree)>Tree'(sK2) != X3 )
| ~ searchtree(X3) ),
inference(equality_resolution,[],[f57]) ).
tff(f57,plain,
! [X2: 'Tree',X3: 'Tree'] :
( ( 'left:(Tree)>Tree'(sK2) != X2 )
| ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK2) != X3 )
| ~ searchtree(X3) ),
inference(cnf_transformation,[],[f33]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW679=1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_uns --cores 0 -t %d %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 30 20:56:32 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.22/0.50 % (5089)lrs+10_1:1_ep=R:gve=force:plsq=on:plsqr=32,1:uwa=one_side_interpreted:i=2:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.22/0.51 % (5089)Instruction limit reached!
% 0.22/0.51 % (5089)------------------------------
% 0.22/0.51 % (5089)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.51 % (5089)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.51 % (5089)Termination reason: Unknown
% 0.22/0.51 % (5089)Termination phase: Property scanning
% 0.22/0.51
% 0.22/0.51 % (5089)Memory used [KB]: 1023
% 0.22/0.51 % (5089)Time elapsed: 0.003 s
% 0.22/0.51 % (5089)Instructions burned: 3 (million)
% 0.22/0.51 % (5089)------------------------------
% 0.22/0.51 % (5089)------------------------------
% 0.22/0.51 % (5098)dis+10_1:64_nwc=1.4:rp=on:tha=off:i=21:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/21Mi)
% 0.22/0.51 % (5088)dis+32_1:1_bd=off:nm=4:sos=on:ss=included:i=4:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.22/0.51 % (5088)Instruction limit reached!
% 0.22/0.51 % (5088)------------------------------
% 0.22/0.51 % (5088)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.51 % (5088)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.51 % (5088)Termination reason: Unknown
% 0.22/0.51 % (5088)Termination phase: Saturation
% 0.22/0.51
% 0.22/0.51 % (5088)Memory used [KB]: 1023
% 0.22/0.51 % (5088)Time elapsed: 0.003 s
% 0.22/0.51 % (5088)Instructions burned: 4 (million)
% 0.22/0.51 % (5088)------------------------------
% 0.22/0.51 % (5088)------------------------------
% 0.22/0.51 % (5098)First to succeed.
% 0.22/0.52 % (5106)dis+20_1:12_aac=none:acc=model:awrs=converge:fd=preordered:fsr=off:nicw=on:nwc=3.0:s2a=on:s2agt=16:spb=goal:to=lpo:i=41:si=on:rawr=on:rtra=on_0 on theBenchmark for (2999ds/41Mi)
% 0.22/0.52 % (5098)Refutation found. Thanks to Tanya!
% 0.22/0.52 % SZS status Theorem for theBenchmark
% 0.22/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.52 % (5098)------------------------------
% 0.22/0.52 % (5098)Version: Vampire 4.7 (commit 807e37dd9 on 2022-08-23 09:55:27 +0200)
% 0.22/0.52 % (5098)Linked with Z3 4.8.13.0 f03d756e086f81f2596157241e0decfb1c982299 z3-4.8.4-5390-gf03d756e0
% 0.22/0.52 % (5098)Termination reason: Refutation
% 0.22/0.52
% 0.22/0.52 % (5098)Memory used [KB]: 5500
% 0.22/0.52 % (5098)Time elapsed: 0.097 s
% 0.22/0.52 % (5098)Instructions burned: 4 (million)
% 0.22/0.52 % (5098)------------------------------
% 0.22/0.52 % (5098)------------------------------
% 0.22/0.52 % (5076)Success in time 0.153 s
%------------------------------------------------------------------------------