%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV486+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n016.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:24:25 PM UTC 2026
% Result : Theorem 0.23s 0.33s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 14
% Syntax : Number of formulae : 99 ( 18 unt; 9 def)
% Number of atoms : 304 ( 55 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 345 ( 140 ~; 138 |; 43 &)
% ( 11 <=>; 13 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 10 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 89 ( 0 sgn 82 !; 7 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( int_leq(X0,X1)
<=> ( int_less(X0,X1)
| X0 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_leq) ).
fof(f2,axiom,
! [X0,X1,X2] :
( ( int_less(X0,X1)
& int_less(X1,X2) )
=> int_less(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_transitive) ).
fof(f9,axiom,
! [X0,X1] :
( int_less(X0,X1)
<=> ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',plus_and_inverse) ).
fof(f12,axiom,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& X0 = plus(X1,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(plus(X3,X2),X3) = qr(plus(X3,X2),X3) ) )
& ! [X2] :
( ( int_less(int_zero,X2)
& X1 = plus(X0,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X0) )
=> a(X3,plus(X3,X2)) = real_zero ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qih) ).
fof(f13,conjecture,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) )
=> a(X0,X1) = real_zero ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lt) ).
fof(f14,negated_conjecture,
~ ! [X0,X1] :
( ( int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) )
=> a(X0,X1) = real_zero ),
inference(negated_conjecture,[status(cth)],[f13]) ).
fof(f15,plain,
! [X0,X1] :
( ( int_leq(int_one,X0)
& int_leq(X0,n)
& int_leq(int_one,X1)
& int_leq(X1,n) )
=> ( ! [X2] :
( ( int_less(int_zero,X2)
& X0 = plus(X1,X2) )
=> ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(plus(X3,X2),X3) = qr(plus(X3,X2),X3) ) )
& ! [X4] :
( ( int_less(int_zero,X4)
& plus(X0,X4) = X1 )
=> ! [X5] :
( ( int_leq(int_one,X5)
& int_leq(X5,X0) )
=> real_zero = a(X5,plus(X5,X4)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(flattening,[],[f16]) ).
fof(f21,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = qr(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( ! [X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_less(int_zero,X4)
| plus(X0,X4) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(ennf_transformation,[],[f15]) ).
fof(f22,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = qr(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( ! [X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0) )
| ~ int_less(int_zero,X4)
| plus(X0,X4) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(flattening,[],[f21]) ).
fof(f23,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(ennf_transformation,[],[f14]) ).
fof(f24,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(flattening,[],[f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) )
& ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ) ),
inference(nnf_transformation,[],[f1]) ).
fof(f26,plain,
! [X0,X1] :
( ( int_leq(X0,X1)
| ( ~ int_less(X0,X1)
& X0 != X1 ) )
& ( int_less(X0,X1)
| X0 = X1
| ~ int_leq(X0,X1) ) ),
inference(flattening,[],[f25]) ).
fof(f27,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ? [X2] :
( plus(X0,X2) = X1
& int_less(int_zero,X2) )
| ~ int_less(X0,X1) ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f28,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ? [X3] :
( plus(X0,X3) = X1
& int_less(int_zero,X3) )
| ~ int_less(X0,X1) ) ),
inference(rectify,[],[f27]) ).
fof(f29,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ( plus(X0,sK0(X0,X1)) = X1
& int_less(int_zero,sK0(X0,X1)) )
| ~ int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f28]) ).
fof(f31,plain,
( real_zero != a(sK1,sK2)
& int_leq(int_one,sK1)
& int_less(sK1,sK2)
& int_leq(sK2,n) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X0,sK1),skolemize(X1,sK2)],[f24]) ).
fof(f32,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f33,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f26]) ).
fof(f34,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f35,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f17]) ).
fof(f42,plain,
! [X0,X1] :
( int_less(int_zero,sK0(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f29]) ).
fof(f43,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| plus(X0,sK0(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f29]) ).
fof(f48,plain,
! [X0,X1,X4,X5] :
( real_zero = a(X5,plus(X5,X4))
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0)
| ~ int_less(int_zero,X4)
| plus(X0,X4) != X1
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cnf_transformation,[],[f22]) ).
fof(f50,plain,
int_leq(sK2,n),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
int_less(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f52,plain,
int_leq(int_one,sK1),
inference(cnf_transformation,[],[f31]) ).
fof(f53,plain,
real_zero != a(sK1,sK2),
inference(cnf_transformation,[],[f31]) ).
fof(f54,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f33]) ).
fof(f58,plain,
! [X0,X4,X5] :
( ~ int_leq(plus(X0,X4),n)
| ~ int_leq(int_one,X5)
| ~ int_leq(X5,X0)
| ~ int_less(int_zero,X4)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,plus(X0,X4))
| real_zero = a(X5,plus(X5,X4)) ),
inference(equality_resolution,[],[f48]) ).
fof(f59,plain,
int_leq(sK1,sK2),
inference(resolution,[],[f34,f51]) ).
fof(f88,plain,
( int_one = sK1
| int_less(int_one,sK1) ),
inference(resolution,[],[f32,f52]) ).
fof(f90,plain,
( n = sK2
| int_less(sK2,n) ),
inference(resolution,[],[f32,f50]) ).
fof(f92,definition,
( spl3_1
<=> int_less(sK2,n) ),
introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).
fof(f94,plain,
( int_less(sK2,n)
| ~ spl3_1 ),
inference(avatar_component_clause,[],[f92]) ).
fof(f96,definition,
( spl3_2
<=> n = sK2 ),
introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).
fof(f98,plain,
( n = sK2
| ~ spl3_2 ),
inference(avatar_component_clause,[],[f96]) ).
fof(f99,plain,
( spl3_1
| spl3_2 ),
inference(avatar_split_clause,[],[f90,f96,f92]) ).
fof(f101,definition,
( spl3_3
<=> int_less(int_one,sK1) ),
introduced(definition,[new_symbols(definition,[spl3_3])],[avatar_definition]) ).
fof(f103,plain,
( int_less(int_one,sK1)
| ~ spl3_3 ),
inference(avatar_component_clause,[],[f101]) ).
fof(f105,definition,
( spl3_4
<=> int_one = sK1 ),
introduced(definition,[new_symbols(definition,[spl3_4])],[avatar_definition]) ).
fof(f107,plain,
( int_one = sK1
| ~ spl3_4 ),
inference(avatar_component_clause,[],[f105]) ).
fof(f108,plain,
( spl3_3
| spl3_4 ),
inference(avatar_split_clause,[],[f88,f105,f101]) ).
fof(f109,plain,
( int_leq(sK1,n)
| ~ spl3_2 ),
inference(superposition,[],[f59,f98]) ).
fof(f113,plain,
! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,sK2) ),
inference(resolution,[],[f35,f51]) ).
fof(f128,plain,
sK2 = plus(sK1,sK0(sK1,sK2)),
inference(resolution,[],[f43,f51]) ).
fof(f135,definition,
( spl3_5
<=> int_less(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl3_5])],[avatar_definition]) ).
fof(f137,plain,
( int_less(sK1,n)
| ~ spl3_5 ),
inference(avatar_component_clause,[],[f135]) ).
fof(f153,plain,
( ! [X0] :
( ~ int_less(X0,sK2)
| int_less(X0,n) )
| ~ spl3_1 ),
inference(resolution,[],[f94,f35]) ).
fof(f186,plain,
( int_less(int_one,sK2)
| ~ spl3_3 ),
inference(resolution,[],[f113,f103]) ).
fof(f196,plain,
! [X0] :
( ~ int_leq(sK2,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(superposition,[],[f58,f128]) ).
fof(f197,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(forward_subsumption_resolution,[],[f196,f50]) ).
fof(f199,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| ~ int_leq(X0,sK1)
| ~ int_less(int_zero,sK0(sK1,sK2))
| ~ int_leq(sK1,n)
| ~ int_leq(int_one,sK2)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2))) ),
inference(forward_subsumption_resolution,[],[f197,f52]) ).
fof(f202,definition,
( spl3_11
<=> int_leq(int_one,sK2) ),
introduced(definition,[new_symbols(definition,[spl3_11])],[avatar_definition]) ).
fof(f206,definition,
( spl3_12
<=> int_leq(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl3_12])],[avatar_definition]) ).
fof(f208,plain,
( ~ int_leq(sK1,n)
| spl3_12 ),
inference(avatar_component_clause,[],[f206]) ).
fof(f210,definition,
( spl3_13
<=> int_less(int_zero,sK0(sK1,sK2)) ),
introduced(definition,[new_symbols(definition,[spl3_13])],[avatar_definition]) ).
fof(f212,plain,
( ~ int_less(int_zero,sK0(sK1,sK2))
| spl3_13 ),
inference(avatar_component_clause,[],[f210]) ).
fof(f214,definition,
( spl3_14
<=> ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| ~ int_leq(X0,sK1) ) ),
introduced(definition,[new_symbols(definition,[spl3_14])],[avatar_definition]) ).
fof(f215,plain,
( ! [X0] :
( ~ int_leq(int_one,X0)
| real_zero = a(X0,plus(X0,sK0(sK1,sK2)))
| ~ int_leq(X0,sK1) )
| ~ spl3_14 ),
inference(avatar_component_clause,[],[f214]) ).
fof(f216,plain,
( ~ spl3_11
| ~ spl3_12
| ~ spl3_13
| spl3_14 ),
inference(avatar_split_clause,[],[f199,f214,f210,f206,f202]) ).
fof(f223,plain,
( int_leq(int_one,sK2)
| ~ spl3_3 ),
inference(resolution,[],[f186,f34]) ).
fof(f224,plain,
( spl3_11
| ~ spl3_3 ),
inference(avatar_split_clause,[],[f223,f101,f202]) ).
fof(f229,plain,
( int_leq(int_one,sK2)
| ~ spl3_4 ),
inference(superposition,[],[f59,f107]) ).
fof(f236,plain,
( spl3_11
| ~ spl3_4 ),
inference(avatar_split_clause,[],[f229,f105,f202]) ).
fof(f335,plain,
( int_less(sK1,n)
| ~ spl3_1 ),
inference(resolution,[],[f153,f51]) ).
fof(f336,plain,
( spl3_5
| ~ spl3_1 ),
inference(avatar_split_clause,[],[f335,f92,f135]) ).
fof(f339,plain,
( $false
| ~ spl3_2
| spl3_12 ),
inference(forward_subsumption_resolution,[],[f109,f208]) ).
fof(f340,plain,
( ~ spl3_2
| spl3_12 ),
inference(avatar_contradiction_clause,[],[f339]) ).
fof(f358,plain,
( int_leq(sK1,n)
| ~ spl3_5 ),
inference(resolution,[],[f137,f34]) ).
fof(f361,plain,
( spl3_12
| ~ spl3_5 ),
inference(avatar_split_clause,[],[f358,f135,f206]) ).
fof(f492,plain,
( ~ int_less(sK1,sK2)
| spl3_13 ),
inference(resolution,[],[f212,f42]) ).
fof(f496,plain,
( $false
| spl3_13 ),
inference(forward_subsumption_resolution,[],[f492,f51]) ).
fof(f497,plain,
spl3_13,
inference(avatar_contradiction_clause,[],[f496]) ).
fof(f1098,plain,
( real_zero = a(sK1,plus(sK1,sK0(sK1,sK2)))
| ~ int_leq(sK1,sK1)
| ~ spl3_14 ),
inference(resolution,[],[f215,f52]) ).
fof(f1116,plain,
( real_zero = a(sK1,plus(sK1,sK0(sK1,sK2)))
| ~ spl3_14 ),
inference(forward_subsumption_resolution,[],[f1098,f54]) ).
fof(f1140,plain,
( real_zero = a(sK1,sK2)
| ~ spl3_14 ),
inference(forward_demodulation,[],[f1116,f128]) ).
fof(f1141,plain,
( $false
| ~ spl3_14 ),
inference(forward_subsumption_resolution,[],[f1140,f53]) ).
fof(f1142,plain,
~ spl3_14,
inference(avatar_contradiction_clause,[],[f1141]) ).
cnf(s1,plain,
( spl3_1
| spl3_2 ),
inference(sat_conversion,[],[f99]) ).
cnf(s2,plain,
( spl3_3
| spl3_4 ),
inference(sat_conversion,[],[f108]) ).
cnf(s6,plain,
( ~ spl3_11
| ~ spl3_12
| ~ spl3_13
| spl3_14 ),
inference(sat_conversion,[],[f216]) ).
cnf(s8,plain,
( ~ spl3_3
| spl3_11 ),
inference(sat_conversion,[],[f224]) ).
cnf(s9,plain,
( ~ spl3_4
| spl3_11 ),
inference(sat_conversion,[],[f236]) ).
cnf(s13,plain,
( ~ spl3_1
| spl3_5 ),
inference(sat_conversion,[],[f336]) ).
cnf(s15,plain,
( ~ spl3_2
| spl3_12 ),
inference(sat_conversion,[],[f340]) ).
cnf(s19,plain,
( ~ spl3_5
| spl3_12 ),
inference(sat_conversion,[],[f361]) ).
cnf(s26,plain,
spl3_13,
inference(sat_conversion,[],[f497]) ).
cnf(s79,plain,
~ spl3_14,
inference(sat_conversion,[],[f1142]) ).
cnf(s83,plain,
( ~ spl3_11
| ~ spl3_12 ),
inference(rat,[],[s6,s79,s26]) ).
cnf(s84,plain,
spl3_11,
inference(rat,[],[s2,s8,s9]) ).
cnf(s85,plain,
~ spl3_12,
inference(rat,[],[s83,s84]) ).
cnf(s86,plain,
~ spl3_5,
inference(rat,[],[s19,s85]) ).
cnf(s87,plain,
~ spl3_2,
inference(rat,[],[s15,s85]) ).
cnf(s88,plain,
~ spl3_1,
inference(rat,[],[s13,s86]) ).
cnf(s89,plain,
$false,
inference(rat,[],[s1,s87,s88]) ).
fof(f1143,plain,
$false,
inference(avatar_sat_refutation,[],[s89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV486+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.24 % Computer : n016.cluster.edu
% 0.11/0.24 % Model : x86_64 x86_64
% 0.11/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.24 % Memory : 8046.5625MB
% 0.11/0.24 % OS : Linux 6.8.0-71-generic
% 0.11/0.24 % CPULimit : 300
% 0.11/0.24 % WCLimit : 300
% 0.11/0.24 % DateTime : Mon Sep 28 11:19:03 UTC 2026
% 0.11/0.24 % CPUTime :
% 0.11/0.24 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.27 Running first-order model finding
% 0.23/0.27 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.23/0.33 % (3563500)Will run a generic schedule for satisfiability detection.
% 0.23/0.33 % (3563514)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=683123804:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_3000 on theBenchmark for (3000ds/159Mi)
% 0.23/0.33 % (3563509)% WARNING: option uhcvi not known.
% 0.23/0.33 % (3563509)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=828217294:i=135531:add=off:rawr=on_3000 on theBenchmark for (3000ds/135531Mi)
% 0.23/0.33 % (3563508)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1118927915_3000 on theBenchmark for (3000ds/0Mi)
% 0.23/0.33 % (3563513)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2455377764:i=131_3000 on theBenchmark for (3000ds/131Mi)
% 0.23/0.33 % (3563511)dis+10_1_sil=32000:sp=arity:random_seed=3149815005:i=103:fgj=on_3000 on theBenchmark for (3000ds/103Mi)
% 0.23/0.33 % (3563510)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4074951464:i=88024:add=on:rawr=on_3000 on theBenchmark for (3000ds/88024Mi)
% 0.23/0.33 % (3563512)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3108439070:i=116_3000 on theBenchmark for (3000ds/116Mi)
% 0.23/0.33 % TRYING [1]
% 0.23/0.33 % TRYING [2]
% 0.23/0.33 % TRYING [3]
% 0.23/0.33 % TRYING [4]
% 0.23/0.33 % TRYING [5]
% 0.23/0.33 % TRYING [6]
% 0.23/0.33 % (3563511) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3563500-3563511"...
% 0.23/0.33 % (3563511)...printing done.
% 0.23/0.33 % (3563511)Refutation found. Thanks to Tanya!
% 0.23/0.33 % SZS status Theorem for theBenchmark
% 0.23/0.33 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.33 % (3563511)------------------------------
% 0.23/0.33 % (3563511)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.33 % (3563511)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.33 % (3563511)CaDiCaL version: 2.1.3
% 0.23/0.33 % (3563511)Termination reason: Refutation
% 0.23/0.33 % (3563511)Time elapsed: 0.026 s
% 0.23/0.33 % (3563511)Peak memory usage: 12 MB
% 0.23/0.33 % (3563511)Instructions burned: 36 (million)
% 0.23/0.33 % (3563500)Success in time 0.05 s
% 0.23/0.33 % Vampire exiting
%------------------------------------------------------------------------------