%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM944_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n004.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:16 PM UTC 2026
% Result : Theorem 0.17s 0.47s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 7
% Syntax : Number of formulae : 30 ( 26 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 24 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 18 ( 14 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 8 ( 8 !; 0 ?; 8 :)
% 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,
min: int ).
tff(func_def_6,type,
pls: int ).
tff(func_def_7,type,
number_number_of:
!>[X0: $tType] : ( int > X0 ) ).
tff(func_def_8,type,
legendre: ( int * int ) > int ).
tff(func_def_9,type,
fFalse: bool ).
tff(func_def_10,type,
fTrue: bool ).
tff(func_def_11,type,
m: int ).
tff(pred_def_1,type,
number:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
number_ring:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
number_semiring:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
zprime: int > $o ).
tff(pred_def_9,type,
quadRes: ( int * int ) > $o ).
tff(pred_def_10,type,
pp: bool > $o ).
tff(f1,axiom,
legendre(number_number_of(int,min),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_0__096Legendre_A_N1_A_I4_A_K_Am_A_L_A1_J_A_061_A1_096) ).
tff(f2,axiom,
( ~ quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min))
=> ( legendre(number_number_of(int,min),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_1__096_126_AQuadRes_A_I4_A_K_Am_A_L_A1_J_A_N1_A_061_061_062_ALegendre_A_N1_A_I4_A_K_Am_A_L_A1_J_A_126_061_A1_096) ).
tff(f38,axiom,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_37_number__of__is__id) ).
tff(f39,axiom,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_38_add__Pls__right) ).
tff(f41,axiom,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_40_Bit0__def) ).
tff(f51,axiom,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_50_Bit1__def) ).
tff(f112,conjecture,
quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f113,negated_conjecture,
~ quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)),
inference(negated_conjecture,[status(cth)],[f112]) ).
tff(f114,plain,
~ quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)),
inference(flattening,[],[f113]) ).
tff(f115,plain,
( ( legendre(number_number_of(int,min),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))) != one_one(int) )
| quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)) ),
inference(ennf_transformation,[],[f2]) ).
tff(f173,plain,
one_one(int) = legendre(number_number_of(int,min),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),
inference(cnf_transformation,[],[f1]) ).
tff(f174,plain,
( quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min))
| ( one_one(int) != legendre(number_number_of(int,min),plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))) ) ),
inference(cnf_transformation,[],[f115]) ).
tff(f216,plain,
! [X0: int] : ( number_number_of(int,X0) = X0 ),
inference(cnf_transformation,[],[f38]) ).
tff(f217,plain,
! [X0: int] : ( plus_plus(int,X0,pls) = X0 ),
inference(cnf_transformation,[],[f39]) ).
tff(f219,plain,
! [X0: int] : ( bit0(X0) = plus_plus(int,X0,X0) ),
inference(cnf_transformation,[],[f41]) ).
tff(f229,plain,
! [X0: int] : ( bit1(X0) = plus_plus(int,plus_plus(int,one_one(int),X0),X0) ),
inference(cnf_transformation,[],[f51]) ).
tff(f301,plain,
~ quadRes(plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),number_number_of(int,min)),
inference(cnf_transformation,[],[f114]) ).
tff(f302,plain,
one_one(int) = legendre(number_number_of(int,min),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))),
inference(definition_unfolding,[],[f173,f219,f219,f229]) ).
tff(f303,plain,
( quadRes(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)),number_number_of(int,min))
| ( one_one(int) != legendre(number_number_of(int,min),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))) ) ),
inference(definition_unfolding,[],[f174,f219,f219,f229,f219,f219,f229]) ).
tff(f353,plain,
~ quadRes(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)),number_number_of(int,min)),
inference(definition_unfolding,[],[f301,f219,f219,f229]) ).
tff(f376,plain,
one_one(int) != legendre(number_number_of(int,min),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))),
inference(forward_subsumption_resolution,[],[f303,f353]) ).
tff(f377,plain,
one_one(int) = legendre(number_number_of(int,min),plus_plus(int,times_times(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))),
inference(forward_demodulation,[],[f302,f216]) ).
tff(f382,plain,
one_one(int) != legendre(number_number_of(int,min),plus_plus(int,times_times(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))),
inference(forward_demodulation,[],[f376,f216]) ).
tff(f383,plain,
one_one(int) = legendre(number_number_of(int,min),plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)),plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls))),m),one_one(int))),
inference(forward_demodulation,[],[f377,f217]) ).
tff(f385,plain,
one_one(int) != legendre(number_number_of(int,min),plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls)),plus_plus(int,plus_plus(int,one_one(int),pls),plus_plus(int,one_one(int),pls))),m),one_one(int))),
inference(forward_demodulation,[],[f382,f217]) ).
tff(f386,plain,
one_one(int) = legendre(number_number_of(int,min),plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,one_one(int),one_one(int)),plus_plus(int,one_one(int),one_one(int))),m),one_one(int))),
inference(forward_demodulation,[],[f383,f217]) ).
tff(f387,plain,
one_one(int) != legendre(number_number_of(int,min),plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,one_one(int),one_one(int)),plus_plus(int,one_one(int),one_one(int))),m),one_one(int))),
inference(forward_demodulation,[],[f385,f217]) ).
tff(f388,plain,
one_one(int) = legendre(min,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,one_one(int),one_one(int)),plus_plus(int,one_one(int),one_one(int))),m),one_one(int))),
inference(forward_demodulation,[],[f386,f216]) ).
tff(f389,plain,
one_one(int) != legendre(min,plus_plus(int,times_times(int,plus_plus(int,plus_plus(int,one_one(int),one_one(int)),plus_plus(int,one_one(int),one_one(int))),m),one_one(int))),
inference(forward_demodulation,[],[f387,f216]) ).
tff(f390,plain,
$false,
inference(forward_subsumption_resolution,[],[f389,f388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM944_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.38 % Computer : n004.cluster.edu
% 0.09/0.38 % Model : x86_64 x86_64
% 0.09/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38 % Memory : 8046.5625MB
% 0.09/0.38 % OS : Linux 6.8.0-71-generic
% 0.09/0.38 % CPULimit : 300
% 0.09/0.38 % WCLimit : 300
% 0.09/0.38 % DateTime : Sun Sep 27 21:47:07 UTC 2026
% 0.09/0.39 % CPUTime :
% 0.09/0.39 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.42 Running first-order model finding
% 0.09/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
% 0.17/0.47 % (3907792)Will run a generic schedule for satisfiability detection.
% 0.17/0.47 % (3907801)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3139445499:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47 % (3907798)% WARNING: option uhcvi not known.
% 0.17/0.47 % (3907801) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3907792-3907801"...
% 0.17/0.47 % (3907801)...printing done.
% 0.17/0.47 % (3907801)Refutation found. Thanks to Tanya!
% 0.17/0.47 % SZS status Theorem for theBenchmark
% 0.17/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47 % (3907801)------------------------------
% 0.17/0.47 % (3907801)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47 % (3907801)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47 % (3907801)CaDiCaL version: 2.1.3
% 0.17/0.47 % (3907801)Termination reason: Refutation
% 0.17/0.47 % (3907801)Time elapsed: 0.004 s
% 0.17/0.47 % (3907801)Peak memory usage: 12 MB
% 0.17/0.47 % (3907801)Instructions burned: 14 (million)
% 0.17/0.47 % (3907792)Success in time 0.045 s
% 0.17/0.47 % Vampire exiting
%------------------------------------------------------------------------------