%------------------------------------------------------------------------------
% File : Vampire-SAT---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 SAT
% Computer : n005.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:24 PM UTC 2026
% Result : ContradictoryAxioms 0.18s 0.27s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 56 ( 56 usr; 4 con; 0-5 aty)
% Number of variables : 25 ( 25 !; 0 ?; 25 :)
% 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] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_35,type,
sK1:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) * list(X0) ) > X0 ) ).
tff(func_def_36,type,
sK2:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_37,type,
sK3:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > huffma1450048681e_tree(X0) ) ).
tff(func_def_38,type,
sK4:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > huffma1450048681e_tree(X0) ) ).
tff(func_def_39,type,
sK5:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > nat ) ).
tff(func_def_40,type,
sK6:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > X0 ) ).
tff(func_def_41,type,
sK7:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) * X0 ) > X0 ) ).
tff(func_def_42,type,
sK8:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_43,type,
sK9:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_44,type,
sK10:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_45,type,
sK11:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_46,type,
sK12:
!>[X0: $tType] : ( fun(X0,bool) > X0 ) ).
tff(func_def_47,type,
sK13:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > X0 ) ).
tff(func_def_48,type,
sK14:
!>[X0: $tType] : ( huffma1450048681e_tree(X0) > X0 ) ).
tff(func_def_49,type,
sK15:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_50,type,
sK16:
!>[X0: $tType] : ( ( fun(X0,bool) * fun(X0,bool) ) > X0 ) ).
tff(func_def_51,type,
sK17:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
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(f29,axiom,
! [X0: $tType] : ( set(X0,nil(X0)) = bot_bot(fun(X0,bool)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_28_List_Oset_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(f128,axiom,
! [X0: $tType,X1: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_COMBC_1_1_U) ).
tff(f260,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(f294,plain,
! [X0: $tType] : ( huffma1516701463abet_F(X0,nil(huffma1450048681e_tree(X0))) = bot_bot(fun(X0,bool)) ),
inference(cnf_transformation,[],[f28]) ).
tff(f295,plain,
! [X0: $tType] : ( bot_bot(fun(X0,bool)) = set(X0,nil(X0)) ),
inference(cnf_transformation,[],[f29]) ).
tff(f308,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(f423,plain,
! [X1: $tType,X0: $tType,X2: $tType,X3: X0,X4: X2,X5: fun(X0,fun(X2,X1))] : ( aa(X0,X1,combc(X0,X2,X1,X5,X4),X3) = aa(X2,X1,aa(X0,fun(X2,X1),X5,X3),X4) ),
inference(cnf_transformation,[],[f128]) ).
tff(f465,plain,
! [X0: $tType,X1: X0] : ~ pp(aa(X0,bool,combc(X0,fun(X0,bool),bool,member(X0),bot_bot(fun(X0,bool))),X1)),
inference(forward_demodulation,[],[f308,f423]) ).
tff(f472,plain,
! [X0: $tType] : ( huffma1516701463abet_F(X0,nil(huffma1450048681e_tree(X0))) = set(X0,nil(X0)) ),
inference(forward_demodulation,[],[f294,f295]) ).
tff(f478,plain,
pp(aa(a,bool,combc(a,fun(a,bool),bool,member(a),huffma1516701463abet_F(a,nil(huffma1450048681e_tree(a)))),a1)),
inference(forward_demodulation,[],[f260,f423]) ).
tff(f504,plain,
! [X0: $tType,X1: X0] : ~ pp(aa(X0,bool,combc(X0,fun(X0,bool),bool,member(X0),set(X0,nil(X0))),X1)),
inference(forward_demodulation,[],[f465,f295]) ).
tff(f509,plain,
pp(aa(a,bool,combc(a,fun(a,bool),bool,member(a),set(a,nil(a))),a1)),
inference(forward_demodulation,[],[f478,f472]) ).
tff(f516,plain,
$false,
inference(forward_subsumption_resolution,[],[f509,f504]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWW533_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n005.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.19 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 14:18:01 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.18/0.27 % (809392)Will run a generic schedule for satisfiability detection.
% 0.18/0.27 % (809403)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2369153863:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.27 % (809398)% WARNING: option uhcvi not known.
% 0.18/0.27 % (809397)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=545852949_2999 on theBenchmark for (2999ds/0Mi)
% 0.18/0.27 % (809399)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1507740195:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.18/0.27 % (809400)dis+10_1_sil=32000:sp=arity:random_seed=1274925213:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.18/0.27 % (809402)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1618594829:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.18/0.27 % (809398)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=895846064:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.18/0.27 % (809401)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=504039587:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.18/0.27 % Exception at run slice level
% 0.18/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.18/0.27 % (809402) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809392-809402"...
% 0.18/0.27 % (809401) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-809392-809401"...
% 0.18/0.27 % (809402)...printing done.
% 0.18/0.27 % (809402)Refutation found. Thanks to Tanya!
% 0.18/0.27 % SZS status ContradictoryAxioms for theBenchmark
% 0.18/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.27 % (809402)------------------------------
% 0.18/0.27 % (809402)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.27 % (809402)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.27 % (809402)CaDiCaL version: 2.1.3
% 0.18/0.27 % (809402)Termination reason: Refutation
% 0.18/0.27 % (809402)Time elapsed: 0.009 s
% 0.18/0.27 % (809402)Peak memory usage: 12 MB
% 0.18/0.27 % (809402)Instructions burned: 15 (million)
% 0.18/0.27 % (809392)Success in time 0.047 s
% 0.18/0.27 % Vampire exiting
%------------------------------------------------------------------------------