%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW490_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 : n026.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 01:40:19 PM UTC 2026
% Result : Theorem 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 10 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 2 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-2 aty)
% Number of functors : 36 ( 36 usr; 3 con; 0-5 aty)
% Number of variables : 9 ( 9 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
poly: $tType > $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
fundam296178794t_poly:
!>[X0: $tType] : ( ( poly(X0) * X0 ) > poly(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,
suc: nat > nat ).
tff(func_def_5,type,
nat_case:
!>[X0: $tType] : ( ( X0 * fun(nat,X0) ) > fun(nat,X0) ) ).
tff(func_def_6,type,
semiri532925092at_aux:
!>[X0: $tType] : ( ( fun(X0,X0) * nat * X0 ) > X0 ) ).
tff(func_def_7,type,
abs_poly:
!>[X0: $tType] : ( fun(nat,X0) > poly(X0) ) ).
tff(func_def_8,type,
coeff:
!>[X0: $tType] : ( poly(X0) > fun(nat,X0) ) ).
tff(func_def_9,type,
degree:
!>[X0: $tType] : ( poly(X0) > nat ) ).
tff(func_def_10,type,
monom:
!>[X0: $tType] : ( ( X0 * nat ) > poly(X0) ) ).
tff(func_def_11,type,
order:
!>[X0: $tType] : ( ( X0 * poly(X0) ) > nat ) ).
tff(func_def_12,type,
pCons:
!>[X0: $tType] : ( ( X0 * poly(X0) ) > poly(X0) ) ).
tff(func_def_13,type,
pcompose:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > poly(X0) ) ).
tff(func_def_14,type,
poly1:
!>[X0: $tType] : ( poly(X0) > fun(X0,X0) ) ).
tff(func_def_15,type,
poly_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(poly(X1),fun(X0,X0))) * poly(X1) ) > X0 ) ).
tff(func_def_16,type,
smult:
!>[X0: $tType] : ( ( X0 * poly(X0) ) > poly(X0) ) ).
tff(func_def_17,type,
synthetic_div:
!>[X0: $tType] : ( ( poly(X0) * X0 ) > poly(X0) ) ).
tff(func_def_18,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_19,type,
fFalse: bool ).
tff(func_def_20,type,
fTrue: bool ).
tff(func_def_21,type,
fequal:
!>[X0: $tType] : ( ( X0 * X0 ) > bool ) ).
tff(func_def_22,type,
h: a ).
tff(func_def_23,type,
sK0:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).
tff(func_def_24,type,
sK1:
!>[X0: $tType] : ( fun(poly(X0),bool) > X0 ) ).
tff(func_def_25,type,
sK2:
!>[X0: $tType] : ( fun(poly(X0),bool) > poly(X0) ) ).
tff(func_def_26,type,
sK3:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).
tff(func_def_27,type,
sK4:
!>[X0: $tType] : ( poly(X0) > X0 ) ).
tff(func_def_28,type,
sK5:
!>[X0: $tType] : ( poly(X0) > poly(X0) ) ).
tff(func_def_29,type,
sK6: nat > nat ).
tff(func_def_30,type,
sK7: fun(nat,bool) > nat ).
tff(func_def_31,type,
sK8: fun(nat,bool) > nat ).
tff(func_def_32,type,
sK9: nat > nat ).
tff(func_def_33,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
cancel1352612707id_add:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
idom:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
comm_semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
ab_semigroup_add:
!>[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,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(f1,axiom,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X3: X0] : ( fundam296178794t_poly(X0,zero_zero(poly(X0)),X3) = zero_zero(poly(X0)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_offset__poly__0) ).
tff(f134,conjecture,
degree(a,fundam296178794t_poly(a,zero_zero(poly(a)),h)) = degree(a,zero_zero(poly(a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f135,negated_conjecture,
( ( ~ degree(a,fundam296178794t_poly(a,zero_zero(poly(a)),h)) ) = degree(a,zero_zero(poly(a))) ),
inference(negated_conjecture,[status(cth)],[f134]) ).
tff(f136,axiom,
comm_semiring_0(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',tfree_0) ).
tff(f137,plain,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X1: X0] : ( zero_zero(poly(X0)) = fundam296178794t_poly(X0,zero_zero(poly(X0)),X1) ) ),
inference(rectify,[],[f1]) ).
tff(f138,plain,
degree(a,fundam296178794t_poly(a,zero_zero(poly(a)),h)) != degree(a,zero_zero(poly(a))),
inference(flattening,[],[f135]) ).
tff(f139,plain,
! [X0: $tType] :
( ! [X1: X0] : ( zero_zero(poly(X0)) = fundam296178794t_poly(X0,zero_zero(poly(X0)),X1) )
| ~ comm_semiring_0(X0) ),
inference(ennf_transformation,[],[f137]) ).
tff(f280,plain,
! [X0: $tType,X1: X0] :
( ~ comm_semiring_0(X0)
| ( zero_zero(poly(X0)) = fundam296178794t_poly(X0,zero_zero(poly(X0)),X1) ) ),
inference(cnf_transformation,[],[f139]) ).
tff(f445,plain,
degree(a,fundam296178794t_poly(a,zero_zero(poly(a)),h)) != degree(a,zero_zero(poly(a))),
inference(cnf_transformation,[],[f138]) ).
tff(f446,plain,
comm_semiring_0(a),
inference(cnf_transformation,[],[f136]) ).
tff(f738,plain,
! [X0: a] : ( zero_zero(poly(a)) = fundam296178794t_poly(a,zero_zero(poly(a)),X0) ),
inference(resolution,[],[f280,f446]) ).
tff(f806,plain,
degree(a,zero_zero(poly(a))) != degree(a,zero_zero(poly(a))),
inference(superposition,[],[f445,f738]) ).
tff(f807,plain,
$false,
inference(trivial_inequality_removal,[],[f806]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW490_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n026.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Mon Sep 28 14:17:42 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.21/0.29 % (3872086)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (3872101)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2363347118:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29 % (3872096)% WARNING: option uhcvi not known.
% 0.21/0.29 % (3872099)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1398686064:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % (3872097)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=50581335:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (3872098)dis+10_1_sil=32000:sp=arity:random_seed=2503515363:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (3872095)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=895257974_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (3872096)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3306990626:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (3872100)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2922470574:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29 % Exception at run slice level
% 0.21/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.21/0.29 % (3872098) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3872086-3872098"...
% 0.21/0.29 % (3872101) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3872086-3872101"...
% 0.21/0.29 % (3872098)...printing done.
% 0.21/0.29 % (3872101)...printing done.
% 0.21/0.29 % (3872098)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Theorem for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (3872098)------------------------------
% 0.21/0.29 % (3872098)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (3872098)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (3872098)CaDiCaL version: 2.1.3
% 0.21/0.29 % (3872098)Termination reason: Refutation
% 0.21/0.29 % (3872098)Time elapsed: 0.016 s
% 0.21/0.29 % (3872098)Peak memory usage: 12 MB
% 0.21/0.29 % (3872098)Instructions burned: 24 (million)
% 0.21/0.29 % (3872086)Success in time 0.055 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------