%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM926+2 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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:26:12 PM UTC 2026
% Result : Theorem 1.58s 0.73s
% Output : Refutation 1.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of formulae : 60 ( 28 unt; 5 def)
% Number of atoms : 122 ( 34 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 101 ( 39 ~; 39 |; 12 &)
% ( 8 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-2 aty)
% Number of variables : 32 ( 0 sgn 20 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
is_int(one_one_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_c_Groups_Oone__class_Oone_000tc__Int__Oint) ).
fof(f18,axiom,
is_int(t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gsy_v_t____) ).
fof(f19,axiom,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_tpos) ).
fof(f20,axiom,
( t = one_one_int
=> ? [X0,X1] :
( is_int(X0)
& is_int(X1)
& plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f21,axiom,
( ord_less_int(one_one_int,t)
=> ? [X0,X1] :
( is_int(X0)
& is_int(X1)
& plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06) ).
fof(f56,axiom,
! [X0,X1] :
( ( is_int(X0)
& is_int(X1) )
=> ( ord_less_int(X0,X1)
<=> ( ord_less_eq_int(X0,X1)
& X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_37_zless__le) ).
fof(f223,axiom,
! [X0] : bit0(X0) = plus_plus_int(X0,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_204_Bit0__def) ).
fof(f270,axiom,
! [X0] : bit1(X0) = plus_plus_int(plus_plus_int(one_one_int,X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_251_Bit1__def) ).
fof(f717,conjecture,
? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(f718,negated_conjecture,
~ ? [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(negated_conjecture,[status(cth)],[f717]) ).
fof(f731,plain,
( ? [X0,X1] :
( is_int(X0)
& is_int(X1)
& plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| one_one_int != t ),
inference(ennf_transformation,[],[f20]) ).
fof(f732,plain,
( ? [X0,X1] :
( is_int(X0)
& is_int(X1)
& plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) = plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) )
| ~ ord_less_int(one_one_int,t) ),
inference(ennf_transformation,[],[f21]) ).
fof(f734,plain,
! [X0,X1] :
( ( ord_less_int(X0,X1)
<=> ( ord_less_eq_int(X0,X1)
& X0 != X1 ) )
| ~ is_int(X0)
| ~ is_int(X1) ),
inference(ennf_transformation,[],[f56]) ).
fof(f735,plain,
! [X0,X1] :
( ( ord_less_int(X0,X1)
<=> ( ord_less_eq_int(X0,X1)
& X0 != X1 ) )
| ~ is_int(X0)
| ~ is_int(X1) ),
inference(flattening,[],[f734]) ).
fof(f1146,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(ennf_transformation,[],[f718]) ).
fof(f1148,plain,
is_int(one_one_int),
inference(cnf_transformation,[],[f2]) ).
fof(f1164,plain,
is_int(t),
inference(cnf_transformation,[],[f18]) ).
fof(f1165,plain,
ord_less_eq_int(one_one_int,t),
inference(cnf_transformation,[],[f19]) ).
fof(f1166,plain,
( one_one_int != t
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK1,number_number_of_nat(bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f731]) ).
fof(f1169,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,number_number_of_nat(bit0(bit1(pls)))),power_power_int(sK3,number_number_of_nat(bit0(bit1(pls))))) ),
inference(cnf_transformation,[],[f732]) ).
fof(f1209,plain,
! [X0,X1] :
( ~ is_int(X1)
| ~ is_int(X0)
| X0 = X1
| ~ ord_less_eq_int(X0,X1)
| ord_less_int(X0,X1) ),
inference(cnf_transformation,[],[f735]) ).
fof(f1438,plain,
! [X0] : bit0(X0) = plus_plus_int(X0,X0),
inference(cnf_transformation,[],[f223]) ).
fof(f1485,plain,
! [X0] : bit1(X0) = plus_plus_int(plus_plus_int(one_one_int,X0),X0),
inference(cnf_transformation,[],[f270]) ).
fof(f2103,plain,
! [X0,X1] : plus_plus_int(power_power_int(X0,number_number_of_nat(bit0(bit1(pls)))),power_power_int(X1,number_number_of_nat(bit0(bit1(pls))))) != plus_plus_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls)))),m),one_one_int),
inference(cnf_transformation,[],[f1146]) ).
fof(f2107,plain,
( one_one_int != t
| plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,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)))),power_power_int(sK1,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,[],[f1166,f1438,f1438,f1485,f1438,f1485,f1438,f1485]) ).
fof(f2108,plain,
( ~ ord_less_int(one_one_int,t)
| plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,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)))),power_power_int(sK3,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,[],[f1169,f1438,f1438,f1485,f1438,f1485,f1438,f1485]) ).
fof(f2515,plain,
! [X0,X1] : plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) != plus_plus_int(power_power_int(X0,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)))),power_power_int(X1,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,[],[f2103,f1438,f1485,f1438,f1485,f1438,f1438,f1485]) ).
fof(f2626,plain,
~ is_int(one_one_int),
inference(consistent_polarity_flipping,[],[f1148]) ).
fof(f2642,plain,
~ is_int(t),
inference(consistent_polarity_flipping,[],[f1164]) ).
fof(f2643,plain,
~ ord_less_eq_int(one_one_int,t),
inference(consistent_polarity_flipping,[],[f1165]) ).
fof(f2653,plain,
! [X0,X1] :
( ord_less_eq_int(X0,X1)
| is_int(X0)
| X0 = X1
| is_int(X1)
| ord_less_int(X0,X1) ),
inference(consistent_polarity_flipping,[],[f1209]) ).
fof(f3106,definition,
( spl12_6
<=> is_int(one_one_int) ),
introduced(definition,[new_symbols(definition,[spl12_6])],[avatar_definition]) ).
fof(f3107,plain,
( ~ is_int(one_one_int)
| spl12_6 ),
inference(avatar_component_clause,[],[f3106]) ).
fof(f3195,definition,
( spl12_23
<=> plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,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)))),power_power_int(sK3,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))))) ),
introduced(definition,[new_symbols(definition,[spl12_23])],[avatar_definition]) ).
fof(f3197,plain,
( plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) = plus_plus_int(power_power_int(sK2,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)))),power_power_int(sK3,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)))))
| ~ spl12_23 ),
inference(avatar_component_clause,[],[f3195]) ).
fof(f3199,definition,
( spl12_24
<=> ord_less_int(one_one_int,t) ),
introduced(definition,[new_symbols(definition,[spl12_24])],[avatar_definition]) ).
fof(f3202,plain,
( spl12_23
| ~ spl12_24 ),
inference(avatar_split_clause,[],[f2108,f3199,f3195]) ).
fof(f3214,definition,
( spl12_27
<=> plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,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)))),power_power_int(sK1,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))))) ),
introduced(definition,[new_symbols(definition,[spl12_27])],[avatar_definition]) ).
fof(f3216,plain,
( plus_plus_int(times_times_int(number_number_of_int(plus_plus_int(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)),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)))),m),one_one_int) = plus_plus_int(power_power_int(sK0,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)))),power_power_int(sK1,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)))))
| ~ spl12_27 ),
inference(avatar_component_clause,[],[f3214]) ).
fof(f3218,definition,
( spl12_28
<=> one_one_int = t ),
introduced(definition,[new_symbols(definition,[spl12_28])],[avatar_definition]) ).
fof(f3221,plain,
( spl12_27
| ~ spl12_28 ),
inference(avatar_split_clause,[],[f2107,f3218,f3214]) ).
fof(f3234,plain,
~ spl12_6,
inference(avatar_split_clause,[],[f2626,f3106]) ).
fof(f11715,plain,
( is_int(one_one_int)
| one_one_int = t
| is_int(t)
| ord_less_int(one_one_int,t) ),
inference(resolution,[],[f2653,f2643]) ).
fof(f11801,plain,
( one_one_int = t
| is_int(t)
| ord_less_int(one_one_int,t)
| spl12_6 ),
inference(forward_subsumption_resolution,[],[f11715,f3107]) ).
fof(f11885,plain,
( $false
| ~ spl12_23 ),
inference(forward_subsumption_resolution,[],[f3197,f2515]) ).
fof(f11886,plain,
~ spl12_23,
inference(avatar_contradiction_clause,[],[f11885]) ).
fof(f11894,plain,
( $false
| ~ spl12_27 ),
inference(forward_subsumption_resolution,[],[f3216,f2515]) ).
fof(f11895,plain,
~ spl12_27,
inference(avatar_contradiction_clause,[],[f11894]) ).
fof(f11897,plain,
( one_one_int = t
| ord_less_int(one_one_int,t)
| spl12_6 ),
inference(forward_subsumption_resolution,[],[f11801,f2642]) ).
fof(f11899,plain,
( spl12_24
| spl12_28
| spl12_6 ),
inference(avatar_split_clause,[],[f11897,f3106,f3218,f3199]) ).
cnf(s28,plain,
( spl12_23
| ~ spl12_24 ),
inference(sat_conversion,[],[f3202]) ).
cnf(s31,plain,
( spl12_27
| ~ spl12_28 ),
inference(sat_conversion,[],[f3221]) ).
cnf(s37,plain,
~ spl12_6,
inference(sat_conversion,[],[f3234]) ).
cnf(s175,plain,
~ spl12_23,
inference(sat_conversion,[],[f11886]) ).
cnf(s179,plain,
~ spl12_27,
inference(sat_conversion,[],[f11895]) ).
cnf(s181,plain,
( spl12_6
| spl12_24
| spl12_28 ),
inference(sat_conversion,[],[f11899]) ).
cnf(s191,plain,
~ spl12_28,
inference(rat,[],[s31,s179]) ).
cnf(s192,plain,
spl12_24,
inference(rat,[],[s181,s37,s191]) ).
cnf(s196,plain,
$false,
inference(rat,[],[s28,s192,s175]) ).
fof(f11900,plain,
$false,
inference(avatar_sat_refutation,[],[s196]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM926+2 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.38 % Computer : n001.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 21:50:02 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42 Running first-order model finding
% 0.11/0.42 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
% 1.58/0.72 % (3990565)Will run a generic schedule for satisfiability detection.
% 1.58/0.72 % (3990575)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2019487039:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.58/0.72 % (3990571)% WARNING: option uhcvi not known.
% 1.58/0.72 % (3990570)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=394275040_2999 on theBenchmark for (2999ds/0Mi)
% 1.58/0.72 % (3990573)dis+10_1_sil=32000:sp=arity:random_seed=2305021948:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.58/0.72 % (3990571)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1188238667:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.58/0.72 % (3990572)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1900881095:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.58/0.72 % (3990574)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1327304972:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.58/0.72 % (3990576)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2665353915:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.58/0.72 % (3990575)Instruction limit reached!
% 1.58/0.72 % (3990575)------------------------------
% 1.58/0.72 % (3990575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.72 % (3990575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.72 % (3990575)CaDiCaL version: 2.1.3
% 1.58/0.72 % (3990575)Termination reason: Instruction limit
% 1.58/0.72 % (3990575)Termination phase: Saturation
% 1.58/0.72 % (3990575)Time elapsed: 0.036 s
% 1.58/0.72 % (3990575)Peak memory usage: 14 MB
% 1.58/0.72 % (3990575)Instructions burned: 134 (million)
% 1.58/0.72 % (3990584)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1779154998:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.58/0.72 % (3990573)Instruction limit reached!
% 1.58/0.72 % (3990573)------------------------------
% 1.58/0.72 % (3990573)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.72 % (3990573)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.72 % (3990573)CaDiCaL version: 2.1.3
% 1.58/0.72 % (3990573)Termination reason: Instruction limit
% 1.58/0.72 % (3990573)Termination phase: Saturation
% 1.58/0.72 % (3990573)Time elapsed: 0.058 s
% 1.58/0.72 % (3990573)Peak memory usage: 14 MB
% 1.58/0.72 % (3990573)Instructions burned: 103 (million)
% 1.58/0.72 % (3990574)Instruction limit reached!
% 1.58/0.72 % (3990574)------------------------------
% 1.58/0.72 % (3990574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.72 % (3990574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.72 % (3990574)CaDiCaL version: 2.1.3
% 1.58/0.72 % (3990574)Termination reason: Instruction limit
% 1.58/0.72 % (3990574)Termination phase: Saturation
% 1.58/0.72 % (3990574)Time elapsed: 0.063 s
% 1.58/0.72 % (3990574)Peak memory usage: 14 MB
% 1.58/0.72 % (3990574)Instructions burned: 117 (million)
% 1.58/0.72 % (3990586)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1468283479:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.58/0.72 % (3990587)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2765322545:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.58/0.72 % (3990576)Instruction limit reached!
% 1.58/0.72 % (3990576)------------------------------
% 1.58/0.72 % (3990576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.72 % (3990576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.72 % (3990576)CaDiCaL version: 2.1.3
% 1.58/0.72 % (3990576)Termination reason: Instruction limit
% 1.58/0.72 % (3990576)Termination phase: Saturation
% 1.58/0.72 % (3990576)Time elapsed: 0.093 s
% 1.58/0.72 % (3990576)Peak memory usage: 15 MB
% 1.58/0.72 % (3990576)Instructions burned: 160 (million)
% 1.58/0.72 % (3990590)ott-21_1_sil=16000:fs=off:random_seed=181705:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.58/0.72 % TRYING [1]
% 1.58/0.72 % (3990586)Instruction limit reached!
% 1.58/0.72 % (3990586)------------------------------
% 1.58/0.72 % (3990586)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.72 % (3990586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.73 % (3990586)CaDiCaL version: 2.1.3
% 1.58/0.73 % (3990586)Termination reason: Instruction limit
% 1.58/0.73 % (3990586)Termination phase: Saturation
% 1.58/0.73 % (3990586)Time elapsed: 0.074 s
% 1.58/0.73 % (3990586)Peak memory usage: 14 MB
% 1.58/0.73 % (3990586)Instructions burned: 133 (million)
% 1.58/0.73 % TRYING [2]
% 1.58/0.73 % (3990592)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2586852017:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.58/0.73 % TRYING [3]
% 1.58/0.73 % (3990590)Instruction limit reached!
% 1.58/0.73 % (3990590)------------------------------
% 1.58/0.73 % (3990590)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.73 % (3990590)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.73 % (3990590)CaDiCaL version: 2.1.3
% 1.58/0.73 % (3990590)Termination reason: Instruction limit
% 1.58/0.73 % (3990590)Termination phase: Saturation
% 1.58/0.73 % (3990590)Time elapsed: 0.087 s
% 1.58/0.73 % (3990590)Peak memory usage: 14 MB
% 1.58/0.73 % (3990590)Instructions burned: 181 (million)
% 1.58/0.73 % (3990584)Instruction limit reached!
% 1.58/0.73 % (3990584)------------------------------
% 1.58/0.73 % (3990584)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.73 % (3990584)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.73 % (3990584)CaDiCaL version: 2.1.3
% 1.58/0.73 % (3990584)Termination reason: Instruction limit
% 1.58/0.73 % (3990584)Termination phase: Finite model building constraint generation
% 1.58/0.73 % (3990584)Time elapsed: 0.164 s
% 1.58/0.73 % (3990584)Peak memory usage: 27 MB
% 1.58/0.73 % (3990584)Instructions burned: 720 (million)
% 1.58/0.73 % TRYING [1]
% 1.58/0.73 % TRYING [2]
% 1.58/0.73 % (3990595)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=241805290:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 1.58/0.73 % (3990594)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3439715131:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.58/0.73 % (3990571) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3990565-3990571"...
% 1.58/0.73 % (3990571)...printing done.
% 1.58/0.73 % (3990571)Refutation found. Thanks to Tanya!
% 1.58/0.73 % SZS status Theorem for theBenchmark
% 1.58/0.73 % SZS output start Proof for theBenchmark
% See solution above
% 1.58/0.73 % (3990571)------------------------------
% 1.58/0.73 % (3990571)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.58/0.73 % (3990571)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.58/0.73 % (3990571)CaDiCaL version: 2.1.3
% 1.58/0.73 % (3990571)Termination reason: Refutation
% 1.58/0.73 % (3990571)Time elapsed: 0.237 s
% 1.58/0.73 % (3990571)Peak memory usage: 18 MB
% 1.58/0.73 % (3990571)Instructions burned: 406 (million)
% 1.58/0.73 % (3990565)Success in time 0.298 s
% 1.58/0.73 % Vampire exiting
%------------------------------------------------------------------------------