%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW679_1 : TPTP v9.3.1. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:31:07 PM UTC 2026
% Result : Theorem 1.04s 0.93s
% Output : Refutation 2.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 11 unt; 0 typ; 4 def)
% Number of atoms : 252 ( 57 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 307 ( 106 ~; 74 |; 83 &)
% ( 10 <=>; 34 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 79 ( 47 atm; 0 fun; 0 num; 32 var)
% Number of types : 3 ( 1 usr; 1 ari; 0 dat; 0 cdt)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 6 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 69 ( 0 sgn 51 !; 18 ?; 69 :)
% 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,
sK1: 'Tree' > $int ).
tff(func_def_10,type,
sK2: 'Tree' > $int ).
tff(func_def_11,type,
sK3: $int ).
tff(func_def_12,type,
sK4: 'Tree' ).
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(f7,axiom,
! [X0: 'Tree'] :
( ( ( ( X0 = 'empty:Tree' )
=> $true )
& ( ( X0 != 'empty:Tree' )
=> ( searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0))
& ! [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
=> $lesseq(X1,'val:(Tree)>Int'(X0)) )
& ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $greater(X1,'val:(Tree)>Int'(X0)) ) ) ) )
<=> searchtree(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_006) ).
tff(f8,conjecture,
! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( X0 != 'empty:Tree' )
=> ( ( ( X1 != 'val:(Tree)>Int'(X0) )
=> ( ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( X2 = 'left:(Tree)>Tree'(X0) ) ) )
& ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( X3 = 'right:(Tree)>Tree'(X0) ) ) ) ) )
& ( ( X1 = 'val:(Tree)>Int'(X0) )
=> $true ) ) )
& ( ( X0 = 'empty:Tree' )
=> $true ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula_007) ).
tff(f9,negated_conjecture,
~ ! [X0: 'Tree',X1: $int] :
( searchtree(X0)
=> ( ( ( X0 != 'empty:Tree' )
=> ( ( ( X1 != 'val:(Tree)>Int'(X0) )
=> ( ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( X2 = 'left:(Tree)>Tree'(X0) ) ) )
& ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( X3 = 'right:(Tree)>Tree'(X0) ) ) ) ) )
& ( ( X1 = 'val:(Tree)>Int'(X0) )
=> $true ) ) )
& ( ( X0 = 'empty:Tree' )
=> $true ) ) ),
inference(negated_conjecture,[status(cth)],[f8]) ).
tff(f10,plain,
! [X0: 'Tree'] :
( ( ( ( X0 = 'empty:Tree' )
=> $true )
& ( ( X0 != 'empty:Tree' )
=> ( searchtree('right:(Tree)>Tree'(X0))
& searchtree('left:(Tree)>Tree'(X0))
& ! [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X1) )
& ! [X1: $int] :
( in(X1,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X1) ) ) ) )
<=> searchtree(X0) ),
inference(theory_normalization,[],[f7]) ).
tff(f23,plain,
~ ! [X1: $int,X0: 'Tree'] :
( searchtree(X0)
=> ( ( X0 != 'empty:Tree' )
=> ( ( X1 != 'val:(Tree)>Int'(X0) )
=> ( ( $less(X1,'val:(Tree)>Int'(X0))
=> ? [X2: 'Tree'] :
( searchtree(X2)
& ( X2 = 'left:(Tree)>Tree'(X0) ) ) )
& ( ~ $less(X1,'val:(Tree)>Int'(X0))
=> ? [X3: 'Tree'] :
( searchtree(X3)
& ( X3 = 'right:(Tree)>Tree'(X0) ) ) ) ) ) ) ),
inference(true_and_false_elimination,[],[f9]) ).
tff(f24,plain,
! [X0: 'Tree'] :
( ( ( ( X0 = 'empty:Tree' )
=> $true )
& ( ( X0 != 'empty:Tree' )
=> ( ! [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X2) )
& searchtree('left:(Tree)>Tree'(X0))
& ! [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X1) )
& searchtree('right:(Tree)>Tree'(X0)) ) ) )
<=> searchtree(X0) ),
inference(rectify,[],[f10]) ).
tff(f25,plain,
! [X0: 'Tree'] :
( ( ( X0 != 'empty:Tree' )
=> ( ! [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
=> $less('val:(Tree)>Int'(X0),X2) )
& searchtree('left:(Tree)>Tree'(X0))
& ! [X1: $int] :
( in(X1,'left:(Tree)>Tree'(X0))
=> ~ $less('val:(Tree)>Int'(X0),X1) )
& searchtree('right:(Tree)>Tree'(X0)) ) )
<=> searchtree(X0) ),
inference(true_and_false_elimination,[],[f24]) ).
tff(f33,plain,
? [X1: $int,X0: 'Tree'] :
( ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
& ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'right:(Tree)>Tree'(X0) != X3 ) ) )
| ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X0) != X2 )
| ~ searchtree(X2) )
& $less(X1,'val:(Tree)>Int'(X0)) ) )
& ( X1 != 'val:(Tree)>Int'(X0) )
& ( X0 != 'empty:Tree' )
& searchtree(X0) ),
inference(ennf_transformation,[],[f23]) ).
tff(f34,plain,
? [X1: $int,X0: 'Tree'] :
( searchtree(X0)
& ( X0 != 'empty:Tree' )
& ( X1 != 'val:(Tree)>Int'(X0) )
& ( ( ~ $less(X1,'val:(Tree)>Int'(X0))
& ! [X3: 'Tree'] :
( ~ searchtree(X3)
| ( 'right:(Tree)>Tree'(X0) != X3 ) ) )
| ( ! [X2: 'Tree'] :
( ( 'left:(Tree)>Tree'(X0) != X2 )
| ~ searchtree(X2) )
& $less(X1,'val:(Tree)>Int'(X0)) ) ) ),
inference(flattening,[],[f33]) ).
tff(f35,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> ( ( 'empty:Tree' = X0 )
| ( ! [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'left:(Tree)>Tree'(X0)) )
& searchtree('left:(Tree)>Tree'(X0))
& searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) ) ) ) ),
inference(ennf_transformation,[],[f25]) ).
tff(f38,definition,
! [X0: 'Tree'] :
( sP0(X0)
<=> ( ( 'empty:Tree' = X0 )
| ( ! [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'left:(Tree)>Tree'(X0)) )
& searchtree('left:(Tree)>Tree'(X0))
& searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) ) ) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
tff(f39,plain,
! [X0: 'Tree'] :
( searchtree(X0)
<=> sP0(X0) ),
inference(definition_folding,[],[f35,f38]) ).
tff(f43,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ? [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
& in(X1,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('left:(Tree)>Tree'(X0))
| ~ searchtree('right:(Tree)>Tree'(X0))
| ? [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X2) ) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( ! [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'left:(Tree)>Tree'(X0)) )
& searchtree('left:(Tree)>Tree'(X0))
& searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) ) )
| ~ sP0(X0) ) ),
inference(nnf_transformation,[],[f38]) ).
tff(f44,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ? [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
& in(X1,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('left:(Tree)>Tree'(X0))
| ~ searchtree('right:(Tree)>Tree'(X0))
| ? [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X2) ) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( ! [X1: $int] :
( ~ $less('val:(Tree)>Int'(X0),X1)
| ~ in(X1,'left:(Tree)>Tree'(X0)) )
& searchtree('left:(Tree)>Tree'(X0))
& searchtree('right:(Tree)>Tree'(X0))
& ! [X2: $int] :
( ~ in(X2,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X2) ) )
| ~ sP0(X0) ) ),
inference(flattening,[],[f43]) ).
tff(f45,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ? [X1: $int] :
( $less('val:(Tree)>Int'(X0),X1)
& in(X1,'left:(Tree)>Tree'(X0)) )
| ~ searchtree('left:(Tree)>Tree'(X0))
| ~ searchtree('right:(Tree)>Tree'(X0))
| ? [X2: $int] :
( in(X2,'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),X2) ) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( ! [X3: $int] :
( ~ $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'left:(Tree)>Tree'(X0)) )
& searchtree('left:(Tree)>Tree'(X0))
& searchtree('right:(Tree)>Tree'(X0))
& ! [X4: $int] :
( ~ in(X4,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X4) ) )
| ~ sP0(X0) ) ),
inference(rectify,[],[f44]) ).
tff(f46,plain,
! [X0: 'Tree'] :
( ( sP0(X0)
| ( ( 'empty:Tree' != X0 )
& ( ( $less('val:(Tree)>Int'(X0),sK1(X0))
& in(sK1(X0),'left:(Tree)>Tree'(X0)) )
| ~ searchtree('left:(Tree)>Tree'(X0))
| ~ searchtree('right:(Tree)>Tree'(X0))
| ( in(sK2(X0),'right:(Tree)>Tree'(X0))
& ~ $less('val:(Tree)>Int'(X0),sK2(X0)) ) ) ) )
& ( ( 'empty:Tree' = X0 )
| ( ! [X3: $int] :
( ~ $less('val:(Tree)>Int'(X0),X3)
| ~ in(X3,'left:(Tree)>Tree'(X0)) )
& searchtree('left:(Tree)>Tree'(X0))
& searchtree('right:(Tree)>Tree'(X0))
& ! [X4: $int] :
( ~ in(X4,'right:(Tree)>Tree'(X0))
| $less('val:(Tree)>Int'(X0),X4) ) )
| ~ sP0(X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X1,sK1(X0)),skolemize(X2,sK2(X0))],[f45]) ).
tff(f47,plain,
! [X0: 'Tree'] :
( ( searchtree(X0)
| ~ sP0(X0) )
& ( sP0(X0)
| ~ searchtree(X0) ) ),
inference(nnf_transformation,[],[f39]) ).
tff(f50,plain,
? [X0: $int,X1: 'Tree'] :
( searchtree(X1)
& ( 'empty:Tree' != X1 )
& ( 'val:(Tree)>Int'(X1) != X0 )
& ( ( ~ $less(X0,'val:(Tree)>Int'(X1))
& ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(X1) != X2 ) ) )
| ( ! [X3: 'Tree'] :
( ( 'left:(Tree)>Tree'(X1) != X3 )
| ~ searchtree(X3) )
& $less(X0,'val:(Tree)>Int'(X1)) ) ) ),
inference(rectify,[],[f34]) ).
tff(f51,plain,
( searchtree(sK4)
& ( 'empty:Tree' != sK4 )
& ( 'val:(Tree)>Int'(sK4) != sK3 )
& ( ( ~ $less(sK3,'val:(Tree)>Int'(sK4))
& ! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK4) != X2 ) ) )
| ( ! [X3: 'Tree'] :
( ( 'left:(Tree)>Tree'(sK4) != X3 )
| ~ searchtree(X3) )
& $less(sK3,'val:(Tree)>Int'(sK4)) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4]),skolemize(X0,sK3),skolemize(X1,sK4)],[f50]) ).
tff(f61,plain,
! [X0: 'Tree'] :
( ~ sP0(X0)
| searchtree('right:(Tree)>Tree'(X0))
| ( 'empty:Tree' = X0 ) ),
inference(cnf_transformation,[],[f46]) ).
tff(f62,plain,
! [X0: 'Tree'] :
( ~ sP0(X0)
| ( 'empty:Tree' = X0 )
| searchtree('left:(Tree)>Tree'(X0)) ),
inference(cnf_transformation,[],[f46]) ).
tff(f69,plain,
! [X0: 'Tree'] :
( ~ searchtree(X0)
| sP0(X0) ),
inference(cnf_transformation,[],[f47]) ).
tff(f74,plain,
! [X2: 'Tree'] :
( ~ searchtree(X2)
| ( 'right:(Tree)>Tree'(sK4) != X2 )
| $less(sK3,'val:(Tree)>Int'(sK4)) ),
inference(cnf_transformation,[],[f51]) ).
tff(f77,plain,
! [X3: 'Tree'] :
( ~ $less(sK3,'val:(Tree)>Int'(sK4))
| ( 'left:(Tree)>Tree'(sK4) != X3 )
| ~ searchtree(X3) ),
inference(cnf_transformation,[],[f51]) ).
tff(f79,plain,
'empty:Tree' != sK4,
inference(cnf_transformation,[],[f51]) ).
tff(f80,plain,
searchtree(sK4),
inference(cnf_transformation,[],[f51]) ).
tff(f85,plain,
( ~ searchtree('left:(Tree)>Tree'(sK4))
| ~ $less(sK3,'val:(Tree)>Int'(sK4)) ),
inference(equality_resolution,[],[f77]) ).
tff(f88,plain,
( ~ searchtree('right:(Tree)>Tree'(sK4))
| $less(sK3,'val:(Tree)>Int'(sK4)) ),
inference(equality_resolution,[],[f74]) ).
tff(f90,definition,
( spl5_1
<=> searchtree('right:(Tree)>Tree'(sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_1])],[avatar_definition]) ).
tff(f92,plain,
( ~ searchtree('right:(Tree)>Tree'(sK4))
| spl5_1 ),
inference(avatar_component_clause,[],[f90]) ).
tff(f94,definition,
( spl5_2
<=> searchtree('left:(Tree)>Tree'(sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_2])],[avatar_definition]) ).
tff(f96,plain,
( ~ searchtree('left:(Tree)>Tree'(sK4))
| spl5_2 ),
inference(avatar_component_clause,[],[f94]) ).
tff(f99,definition,
( spl5_3
<=> $less(sK3,'val:(Tree)>Int'(sK4)) ),
introduced(definition,[new_symbols(definition,[spl5_3])],[avatar_definition]) ).
tff(f102,plain,
( ~ spl5_2
| ~ spl5_3 ),
inference(avatar_split_clause,[],[f85,f99,f94]) ).
tff(f103,plain,
( spl5_3
| ~ spl5_1 ),
inference(avatar_split_clause,[],[f88,f90,f99]) ).
tff(f106,plain,
sP0(sK4),
inference(resolution,[],[f69,f80]) ).
tff(f107,plain,
( searchtree('left:(Tree)>Tree'(sK4))
| ( 'empty:Tree' = sK4 ) ),
inference(resolution,[],[f106,f62]) ).
tff(f108,plain,
( ( 'empty:Tree' = sK4 )
| searchtree('right:(Tree)>Tree'(sK4)) ),
inference(resolution,[],[f106,f61]) ).
tff(f109,plain,
searchtree('right:(Tree)>Tree'(sK4)),
inference(forward_subsumption_resolution,[],[f108,f79]) ).
tff(f110,plain,
( ( 'empty:Tree' = sK4 )
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f107,f96]) ).
tff(f111,plain,
( $false
| spl5_1 ),
inference(forward_subsumption_resolution,[],[f109,f92]) ).
tff(f112,plain,
spl5_1,
inference(avatar_contradiction_clause,[],[f111]) ).
tff(f113,plain,
( $false
| spl5_2 ),
inference(forward_subsumption_resolution,[],[f110,f79]) ).
tff(f114,plain,
spl5_2,
inference(avatar_contradiction_clause,[],[f113]) ).
cnf(s2,plain,
( ~ spl5_2
| ~ spl5_3 ),
inference(sat_conversion,[],[f102]) ).
cnf(s3,plain,
( ~ spl5_1
| spl5_3 ),
inference(sat_conversion,[],[f103]) ).
cnf(s4,plain,
spl5_1,
inference(sat_conversion,[],[f112]) ).
cnf(s5,plain,
spl5_2,
inference(sat_conversion,[],[f114]) ).
cnf(s6,plain,
spl5_3,
inference(rat,[],[s3,s4]) ).
cnf(s7,plain,
$false,
inference(rat,[],[s2,s6,s5]) ).
tff(f115,plain,
$false,
inference(avatar_sat_refutation,[],[s7]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW679_1 : TPTP v9.3.1. Released v6.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.17 % Computer : n015.cluster.edu
% 0.06/0.17 % Model : x86_64 x86_64
% 0.06/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.17 % Memory : 8046.5625MB
% 0.06/0.17 % OS : Linux 6.8.0-71-generic
% 0.06/0.17 % CPULimit : 300
% 0.06/0.17 % WCLimit : 300
% 0.06/0.17 % DateTime : Mon Sep 28 14:28:17 UTC 2026
% 0.06/0.18 % CPUTime :
% 0.06/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.06/0.20 Running first-order theorem proving
% 0.06/0.20 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.04/0.93 % (2667747)Detected arithmetic, will pick strategies from an ALASCA-aware ARI schedule.
% 1.04/0.93 % (2667844)dis+10_3_slsqr=1,4:to=lpo:sil=128000:thi=strong:si=on:uwa=off:s2agt=20:slsqc=1:slsq=on:random_seed=1232655051:i=201:slsql=off:asg=cautious:rtra=on:gtg=all:ss=axioms:sgt=16_2999 on theBenchmark for (2999ds/201Mi)
% 1.04/0.93 % (2667844)First to succeed.
% 1.04/0.93 % (2667844)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2667747"
% 1.04/0.93 % (2667849)lrs+10_1_tgt=ground:sas=z3:si=on:random_seed=157984080:i=33:rtra=on_2999 on theBenchmark for (2999ds/33Mi)
% 1.04/0.93 % (2667847)dis+21_64_to=kbo:sil=128000:si=on:sp=weighted_frequency:uwa=alasca_can_abstract:random_seed=974177114:i=4:rtra=on_2999 on theBenchmark for (2999ds/4Mi)
% 1.04/0.93 % (2667843)dis+1002_1_to=kbo:sil=128000:tgt=ground:sas=z3:si=on:spb=units:tha=off:random_seed=1599609378:i=307:kws=precedence:nm=0:rtra=on_2999 on theBenchmark for (2999ds/307Mi)
% 1.04/0.93 % (2667845)lrs+1002_4:1_to=lpo:sil=64000:si=on:br=off:random_seed=641836623:s2a=on:i=7:rtra=on:inst=on_2999 on theBenchmark for (2999ds/7Mi)
% 1.04/0.93 % (2667841)dis+1002_16:1_to=lpo:sil=64000:sas=z3:si=on:norm_ineq=on:gve=force:uwa=one_side_constant:random_seed=1742883184:i=12:doe=on:rtra=on:gtg=exists_top:ss=axioms_2999 on theBenchmark for (2999ds/12Mi)
% 1.04/0.93 % (2667847)Instruction limit reached!
% 1.04/0.93 % (2667847)------------------------------
% 1.04/0.93 % (2667847)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/0.93 % (2667847)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.93 % (2667847)CaDiCaL version: 2.1.3
% 1.04/0.93 % (2667847)Termination reason: Instruction limit
% 1.04/0.93 % (2667847)Termination phase: Saturation
% 1.04/0.93 % (2667847)Time elapsed: 0.004 s
% 1.04/0.93 % (2667847)Peak memory usage: 89 MB
% 1.04/0.93 % (2667847)Instructions burned: 5 (million)
% 1.04/0.93 % (2667845)Instruction limit reached!
% 1.04/0.93 % (2667845)------------------------------
% 1.04/0.93 % (2667845)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/0.93 % (2667845)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.93 % (2667845)CaDiCaL version: 2.1.3
% 1.04/0.93 % (2667845)Termination reason: Instruction limit
% 1.04/0.93 % (2667845)Termination phase: Saturation
% 1.04/0.93 % (2667845)Time elapsed: 0.005 s
% 1.04/0.93 % (2667845)Peak memory usage: 88 MB
% 1.04/0.93 % (2667845)Instructions burned: 7 (million)
% 1.04/0.93 % (2667848)lrs+10_1_to=lpo:sas=z3:si=on:tha=off:random_seed=3708062590:i=46:rtra=on_2999 on theBenchmark for (2999ds/46Mi)
% 1.04/0.93 % (2667841)Instruction limit reached!
% 1.04/0.93 % (2667841)------------------------------
% 1.04/0.93 % (2667841)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.04/0.93 % (2667841)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.04/0.93 % (2667841)CaDiCaL version: 2.1.3
% 1.04/0.93 % (2667841)Termination reason: Instruction limit
% 1.04/0.93 % (2667841)Termination phase: Saturation
% 1.04/0.93 % (2667841)Time elapsed: 0.031 s
% 1.04/0.93 % (2667841)Peak memory usage: 116 MB
% 1.04/0.93 % (2667841)Instructions burned: 12 (million)
% 1.04/0.93 % (2667843)Also succeeded, but the first one will report.
% 1.04/0.93 % (2667849)Also succeeded, but the first one will report.
% 1.04/0.93 % (2667848)Also succeeded, but the first one will report.
% 1.04/0.93 % (2667882)dis+11_3_anc=none:drc=ordering:si=on:urr=ec_only:bce=on:tha=off:sac=on:random_seed=3760546543:st=5:i=14:sd=10:rtra=on:ss=axioms:rawr=on_2998 on theBenchmark for (2998ds/14Mi)
% 1.04/0.93 % (2667883)dis+1011_2:1_to=kbo:sil=128000:tgt=full:fde=none:si=on:norm_ineq=on:spb=goal_then_units:tha=some:nwc=2:sac=on:random_seed=4028329479:i=29:thsqd=64:nm=0:thsqc=8:rtra=on:thsq=on:ev=off_2998 on theBenchmark for (2998ds/29Mi)
% 1.04/0.93 % (2667883)Also succeeded, but the first one will report.
% 1.04/0.93 % (2667882)Also succeeded, but the first one will report.
% 1.04/0.93 % (2667844)Refutation found. Thanks to Tanya!
% 1.04/0.93 % SZS status Theorem for theBenchmark
% 1.04/0.93 % SZS output start Proof for theBenchmark
% See solution above
% 2.62/1.12 % (2667844)------------------------------
% 2.62/1.12 % (2667844)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.62/1.12 % (2667844)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.62/1.12 % (2667844)CaDiCaL version: 2.1.3
% 2.62/1.12 % (2667844)Termination reason: Refutation
% 2.62/1.12 % (2667844)Time elapsed: 0.019 s
% 2.62/1.12 % (2667844)Peak memory usage: 114 MB
% 2.62/1.12 % (2667844)Instructions burned: 10 (million)
% 2.62/1.12 % (2667844)------------------------------
% 2.62/1.12 % (2667844)------------------------------
% 2.62/1.12 % (2667747)Success in time 0.285 s
% 2.62/1.12 % Vampire exiting
%------------------------------------------------------------------------------