%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWW504_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n006.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:21 PM UTC 2026
% Result : Theorem 0.19s 0.29s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-5 aty)
% Number of functors : 47 ( 47 usr; 5 con; 0-5 aty)
% Number of variables : 11 ( 6 !; 5 ?; 11 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
com: $tType ).
tff(type_def_6,type,
state: $tType ).
tff(type_def_7,type,
node: ( $tType * $tType ) > $tType ).
tff(type_def_8,type,
bool: $tType ).
tff(type_def_9,type,
hoare_28830079triple: $tType > $tType ).
tff(type_def_10,type,
int: $tType ).
tff(type_def_11,type,
nat: $tType ).
tff(type_def_12,type,
char: $tType ).
tff(type_def_13,type,
literal: $tType ).
tff(type_def_14,type,
nibble: $tType ).
tff(type_def_15,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_16,type,
sum_sum: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
one_one:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
sgn_sgn:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_2,type,
uminus_uminus:
!>[X0: $tType] : ( X0 > X0 ) ).
tff(func_def_3,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_4,type,
bool_size: bool > nat ).
tff(func_def_5,type,
equal_equal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_6,type,
hoare_689268419triple:
!>[X0: $tType] : fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),hoare_28830079triple(X0)) ).
tff(func_def_7,type,
hoare_334633230triple:
!>[X0: $tType] : fun(hoare_28830079triple(X0),fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool)) ).
tff(func_def_8,type,
hoare_1841697145triple:
!>[X0: $tType] : ( ( fun(X0,fun(state,bool)) * com * fun(X0,fun(state,bool)) ) > hoare_28830079triple(X0) ) ).
tff(func_def_9,type,
hoare_376461865e_case:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_10,type,
hoare_678420151le_rec:
!>[X0: $tType,X1: $tType] : ( ( fun(fun(X0,fun(state,bool)),fun(com,fun(fun(X0,fun(state,bool)),X1))) * hoare_28830079triple(X0) ) > X1 ) ).
tff(func_def_11,type,
hoare_711253694ep_set:
!>[X0: $tType] : fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),bool) ).
tff(func_def_12,type,
hoare_47506394e_size:
!>[X0: $tType] : ( ( fun(X0,nat) * hoare_28830079triple(X0) ) > nat ) ).
tff(func_def_13,type,
nat_size: nat > nat ).
tff(func_def_14,type,
semiring_1_of_nat:
!>[X0: $tType] : ( nat > X0 ) ).
tff(func_def_15,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_16,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_17,type,
char1: ( nibble * nibble ) > char ).
tff(func_def_18,type,
char_case:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char ) > X0 ) ).
tff(func_def_19,type,
char_rec:
!>[X0: $tType] : ( ( fun(nibble,fun(nibble,X0)) * char ) > X0 ) ).
tff(func_def_20,type,
char_size: char > nat ).
tff(func_def_21,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_22,type,
fFalse: bool ).
tff(func_def_23,type,
fTrue: bool ).
tff(func_def_24,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_25,type,
sK0:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).
tff(func_def_26,type,
sK1:
!>[X0: $tType] : ( hoare_28830079triple(X0) > com ) ).
tff(func_def_27,type,
sK2:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(X0,fun(state,bool)) ) ).
tff(func_def_28,type,
sK3:
!>[X0: $tType] : ( fun(fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool),bool) > hoare_28830079triple(X0) ) ).
tff(func_def_29,type,
sK4:
!>[X0: $tType] : ( fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool) > hoare_28830079triple(X0) ) ).
tff(func_def_30,type,
sK5:
!>[X0: $tType] : ( fun(hoare_28830079triple(X0),bool) > fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool) ) ).
tff(func_def_31,type,
sK6:
!>[X0: $tType] : ( hoare_28830079triple(X0) > fun(node(sum_sum(com,fun(X0,fun(state,bool))),sum_sum(state,X0)),bool) ) ).
tff(func_def_32,type,
sK7:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,X0) ) > X1 ) ).
tff(func_def_33,type,
sK8:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,bool) * fun(X0,X1) ) > X0 ) ).
tff(func_def_34,type,
sK9:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,bool) * fun(X0,bool) * fun(X0,X1) ) > X0 ) ).
tff(func_def_35,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,bool) * fun(X1,X0) ) > X1 ) ).
tff(func_def_36,type,
sK11: char > nibble ).
tff(func_def_37,type,
sK12: char > nibble ).
tff(func_def_38,type,
sK13: fun(nat,bool) > nat ).
tff(func_def_39,type,
sK14:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_40,type,
sK15: state ).
tff(func_def_41,type,
sK16: state ).
tff(func_def_42,type,
sK17: state ).
tff(pred_def_1,type,
enum:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
cl_HOL_Oequal:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
one:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
sgn_if:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
group_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
semiring_1:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
zero_neq_one:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
semiring_char_0:
!>[X0: $tType] : $o ).
tff(pred_def_10,type,
linordered_idom:
!>[X0: $tType] : $o ).
tff(pred_def_11,type,
linordered_semidom:
!>[X0: $tType] : $o ).
tff(pred_def_12,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_13,type,
semigroup:
!>[X0: $tType] : ( fun(X0,fun(X0,X0)) > $o ) ).
tff(pred_def_17,type,
ord_less:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_18,type,
type_definition:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * fun(X1,X0) * fun(X1,bool) ) > $o ) ).
tff(pred_def_19,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_20,type,
pp: bool > $o ).
tff(f139,axiom,
? [X0: state,X1: state] : ( X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f140,conjecture,
! [X0: state] :
? [X1: state] : ( X1 != X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f141,negated_conjecture,
~ ! [X0: state] :
? [X1: state] : ( X1 != X0 ),
inference(negated_conjecture,[status(cth)],[f140]) ).
tff(f221,plain,
? [X0: state] :
! [X1: state] : ( X0 = X1 ),
inference(ennf_transformation,[],[f141]) ).
tff(f388,plain,
sK15 != sK16,
inference(cnf_transformation,[],[f139]) ).
tff(f389,plain,
! [X1: state] : ( sK17 = X1 ),
inference(cnf_transformation,[],[f221]) ).
tff(f461,plain,
! [X0: state,X1: state] : ( X0 = X1 ),
inference(superposition,[],[f389,f389]) ).
tff(f464,plain,
$false,
inference(forward_subsumption_resolution,[],[f388,f461]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWW504_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n006.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.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Mon Sep 28 14:15:10 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.29 % (3991037)Will run a generic schedule for satisfiability detection.
% 0.19/0.29 % (3991042)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3511923117_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.29 % Exception at run slice level
% 0.19/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.29 % (3991043)% WARNING: option uhcvi not known.
% 0.19/0.29 % (3991043)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=377814912:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.29 % (3991044)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3447940604:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.29 % (3991045)dis+10_1_sil=32000:sp=arity:random_seed=4166095564:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.29 % (3991046)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1371410992:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.29 % (3991047)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4189322035:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.29 % (3991048)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3904399495:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.29 % (3991043) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3991037-3991043"...
% 0.19/0.29 % (3991045) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3991037-3991045"...
% 0.19/0.29 % (3991050)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=3271777542:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.29 % (3991043)...printing done.
% 0.19/0.29 % (3991044) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3991037-3991044"...
% 0.19/0.29 % (3991045)...printing done.
% 0.19/0.29 % Exception at run slice level
% 0.19/0.29 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.19/0.29 % (3991043)Refutation found. Thanks to Tanya!
% 0.19/0.29 % SZS status Theorem for theBenchmark
% 0.19/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.29 % (3991043)------------------------------
% 0.19/0.29 % (3991043)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.29 % (3991043)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.29 % (3991043)CaDiCaL version: 2.1.3
% 0.19/0.29 % (3991043)Termination reason: Refutation
% 0.19/0.29 % (3991043)Time elapsed: 0.006 s
% 0.19/0.29 % (3991043)Peak memory usage: 12 MB
% 0.19/0.29 % (3991043)Instructions burned: 8 (million)
% 0.19/0.29 % (3991037)Success in time 0.058 s
% 0.19/0.29 % Vampire exiting
%------------------------------------------------------------------------------