%------------------------------------------------------------------------------
% File : Vampire---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 THM
% Computer : n001.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:30:41 PM UTC 2026
% Result : Theorem 5.73s 1.82s
% Output : Refutation 5.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 16 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 2 |; 0 &)
% ( 0 <=>; 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 : 20 ( 18 usr; 2 prp; 0-6 aty)
% Number of functors : 32 ( 32 usr; 12 con; 0-4 aty)
% Number of variables : 10 ( 9 !; 1 ?; 10 :)
% 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:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_12,type,
sK1: fun(real,bool) > real ).
tff(func_def_13,type,
sK2: fun(real,bool) > 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: real ).
tff(func_def_19,type,
sK8: real ).
tff(func_def_20,type,
sK9: real ).
tff(func_def_21,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_22,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_23,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,X1) > X0 ) ).
tff(func_def_24,type,
sK13:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_25,type,
sK14:
!>[X0: $tType,X1: $tType] : ( fun(X1,X0) > X1 ) ).
tff(func_def_26,type,
sK15: fun(real,bool) > real ).
tff(func_def_27,type,
sK16: ( fun(real,bool) * real ) > real ).
tff(func_def_28,type,
sK17: ( fun(real,bool) * real ) > real ).
tff(func_def_29,type,
sK18:
!>[X0: $tType] : X0 ).
tff(func_def_30,type,
sK19:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
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(f124,plain,
~ thesis,
inference(flattening,[],[f123]) ).
tff(f126,plain,
! [X0: real] :
( thesis
| ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
inference(ennf_transformation,[],[f121]) ).
tff(f176,plain,
isLub(real,top_top(fun(real,bool)),collect(real,p),sK8),
inference(skolemize,[status(esa),new_symbols(skolem,[sK8]),skolemize(X0,sK8)],[f3]) ).
tff(f187,plain,
! [X0: real] :
( thesis
| ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0) ),
inference(cnf_transformation,[],[f126]) ).
tff(f188,plain,
~ thesis,
inference(cnf_transformation,[],[f124]) ).
tff(f191,plain,
! [X0: $tType,X1: fun(X0,bool)] : ( collect(X0,X1) = X1 ),
inference(cnf_transformation,[],[f78]) ).
tff(f210,plain,
isLub(real,top_top(fun(real,bool)),collect(real,p),sK8),
inference(cnf_transformation,[],[f176]) ).
tff(f249,plain,
isLub(real,top_top(fun(real,bool)),p,sK8),
inference(forward_demodulation,[],[f210,f191]) ).
tff(f256,plain,
! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),collect(real,p),X0),
inference(forward_subsumption_resolution,[],[f187,f188]) ).
tff(f257,plain,
! [X0: real] : ~ isLub(real,top_top(fun(real,bool)),p,X0),
inference(forward_demodulation,[],[f256,f191]) ).
tff(f258,plain,
$false,
inference(resolution,[],[f257,f249]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWW494_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.08 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.27 % Computer : n001.cluster.edu
% 0.11/0.27 % Model : x86_64 x86_64
% 0.11/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.27 % Memory : 8046.5625MB
% 0.11/0.27 % OS : Linux 6.8.0-71-generic
% 0.11/0.27 % CPULimit : 300
% 0.11/0.27 % WCLimit : 300
% 0.11/0.27 % DateTime : Mon Sep 28 14:20:48 UTC 2026
% 0.11/0.27 % CPUTime :
% 0.11/0.27 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.32 Running first-order theorem proving
% 0.26/0.32 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.73/1.82 % (370461)Detected formulas, will run a generic FOF schedule.
% 5.73/1.82 % (370470)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2685604783:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 5.73/1.82 % (370476)dis-21_1_sil=8000:lcm=predicate:random_seed=46921265:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 5.73/1.82 % (370473)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2153538907:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 5.73/1.82 % (370474)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=1580778890:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 5.73/1.82 % (370472)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=534078675:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 5.73/1.82 % (370471)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=2796178569:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 5.73/1.82 % (370473)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 5.73/1.82 % (370473)Refutation not found, incomplete strategy
% 5.73/1.82 % (370473)------------------------------
% 5.73/1.82 % (370473)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.73/1.82 % (370473)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.73/1.82 % (370473)CaDiCaL version: 2.1.3
% 5.73/1.82 % (370473)Termination reason: Refutation not found, incomplete strategy
% 5.73/1.82 % (370473)Time elapsed: 0.004 s
% 5.73/1.82 % (370473)Peak memory usage: 88 MB
% 5.73/1.82 % (370473)Instructions burned: 2 (million)
% 5.73/1.82 % (370474)First to succeed.
% 5.73/1.82 % (370472)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 5.73/1.82 % (370474)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-370461"
% 5.73/1.82 % (370475)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2989582455:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 5.73/1.82 % (370475)Also succeeded, but the first one will report.
% 5.73/1.82 % (370476)Instruction limit reached!
% 5.73/1.82 % (370476)------------------------------
% 5.73/1.82 % (370476)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.73/1.82 % (370476)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.73/1.82 % (370476)CaDiCaL version: 2.1.3
% 5.73/1.82 % (370476)Termination reason: Instruction limit
% 5.73/1.82 % (370476)Termination phase: Saturation
% 5.73/1.82 % (370476)Time elapsed: 0.102 s
% 5.73/1.82 % (370476)Peak memory usage: 89 MB
% 5.73/1.82 % (370476)Instructions burned: 130 (million)
% 5.73/1.82 % Exception at run slice level
% 5.73/1.82 User error: GNN currently only supports monomorphic FOL.
% 5.73/1.82 % (370484)lrs+10_1_sil=8000:sp=occurrence:random_seed=3323343941:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 5.73/1.82 % (370484)Also succeeded, but the first one will report.
% 5.73/1.82 % (370473)------------------------------
% 5.73/1.82 % (370473)------------------------------
% 5.73/1.82 % (370474)Refutation found. Thanks to Tanya!
% 5.73/1.82 % SZS status Theorem for theBenchmark
% 5.73/1.82 % SZS output start Proof for theBenchmark
% See solution above
% 5.73/1.82 % (370474)------------------------------
% 5.73/1.82 % (370474)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 5.73/1.82 % (370474)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.73/1.82 % (370474)CaDiCaL version: 2.1.3
% 5.73/1.82 % (370474)Termination reason: Refutation
% 5.73/1.82 % (370474)Time elapsed: 0.007 s
% 5.73/1.82 % (370474)Peak memory usage: 88 MB
% 5.73/1.82 % (370474)Instructions burned: 4 (million)
% 5.73/1.82 % (370474)------------------------------
% 5.73/1.82 % (370474)------------------------------
% 5.73/1.82 % (370461)Success in time 0.682 s
% 5.73/1.82 % Vampire exiting
%------------------------------------------------------------------------------