%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW486_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 : 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.19s 0.31s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 47 ( 4 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 19 ~; 10 |; 2 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 38 ( 36 usr; 1 prp; 0-3 aty)
% Number of functors : 19 ( 19 usr; 9 con; 0-4 aty)
% Number of variables : 37 ( 37 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
complex: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
poly1: $tType > $tType ).
tff(type_def_8,type,
real: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
plus_plus:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_1,type,
times_times:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_2,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_3,type,
pCons:
!>[X0: $tType] : ( ( X0 * poly1(X0) ) > poly1(X0) ) ).
tff(func_def_4,type,
poly:
!>[X0: $tType] : ( poly1(X0) > fun(X0,X0) ) ).
tff(func_def_5,type,
norm_norm:
!>[X0: $tType] : ( X0 > real ) ).
tff(func_def_6,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_7,type,
fFalse: bool ).
tff(func_def_8,type,
fTrue: bool ).
tff(func_def_9,type,
c: complex ).
tff(func_def_10,type,
cs: poly1(complex) ).
tff(func_def_11,type,
m: real ).
tff(func_def_12,type,
r: real ).
tff(func_def_13,type,
z: complex ).
tff(func_def_14,type,
sK0: real ).
tff(func_def_15,type,
sK1: real ).
tff(func_def_16,type,
sK2:
!>[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,
semiring:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
ring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
mult_zero:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
comm_semiring_0:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
comm_semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
linordered_ring:
!>[X0: $tType] : $o ).
tff(pred_def_14,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_15,type,
no_zero_divisors:
!>[X0: $tType] : $o ).
tff(pred_def_16,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_17,type,
ab_semigroup_mult:
!>[X0: $tType] : $o ).
tff(pred_def_18,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_19,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_20,type,
ring_n68954251visors:
!>[X0: $tType] : $o ).
tff(pred_def_21,type,
linord581940658strict:
!>[X0: $tType] : $o ).
tff(pred_def_22,type,
real_normed_vector:
!>[X0: $tType] : $o ).
tff(pred_def_23,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_24,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_25,type,
ordere216010020id_add:
!>[X0: $tType] : $o ).
tff(pred_def_26,type,
real_normed_algebra:
!>[X0: $tType] : $o ).
tff(pred_def_27,type,
ordere779506340up_add:
!>[X0: $tType] : $o ).
tff(pred_def_28,type,
ab_sem1668676832m_mult:
!>[X0: $tType] : $o ).
tff(pred_def_29,type,
linord20386208strict:
!>[X0: $tType] : $o ).
tff(pred_def_30,type,
real_n1866405975lgebra:
!>[X0: $tType] : $o ).
tff(pred_def_31,type,
linord893533164strict:
!>[X0: $tType] : $o ).
tff(pred_def_32,type,
ordere236663937imp_le:
!>[X0: $tType] : $o ).
tff(pred_def_33,type,
semiri456707255roduct:
!>[X0: $tType] : $o ).
tff(pred_def_34,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_35,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_36,type,
pp: bool > $o ).
tff(f1,axiom,
ord_less_eq(real,norm_norm(complex,plus_plus(complex,c,times_times(complex,z,aa(complex,complex,poly(complex,cs),z)))),plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__096cmod_A_Ic_A_L_Az_A_K_Apoly_Acs_Az_J_A_060_061_Acmod_Ac_A_L_Acmod_A_Iz_A_K_Apoly_Acs_Az_J_096) ).
tff(f5,axiom,
! [X0: $tType] :
( comm_semiring_0(X0)
=> ! [X1: X0,X2: poly1(X0),X3: X0] : ( aa(X0,X0,poly(X0,pCons(X0,X3,X2)),X1) = plus_plus(X0,X3,times_times(X0,X1,aa(X0,X0,poly(X0,X2),X1))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_4_poly__pCons) ).
tff(f91,axiom,
! [X0: $tType] :
( preorder(X0)
=> ! [X1: X0,X2: X0] :
( ord_less(X0,X2,X1)
<=> ( ord_less_eq(X0,X2,X1)
& ~ ord_less_eq(X0,X1,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_90_less__le__not__le) ).
tff(f95,axiom,
! [X0: $tType] :
( linorder(X0)
=> ! [X1: X0,X2: X0] :
( ~ ord_less(X0,X2,X1)
<=> ord_less_eq(X0,X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_94_linorder__not__less) ).
tff(f132,axiom,
preorder(real),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_RealDef_Oreal___Orderings_Opreorder) ).
tff(f133,axiom,
linorder(real),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_RealDef_Oreal___Orderings_Olinorder) ).
tff(f152,axiom,
comm_semiring_0(complex),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',arity_Complex_Ocomplex___Rings_Ocomm__semiring__0) ).
tff(f187,conjecture,
ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,pCons(complex,c,cs)),z)),plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f188,negated_conjecture,
~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,pCons(complex,c,cs)),z)),plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
inference(negated_conjecture,[status(cth)],[f187]) ).
tff(f189,plain,
~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,pCons(complex,c,cs)),z)),plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
inference(flattening,[],[f188]) ).
tff(f192,plain,
! [X0: $tType] :
( ! [X1: X0,X2: poly1(X0),X3: X0] : ( aa(X0,X0,poly(X0,pCons(X0,X3,X2)),X1) = plus_plus(X0,X3,times_times(X0,X1,aa(X0,X0,poly(X0,X2),X1))) )
| ~ comm_semiring_0(X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f297,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] :
( ord_less(X0,X2,X1)
<=> ( ord_less_eq(X0,X2,X1)
& ~ ord_less_eq(X0,X1,X2) ) )
| ~ preorder(X0) ),
inference(ennf_transformation,[],[f91]) ).
tff(f301,plain,
! [X0: $tType] :
( ! [X1: X0,X2: X0] :
( ~ ord_less(X0,X2,X1)
<=> ord_less_eq(X0,X1,X2) )
| ~ linorder(X0) ),
inference(ennf_transformation,[],[f95]) ).
tff(f339,plain,
ord_less_eq(real,norm_norm(complex,plus_plus(complex,c,times_times(complex,z,aa(complex,complex,poly(complex,cs),z)))),plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
inference(cnf_transformation,[],[f1]) ).
tff(f343,plain,
! [X0: $tType,X2: poly1(X0),X3: X0,X1: X0] :
( ~ comm_semiring_0(X0)
| ( aa(X0,X0,poly(X0,pCons(X0,X3,X2)),X1) = plus_plus(X0,X3,times_times(X0,X1,aa(X0,X0,poly(X0,X2),X1))) ) ),
inference(cnf_transformation,[],[f192]) ).
tff(f467,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ~ preorder(X0)
| ~ ord_less_eq(X0,X1,X2)
| ~ ord_less(X0,X2,X1) ),
inference(cnf_transformation,[],[f297]) ).
tff(f477,plain,
! [X0: $tType,X2: X0,X1: X0] :
( ~ linorder(X0)
| ord_less_eq(X0,X1,X2)
| ord_less(X0,X2,X1) ),
inference(cnf_transformation,[],[f301]) ).
tff(f514,plain,
preorder(real),
inference(cnf_transformation,[],[f132]) ).
tff(f515,plain,
linorder(real),
inference(cnf_transformation,[],[f133]) ).
tff(f534,plain,
comm_semiring_0(complex),
inference(cnf_transformation,[],[f152]) ).
tff(f569,plain,
~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,pCons(complex,c,cs)),z)),plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
inference(cnf_transformation,[],[f189]) ).
tff(f625,plain,
! [X0: real,X1: real] :
( ~ ord_less_eq(real,X0,X1)
| ~ ord_less(real,X1,X0) ),
inference(resolution,[],[f467,f514]) ).
tff(f641,plain,
! [X0: real,X1: real] :
( ord_less_eq(real,X0,X1)
| ord_less(real,X1,X0) ),
inference(resolution,[],[f477,f515]) ).
tff(f769,plain,
ord_less(real,plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z)))),norm_norm(complex,aa(complex,complex,poly(complex,pCons(complex,c,cs)),z))),
inference(resolution,[],[f641,f569]) ).
tff(f1037,plain,
! [X2: complex,X0: complex,X1: poly1(complex)] : ( aa(complex,complex,poly(complex,pCons(complex,X0,X1)),X2) = plus_plus(complex,X0,times_times(complex,X2,aa(complex,complex,poly(complex,X1),X2))) ),
inference(resolution,[],[f343,f534]) ).
tff(f1133,plain,
~ ord_less(real,plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z)))),norm_norm(complex,plus_plus(complex,c,times_times(complex,z,aa(complex,complex,poly(complex,cs),z))))),
inference(resolution,[],[f339,f625]) ).
tff(f1134,plain,
~ ord_less(real,plus_plus(real,norm_norm(complex,c),norm_norm(complex,times_times(complex,z,aa(complex,complex,poly(complex,cs),z)))),norm_norm(complex,aa(complex,complex,poly(complex,pCons(complex,c,cs)),z))),
inference(forward_demodulation,[],[f1133,f1037]) ).
tff(f1136,plain,
$false,
inference(forward_subsumption_resolution,[],[f1134,f769]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW486_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.07/0.18 % Computer : n026.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 14:17:26 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/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.19/0.31 % (3871015)Will run a generic schedule for satisfiability detection.
% 0.19/0.31 % (3871022)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1349756009:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.31 % (3871021)% WARNING: option uhcvi not known.
% 0.19/0.31 % (3871020)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=502888914_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.31 % (3871021)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2265666396:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.31 % (3871023)dis+10_1_sil=32000:sp=arity:random_seed=1982248784:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.31 % (3871024)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4172940843:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.31 % Exception at run slice level
% 0.19/0.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.31 % (3871025)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1846290821:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.31 % (3871026)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2140966248:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.31 % (3871032)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2001478989:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.31 % (3871024) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3871015-3871024"...
% 0.19/0.31 % Exception at run slice level
% 0.19/0.31 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.31 % (3871024)...printing done.
% 0.19/0.31 % (3871024)Refutation found. Thanks to Tanya!
% 0.19/0.31 % SZS status Theorem for theBenchmark
% 0.19/0.31 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.31 % (3871024)------------------------------
% 0.19/0.31 % (3871024)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.31 % (3871024)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.31 % (3871024)CaDiCaL version: 2.1.3
% 0.19/0.31 % (3871024)Termination reason: Refutation
% 0.19/0.31 % (3871024)Time elapsed: 0.030 s
% 0.19/0.31 % (3871024)Peak memory usage: 13 MB
% 0.19/0.31 % (3871024)Instructions burned: 48 (million)
% 0.19/0.31 % (3871015)Success in time 0.08 s
% 0.19/0.31 % Vampire exiting
%------------------------------------------------------------------------------