%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW494_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.08s 0.25s
% Output : Refutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 16 unt; 0 typ; 2 def)
% Number of atoms : 38 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 28 ( 17 ~; 8 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 22 ( 20 usr; 4 prp; 0-6 aty)
% Number of functors : 40 ( 40 usr; 12 con; 0-4 aty)
% Number of variables : 12 ( 0 sgn 11 !; 1 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
real: $tType ).
tff(type_def_7,type,
fun: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_1,type,
isUb:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > fun(X0,bool) ) ).
tff(func_def_2,type,
ubs:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > fun(X0,bool) ) ).
tff(func_def_3,type,
top_top:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
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,
p: fun(real,bool) ).
tff(func_def_9,type,
y: real ).
tff(func_def_10,type,
x: real ).
tff(func_def_11,type,
sK0: real ).
tff(func_def_12,type,
sK1: real ).
tff(func_def_13,type,
sK2: real ).
tff(func_def_14,type,
sK3: real ).
tff(func_def_15,type,
sK4: real ).
tff(func_def_16,type,
sK5: real ).
tff(func_def_17,type,
sK6: real ).
tff(func_def_18,type,
sK7: fun(real,bool) > real ).
tff(func_def_19,type,
sK8: fun(real,bool) > real ).
tff(func_def_20,type,
sK9:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_21,type,
sK10:
!>[X0: $tType] : X0 ).
tff(func_def_22,type,
sK11: fun(real,bool) > real ).
tff(func_def_23,type,
sK12: ( fun(real,bool) * real ) > real ).
tff(func_def_24,type,
sK13: ( fun(real,bool) * real ) > real ).
tff(func_def_25,type,
sK14:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_26,type,
sK15:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_27,type,
sK16:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_28,type,
sK17:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_29,type,
sK18:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_30,type,
sK19:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_31,type,
sK20:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_32,type,
sK21:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_33,type,
sK22:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_34,type,
sK23:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_35,type,
sK24:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_36,type,
sK25:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > X0 ) ).
tff(func_def_37,type,
sK26:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_38,type,
sK27:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
ord:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
top:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
order:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
preorder:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
dense_linorder:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
isLub:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * X0 ) > $o ) ).
tff(pred_def_9,type,
leastP:
!>[X0: $tType] : ( ( fun(X0,bool) * X0 ) > $o ) ).
tff(pred_def_10,type,
setge:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_11,type,
setle:
!>[X0: $tType] : ( ( fun(X0,bool) * X0 ) > $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,
order_strict_mono:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > $o ) ).
tff(pred_def_15,type,
inv_imagep:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X0,bool)) * fun(X1,X0) * X1 * X1 ) > $o ) ).
tff(pred_def_16,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_17,type,
pp: bool > $o ).
tff(f3,axiom,
? [X0: real] : isLub(real,top_top(fun(real,bool)),collect(real,p),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096EX_At_O_AisLub_AUNIV_A_ICollect_AP_J_At_096) ).
tff(f78,axiom,
! [X0: $tType,X1: fun(X0,bool)] : ( collect(X0,X1) = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_77_Collect__def) ).
tff(f121,axiom,
! [X0: real] :
( isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
=> thesis ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f122,conjecture,
thesis,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).
tff(f123,negated_conjecture,
~ thesis,
inference(negated_conjecture,[status(cth)],[f122]) ).
tff(f125,plain,
~ thesis,
inference(flattening,[],[f123]) ).
tff(f241,plain,
! [X0: real] :
( thesis
| ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
inference(ennf_transformation,[],[f121]) ).
tff(f244,plain,
isLub(real,top_top(fun(real,bool)),collect(real,p),sK1),
inference(cnf_transformation,[],[f3]) ).
tff(f344,plain,
! [X0: $tType,X1: fun(X0,bool)] : ( collect(X0,X1) = X1 ),
inference(cnf_transformation,[],[f78]) ).
tff(f395,plain,
! [X0: real] :
( ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
| thesis ),
inference(cnf_transformation,[],[f241]) ).
tff(f396,plain,
~ thesis,
inference(cnf_transformation,[],[f125]) ).
tff(f518,plain,
! [X0: real] :
( ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
| ~ thesis ),
inference(consistent_polarity_flipping,[],[f395]) ).
tff(f519,plain,
thesis,
inference(consistent_polarity_flipping,[],[f396]) ).
tff(f521,definition,
( spl28_1
<=> thesis ),
introduced(definition,[new_symbols(definition,[spl28_1])],[avatar_definition]) ).
tff(f525,definition,
( spl28_2
<=> ! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
introduced(definition,[new_symbols(definition,[spl28_2])],[avatar_definition]) ).
tff(f526,plain,
( ! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0)
| ~ spl28_2 ),
inference(avatar_component_clause,[],[f525]) ).
tff(f527,plain,
( ~ spl28_1
| spl28_2 ),
inference(avatar_split_clause,[],[f518,f525,f521]) ).
tff(f536,plain,
spl28_1,
inference(avatar_split_clause,[],[f519,f521]) ).
tff(f581,plain,
( ! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),p,X0)
| ~ spl28_2 ),
inference(forward_demodulation,[],[f526,f344]) ).
tff(f582,plain,
isLub(real,top_top(fun(real,bool)),p,sK1),
inference(forward_demodulation,[],[f244,f344]) ).
tff(f583,plain,
( $false
| ~ spl28_2 ),
inference(forward_subsumption_resolution,[],[f582,f581]) ).
tff(f584,plain,
~ spl28_2,
inference(avatar_contradiction_clause,[],[f583]) ).
cnf(s1,plain,
( ~ spl28_1
| spl28_2 ),
inference(sat_conversion,[],[f527]) ).
cnf(s5,plain,
spl28_1,
inference(sat_conversion,[],[f536]) ).
cnf(s8,plain,
~ spl28_2,
inference(sat_conversion,[],[f584]) ).
cnf(s9,plain,
$false,
inference(rat,[],[s1,s8,s5]) ).
tff(f585,plain,
$false,
inference(avatar_sat_refutation,[],[s9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW494_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.17 % Computer : n026.cluster.edu
% 0.08/0.17 % Model : x86_64 x86_64
% 0.08/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17 % Memory : 8046.5625MB
% 0.08/0.17 % OS : Linux 6.8.0-71-generic
% 0.08/0.17 % CPULimit : 300
% 0.08/0.17 % WCLimit : 300
% 0.08/0.17 % DateTime : Mon Sep 28 14:17:57 UTC 2026
% 0.08/0.17 % CPUTime :
% 0.08/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.20 Running first-order model finding
% 0.08/0.20 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.08/0.25 % (3872865)Will run a generic schedule for satisfiability detection.
% 0.08/0.25 % (3872874)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2779141421:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.25 % (3872870)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=102810686_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.25 % (3872872)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1167570533:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.25 % (3872871)% WARNING: option uhcvi not known.
% 0.08/0.25 % (3872873)dis+10_1_sil=32000:sp=arity:random_seed=2675043870:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.25 % (3872875)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3847490964:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.25 % (3872876)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4078233418:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.25 % (3872871)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3393169649:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.25 % Exception at run slice level
% 0.08/0.25 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.08/0.25 % (3872873) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3872865-3872873"...
% 0.08/0.25 % (3872875) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3872865-3872875"...
% 0.08/0.25 % (3872871) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3872865-3872871"...
% 0.08/0.25 % (3872873)...printing done.
% 0.08/0.25 % (3872871)...printing done.
% 0.08/0.25 % (3872875)...printing done.
% 0.08/0.25 % (3872874) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3872865-3872874"...
% 0.08/0.25 % (3872871)Refutation found. Thanks to Tanya!
% 0.08/0.25 % SZS status Theorem for theBenchmark
% 0.08/0.25 % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.25 % (3872871)------------------------------
% 0.08/0.25 % (3872871)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.25 % (3872871)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.25 % (3872871)CaDiCaL version: 2.1.3
% 0.08/0.25 % (3872871)Termination reason: Refutation
% 0.08/0.25 % (3872871)Time elapsed: 0.004 s
% 0.08/0.25 % (3872871)Peak memory usage: 13 MB
% 0.08/0.25 % (3872871)Instructions burned: 9 (million)
% 0.08/0.25 % (3872865)Success in time 0.042 s
% 0.08/0.25 % Vampire exiting
%------------------------------------------------------------------------------