%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWV779_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 : n015.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:26:24 PM UTC 2026
% Result : Theorem 0.20s 0.27s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of FOOLs : 1 ( 1 fml; 0 var)
% Number of types : 5 ( 4 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 50 ( 50 usr; 7 con; 0-5 aty)
% Number of variables : 12 ( 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
event: $tType ).
tff(type_def_6,type,
bool: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
agent: $tType ).
tff(type_def_9,type,
msg: $tType ).
tff(type_def_10,type,
fun: ( $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)) > fun(X1,fun(X0,X2)) ) ).
tff(func_def_2,type,
combs:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( fun(X0,fun(X1,X2)) * fun(X0,X1) ) > fun(X0,X2) ) ).
tff(func_def_3,type,
gets: ( agent * msg ) > event ).
tff(func_def_4,type,
initState: agent > fun(msg,bool) ).
tff(func_def_5,type,
knows: ( agent * list(event) ) > fun(msg,bool) ).
tff(func_def_6,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_7,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_8,type,
insert1:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_9,type,
cons:
!>[X0: $tType] : fun(X0,fun(list(X0),list(X0))) ).
tff(func_def_10,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_11,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_12,type,
rev:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_13,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_14,type,
spy: agent ).
tff(func_def_15,type,
nS_Sha254967238shared: fun(list(event),bool) ).
tff(func_def_16,type,
collect:
!>[X0: $tType] : ( fun(X0,bool) > fun(X0,bool) ) ).
tff(func_def_17,type,
insert:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > fun(X0,bool) ) ).
tff(func_def_18,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_19,type,
fFalse: bool ).
tff(func_def_20,type,
fNot: fun(bool,bool) ).
tff(func_def_21,type,
fTrue: bool ).
tff(func_def_22,type,
fdisj: fun(bool,fun(bool,bool)) ).
tff(func_def_23,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_24,type,
fimplies: fun(bool,fun(bool,bool)) ).
tff(func_def_25,type,
member:
!>[X0: $tType] : fun(X0,fun(fun(X0,bool),bool)) ).
tff(func_def_26,type,
sK0:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_27,type,
sK1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_28,type,
sK2:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_29,type,
sK3:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_30,type,
sK4:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_31,type,
sK5:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_32,type,
sK6:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_33,type,
sK7:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_34,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_35,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_36,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_37,type,
sK11:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_38,type,
sK12:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_39,type,
sK13:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_40,type,
sK14:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_41,type,
sK15:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_42,type,
sK16:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_43,type,
sK17:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_44,type,
sK18:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_45,type,
sK19:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_46,type,
sK20:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_47,type,
sK21:
!>[X0: $tType] : ( ( fun(X0,bool) * X0 * fun(X0,bool) * X0 ) > fun(X0,bool) ) ).
tff(pred_def_1,type,
list_all:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
nS_Sha993195050haredp: list(event) > $o ).
tff(pred_def_4,type,
ord_less_eq:
!>[X0: $tType] : ( ( X0 * X0 ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(f28,axiom,
! [X0: $tType,X1: list(X0)] : ( rev(X0,X1) = foldl(list(X0),X0,combc(X0,list(X0),list(X0),cons(X0)),nil(X0),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_rev__foldl__cons) ).
tff(f31,axiom,
! [X0: $tType,X1: $tType,X2: X1,X3: fun(X1,fun(X0,X1))] : ( foldl(X1,X0,X3,X2,nil(X0)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_30_foldl__Nil) ).
tff(f116,conjecture,
knows(spy,nil(event)) = knows(spy,rev(event,nil(event))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f117,negated_conjecture,
( ( ~ knows(spy,nil(event)) ) = knows(spy,rev(event,nil(event))) ),
inference(negated_conjecture,[status(cth)],[f116]) ).
tff(f120,plain,
knows(spy,nil(event)) != knows(spy,rev(event,nil(event))),
inference(flattening,[],[f117]) ).
tff(f201,plain,
! [X0: $tType,X1: list(X0)] : ( rev(X0,X1) = foldl(list(X0),X0,combc(X0,list(X0),list(X0),cons(X0)),nil(X0),X1) ),
inference(cnf_transformation,[],[f28]) ).
tff(f206,plain,
! [X1: $tType,X0: $tType,X2: X1,X3: fun(X1,fun(X0,X1))] : ( foldl(X1,X0,X3,X2,nil(X0)) = X2 ),
inference(cnf_transformation,[],[f31]) ).
tff(f348,plain,
knows(spy,nil(event)) != knows(spy,rev(event,nil(event))),
inference(cnf_transformation,[],[f120]) ).
tff(f401,plain,
knows(spy,nil(event)) != knows(spy,foldl(list(event),event,combc(event,list(event),list(event),cons(event)),nil(event),nil(event))),
inference(definition_unfolding,[],[f348,f201]) ).
tff(f471,plain,
knows(spy,nil(event)) != knows(spy,nil(event)),
inference(superposition,[],[f401,f206]) ).
tff(f472,plain,
$false,
inference(trivial_inequality_removal,[],[f471]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWV779_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.07/0.17 % Computer : n015.cluster.edu
% 0.07/0.17 % Model : x86_64 x86_64
% 0.07/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.17 % Memory : 8046.5625MB
% 0.07/0.17 % OS : Linux 6.8.0-71-generic
% 0.07/0.17 % CPULimit : 300
% 0.07/0.17 % WCLimit : 300
% 0.07/0.17 % DateTime : Mon Sep 28 12:35:02 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21 Running first-order model finding
% 0.07/0.21 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.20/0.27 % (2599350)Will run a generic schedule for satisfiability detection.
% 0.20/0.27 % (2599364)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2830097249_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.27 % (2599365)% WARNING: option uhcvi not known.
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (2599365)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1940870275:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.27 % (2599367)dis+10_1_sil=32000:sp=arity:random_seed=3004533177:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.27 % (2599369)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2113721271:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.27 % (2599366)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1266742724:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.27 % (2599376)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2672107489:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.27 % (2599370)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1776717605:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.27 % (2599368)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2323351587:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.27 % (2599367) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2599350-2599367"...
% 0.20/0.27 % (2599365) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2599350-2599365"...
% 0.20/0.27 % Exception at run slice level
% 0.20/0.27 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 0.20/0.27 % (2599367)...printing done.
% 0.20/0.27 % (2599365)...printing done.
% 0.20/0.27 % (2599366) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2599350-2599366"...
% 0.20/0.27 % (2599365)Refutation found. Thanks to Tanya!
% 0.20/0.27 % SZS status Theorem for theBenchmark
% 0.20/0.27 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.27 % (2599365)------------------------------
% 0.20/0.27 % (2599365)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.27 % (2599365)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.27 % (2599365)CaDiCaL version: 2.1.3
% 0.20/0.27 % (2599365)Termination reason: Refutation
% 0.20/0.27 % (2599365)Time elapsed: 0.012 s
% 0.20/0.27 % (2599365)Peak memory usage: 12 MB
% 0.20/0.27 % (2599365)Instructions burned: 20 (million)
% 0.20/0.27 % (2599350)Success in time 0.055 s
% 0.20/0.27 % Vampire exiting
%------------------------------------------------------------------------------