%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW492_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 : n017.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.20s 0.28s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 20 ( 9 unt; 0 typ; 2 def)
% Number of atoms : 35 ( 20 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 19 ~; 6 |; 0 &)
% ( 6 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 16 ( 14 usr; 3 prp; 0-3 aty)
% Number of functors : 38 ( 38 usr; 3 con; 0-5 aty)
% Number of variables : 2 ( 0 sgn 2 !; 0 ?; 2 :)
% 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,
fundam1280195782_psize:
!>[X0: $tType] : ( poly(X0) > nat ) ).
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,
order1:
!>[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,
p: poly(a) ).
tff(func_def_23,type,
sK0: nat > nat ).
tff(func_def_24,type,
sK1: fun(nat,bool) > nat ).
tff(func_def_25,type,
sK2: fun(nat,bool) > nat ).
tff(func_def_26,type,
sK3: nat > nat ).
tff(func_def_27,type,
sK4:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).
tff(func_def_28,type,
sK5:
!>[X0: $tType] : ( fun(poly(X0),bool) > X0 ) ).
tff(func_def_29,type,
sK6:
!>[X0: $tType] : ( fun(poly(X0),bool) > poly(X0) ) ).
tff(func_def_30,type,
sK7:
!>[X0: $tType] : ( ( poly(X0) * poly(X0) ) > nat ) ).
tff(func_def_31,type,
sK8:
!>[X0: $tType] : ( poly(X0) > X0 ) ).
tff(func_def_32,type,
sK9:
!>[X0: $tType] : ( poly(X0) > poly(X0) ) ).
tff(func_def_33,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_34,type,
sK11:
!>[X0: $tType] : ( fun(nat,X0) > nat ) ).
tff(func_def_35,type,
sK12: nat > nat ).
tff(pred_def_1,type,
comm_semiring_1:
!>[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,
order:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
comm_semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_11,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_12,type,
pp: bool > $o ).
tff(f4,axiom,
! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_Zero__not__Suc) ).
tff(f125,conjecture,
~ ( ( ( p != zero_zero(poly(a)) )
=> ( suc(degree(a,p)) = zero_zero(nat) ) )
<=> ( p != zero_zero(poly(a)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f126,negated_conjecture,
~ ~ ( ( ( p != zero_zero(poly(a)) )
=> ( suc(degree(a,p)) = zero_zero(nat) ) )
<=> ( p != zero_zero(poly(a)) ) ),
inference(negated_conjecture,[status(cth)],[f125]) ).
tff(f128,plain,
( ( ( p != zero_zero(poly(a)) )
=> ( suc(degree(a,p)) = zero_zero(nat) ) )
<=> ( p != zero_zero(poly(a)) ) ),
inference(flattening,[],[f126]) ).
tff(f224,plain,
( ( ( suc(degree(a,p)) = zero_zero(nat) )
| ( p = zero_zero(poly(a)) ) )
<=> ( p != zero_zero(poly(a)) ) ),
inference(ennf_transformation,[],[f128]) ).
tff(f230,plain,
! [X0: nat] : ( zero_zero(nat) != suc(X0) ),
inference(cnf_transformation,[],[f4]) ).
tff(f380,plain,
p != zero_zero(poly(a)),
inference(cnf_transformation,[],[f224]) ).
tff(f382,plain,
( ( p = zero_zero(poly(a)) )
| ( zero_zero(nat) = suc(degree(a,p)) ) ),
inference(cnf_transformation,[],[f224]) ).
tff(f509,definition,
( spl13_1
<=> ( zero_zero(nat) = suc(degree(a,p)) ) ),
introduced(definition,[new_symbols(definition,[spl13_1])],[avatar_definition]) ).
tff(f510,plain,
( ( zero_zero(nat) = suc(degree(a,p)) )
| ~ spl13_1 ),
inference(avatar_component_clause,[],[f509]) ).
tff(f513,definition,
( spl13_2
<=> ( p = zero_zero(poly(a)) ) ),
introduced(definition,[new_symbols(definition,[spl13_2])],[avatar_definition]) ).
tff(f517,plain,
( spl13_1
| spl13_2 ),
inference(avatar_split_clause,[],[f382,f513,f509]) ).
tff(f518,plain,
~ spl13_2,
inference(avatar_split_clause,[],[f380,f513]) ).
tff(f520,plain,
( $false
| ~ spl13_1 ),
inference(backward_subsumption_resolution,[],[f510,f230]) ).
tff(f521,plain,
~ spl13_1,
inference(avatar_contradiction_clause,[],[f520]) ).
cnf(s2,plain,
( spl13_1
| spl13_2 ),
inference(sat_conversion,[],[f517]) ).
cnf(s3,plain,
~ spl13_2,
inference(sat_conversion,[],[f518]) ).
cnf(s4,plain,
~ spl13_1,
inference(sat_conversion,[],[f521]) ).
cnf(s5,plain,
$false,
inference(rat,[],[s2,s3,s4]) ).
tff(f522,plain,
$false,
inference(avatar_sat_refutation,[],[s5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW492_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.08/0.19 % Computer : n017.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Mon Sep 28 14:10:06 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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.20/0.28 % (3574739)Will run a generic schedule for satisfiability detection.
% 0.20/0.28 % (3574744)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=555172802_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.28 % Exception at run slice level
% 0.20/0.28 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.28 % (3574745)% WARNING: option uhcvi not known.
% 0.20/0.28 % (3574747)dis+10_1_sil=32000:sp=arity:random_seed=1321057568:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.28 % (3574745)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3353456129:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.28 % (3574746)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2462903182:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.28 % (3574748)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3196903635:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.28 % (3574749)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=567792431:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.28 % (3574750)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2931503350:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.28 % (3574747) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3574739-3574747"...
% 0.20/0.28 % (3574745) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3574739-3574745"...
% 0.20/0.28 % (3574746) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3574739-3574746"...
% 0.20/0.28 % (3574752)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2088494568:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.28 % (3574749) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3574739-3574749"...
% 0.20/0.28 % (3574745)...printing done.
% 0.20/0.28 % (3574747)...printing done.
% 0.20/0.28 % (3574748) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3574739-3574748"...
% 0.20/0.28 % (3574746)...printing done.
% 0.20/0.28 % (3574745)Refutation found. Thanks to Tanya!
% 0.20/0.28 % SZS status Theorem for theBenchmark
% 0.20/0.28 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.28 % (3574745)------------------------------
% 0.20/0.28 % (3574745)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.28 % (3574745)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.28 % (3574745)CaDiCaL version: 2.1.3
% 0.20/0.28 % (3574745)Termination reason: Refutation
% 0.20/0.28 % (3574745)Time elapsed: 0.006 s
% 0.20/0.28 % (3574745)Peak memory usage: 12 MB
% 0.20/0.28 % (3574745)Instructions burned: 8 (million)
% 0.20/0.28 % (3574739)Success in time 0.047 s
% 0.20/0.28 % Vampire exiting
%------------------------------------------------------------------------------