%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL764_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 12:00:30 PM UTC 2026
% Result : Theorem 0.23s 0.52s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 8 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 46 ( 46 usr; 3 con; 0-5 aty)
% Number of variables : 6 ( 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
tff(type_def_5,type,
bool: $tType ).
tff(type_def_6,type,
dB: $tType ).
tff(type_def_7,type,
list: $tType > $tType ).
tff(type_def_8,type,
nat: $tType ).
tff(type_def_9,type,
fun: ( $tType * $tType ) > $tType ).
tff(type_def_10,type,
product_prod: ( $tType * $tType ) > $tType ).
tff(func_def_0,type,
product:
!>[X0: $tType,X1: $tType] : ( ( list(X0) * list(X1) ) > list(product_prod(X0,X1)) ) ).
tff(func_def_1,type,
equal_equal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_2,type,
it: fun(dB,bool) ).
tff(func_def_3,type,
lift: ( dB * nat ) > dB ).
tff(func_def_4,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_5,type,
butlast:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_6,type,
hd:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_7,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_8,type,
last:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_9,type,
linorder_insort_key:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 * list(X0) ) > list(X0) ) ).
tff(func_def_10,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_11,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_12,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_13,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_14,type,
maps:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,list(X1)) * list(X0) ) > list(X1) ) ).
tff(func_def_15,type,
replicate:
!>[X0: $tType] : ( ( nat * X0 ) > list(X0) ) ).
tff(func_def_16,type,
rev:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_17,type,
rotate1:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_18,type,
splice:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_19,type,
tl:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_20,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_21,type,
fFalse: bool ).
tff(func_def_22,type,
fTrue: bool ).
tff(func_def_23,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_24,type,
sK0:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > X0 ) ).
tff(func_def_25,type,
sK1:
!>[X0: $tType] : ( ( list(X0) * fun(X0,bool) ) > list(X0) ) ).
tff(func_def_26,type,
sK2:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_27,type,
sK3:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_28,type,
sK4:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_29,type,
sK5:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_30,type,
sK6:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_31,type,
sK7:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_32,type,
sK8:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_33,type,
sK9:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_34,type,
sK10:
!>[X0: $tType] : ( ( list(X0) * X0 * list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_35,type,
sK11:
!>[X0: $tType] : ( ( list(X0) * list(X0) * list(X0) * X0 ) > list(X0) ) ).
tff(func_def_36,type,
sK12:
!>[X0: $tType] : ( fun(list(X0),bool) > X0 ) ).
tff(func_def_37,type,
sK13:
!>[X0: $tType] : ( fun(list(X0),bool) > list(X0) ) ).
tff(func_def_38,type,
sK14:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_39,type,
sK15:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_40,type,
sK16:
!>[X0: $tType] : ( list(X0) > list(X0) ) ).
tff(func_def_41,type,
sK17:
!>[X0: $tType] : ( list(X0) > X0 ) ).
tff(func_def_42,type,
sK18:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
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,
linorder:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_5,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_6,type,
member:
!>[X0: $tType] : ( ( list(X0) * X0 ) > $o ) ).
tff(pred_def_7,type,
null:
!>[X0: $tType] : ( list(X0) > $o ) ).
tff(pred_def_8,type,
pp: bool > $o ).
tff(f1,axiom,
! [X0: $tType,X3: fun(X0,bool)] : listsp(X0,X3,nil(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_listsp_ONil) ).
tff(f114,conjecture,
listsp(dB,it,nil(dB)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
tff(f115,negated_conjecture,
~ listsp(dB,it,nil(dB)),
inference(negated_conjecture,[status(cth)],[f114]) ).
tff(f116,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(rectify,[],[f1]) ).
tff(f118,plain,
~ listsp(dB,it,nil(dB)),
inference(flattening,[],[f115]) ).
tff(f218,plain,
! [X0: $tType,X1: fun(X0,bool)] : listsp(X0,X1,nil(X0)),
inference(cnf_transformation,[],[f116]) ).
tff(f393,plain,
~ listsp(dB,it,nil(dB)),
inference(cnf_transformation,[],[f118]) ).
tff(f395,plain,
$false,
inference(resolution,[],[f218,f393]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : LCL764_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.17/0.44 % Computer : n005.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Sun Sep 27 16:45:16 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.23/0.48 Running first-order model finding
% 0.23/0.48 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.23/0.52 % (4525)Will run a generic schedule for satisfiability detection.
% 0.23/0.52 % (4535)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3082085972:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.52 % (4535) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4525-4535"...
% 0.23/0.52 % (4531)% WARNING: option uhcvi not known.
% 0.23/0.52 % (4535)...printing done.
% 0.23/0.52 % (4535)Refutation found. Thanks to Tanya!
% 0.23/0.52 % SZS status Theorem for theBenchmark
% 0.23/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.52 % (4535)------------------------------
% 0.23/0.52 % (4535)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.52 % (4535)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.52 % (4535)CaDiCaL version: 2.1.3
% 0.23/0.52 % (4535)Termination reason: Refutation
% 0.23/0.52 % (4535)Time elapsed: 0.005 s
% 0.23/0.52 % (4535)Peak memory usage: 12 MB
% 0.23/0.52 % (4535)Instructions burned: 14 (million)
% 0.23/0.52 % (4525)Success in time 0.026 s
% 0.23/0.52 % Vampire exiting
%------------------------------------------------------------------------------