%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : NUM991_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:20 PM UTC 2026
% Result : Theorem 0.11s 0.47s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 18 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 6 con; 0-4 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
int: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
fun: ( $tType * $tType ) > $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,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
if:
!>[X0: $tType] : ( ( bool * X0 * X0 ) > X0 ) ).
tff(func_def_4,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_5,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_6,type,
fFalse: bool ).
tff(func_def_7,type,
fTrue: bool ).
tff(func_def_8,type,
m1: int ).
tff(func_def_9,type,
n: nat ).
tff(func_def_10,type,
t: int ).
tff(func_def_11,type,
tn: nat ).
tff(func_def_12,type,
sK0: int > nat ).
tff(func_def_13,type,
sK1: ( fun(int,bool) * int ) > int ).
tff(func_def_14,type,
sK2: ( nat * nat ) > nat ).
tff(pred_def_1,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
ordere216010020id_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
ordere223160158up_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
pp: bool > $o ).
tff(f1,axiom,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_n1pos) ).
tff(f134,conjecture,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f135,negated_conjecture,
~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(negated_conjecture,[status(cth)],[f134]) ).
tff(f136,plain,
~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(flattening,[],[f135]) ).
tff(f240,plain,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(cnf_transformation,[],[f1]) ).
tff(f418,plain,
~ ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(cnf_transformation,[],[f136]) ).
tff(f424,plain,
$false,
inference(forward_subsumption_resolution,[],[f240,f418]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM991_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n011.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 27 21:49:30 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.47 % (2790325)Will run a generic schedule for satisfiability detection.
% 0.11/0.47 % (2790330)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1598661455_2999 on theBenchmark for (2999ds/0Mi)
% 0.11/0.47 % Exception at run slice level
% 0.11/0.47 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.11/0.47 % (2790331)% WARNING: option uhcvi not known.
% 0.11/0.47 % (2790333)dis+10_1_sil=32000:sp=arity:random_seed=2773352023:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.11/0.47 % (2790335)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=556674014:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.11/0.47 % (2790332)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2706534421:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.11/0.47 % (2790336)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2879880804:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.47 % (2790334)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3201380606:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.11/0.47 % (2790331)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3088560023:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.11/0.47 % (2790332) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2790325-2790332"...
% 0.11/0.47 % (2790335) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2790325-2790335"...
% 0.11/0.47 % (2790335)...printing done.
% 0.11/0.47 % (2790338)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=213207977:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.11/0.47 % (2790332)...printing done.
% 0.11/0.47 % (2790335)Refutation found. Thanks to Tanya!
% 0.11/0.47 % SZS status Theorem for theBenchmark
% 0.11/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.47 % (2790335)------------------------------
% 0.11/0.47 % (2790335)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.47 % (2790335)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.47 % (2790335)CaDiCaL version: 2.1.3
% 0.11/0.47 % (2790335)Termination reason: Refutation
% 0.11/0.47 % (2790335)Time elapsed: 0.009 s
% 0.11/0.47 % (2790335)Peak memory usage: 11 MB
% 0.11/0.47 % (2790335)Instructions burned: 8 (million)
% 0.11/0.47 % (2790325)Success in time 0.05 s
% 0.11/0.47 % Vampire exiting
%------------------------------------------------------------------------------