%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWW533_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 : 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:30:46 PM UTC 2026
% Result : ContradictoryAxioms 3.51s 1.30s
% Output : Refutation 3.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 42 ( 42 usr; 4 con; 0-5 aty)
% Number of variables : 6 ( 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
a: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
huffma1450048681e_tree: $tType > $tType ).
tff(type_def_8,type,
list: $tType > $tType ).
tff(type_def_9,type,
nat: $tType ).
tff(type_def_10,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_11,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
combb:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,X1) * fun(X2,X0) ) > fun(X2,X1) ) ).
tff(func_def_1,type,
combc:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * X1 ) > fun(X0,X2) ) ).
tff(func_def_2,type,
combk:
!>[X0: $tType,X1: $tType] : ( X0 > fun(X1,X0) ) ).
tff(func_def_3,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_4,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_5,type,
huffma675207370phabet:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > fun(X0,bool) ) ).
tff(func_def_6,type,
huffma1516701463abet_F:
!>[X0: $tType] : ( list(huffma1450048681e_tree(X0)) > fun(X0,bool) ) ).
tff(func_def_7,type,
huffma410068972_depth:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).
tff(func_def_8,type,
huffma1352802255e_freq:
!>[X0: $tType] : ( ( huffma1450048681e_tree(X0) * X0 ) > nat ) ).
tff(func_def_9,type,
huffma409467474freq_F:
!>[X0: $tType] : ( ( list(huffma1450048681e_tree(X0)) * X0 ) > nat ) ).
tff(func_def_10,type,
huffma945805758height:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_11,type,
huffma632063779ight_F:
!>[X0: $tType] : ( list(huffma1450048681e_tree(X0)) > nat ) ).
tff(func_def_12,type,
huffma1146269203erNode:
!>[X0: $tType] : ( ( nat * huffma1450048681e_tree(X0) * huffma1450048681e_tree(X0) ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_13,type,
huffma2021818691e_Leaf:
!>[X0: $tType] : ( ( nat * X0 ) > huffma1450048681e_tree(X0) ) ).
tff(func_def_14,type,
huffma107959123e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),X1))) * huffma1450048681e_tree(X0) ) > X1 ) ).
tff(func_def_15,type,
huffma1280178957ee_rec:
!>[X0: $tType,X1: $tType] : ( ( fun(nat,fun(X0,X1)) * fun(nat,fun(huffma1450048681e_tree(X0),fun(huffma1450048681e_tree(X0),fun(X1,fun(X1,X1))))) * huffma1450048681e_tree(X0) ) > X1 ) ).
tff(func_def_16,type,
inf_inf:
!>[X0: $tType] : ( ( X0 * X0 ) > X0 ) ).
tff(func_def_17,type,
dropWhile:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > list(X0) ) ).
tff(func_def_18,type,
lexn:
!>[X0: $tType] : ( ( fun(product_prod(X0,X0),bool) * nat ) > fun(product_prod(list(X0),list(X0)),bool) ) ).
tff(func_def_19,type,
linord467138063of_set:
!>[X0: $tType] : ( fun(X0,bool) > list(X0) ) ).
tff(func_def_20,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_21,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_22,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_23,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_24,type,
set:
!>[X0: $tType] : ( list(X0) > fun(X0,bool) ) ).
tff(func_def_25,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_26,type,
bot_bot:
!>[X0: $tType] : X0 ).
tff(func_def_27,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_28,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_29,type,
fFalse: bool ).
tff(func_def_30,type,
fTrue: bool ).
tff(func_def_31,type,
fconj: fun(bool,fun(bool,bool)) ).
tff(func_def_32,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_33,type,
a1: a ).
tff(func_def_34,type,
sK0:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_35,type,
sK1:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_36,type,
sK2:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_37,type,
sK3:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(pred_def_1,type,
lattice:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
bounded_lattice:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
bot:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ord:
!>[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,
semilattice_inf:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
bounded_lattice_bot:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
huffma1518433673istent:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > $o ) ).
tff(pred_def_12,type,
huffma594769176tent_F:
!>[X0: $tType] : ( list(huffma1450048681e_tree(X0)) > $o ) ).
tff(pred_def_13,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_14,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_15,type,
pp: bool > $o ).
tff(f3,axiom,
pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),a1),huffma1516701463abet_F(a,nil(huffma1450048681e_tree(a))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_Nil_I3_J) ).
tff(f28,axiom,
! [X0: $tType] : ( huffma1516701463abet_F(X0,nil(huffma1450048681e_tree(X0))) = bot_bot(fun(X0,bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_alphabet_092_060_094isub_062F_Osimps_I1_J) ).
tff(f36,axiom,
! [X0: $tType,X1: X0] : ~ pp(aa(fun(X0,bool),bool,aa(X0,fun(fun(X0,bool),bool),member(X0),X1),bot_bot(fun(X0,bool)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_35_empty__iff) ).
tff(f171,plain,
pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),a1),huffma1516701463abet_F(a,nil(huffma1450048681e_tree(a))))),
inference(cnf_transformation,[],[f3]) ).
tff(f176,plain,
! [X0: $tType] : ( huffma1516701463abet_F(X0,nil(huffma1450048681e_tree(X0))) = bot_bot(fun(X0,bool)) ),
inference(cnf_transformation,[],[f28]) ).
tff(f183,plain,
! [X0: $tType,X1: X0] : ~ pp(aa(fun(X0,bool),bool,aa(X0,fun(fun(X0,bool),bool),member(X0),X1),bot_bot(fun(X0,bool)))),
inference(cnf_transformation,[],[f36]) ).
tff(f204,plain,
pp(aa(fun(a,bool),bool,aa(a,fun(fun(a,bool),bool),member(a),a1),bot_bot(fun(a,bool)))),
inference(forward_demodulation,[],[f171,f176]) ).
tff(f205,plain,
$false,
inference(forward_subsumption_resolution,[],[f204,f183]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW533_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 % Computer : n017.cluster.edu
% 0.09/0.22 % Model : x86_64 x86_64
% 0.09/0.22 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.22 % Memory : 8046.5625MB
% 0.09/0.22 % OS : Linux 6.8.0-71-generic
% 0.09/0.22 % CPULimit : 300
% 0.09/0.22 % WCLimit : 300
% 0.09/0.22 % DateTime : Mon Sep 28 14:13:36 UTC 2026
% 0.09/0.22 % CPUTime :
% 0.09/0.22 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.25 Running first-order theorem proving
% 0.09/0.25 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
% 3.51/1.29 % (3579185)Detected formulas, will run a generic FOF schedule.
% 3.51/1.29 % (3579190)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=2922174764:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.51/1.29 % (3579196)dis-21_1_sil=8000:lcm=predicate:random_seed=709748332: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)
% 3.51/1.29 % (3579195)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=865278658:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.51/1.29 % (3579194)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=3220698882:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.51/1.29 % (3579193)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=480304329:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.51/1.29 % (3579191)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=1658442108:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.51/1.30 % (3579192)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=1228556780:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.51/1.30 % (3579193)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.51/1.30 % (3579193)Refutation not found, incomplete strategy
% 3.51/1.30 % (3579193)------------------------------
% 3.51/1.30 % (3579193)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.30 % (3579193)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.30 % (3579193)CaDiCaL version: 2.1.3
% 3.51/1.30 % (3579193)Termination reason: Refutation not found, incomplete strategy
% 3.51/1.30 % (3579193)Time elapsed: 0.002 s
% 3.51/1.30 % (3579193)Peak memory usage: 88 MB
% 3.51/1.30 % (3579193)Instructions burned: 1 (million)
% 3.51/1.30 % (3579194)First to succeed.
% 3.51/1.30 % (3579194)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3579185"
% 3.51/1.30 % (3579192)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.51/1.30 % (3579195)Also succeeded, but the first one will report.
% 3.51/1.30 % (3579196)Instruction limit reached!
% 3.51/1.30 % (3579196)------------------------------
% 3.51/1.30 % (3579196)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.30 % (3579196)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.30 % (3579196)CaDiCaL version: 2.1.3
% 3.51/1.30 % (3579196)Termination reason: Instruction limit
% 3.51/1.30 % (3579196)Termination phase: Saturation
% 3.51/1.30 % (3579196)Time elapsed: 0.059 s
% 3.51/1.30 % (3579196)Peak memory usage: 89 MB
% 3.51/1.30 % (3579196)Instructions burned: 129 (million)
% 3.51/1.30 % Exception at run slice level
% 3.51/1.30 User error: GNN currently only supports monomorphic FOL.
% 3.51/1.30 % (3579204)lrs+10_1_sil=8000:sp=occurrence:random_seed=3340120531:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.51/1.30 % (3579204)Also succeeded, but the first one will report.
% 3.51/1.30 % (3579193)------------------------------
% 3.51/1.30 % (3579193)------------------------------
% 3.51/1.30 % (3579194)Refutation found. Thanks to Tanya!
% 3.51/1.30 % SZS status ContradictoryAxioms for theBenchmark
% 3.51/1.30 % SZS output start Proof for theBenchmark
% See solution above
% 3.51/1.30 % (3579194)------------------------------
% 3.51/1.30 % (3579194)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.51/1.30 % (3579194)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.51/1.30 % (3579194)CaDiCaL version: 2.1.3
% 3.51/1.30 % (3579194)Termination reason: Refutation
% 3.51/1.30 % (3579194)Time elapsed: 0.004 s
% 3.51/1.30 % (3579194)Peak memory usage: 88 MB
% 3.51/1.30 % (3579194)Instructions burned: 4 (million)
% 3.51/1.30 % (3579194)------------------------------
% 3.51/1.30 % (3579194)------------------------------
% 3.51/1.30 % (3579185)Success in time 0.419 s
% 3.51/1.30 % Vampire exiting
%------------------------------------------------------------------------------