%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM925+3 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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 12:17:33 PM UTC 2026
% Result : Theorem 3.45s 1.55s
% Output : Refutation 5.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 15
% Syntax : Number of formulae : 62 ( 40 unt; 2 def)
% Number of atoms : 95 ( 39 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 69 ( 36 ~; 27 |; 1 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 58 ( 0 sgn 58 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
is_int(one_one_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint) ).
fof(f4,axiom,
! [X0,X1] :
( ( is_int(X0)
& is_int(X1) )
=> is_int(plus_plus_int(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_c_Groups_Oplus__class_Oplus_000tc__Int__Oint) ).
fof(f20,axiom,
! [X0,X1] : is_int(hAPP_nat_int(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_c_hAPP_000tc__Nat__Onat_000tc__Int__Oint) ).
fof(f94,axiom,
! [X0,X1,X2] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_65_zadd__assoc) ).
fof(f96,axiom,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_67_zadd__commute) ).
fof(f112,axiom,
! [X0] : ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_nat_int(semiri1621563631at_int,X0)),zero_zero_int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_83_int__less__0__conv) ).
fof(f127,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_98_Pls__def) ).
fof(f132,axiom,
! [X0] : bit0(X0) = plus_plus_int(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_103_Bit0__def) ).
fof(f157,axiom,
! [X0] : bit1(X0) = plus_plus_int(plus_plus_int(one_one_int,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_128_Bit1__def) ).
fof(f260,axiom,
! [X0,X1] :
( is_int(X1)
=> ( X1 != zero_zero_int
=> hAPP_nat_int(power_power_int(X1),X0) != zero_zero_int ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_231_field__power__not__zero) ).
fof(f298,axiom,
! [X0] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X0),plus_plus_int(X0,one_one_int))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_269_less__add__one) ).
fof(f354,axiom,
! [X0,X1,X2,X3] : plus_plus_int(plus_plus_int(X0,X1),plus_plus_int(X2,X3)) = plus_plus_int(plus_plus_int(X0,X2),plus_plus_int(X1,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_325_comm__semiring__1__class_Onormalizing__semiring__rules_I20_J) ).
fof(f1233,conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f1234,negated_conjecture,
~ ( hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ),
inference(negated_conjecture,[status(cth)],[f1233]) ).
fof(f1235,plain,
zero_zero_int = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))),
inference(flattening,[],[f1234]) ).
fof(f1239,plain,
! [X0,X1] :
( is_int(plus_plus_int(X0,X1))
| ~ is_int(X0)
| ~ is_int(X1) ),
inference(ennf_transformation,[],[f4]) ).
fof(f1240,plain,
! [X0,X1] :
( is_int(plus_plus_int(X0,X1))
| ~ is_int(X0)
| ~ is_int(X1) ),
inference(flattening,[],[f1239]) ).
fof(f1395,plain,
! [X0,X1] :
( hAPP_nat_int(power_power_int(X1),X0) != zero_zero_int
| zero_zero_int = X1
| ~ is_int(X1) ),
inference(ennf_transformation,[],[f260]) ).
fof(f1396,plain,
! [X0,X1] :
( hAPP_nat_int(power_power_int(X1),X0) != zero_zero_int
| zero_zero_int = X1
| ~ is_int(X1) ),
inference(flattening,[],[f1395]) ).
fof(f1529,plain,
is_int(one_one_int),
inference(cnf_transformation,[],[f3]) ).
fof(f1530,plain,
! [X0,X1] :
( is_int(plus_plus_int(X0,X1))
| ~ is_int(X0)
| ~ is_int(X1) ),
inference(cnf_transformation,[],[f1240]) ).
fof(f1535,plain,
! [X0,X1] : is_int(hAPP_nat_int(X0,X1)),
inference(cnf_transformation,[],[f20]) ).
fof(f1536,plain,
zero_zero_int = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(bit0(bit1(pls)))),
inference(cnf_transformation,[],[f1235]) ).
fof(f1616,plain,
! [X0] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X0),plus_plus_int(X0,one_one_int))),
inference(cnf_transformation,[],[f298]) ).
fof(f1627,plain,
! [X0] : bit1(X0) = plus_plus_int(plus_plus_int(one_one_int,X0),X0),
inference(cnf_transformation,[],[f157]) ).
fof(f1676,plain,
! [X2,X3,X0,X1] : plus_plus_int(plus_plus_int(X0,X1),plus_plus_int(X2,X3)) = plus_plus_int(plus_plus_int(X0,X2),plus_plus_int(X1,X3)),
inference(cnf_transformation,[],[f354]) ).
fof(f1684,plain,
! [X0,X1] : plus_plus_int(X0,X1) = plus_plus_int(X1,X0),
inference(cnf_transformation,[],[f96]) ).
fof(f1686,plain,
! [X2,X0,X1] : plus_plus_int(plus_plus_int(X0,X1),X2) = plus_plus_int(X0,plus_plus_int(X1,X2)),
inference(cnf_transformation,[],[f94]) ).
fof(f1714,plain,
! [X0] : bit0(X0) = plus_plus_int(X0,X0),
inference(cnf_transformation,[],[f132]) ).
fof(f1760,plain,
zero_zero_int = pls,
inference(cnf_transformation,[],[f127]) ).
fof(f1813,plain,
! [X0] : ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_nat_int(semiri1621563631at_int,X0)),zero_zero_int)),
inference(cnf_transformation,[],[f112]) ).
fof(f1868,plain,
! [X0,X1] :
( zero_zero_int != hAPP_nat_int(power_power_int(X1),X0)
| zero_zero_int = X1
| ~ is_int(X1) ),
inference(cnf_transformation,[],[f1396]) ).
fof(f1925,plain,
pls = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(plus_plus_int(plus_plus_int(one_one_int,pls),pls),plus_plus_int(plus_plus_int(one_one_int,pls),pls)))),
inference(definition_unfolding,[],[f1536,f1760,f1714,f1627]) ).
fof(f2083,plain,
! [X0] : ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_nat_int(semiri1621563631at_int,X0)),pls)),
inference(definition_unfolding,[],[f1813,f1760]) ).
fof(f2106,plain,
! [X0,X1] :
( pls != hAPP_nat_int(power_power_int(X1),X0)
| pls = X1
| ~ is_int(X1) ),
inference(definition_unfolding,[],[f1868,f1760,f1760]) ).
fof(f2212,plain,
! [X2,X3,X0,X1] : plus_plus_int(plus_plus_int(X0,X1),plus_plus_int(X2,X3)) = plus_plus_int(X0,plus_plus_int(X2,plus_plus_int(X1,X3))),
inference(forward_demodulation,[],[f1676,f1686]) ).
fof(f2223,plain,
pls = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(plus_plus_int(one_one_int,pls),plus_plus_int(pls,plus_plus_int(plus_plus_int(one_one_int,pls),pls))))),
inference(forward_demodulation,[],[f1925,f1686]) ).
fof(f2232,plain,
! [X2,X3,X0,X1] : plus_plus_int(X0,plus_plus_int(X2,plus_plus_int(X1,X3))) = plus_plus_int(X0,plus_plus_int(X1,plus_plus_int(X2,X3))),
inference(forward_demodulation,[],[f2212,f1686]) ).
fof(f2239,plain,
pls = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(plus_plus_int(one_one_int,pls),pls)))))),
inference(forward_demodulation,[],[f2223,f1686]) ).
fof(f2241,plain,
pls = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(one_one_int,plus_plus_int(pls,pls))))))),
inference(forward_demodulation,[],[f2239,f1686]) ).
fof(f2242,plain,
pls = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(pls,plus_plus_int(one_one_int,plus_plus_int(pls,plus_plus_int(pls,pls))))))),
inference(forward_demodulation,[],[f2241,f2232]) ).
fof(f2243,plain,
pls = hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),number_number_of_nat(plus_plus_int(one_one_int,plus_plus_int(one_one_int,plus_plus_int(pls,plus_plus_int(pls,plus_plus_int(pls,pls))))))),
inference(forward_demodulation,[],[f2242,f2232]) ).
fof(f2348,plain,
! [X0] : hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,X0),plus_plus_int(one_one_int,X0))),
inference(superposition,[],[f1616,f1684]) ).
fof(f2636,plain,
( pls != pls
| pls = plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))
| ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))) ),
inference(superposition,[],[f2106,f2243]) ).
fof(f2643,plain,
( pls = plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))
| ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))) ),
inference(trivial_inequality_removal,[],[f2636]) ).
fof(f2645,definition,
( spl14_9
<=> is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))) ),
introduced(definition,[new_symbols(definition,[spl14_9])],[avatar_definition]) ).
fof(f2647,plain,
( ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))
| spl14_9 ),
inference(avatar_component_clause,[],[f2645]) ).
fof(f2649,definition,
( spl14_10
<=> pls = plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) ),
introduced(definition,[new_symbols(definition,[spl14_10])],[avatar_definition]) ).
fof(f2651,plain,
( pls = plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))
| ~ spl14_10 ),
inference(avatar_component_clause,[],[f2649]) ).
fof(f2654,plain,
( ~ spl14_9
| spl14_10 ),
inference(avatar_split_clause,[],[f2643,f2649,f2645]) ).
fof(f2655,plain,
( ~ is_int(one_one_int)
| ~ is_int(hAPP_nat_int(semiri1621563631at_int,n))
| spl14_9 ),
inference(resolution,[],[f2647,f1530]) ).
fof(f2656,plain,
( ~ is_int(hAPP_nat_int(semiri1621563631at_int,n))
| spl14_9 ),
inference(forward_subsumption_resolution,[],[f2655,f1529]) ).
fof(f2657,plain,
( $false
| spl14_9 ),
inference(forward_subsumption_resolution,[],[f2656,f1535]) ).
fof(f2658,plain,
spl14_9,
inference(avatar_contradiction_clause,[],[f2657]) ).
fof(f2673,plain,
( hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_nat_int(semiri1621563631at_int,n)),pls))
| ~ spl14_10 ),
inference(superposition,[],[f2348,f2651]) ).
fof(f2681,plain,
( $false
| ~ spl14_10 ),
inference(forward_subsumption_resolution,[],[f2673,f2083]) ).
fof(f2682,plain,
~ spl14_10,
inference(avatar_contradiction_clause,[],[f2681]) ).
cnf(s18,plain,
( ~ spl14_9
| spl14_10 ),
inference(sat_conversion,[],[f2654]) ).
cnf(s19,plain,
spl14_9,
inference(sat_conversion,[],[f2658]) ).
cnf(s20,plain,
~ spl14_10,
inference(sat_conversion,[],[f2682]) ).
cnf(s22,plain,
$false,
inference(rat,[],[s18,s20,s19]) ).
fof(f2691,plain,
$false,
inference(avatar_sat_refutation,[],[s22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM925+3 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n001.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 21:49:49 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.39 Running first-order theorem proving
% 0.09/0.39 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
% 3.45/1.55 % (3990156)Detected formulas, will run a generic FOF schedule.
% 3.45/1.55 % (3990162)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=3883139392:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.45/1.55 % (3990166)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3894852585:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.45/1.55 % (3990165)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1759487469:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.45/1.55 % (3990161)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=3997792523:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.45/1.55 % (3990164)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1908547339:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.45/1.55 % (3990163)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=1163193426:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.45/1.55 % (3990167)dis-21_1_sil=8000:lcm=predicate:random_seed=697064174: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)
% 3.45/1.55 % (3990164)Instruction limit reached!
% 3.45/1.55 % (3990164)------------------------------
% 3.45/1.55 % (3990164)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.55 % (3990164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.55 % (3990164)CaDiCaL version: 2.1.3
% 3.45/1.55 % (3990164)Termination reason: Instruction limit
% 3.45/1.55 % (3990164)Termination phase: Saturation
% 3.45/1.55 % (3990164)Time elapsed: 0.054 s
% 3.45/1.55 % (3990164)Peak memory usage: 90 MB
% 3.45/1.55 % (3990164)Instructions burned: 109 (million)
% 3.45/1.55 % (3990165)Instruction limit reached!
% 3.45/1.55 % (3990165)------------------------------
% 3.45/1.55 % (3990165)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.55 % (3990165)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.55 % (3990165)CaDiCaL version: 2.1.3
% 3.45/1.55 % (3990165)Termination reason: Instruction limit
% 3.45/1.55 % (3990165)Termination phase: Saturation
% 3.45/1.55 % (3990165)Time elapsed: 0.067 s
% 3.45/1.55 % (3990165)Peak memory usage: 90 MB
% 3.45/1.55 % (3990165)Instructions burned: 121 (million)
% 3.45/1.55 % (3990166)Instruction limit reached!
% 3.45/1.55 % (3990166)------------------------------
% 3.45/1.55 % (3990166)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.55 % (3990166)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.55 % (3990166)CaDiCaL version: 2.1.3
% 3.45/1.55 % (3990166)Termination reason: Instruction limit
% 3.45/1.55 % (3990166)Termination phase: Saturation
% 3.45/1.55 % (3990166)Time elapsed: 0.071 s
% 3.45/1.55 % (3990166)Peak memory usage: 91 MB
% 3.45/1.55 % (3990166)Instructions burned: 140 (million)
% 3.45/1.55 % (3990167)Instruction limit reached!
% 3.45/1.55 % (3990167)------------------------------
% 3.45/1.55 % (3990167)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.55 % (3990167)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.55 % (3990167)CaDiCaL version: 2.1.3
% 3.45/1.55 % (3990167)Termination reason: Instruction limit
% 3.45/1.55 % (3990167)Termination phase: Saturation
% 3.45/1.55 % (3990167)Time elapsed: 0.060 s
% 3.45/1.55 % (3990167)Peak memory usage: 90 MB
% 3.45/1.55 % (3990167)Instructions burned: 129 (million)
% 3.45/1.55 % (3990175)lrs+10_1_sil=8000:sp=occurrence:random_seed=458438701:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.45/1.55 % (3990177)lrs+1011_1_sil=32000:sp=occurrence:random_seed=994162762:i=325:sd=1:ss=axioms:sgt=32_2997 on theBenchmark for (2997ds/325Mi)
% 3.45/1.55 % (3990176)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2440933992:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.45/1.55 % (3990178)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=1440873943:s2a=on:i=248:s2at=1.23:gtg=position_2997 on theBenchmark for (2997ds/248Mi)
% 3.45/1.55 % (3990177)First to succeed.
% 3.45/1.55 % (3990177)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3990156"
% 3.45/1.55 % (3990175)Also succeeded, but the first one will report.
% 3.45/1.55 % (3990178)Also succeeded, but the first one will report.
% 3.45/1.55 % (3990176)Instruction limit reached!
% 3.45/1.55 % (3990176)------------------------------
% 3.45/1.55 % (3990176)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.55 % (3990176)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.55 % (3990176)CaDiCaL version: 2.1.3
% 3.45/1.55 % (3990176)Termination reason: Instruction limit
% 3.45/1.55 % (3990176)Termination phase: Saturation
% 3.45/1.55 % (3990176)Time elapsed: 0.092 s
% 3.45/1.55 % (3990176)Peak memory usage: 91 MB
% 3.45/1.55 % (3990176)Instructions burned: 158 (million)
% 3.45/1.55 % (3990183)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=4181282331:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2995 on theBenchmark for (2995ds/294Mi)
% 3.45/1.55 % (3990183)Instruction limit reached!
% 3.45/1.55 % (3990183)------------------------------
% 3.45/1.55 % (3990183)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.45/1.55 % (3990183)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.45/1.55 % (3990183)CaDiCaL version: 2.1.3
% 3.45/1.55 % (3990183)Termination reason: Instruction limit
% 3.45/1.55 % (3990183)Termination phase: Saturation
% 3.45/1.55 % (3990183)Time elapsed: 0.070 s
% 3.45/1.55 % (3990183)Peak memory usage: 92 MB
% 3.45/1.55 % (3990183)Instructions burned: 296 (million)
% 3.45/1.55 % (3990177)Refutation found. Thanks to Tanya!
% 3.45/1.55 % SZS status Theorem for theBenchmark
% 3.45/1.55 % SZS output start Proof for theBenchmark
% See solution above
% 5.25/1.74 % (3990177)------------------------------
% 5.25/1.74 % (3990177)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.25/1.74 % (3990177)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.25/1.74 % (3990177)CaDiCaL version: 2.1.3
% 5.25/1.74 % (3990177)Termination reason: Refutation
% 5.25/1.74 % (3990177)Time elapsed: 0.033 s
% 5.25/1.74 % (3990177)Peak memory usage: 91 MB
% 5.25/1.74 % (3990177)Instructions burned: 53 (million)
% 5.25/1.74 % (3990177)------------------------------
% 5.25/1.74 % (3990177)------------------------------
% 5.25/1.74 % (3990156)Success in time 0.706 s
% 5.25/1.74 % Vampire exiting
%------------------------------------------------------------------------------