%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : NUM933_5 : TPTP v9.3.1. Released v6.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 12:17:38 PM UTC 2026
% Result : ContradictoryAxioms 3.01s 1.40s
% Output : Refutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 21
% Syntax : Number of formulae : 94 ( 58 unt; 0 typ; 2 def)
% Number of atoms : 157 ( 45 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 105 ( 42 ~; 49 |; 3 &)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 23 ( 21 usr; 3 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 75 ( 0 sgn 75 !; 0 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_3,type,
bit0: int > int ).
tff(func_def_4,type,
bit1: int > int ).
tff(func_def_5,type,
pls: int ).
tff(func_def_6,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_7,type,
fFalse: bool ).
tff(func_def_8,type,
fTrue: bool ).
tff(func_def_9,type,
m: int ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
comm_monoid_mult:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ab_semigroup_mult:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ordere779506340up_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
zprime: int > $o ).
tff(pred_def_17,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
twoSqu1567020053sum2sq: int > $o ).
tff(pred_def_19,type,
pp: bool > $o ).
tff(f1,axiom,
~ ord_less_eq(int,one_one(int),m),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__096_126_A1_A_060_061_Am_096) ).
tff(f2,axiom,
zprime(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_p) ).
tff(f3,axiom,
ord_less_eq(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__0964_A_K_Am_A_L_A1_A_060_061_A1_096) ).
tff(f12,axiom,
! [X0: int,X1: int] : ( plus_plus(int,bit0(X1),bit1(X0)) = bit1(plus_plus(int,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_11_add__Bit0__Bit1) ).
tff(f13,axiom,
! [X0: int,X1: int] : ( plus_plus(int,bit1(X1),bit0(X0)) = bit1(plus_plus(int,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_12_add__Bit1__Bit0) ).
tff(f21,axiom,
! [X0: int,X1: int] : ( bit1(X1) != bit0(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_20_rel__simps_I50_J) ).
tff(f26,axiom,
! [X0: int,X1: int] :
( ord_less_eq(int,bit1(X1),bit1(X0))
<=> ord_less_eq(int,X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_25_rel__simps_I34_J) ).
tff(f28,axiom,
! [X0: int,X1: int] :
( ord_less_eq(int,bit0(X1),bit0(X0))
<=> ord_less_eq(int,X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_rel__simps_I31_J) ).
tff(f30,axiom,
! [X0: int,X1: int] : ( times_times(int,bit0(X1),X0) = bit0(times_times(int,X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_29_mult__Bit0) ).
tff(f42,axiom,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_41_number__of__is__id) ).
tff(f45,axiom,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_44_add__Pls__right) ).
tff(f46,axiom,
! [X0: int] : ( plus_plus(int,pls,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_45_add__Pls) ).
tff(f58,axiom,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_57_Bit1__def) ).
tff(f63,axiom,
one_one(int) = number_number_of(int,bit1(pls)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_62_one__is__num__one) ).
tff(f71,axiom,
! [X0: int] :
( zprime(X0)
=> ( ( X0 != number_number_of(int,bit0(bit1(pls))) )
=> ( ( X0 != number_number_of(int,bit1(bit1(pls))) )
=> ord_less_eq(int,number_number_of(int,bit1(bit0(bit1(pls)))),X0) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_70_prime__g__5) ).
tff(f77,axiom,
! [X0: $tType] :
( ordere236663937imp_le(X0)
=> ! [X1: X0,X2: X0,X3: X0] :
( ord_less_eq(X0,plus_plus(X0,X3,X2),plus_plus(X0,X3,X1))
<=> ord_less_eq(X0,X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_76_add__le__cancel__left) ).
tff(f94,axiom,
! [X0: $tType] :
( monoid_mult(X0)
=> ! [X1: X0] : ( times_times(X0,one_one(X0),X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_93_mult__1__left) ).
tff(f98,axiom,
ordere236663937imp_le(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Groups_Oordered__ab__semigroup__add__imp__le) ).
tff(f107,axiom,
monoid_mult(int),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Int_Oint___Groups_Omonoid__mult) ).
tff(f167,plain,
! [X0: int] :
( ord_less_eq(int,number_number_of(int,bit1(bit0(bit1(pls)))),X0)
| ( number_number_of(int,bit1(bit1(pls))) = X0 )
| ( number_number_of(int,bit0(bit1(pls))) = X0 )
| ~ zprime(X0) ),
inference(ennf_transformation,[],[f71]) ).
tff(f168,plain,
! [X0: int] :
( ord_less_eq(int,number_number_of(int,bit1(bit0(bit1(pls)))),X0)
| ( number_number_of(int,bit1(bit1(pls))) = X0 )
| ( number_number_of(int,bit0(bit1(pls))) = X0 )
| ~ zprime(X0) ),
inference(flattening,[],[f167]) ).
tff(f174,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] :
( ord_less_eq(X0,plus_plus(X0,X3,X2),plus_plus(X0,X3,X1))
<=> ord_less_eq(X0,X2,X1) )
| ~ ordere236663937imp_le(X0) ),
inference(ennf_transformation,[],[f77]) ).
tff(f190,plain,
! [X0: $tType] :
( ! [X1: X0] : ( times_times(X0,one_one(X0),X1) = X1 )
| ~ monoid_mult(X0) ),
inference(ennf_transformation,[],[f94]) ).
tff(f203,plain,
! [X0: int,X1: int] :
( ( ord_less_eq(int,bit1(X1),bit1(X0))
| ~ ord_less_eq(int,X1,X0) )
& ( ord_less_eq(int,X1,X0)
| ~ ord_less_eq(int,bit1(X1),bit1(X0)) ) ),
inference(nnf_transformation,[],[f26]) ).
tff(f204,plain,
! [X0: int,X1: int] :
( ( ord_less_eq(int,bit0(X1),bit0(X0))
| ~ ord_less_eq(int,X1,X0) )
& ( ord_less_eq(int,X1,X0)
| ~ ord_less_eq(int,bit0(X1),bit0(X0)) ) ),
inference(nnf_transformation,[],[f28]) ).
tff(f215,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0,X3: X0] :
( ( ord_less_eq(X0,plus_plus(X0,X3,X2),plus_plus(X0,X3,X1))
| ~ ord_less_eq(X0,X2,X1) )
& ( ord_less_eq(X0,X2,X1)
| ~ ord_less_eq(X0,plus_plus(X0,X3,X2),plus_plus(X0,X3,X1)) ) )
| ~ ordere236663937imp_le(X0) ),
inference(nnf_transformation,[],[f174]) ).
tff(f220,plain,
~ ord_less_eq(int,one_one(int),m),
inference(cnf_transformation,[],[f1]) ).
tff(f221,plain,
zprime(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f2]) ).
tff(f222,plain,
ord_less_eq(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),one_one(int)),
inference(cnf_transformation,[],[f3]) ).
tff(f233,plain,
! [X0: int,X1: int] : ( plus_plus(int,bit0(X1),bit1(X0)) = bit1(plus_plus(int,X1,X0)) ),
inference(cnf_transformation,[],[f12]) ).
tff(f234,plain,
! [X0: int,X1: int] : ( bit1(plus_plus(int,X1,X0)) = plus_plus(int,bit1(X1),bit0(X0)) ),
inference(cnf_transformation,[],[f13]) ).
tff(f247,plain,
! [X0: int,X1: int] : ( bit1(X1) != bit0(X0) ),
inference(cnf_transformation,[],[f21]) ).
tff(f254,plain,
! [X0: int,X1: int] :
( ~ ord_less_eq(int,bit1(X1),bit1(X0))
| ord_less_eq(int,X1,X0) ),
inference(cnf_transformation,[],[f203]) ).
tff(f257,plain,
! [X0: int,X1: int] :
( ~ ord_less_eq(int,bit0(X1),bit0(X0))
| ord_less_eq(int,X1,X0) ),
inference(cnf_transformation,[],[f204]) ).
tff(f260,plain,
! [X0: int,X1: int] : ( bit0(times_times(int,X1,X0)) = times_times(int,bit0(X1),X0) ),
inference(cnf_transformation,[],[f30]) ).
tff(f276,plain,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
inference(cnf_transformation,[],[f42]) ).
tff(f281,plain,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f45]) ).
tff(f282,plain,
! [X0: int] : ( plus_plus(int,pls,X0) = X0 ),
inference(cnf_transformation,[],[f46]) ).
tff(f296,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
inference(cnf_transformation,[],[f58]) ).
tff(f301,plain,
one_one(int) = number_number_of(int,bit1(pls)),
inference(cnf_transformation,[],[f63]) ).
tff(f309,plain,
! [X0: int] :
( ord_less_eq(int,number_number_of(int,bit1(bit0(bit1(pls)))),X0)
| ( number_number_of(int,bit1(bit1(pls))) = X0 )
| ( number_number_of(int,bit0(bit1(pls))) = X0 )
| ~ zprime(X0) ),
inference(cnf_transformation,[],[f168]) ).
tff(f318,plain,
! [X0: $tType,X2: X0,X3: X0,X1: X0] :
( ~ ordere236663937imp_le(X0)
| ~ ord_less_eq(X0,X2,X1)
| ord_less_eq(X0,plus_plus(X0,X3,X2),plus_plus(X0,X3,X1)) ),
inference(cnf_transformation,[],[f215]) ).
tff(f339,plain,
! [X0: $tType,X1: X0] :
( ( times_times(X0,one_one(X0),X1) = X1 )
| ~ monoid_mult(X0) ),
inference(cnf_transformation,[],[f190]) ).
tff(f343,plain,
ordere236663937imp_le(int),
inference(cnf_transformation,[],[f98]) ).
tff(f352,plain,
monoid_mult(int),
inference(cnf_transformation,[],[f107]) ).
tff(f389,plain,
one_one(int) = bit1(pls),
inference(forward_demodulation,[],[f301,f276]) ).
tff(f390,plain,
~ ord_less_eq(int,bit1(pls),m),
inference(superposition,[],[f220,f389]) ).
tff(f403,plain,
! [X0: int] :
( ( times_times(int,bit1(pls),X0) = X0 )
| ~ monoid_mult(int) ),
inference(superposition,[],[f339,f389]) ).
tff(f404,plain,
! [X0: int] : ( times_times(int,bit1(pls),X0) = X0 ),
inference(forward_subsumption_resolution,[],[f403,f352]) ).
tff(f433,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,bit1(pls),X0),X0) ),
inference(forward_demodulation,[],[f296,f389]) ).
tff(f485,plain,
zprime(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls))),
inference(forward_demodulation,[],[f221,f389]) ).
tff(f486,plain,
zprime(plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls))),
inference(forward_demodulation,[],[f485,f276]) ).
tff(f487,plain,
zprime(plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls))),
inference(forward_demodulation,[],[f486,f260]) ).
tff(f488,plain,
zprime(bit1(plus_plus(int,times_times(int,bit0(bit1(pls)),m),pls))),
inference(forward_demodulation,[],[f487,f233]) ).
tff(f489,plain,
zprime(bit1(times_times(int,bit0(bit1(pls)),m))),
inference(forward_demodulation,[],[f488,f281]) ).
tff(f490,plain,
zprime(bit1(bit0(times_times(int,bit1(pls),m)))),
inference(forward_demodulation,[],[f489,f260]) ).
tff(f491,plain,
zprime(bit1(bit0(m))),
inference(forward_demodulation,[],[f490,f404]) ).
tff(f681,plain,
! [X2: int,X0: int,X1: int] :
( ~ ord_less_eq(int,X0,X1)
| ord_less_eq(int,plus_plus(int,X2,X0),plus_plus(int,X2,X1)) ),
inference(resolution,[],[f318,f343]) ).
tff(f736,plain,
ord_less_eq(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),bit1(pls)),bit1(pls)),
inference(forward_demodulation,[],[f222,f389]) ).
tff(f737,plain,
ord_less_eq(int,plus_plus(int,times_times(int,bit0(bit0(bit1(pls))),m),bit1(pls)),bit1(pls)),
inference(forward_demodulation,[],[f736,f276]) ).
tff(f738,plain,
ord_less_eq(int,plus_plus(int,bit0(times_times(int,bit0(bit1(pls)),m)),bit1(pls)),bit1(pls)),
inference(forward_demodulation,[],[f737,f260]) ).
tff(f739,plain,
ord_less_eq(int,bit1(plus_plus(int,times_times(int,bit0(bit1(pls)),m),pls)),bit1(pls)),
inference(forward_demodulation,[],[f738,f233]) ).
tff(f740,plain,
ord_less_eq(int,bit1(times_times(int,bit0(bit1(pls)),m)),bit1(pls)),
inference(forward_demodulation,[],[f739,f281]) ).
tff(f741,plain,
ord_less_eq(int,bit1(bit0(times_times(int,bit1(pls),m))),bit1(pls)),
inference(forward_demodulation,[],[f740,f260]) ).
tff(f742,plain,
ord_less_eq(int,bit1(bit0(m)),bit1(pls)),
inference(forward_demodulation,[],[f741,f404]) ).
tff(f743,plain,
ord_less_eq(int,bit0(m),pls),
inference(resolution,[],[f742,f254]) ).
tff(f1017,plain,
! [X0: int] :
( ord_less_eq(int,bit1(bit0(bit1(pls))),X0)
| ( number_number_of(int,bit1(bit1(pls))) = X0 )
| ( number_number_of(int,bit0(bit1(pls))) = X0 )
| ~ zprime(X0) ),
inference(forward_demodulation,[],[f309,f276]) ).
tff(f1018,plain,
! [X0: int] :
( ( bit1(bit1(pls)) = X0 )
| ord_less_eq(int,bit1(bit0(bit1(pls))),X0)
| ( number_number_of(int,bit0(bit1(pls))) = X0 )
| ~ zprime(X0) ),
inference(forward_demodulation,[],[f1017,f276]) ).
tff(f1019,plain,
! [X0: int] :
( ord_less_eq(int,bit1(bit0(bit1(pls))),X0)
| ( bit1(bit1(pls)) = X0 )
| ( bit0(bit1(pls)) = X0 )
| ~ zprime(X0) ),
inference(forward_demodulation,[],[f1018,f276]) ).
tff(f1021,plain,
! [X0: int] :
( ( bit1(X0) = bit1(bit1(pls)) )
| ( bit0(bit1(pls)) = bit1(X0) )
| ~ zprime(bit1(X0))
| ord_less_eq(int,bit0(bit1(pls)),X0) ),
inference(resolution,[],[f1019,f254]) ).
tff(f1022,plain,
! [X0: int] :
( ~ zprime(bit1(X0))
| ( bit1(X0) = bit1(bit1(pls)) )
| ord_less_eq(int,bit0(bit1(pls)),X0) ),
inference(forward_subsumption_resolution,[],[f1021,f247]) ).
tff(f1116,plain,
! [X0: int] : ord_less_eq(int,plus_plus(int,X0,bit0(m)),plus_plus(int,X0,pls)),
inference(resolution,[],[f681,f743]) ).
tff(f1131,plain,
! [X0: int] : ord_less_eq(int,plus_plus(int,X0,bit0(m)),X0),
inference(forward_demodulation,[],[f1116,f281]) ).
tff(f1198,plain,
ord_less_eq(int,bit1(bit0(m)),plus_plus(int,bit1(pls),bit0(m))),
inference(superposition,[],[f1131,f433]) ).
tff(f1204,plain,
ord_less_eq(int,bit1(bit0(m)),bit1(plus_plus(int,pls,m))),
inference(forward_demodulation,[],[f1198,f234]) ).
tff(f1206,plain,
ord_less_eq(int,bit1(bit0(m)),bit1(m)),
inference(forward_demodulation,[],[f1204,f282]) ).
tff(f1422,plain,
( ( bit1(bit1(pls)) = bit1(bit0(m)) )
| ord_less_eq(int,bit0(bit1(pls)),bit0(m)) ),
inference(resolution,[],[f1022,f491]) ).
tff(f1424,definition,
( spl0_9
<=> ord_less_eq(int,bit0(bit1(pls)),bit0(m)) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
tff(f1426,plain,
( ord_less_eq(int,bit0(bit1(pls)),bit0(m))
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f1424]) ).
tff(f1428,definition,
( spl0_10
<=> ( bit1(bit1(pls)) = bit1(bit0(m)) ) ),
introduced(definition,[new_symbols(definition,[spl0_10])],[avatar_definition]) ).
tff(f1430,plain,
( ( bit1(bit1(pls)) = bit1(bit0(m)) )
| ~ spl0_10 ),
inference(avatar_component_clause,[],[f1428]) ).
tff(f1431,plain,
( spl0_9
| spl0_10 ),
inference(avatar_split_clause,[],[f1422,f1428,f1424]) ).
tff(f1521,plain,
( ord_less_eq(int,bit1(pls),m)
| ~ spl0_9 ),
inference(resolution,[],[f1426,f257]) ).
tff(f1524,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1521,f390]) ).
tff(f1525,plain,
~ spl0_9,
inference(avatar_contradiction_clause,[],[f1524]) ).
tff(f1571,plain,
( ord_less_eq(int,bit1(bit1(pls)),bit1(m))
| ~ spl0_10 ),
inference(superposition,[],[f1206,f1430]) ).
tff(f2143,plain,
( ord_less_eq(int,bit1(pls),m)
| ~ spl0_10 ),
inference(resolution,[],[f1571,f254]) ).
tff(f2147,plain,
( $false
| ~ spl0_10 ),
inference(forward_subsumption_resolution,[],[f2143,f390]) ).
tff(f2148,plain,
~ spl0_10,
inference(avatar_contradiction_clause,[],[f2147]) ).
cnf(s6,plain,
( spl0_9
| spl0_10 ),
inference(sat_conversion,[],[f1431]) ).
cnf(s7,plain,
~ spl0_9,
inference(sat_conversion,[],[f1525]) ).
cnf(s16,plain,
~ spl0_10,
inference(sat_conversion,[],[f2148]) ).
cnf(s17,plain,
$false,
inference(rat,[],[s6,s16,s7]) ).
tff(f2149,plain,
$false,
inference(avatar_sat_refutation,[],[s17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM933_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 % Computer : n020.cluster.edu
% 0.11/0.40 % Model : x86_64 x86_64
% 0.11/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.40 % Memory : 8046.5625MB
% 0.11/0.40 % OS : Linux 6.8.0-71-generic
% 0.11/0.40 % CPULimit : 300
% 0.11/0.41 % WCLimit : 300
% 0.11/0.41 % DateTime : Sun Sep 27 21:46:19 UTC 2026
% 0.11/0.41 % CPUTime :
% 0.11/0.41 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.44 Running first-order theorem proving
% 0.11/0.44 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.01/1.40 % (3786018)Detected formulas, will run a generic FOF schedule.
% 3.01/1.40 % (3786026)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=698676998:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.01/1.40 % (3786026)Refutation not found, incomplete strategy
% 3.01/1.40 % (3786026)------------------------------
% 3.01/1.40 % (3786026)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.40 % (3786026)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.40 % (3786026)CaDiCaL version: 2.1.3
% 3.01/1.40 % (3786026)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.40 % (3786026)Time elapsed: 0.001 s
% 3.01/1.40 % (3786026)Peak memory usage: 87 MB
% 3.01/1.40 % (3786024)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=2633545107:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.01/1.40 % (3786023)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=1466735436:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.01/1.40 % (3786025)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=3140761611:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.01/1.40 % (3786027)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3688570615:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.01/1.40 % (3786029)dis-21_1_sil=8000:lcm=predicate:random_seed=1181562738: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.01/1.40 % (3786027)Refutation not found, incomplete strategy
% 3.01/1.40 % (3786027)------------------------------
% 3.01/1.40 % (3786027)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.40 % (3786027)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.40 % (3786027)CaDiCaL version: 2.1.3
% 3.01/1.40 % (3786027)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.40 % (3786027)Time elapsed: 0.001 s
% 3.01/1.40 % (3786027)Peak memory usage: 86 MB
% 3.01/1.40 % (3786025)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.01/1.40 % (3786028)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=772690243:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.01/1.40 % (3786029)Instruction limit reached!
% 3.01/1.40 % (3786029)------------------------------
% 3.01/1.40 % (3786029)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.40 % (3786029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.40 % (3786029)CaDiCaL version: 2.1.3
% 3.01/1.40 % (3786029)Termination reason: Instruction limit
% 3.01/1.40 % (3786029)Termination phase: Saturation
% 3.01/1.40 % (3786029)Time elapsed: 0.061 s
% 3.01/1.40 % (3786029)Peak memory usage: 89 MB
% 3.01/1.40 % (3786029)Instructions burned: 130 (million)
% 3.01/1.40 % (3786028)First to succeed.
% 3.01/1.40 % (3786028)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3786018"
% 3.01/1.40 % (3786026)------------------------------
% 3.01/1.40 % (3786026)------------------------------
% 3.01/1.40 % (3786037)lrs+10_1_sil=8000:sp=occurrence:random_seed=2773308812:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.01/1.40 % (3786037)Refutation not found, incomplete strategy
% 3.01/1.40 % (3786037)------------------------------
% 3.01/1.40 % (3786037)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.40 % (3786037)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.40 % (3786037)CaDiCaL version: 2.1.3
% 3.01/1.40 % (3786037)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.40 % (3786037)Time elapsed: 0.001 s
% 3.01/1.40 % (3786037)Peak memory usage: 87 MB
% 3.01/1.40 % (3786027)------------------------------
% 3.01/1.40 % (3786027)------------------------------
% 3.01/1.40 % (3786038)lrs+10_1_sil=32000:urr=on:br=off:random_seed=1453490586:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.01/1.40 % (3786038)Refutation not found, incomplete strategy
% 3.01/1.40 % (3786038)------------------------------
% 3.01/1.40 % (3786038)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.40 % (3786038)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.40 % (3786038)CaDiCaL version: 2.1.3
% 3.01/1.40 % (3786038)Termination reason: Refutation not found, incomplete strategy
% 3.01/1.40 % (3786038)Time elapsed: 0.001 s
% 3.01/1.40 % (3786038)Peak memory usage: 87 MB
% 3.01/1.40 % (3786038)Instructions burned: 1 (million)
% 3.01/1.40 % (3786028)Refutation found. Thanks to Tanya!
% 3.01/1.40 % SZS status ContradictoryAxioms for theBenchmark
% 3.01/1.40 % SZS output start Proof for theBenchmark
% See solution above
% 4.13/1.59 % (3786028)------------------------------
% 4.13/1.59 % (3786028)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 4.13/1.59 % (3786028)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.13/1.59 % (3786028)CaDiCaL version: 2.1.3
% 4.13/1.59 % (3786028)Termination reason: Refutation
% 4.13/1.59 % (3786028)Time elapsed: 0.058 s
% 4.13/1.59 % (3786028)Peak memory usage: 91 MB
% 4.13/1.59 % (3786028)Instructions burned: 89 (million)
% 4.13/1.59 % (3786028)------------------------------
% 4.13/1.59 % (3786028)------------------------------
% 4.13/1.59 % (3786018)Success in time 0.508 s
% 4.13/1.59 % Vampire exiting
%------------------------------------------------------------------------------