TSTP Solution File: SWW679_1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SWW679_1 : TPTP v8.1.2. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.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 : Sun May 5 11:41:51 EDT 2024
% Result : Theorem 0.15s 0.39s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 23
% Syntax : Number of formulae : 57 ( 7 unt; 16 typ; 0 def)
% Number of atoms : 252 ( 62 equ)
% Maximal formula atoms : 14 ( 6 avg)
% Number of connectives : 326 ( 115 ~; 66 |; 94 &)
% ( 8 <=>; 43 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 74 ( 41 atm; 0 fun; 0 num; 33 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 17 ( 12 >; 5 *; 0 +; 0 <<)
% Number of predicates : 12 ( 6 usr; 2 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 85 ( 65 !; 20 ?; 85 :)
% 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_9,type,
sK4: 'Tree' ).
tff(func_def_10,type,
sK5: $int ).
tff(func_def_11,type,
sK6: 'Tree' > $int ).
tff(func_def_12,type,
sK7: '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' * $int ) > $o ).
tff(pred_def_7,type,
sP1: 'Tree' > $o ).
tff(pred_def_8,type,
sP2: 'Tree' > $o ).
tff(pred_def_9,type,
sP3: ( 'Tree' * $int ) > $o ).
tff(f136,plain,
$false,
inference(unit_resulting_resolution,[],[f122,f129,f98]) ).
tff(f98,plain,
! [X0: 'Tree',X1: $int] :
( ~ sP0(X0,X1)
| ~ searchtree('left:(Tree)>Tree'(X0)) ),
inference(equality_resolution,[],[f67]) ).
tff(f67,plain,
! [X2: 'Tree',X0: 'Tree',X1: $int] :
( ~ searchtree(X2)
| ( 'left:(Tree)>Tree'(X0) != X2 )
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
tff(f47,plain,
! [X0: 'Tree',X1: $int] :
( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'left:(Tree)>Tree'(X0) != X2 ) )
& $less(X1,'val:(Tree)>Int'(X0)) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f46]) ).
tff(f46,plain,
! [X0: 'Tree',X1: $int] :
( ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) )
| ~ sP0(X0,X1) ),
inference(nnf_transformation,[],[f39]) ).
tff(f39,plain,
! [X0: 'Tree',X1: $int] :
( ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) )
| ~ sP0(X0,X1) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
tff(f129,plain,
sP0(sK4,sK5),
inference(unit_resulting_resolution,[],[f121,f99]) ).
tff(f99,plain,
( ~ searchtree('right:(Tree)>Tree'(sK4))
| sP0(sK4,sK5) ),
inference(equality_resolution,[],[f72]) ).
tff(f72,plain,
! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK4) != X2 )
| sP0(sK4,sK5) ),
inference(cnf_transformation,[],[f49]) ).
tff(f49,plain,
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK4) != X2 ) )
& ~ $less(sK5,'val:(Tree)>Int'(sK4)) )
| sP0(sK4,sK5) )
& ( sK5 != 'val:(Tree)>Int'(sK4) )
& ( 'empty:Tree' != sK4 )
& searchtree(sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f40,f48]) ).
tff(f48,plain,
( ? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| sP0(X0,X1) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) )
=> ( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK4) != X2 ) )
& ~ $less(sK5,'val:(Tree)>Int'(sK4)) )
| sP0(sK4,sK5) )
& ( sK5 != 'val:(Tree)>Int'(sK4) )
& ( 'empty:Tree' != sK4 )
& searchtree(sK4) ) ),
introduced(choice_axiom,[]) ).
tff(f40,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| sP0(X0,X1) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(definition_folding,[],[f35,f39]) ).
tff(f35,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(flattening,[],[f34]) ).
tff(f34,plain,
? [X0: 'Tree',X1: $int] :
( ( ( ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X0) != X2 ) )
& ~ $less(X1,'val:(Tree)>Int'(X0)) )
| ( ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'left:(Tree)>Tree'(X0) != X3 ) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( 'val:(Tree)>Int'(X0) != X1 )
& ( 'empty:Tree' != X0 )
& searchtree(X0) ),
inference(ennf_transformation,[],[f24]) ).
tff(f24,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( 'empty:Tree' != X0 )
=> ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f23]) ).
tff(f23,plain,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( 'empty:Tree' != X0 )
=> ( ( ( 'val:(Tree)>Int'(X0) != X1 )
=> ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( 'right:(Tree)>Tree'(X0) = X2 ) ) )
& ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( 'left:(Tree)>Tree'(X0) = X3 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X0) = X1 )
=> $true ) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f9]) ).
tff(f9,negated_conjecture,
~ ! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(negated_conjecture,[],[f8]) ).
tff(f8,conjecture,
! [X5: 'Tree',X4: $int] :
( searchtree(X5)
=> ( ( ( 'empty:Tree' != X5 )
=> ( ( ( 'val:(Tree)>Int'(X5) != X4 )
=> ( ( ~ $less(X4,'val:(Tree)>Int'(X5))
=> ? [X7: 'Tree'] :
( searchtree(X7)
& ( 'right:(Tree)>Tree'(X5) = X7 ) ) )
& ( $less(X4,'val:(Tree)>Int'(X5))
=> ? [X6: 'Tree'] :
( searchtree(X6)
& ( 'left:(Tree)>Tree'(X5) = X6 ) ) ) ) )
& ( ( 'val:(Tree)>Int'(X5) = X4 )
=> $true ) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_007) ).
tff(f121,plain,
searchtree('right:(Tree)>Tree'(sK4)),
inference(unit_resulting_resolution,[],[f118,f75]) ).
tff(f75,plain,
! [X0: 'Tree'] :
( ~ sP2(X0)
| searchtree('right:(Tree)>Tree'(X0)) ),
inference(cnf_transformation,[],[f54]) ).
tff(f54,plain,
! [X0: 'Tree'] :
( ( sP2(X0)
| ( ~ $less('val:(Tree)>Int'(X0),sK6(X0))
& in(sK6(X0),'right:(Tree)>Tree'(X0)) )
| ~ sP1(X0)
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( ( ! [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'right:(Tree)>Tree'(X0)) )
& sP1(X0)
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP2(X0) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6])],[f52,f53]) ).
tff(f53,plain,
! [X0: 'Tree'] :
( ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
=> ( ~ $less('val:(Tree)>Int'(X0),sK6(X0))
& in(sK6(X0),'right:(Tree)>Tree'(X0)) ) ),
introduced(choice_axiom,[]) ).
tff(f52,plain,
! [X0: 'Tree'] :
( ( sP2(X0)
| ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ~ sP1(X0)
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( ( ! [X2: $int] :
( $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'right:(Tree)>Tree'(X0)) )
& sP1(X0)
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP2(X0) ) ),
inference(rectify,[],[f51]) ).
tff(f51,plain,
! [X0: 'Tree'] :
( ( sP2(X0)
| ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ~ sP1(X0)
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& sP1(X0)
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP2(X0) ) ),
inference(flattening,[],[f50]) ).
tff(f50,plain,
! [X0: 'Tree'] :
( ( sP2(X0)
| ? [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
& in(X1,'right:(Tree)>Tree'(X0)) )
| ~ sP1(X0)
| ~ searchtree('right:(Tree)>Tree'(X0))
| ~ searchtree('left:(Tree)>Tree'(X0)) )
& ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& sP1(X0)
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ~ sP2(X0) ) ),
inference(nnf_transformation,[],[f42]) ).
tff(f42,plain,
! [X0: 'Tree'] :
( sP2(X0)
<=> ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& sP1(X0)
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
tff(f118,plain,
sP2(sK4),
inference(unit_resulting_resolution,[],[f68,f69,f83]) ).
tff(f83,plain,
! [X0: 'Tree'] :
( ~ searchtree(X0)
| ( 'empty:Tree' = X0 )
| sP2(X0) ),
inference(cnf_transformation,[],[f60]) ).
tff(f60,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ( ~ sP2(X0)
& ( 'empty:Tree' != X0 ) ) )
& ( sP2(X0)
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ) ),
inference(flattening,[],[f59]) ).
tff(f59,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ( ~ sP2(X0)
& ( 'empty:Tree' != X0 ) ) )
& ( sP2(X0)
| ( 'empty:Tree' = X0 )
| ~ searchtree(X0) ) ),
inference(nnf_transformation,[],[f43]) ).
tff(f43,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( sP2(X0)
| ( 'empty:Tree' = X0 ) ) ),
inference(definition_folding,[],[f36,f42,f41]) ).
tff(f41,plain,
! [X0: 'Tree'] :
( sP1(X0)
<=> ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
tff(f36,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ! [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'right:(Tree)>Tree'(X0)) )
& ! [X2: $int] :
( ~ $less('val:(Tree)>Int'(X0),X2)
| ~ in(X2,'left:(Tree)>Tree'(X0)) )
& searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) )
| ( 'empty:Tree' = X0 ) ) ),
inference(ennf_transformation,[],[f26]) ).
tff(f26,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( 'empty: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('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) ) ),
inference(true_and_false_elimination,[],[f25]) ).
tff(f25,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( ( 'empty: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('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0)) ) )
& ( ( 'empty:Tree' = X0 )
=> $true ) ) ),
inference(rectify,[],[f10]) ).
tff(f10,plain,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $less('val:(Tree)>Int'(X5),X4) )
& ! [X4: $int] :
( in(X4,'left:(Tree)>Tree'(X5))
=> ~ $less('val:(Tree)>Int'(X5),X4) )
& searchtree('right:(Tree)>Tree'(X5))
& searchtree('left:(Tree)>Tree'(X5)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
inference(theory_normalization,[],[f7]) ).
tff(f7,axiom,
! [X5: 'Tree'] :
( searchtree(X5)
<=> ( ( ( 'empty:Tree' != X5 )
=> ( ! [X4: $int] :
( in(X4,'right:(Tree)>Tree'(X5))
=> $greater(X4,'val:(Tree)>Int'(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)) ) )
& ( ( 'empty:Tree' = X5 )
=> $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_006) ).
tff(f69,plain,
'empty:Tree' != sK4,
inference(cnf_transformation,[],[f49]) ).
tff(f68,plain,
searchtree(sK4),
inference(cnf_transformation,[],[f49]) ).
tff(f122,plain,
searchtree('left:(Tree)>Tree'(sK4)),
inference(unit_resulting_resolution,[],[f118,f74]) ).
tff(f74,plain,
! [X0: 'Tree'] :
( ~ sP2(X0)
| searchtree('left:(Tree)>Tree'(X0)) ),
inference(cnf_transformation,[],[f54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWW679_1 : TPTP v8.1.2. Released v6.4.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36 % Computer : n023.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 19:33:23 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.15/0.37 % (30938)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38 % (30941)WARNING: value z3 for option sas not known
% 0.15/0.39 % (30939)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39 % (30942)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.39 % (30940)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.39 % (30941)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.39 % (30943)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.39 % (30944)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.39 % (30945)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.39 % (30939)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39 % (30940)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39 % (30942)WARNING: trying to run FMB on interpreted or otherwise provably infinite-domain problem!
% 0.15/0.39 % (30939)Terminated due to inappropriate strategy.
% 0.15/0.39 % (30939)------------------------------
% 0.15/0.39 % (30939)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (30942)Terminated due to inappropriate strategy.
% 0.15/0.39 % (30942)------------------------------
% 0.15/0.39 % (30942)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (30940)Terminated due to inappropriate strategy.
% 0.15/0.39 % (30940)------------------------------
% 0.15/0.39 % (30940)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (30939)Termination reason: Inappropriate
% 0.15/0.39 % (30942)Termination reason: Inappropriate
% 0.15/0.39
% 0.15/0.39 % (30940)Termination reason: Inappropriate
% 0.15/0.39
% 0.15/0.39
% 0.15/0.39 % (30939)Memory used [KB]: 801
% 0.15/0.39 % (30942)Memory used [KB]: 801
% 0.15/0.39 % (30940)Memory used [KB]: 801
% 0.15/0.39 % (30939)Time elapsed: 0.003 s
% 0.15/0.39 % (30942)Time elapsed: 0.003 s
% 0.15/0.39 % (30940)Time elapsed: 0.003 s
% 0.15/0.39 % (30939)Instructions burned: 4 (million)
% 0.15/0.39 % (30942)Instructions burned: 4 (million)
% 0.15/0.39 % (30940)Instructions burned: 4 (million)
% 0.15/0.39 % (30940)------------------------------
% 0.15/0.39 % (30940)------------------------------
% 0.15/0.39 % (30942)------------------------------
% 0.15/0.39 % (30942)------------------------------
% 0.15/0.39 % (30939)------------------------------
% 0.15/0.39 % (30939)------------------------------
% 0.15/0.39 % (30945)First to succeed.
% 0.15/0.39 % (30944)Also succeeded, but the first one will report.
% 0.15/0.39 % (30941)Also succeeded, but the first one will report.
% 0.15/0.39 % (30945)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-30938"
% 0.15/0.39 % (30943)Also succeeded, but the first one will report.
% 0.15/0.39 % (30945)Refutation found. Thanks to Tanya!
% 0.15/0.39 % SZS status Theorem for theBenchmark
% 0.15/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.39 % (30945)------------------------------
% 0.15/0.39 % (30945)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.39 % (30945)Termination reason: Refutation
% 0.15/0.39
% 0.15/0.39 % (30945)Memory used [KB]: 842
% 0.15/0.39 % (30945)Time elapsed: 0.007 s
% 0.15/0.39 % (30945)Instructions burned: 8 (million)
% 0.15/0.39 % (30938)Success in time 0.021 s
%------------------------------------------------------------------------------