%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWV486+2 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:16:01 PM UTC 2026
% Result : Theorem 0.66s 0.99s
% Output : Refutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 9
% Syntax : Number of formulae : 76 ( 18 unt; 3 def)
% Number of atoms : 289 ( 52 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 369 ( 156 ~; 143 |; 50 &)
% ( 5 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 3 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-2 aty)
% Number of variables : 104 ( 0 sgn 97 !; 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(f10,axiom,
! [X0] :
( int_less(int_zero,X0)
<=> int_leq(int_one,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',one_successor_of_zero) ).
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) = lu(plus(X3,X2),X3) ) )
& ! [X3] :
( ( int_leq(int_one,X3)
& int_leq(X3,X1) )
=> a(X3,X3) = real_one )
& ! [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',qil) ).
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) = lu(plus(X3,X2),X3) ) )
& ! [X4] :
( ( int_leq(int_one,X4)
& int_leq(X4,X1) )
=> real_one = a(X4,X4) )
& ! [X5] :
( ( int_less(int_zero,X5)
& plus(X0,X5) = X1 )
=> ! [X6] :
( ( int_leq(int_one,X6)
& int_leq(X6,X0) )
=> real_zero = a(X6,plus(X6,X5)) ) ) ) ),
inference(rectify,[],[f12]) ).
fof(f16,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = lu(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(ennf_transformation,[],[f15]) ).
fof(f17,plain,
! [X0,X1] :
( ( ! [X2] :
( ! [X3] :
( a(plus(X3,X2),X3) = lu(plus(X3,X2),X3)
| ~ int_leq(int_one,X3)
| ~ int_leq(X3,X1) )
| ~ int_less(int_zero,X2)
| plus(X1,X2) != X0 )
& ! [X4] :
( real_one = a(X4,X4)
| ~ int_leq(int_one,X4)
| ~ int_leq(X4,X1) )
& ! [X5] :
( ! [X6] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0) )
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1 ) )
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(flattening,[],[f16]) ).
fof(f18,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(f19,plain,
? [X0,X1] :
( real_zero != a(X0,X1)
& int_leq(int_one,X0)
& int_less(X0,X1)
& int_leq(X1,n) ),
inference(flattening,[],[f18]) ).
fof(f21,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(ennf_transformation,[],[f2]) ).
fof(f22,plain,
! [X0,X1,X2] :
( int_less(X0,X2)
| ~ int_less(X0,X1)
| ~ int_less(X1,X2) ),
inference(flattening,[],[f21]) ).
fof(f25,plain,
( real_zero != a(sK0,sK1)
& int_leq(int_one,sK0)
& int_less(sK0,sK1)
& int_leq(sK1,n) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f19]) ).
fof(f26,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(f27,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,[],[f26]) ).
fof(f28,plain,
! [X0,X1] :
( ( int_less(X0,X1)
| ! [X2] :
( plus(X0,X2) != X1
| ~ int_less(int_zero,X2) ) )
& ( ( plus(X0,sK2(X0,X1)) = X1
& int_less(int_zero,sK2(X0,X1)) )
| ~ int_less(X0,X1) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X3,sK2(X0,X1))],[f27]) ).
fof(f29,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(f30,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,[],[f29]) ).
fof(f31,plain,
! [X0] :
( ( int_less(int_zero,X0)
| ~ int_leq(int_one,X0) )
& ( int_leq(int_one,X0)
| ~ int_less(int_zero,X0) ) ),
inference(nnf_transformation,[],[f10]) ).
fof(f32,plain,
! [X0,X1,X6,X5] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0)
| ~ int_less(int_zero,X5)
| plus(X0,X5) != X1
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n) ),
inference(cnf_transformation,[],[f17]) ).
fof(f35,plain,
int_leq(sK1,n),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
int_less(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f37,plain,
int_leq(int_one,sK0),
inference(cnf_transformation,[],[f25]) ).
fof(f38,plain,
real_zero != a(sK0,sK1),
inference(cnf_transformation,[],[f25]) ).
fof(f40,plain,
! [X0,X1] :
( int_less(int_zero,sK2(X0,X1))
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f41,plain,
! [X0,X1] :
( plus(X0,sK2(X0,X1)) = X1
| ~ int_less(X0,X1) ),
inference(cnf_transformation,[],[f28]) ).
fof(f45,plain,
! [X0,X1] :
( ~ int_leq(X0,X1)
| X0 = X1
| int_less(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f46,plain,
! [X0,X1] :
( int_leq(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f30]) ).
fof(f47,plain,
! [X0,X1] :
( ~ int_less(X0,X1)
| int_leq(X0,X1) ),
inference(cnf_transformation,[],[f30]) ).
fof(f48,plain,
! [X0] :
( ~ int_less(int_zero,X0)
| int_leq(int_one,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f49,plain,
! [X0] :
( ~ int_leq(int_one,X0)
| int_less(int_zero,X0) ),
inference(cnf_transformation,[],[f31]) ).
fof(f51,plain,
! [X2,X0,X1] :
( ~ int_less(X1,X2)
| ~ int_less(X0,X1)
| int_less(X0,X2) ),
inference(cnf_transformation,[],[f22]) ).
fof(f55,definition,
~ sP3(real_zero),
introduced(definition,[new_symbols(definition,[sP3])],[inequality_splitting_name_introduction]) ).
fof(f56,plain,
sP3(a(sK0,sK1)),
inference(inequality_splitting,[],[f38,f55]) ).
fof(f60,plain,
! [X0,X6,X5] :
( real_zero = a(X6,plus(X6,X5))
| ~ int_leq(int_one,X6)
| ~ int_leq(X6,X0)
| ~ int_less(int_zero,X5)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_leq(int_one,plus(X0,X5))
| ~ int_leq(plus(X0,X5),n) ),
inference(equality_resolution,[],[f32]) ).
fof(f63,plain,
! [X1] : int_leq(X1,X1),
inference(equality_resolution,[],[f46]) ).
fof(f78,plain,
( n = sK1
| int_less(sK1,n) ),
inference(resolution,[],[f35,f45]) ).
fof(f80,definition,
( spl6_4
<=> int_less(sK1,n) ),
introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition]) ).
fof(f82,plain,
( int_less(sK1,n)
| ~ spl6_4 ),
inference(avatar_component_clause,[],[f80]) ).
fof(f84,definition,
( spl6_5
<=> n = sK1 ),
introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition]) ).
fof(f86,plain,
( n = sK1
| ~ spl6_5 ),
inference(avatar_component_clause,[],[f84]) ).
fof(f87,plain,
( spl6_4
| spl6_5 ),
inference(avatar_split_clause,[],[f78,f84,f80]) ).
fof(f88,plain,
! [X0] :
( ~ int_less(X0,sK0)
| int_less(X0,sK1) ),
inference(resolution,[],[f36,f51]) ).
fof(f89,plain,
int_leq(sK0,sK1),
inference(resolution,[],[f36,f47]) ).
fof(f90,plain,
int_less(int_zero,sK0),
inference(resolution,[],[f37,f49]) ).
fof(f101,plain,
( ! [X0] :
( ~ int_less(X0,sK1)
| int_less(X0,n) )
| ~ spl6_4 ),
inference(resolution,[],[f82,f51]) ).
fof(f112,plain,
! [X2,X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_less(int_zero,sK2(X1,X0))
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f60,f41]) ).
fof(f118,plain,
! [X2,X0,X1] :
( ~ int_leq(plus(X2,sK2(X1,X0)),n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X2)
| ~ int_leq(int_one,X2)
| ~ int_leq(X2,n)
| ~ int_leq(int_one,plus(X2,sK2(X1,X0)))
| real_zero = a(X1,X0)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f112,f40]) ).
fof(f126,plain,
int_less(int_zero,sK1),
inference(resolution,[],[f88,f90]) ).
fof(f128,plain,
int_leq(int_one,sK1),
inference(resolution,[],[f126,f48]) ).
fof(f136,plain,
( int_less(sK0,n)
| ~ spl6_4 ),
inference(resolution,[],[f101,f36]) ).
fof(f163,plain,
( int_leq(sK0,n)
| ~ spl6_4 ),
inference(resolution,[],[f136,f47]) ).
fof(f187,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X1,X0)
| ~ int_less(X1,X0) ),
inference(superposition,[],[f118,f41]) ).
fof(f190,plain,
! [X0,X1] :
( ~ int_leq(X0,n)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| real_zero = a(X1,X0)
| ~ int_less(X1,X0) ),
inference(duplicate_literal_removal,[],[f187]) ).
fof(f191,plain,
! [X0,X1] :
( real_zero = a(X1,X0)
| ~ int_leq(int_one,X1)
| ~ int_leq(X1,n)
| ~ int_leq(int_one,X0)
| ~ int_leq(X0,n)
| ~ int_less(X1,X0) ),
inference(forward_subsumption_resolution,[],[f190,f63]) ).
fof(f294,plain,
( sP3(real_zero)
| ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(superposition,[],[f56,f191]) ).
fof(f316,plain,
( ~ int_leq(int_one,sK0)
| ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f294,f55]) ).
fof(f317,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f316,f37]) ).
fof(f318,plain,
( ~ int_leq(int_one,sK1)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1)
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f317,f163]) ).
fof(f319,plain,
( ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1)
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f318,f128]) ).
fof(f320,plain,
( ~ int_less(sK0,sK1)
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f319,f35]) ).
fof(f321,plain,
( $false
| ~ spl6_4 ),
inference(forward_subsumption_resolution,[],[f320,f36]) ).
fof(f322,plain,
~ spl6_4,
inference(avatar_contradiction_clause,[],[f321]) ).
fof(f323,plain,
( ~ int_leq(sK0,n)
| ~ int_leq(sK1,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f317,f128]) ).
fof(f324,plain,
( ~ int_leq(sK0,n)
| ~ int_less(sK0,sK1) ),
inference(forward_subsumption_resolution,[],[f323,f35]) ).
fof(f325,plain,
~ int_leq(sK0,n),
inference(forward_subsumption_resolution,[],[f324,f36]) ).
fof(f332,plain,
( int_leq(sK0,n)
| ~ spl6_5 ),
inference(superposition,[],[f89,f86]) ).
fof(f338,plain,
( $false
| ~ spl6_5 ),
inference(forward_subsumption_resolution,[],[f332,f325]) ).
fof(f339,plain,
~ spl6_5,
inference(avatar_contradiction_clause,[],[f338]) ).
cnf(s3,plain,
( spl6_4
| spl6_5 ),
inference(sat_conversion,[],[f87]) ).
cnf(s7,plain,
~ spl6_4,
inference(sat_conversion,[],[f322]) ).
cnf(s8,plain,
~ spl6_5,
inference(sat_conversion,[],[f339]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s3,s8,s7]) ).
fof(f340,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWV486+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n020.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Mon Sep 28 11:15:04 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running first-order theorem proving
% 0.10/0.24 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
% 0.66/0.99 % (101054)Detected formulas, will run a generic FOF schedule.
% 0.66/0.99 % (101062)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1143151051:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 0.66/0.99 % (101062)First to succeed.
% 0.66/0.99 % (101062)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-101054"
% 0.66/0.99 % (101065)dis-21_1_sil=8000:lcm=predicate:random_seed=2886940452:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 0.66/0.99 % (101060)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1869337763:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 0.66/0.99 % (101063)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3866575248:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 0.66/0.99 % (101059)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3480045019:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 0.66/0.99 % (101061)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3041061276:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 0.66/0.99 % (101064)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2867648517:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 0.66/0.99 % (101063)Also succeeded, but the first one will report.
% 0.66/0.99 % (101065)Instruction limit reached!
% 0.66/0.99 % (101065)------------------------------
% 0.66/0.99 % (101065)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/0.99 % (101065)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.99 % (101065)CaDiCaL version: 2.1.3
% 0.66/0.99 % (101065)Termination reason: Instruction limit
% 0.66/0.99 % (101065)Termination phase: Saturation
% 0.66/0.99 % (101065)Time elapsed: 0.079 s
% 0.66/0.99 % (101065)Peak memory usage: 88 MB
% 0.66/0.99 % (101065)Instructions burned: 130 (million)
% 0.66/0.99 % (101064)Instruction limit reached!
% 0.66/0.99 % (101064)------------------------------
% 0.66/0.99 % (101064)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.66/0.99 % (101064)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.66/0.99 % (101064)CaDiCaL version: 2.1.3
% 0.66/0.99 % (101064)Termination reason: Instruction limit
% 0.66/0.99 % (101064)Termination phase: Saturation
% 0.66/0.99 % (101064)Time elapsed: 0.096 s
% 0.66/0.99 % (101064)Peak memory usage: 90 MB
% 0.66/0.99 % (101064)Instructions burned: 140 (million)
% 0.66/0.99 % (101062)Refutation found. Thanks to Tanya!
% 0.66/0.99 % SZS status Theorem for theBenchmark
% 0.66/0.99 % SZS output start Proof for theBenchmark
% See solution above
% 2.85/1.19 % (101062)------------------------------
% 2.85/1.19 % (101062)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.85/1.19 % (101062)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.85/1.19 % (101062)CaDiCaL version: 2.1.3
% 2.85/1.19 % (101062)Termination reason: Refutation
% 2.85/1.19 % (101062)Time elapsed: 0.009 s
% 2.85/1.19 % (101062)Peak memory usage: 89 MB
% 2.85/1.19 % (101062)Instructions burned: 21 (million)
% 2.85/1.19 % (101062)------------------------------
% 2.85/1.19 % (101062)------------------------------
% 2.85/1.19 % (101054)Success in time 0.312 s
% 2.85/1.19 % Vampire exiting
%------------------------------------------------------------------------------