%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW485_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.07s 0.26s
% Output : Refutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 16 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 29 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 22 ( 9 ~; 5 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 16 ( 15 usr; 2 prp; 0-3 aty)
% Number of functors : 30 ( 30 usr; 5 con; 0-4 aty)
% Number of variables : 15 ( 11 !; 4 ?; 15 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
complex: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
nat: $tType ).
tff(type_def_8,type,
poly1: $tType > $tType ).
tff(type_def_9,type,
real: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
order1:
!>[X0: $tType] : ( ( X0 * poly1(X0) ) > nat ) ).
tff(func_def_2,type,
poly:
!>[X0: $tType] : ( poly1(X0) > fun(X0,X0) ) ).
tff(func_def_3,type,
norm_norm:
!>[X0: $tType] : ( X0 > real ) ).
tff(func_def_4,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_5,type,
fFalse: bool ).
tff(func_def_6,type,
fTrue: bool ).
tff(func_def_7,type,
cs: poly1(complex) ).
tff(func_def_8,type,
r: real ).
tff(func_def_9,type,
sK0: real ).
tff(func_def_10,type,
sK1:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_11,type,
sK2:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_12,type,
sK3:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_13,type,
sK4:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_14,type,
sK5:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_15,type,
sK6:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_16,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_17,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_18,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_19,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_20,type,
sK11:
!>[X0: $tType] : ( ( X0 * X0 * X0 ) > X0 ) ).
tff(func_def_21,type,
sK12:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_22,type,
sK13: ( real * real ) > real ).
tff(func_def_23,type,
sK14:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_24,type,
sK15:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_25,type,
sK16:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_26,type,
sK17: ( nat * fun(nat,bool) ) > nat ).
tff(func_def_27,type,
sK18: real > complex ).
tff(pred_def_1,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
idom:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
ord:
!>[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,
linorder:
!>[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,
dense_linorder:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
real_normed_vector:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_13,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_14,type,
pp: bool > $o ).
tff(f1,axiom,
? [X2: real] :
( ord_less(real,zero_zero(real),X2)
& ! [X3: complex] :
( ord_less_eq(real,norm_norm(complex,X3),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X3)),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_pCons) ).
tff(f140,axiom,
! [X0: real] :
( ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,X1),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0) )
=> thesis ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f141,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f142,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f141]) ).
tff(f143,plain,
? [X0: real] :
( ord_less(real,zero_zero(real),X0)
& ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,X1),r)
=> ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0) ) ),
inference(rectify,[],[f1]) ).
tff(f144,plain,
~ thesis,
inference(flattening,[],[f142]) ).
tff(f145,plain,
? [X0: real] :
( ord_less(real,zero_zero(real),X0)
& ! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) ) ),
inference(ennf_transformation,[],[f143]) ).
tff(f271,plain,
! [X0: real] :
( thesis
| ? [X1: complex] :
( ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),X0)
& ord_less_eq(real,norm_norm(complex,X1),r) ) ),
inference(ennf_transformation,[],[f140]) ).
tff(f272,plain,
! [X1: complex] :
( ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),X1)),sK0)
| ~ ord_less_eq(real,norm_norm(complex,X1),r) ),
inference(cnf_transformation,[],[f145]) ).
tff(f462,plain,
! [X0: real] :
( ord_less_eq(real,norm_norm(complex,sK18(X0)),r)
| thesis ),
inference(cnf_transformation,[],[f271]) ).
tff(f463,plain,
! [X0: real] :
( ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK18(X0))),X0)
| thesis ),
inference(cnf_transformation,[],[f271]) ).
tff(f464,plain,
~ thesis,
inference(cnf_transformation,[],[f144]) ).
tff(f502,plain,
! [X0: real] : ord_less_eq(real,norm_norm(complex,sK18(X0)),r),
inference(forward_subsumption_resolution,[],[f462,f464]) ).
tff(f503,plain,
! [X0: real] : ~ ord_less_eq(real,norm_norm(complex,aa(complex,complex,poly(complex,cs),sK18(X0))),X0),
inference(forward_subsumption_resolution,[],[f463,f464]) ).
tff(f825,plain,
~ ord_less_eq(real,norm_norm(complex,sK18(sK0)),r),
inference(resolution,[],[f272,f503]) ).
tff(f827,plain,
$false,
inference(forward_subsumption_resolution,[],[f825,f502]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW485_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.17 % Computer : n017.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 14:09:36 UTC 2026
% 0.07/0.17 % CPUTime :
% 0.07/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.19 Running first-order model finding
% 0.07/0.19 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.07/0.26 % (3573980)Will run a generic schedule for satisfiability detection.
% 0.07/0.26 % (3573987)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2999041637:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.07/0.26 % (3573986)% WARNING: option uhcvi not known.
% 0.07/0.26 % (3573985)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2272342908_2999 on theBenchmark for (2999ds/0Mi)
% 0.07/0.26 % (3573988)dis+10_1_sil=32000:sp=arity:random_seed=363726784:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.07/0.26 % (3573990)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=650313942:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.07/0.26 % (3573989)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=195186290:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.26 % (3573991)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1770579589:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.07/0.26 % (3573986)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3586529009:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.07/0.26 % Exception at run slice level
% 0.07/0.26 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.07/0.26 % (3573989) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3573980-3573989"...
% 0.07/0.26 % (3573986) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3573980-3573986"...
% 0.07/0.26 % (3573989)...printing done.
% 0.07/0.26 % (3573988) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3573980-3573988"...
% 0.07/0.26 % (3573989)Refutation found. Thanks to Tanya!
% 0.07/0.26 % SZS status Theorem for theBenchmark
% 0.07/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.07/0.26 % (3573989)------------------------------
% 0.07/0.26 % (3573989)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.07/0.26 % (3573989)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.07/0.26 % (3573989)CaDiCaL version: 2.1.3
% 0.07/0.26 % (3573989)Termination reason: Refutation
% 0.07/0.26 % (3573989)Time elapsed: 0.016 s
% 0.07/0.26 % (3573989)Peak memory usage: 12 MB
% 0.07/0.26 % (3573989)Instructions burned: 25 (million)
% 0.07/0.26 % (3573980)Success in time 0.056 s
% 0.07/0.26 % Vampire exiting
%------------------------------------------------------------------------------