%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : LCL774_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 : n004.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:33 PM UTC 2026
% Result : Theorem 0.16s 0.47s
% Output : Refutation 0.16s
% 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 : 2 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 35 ( 35 usr; 6 con; 0-5 aty)
% Number of variables : 3 ( 3 !; 0 ?; 3 :)
% 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(func_def_0,type,
plus_plus:
!>[X0: $tType] : fun(X0,fun(X0,X0)) ).
tff(func_def_1,type,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_2,type,
it: fun(dB,bool) ).
tff(func_def_3,type,
abs: dB > dB ).
tff(func_def_4,type,
app: fun(dB,fun(dB,dB)) ).
tff(func_def_5,type,
var: nat > dB ).
tff(func_def_6,type,
dB_case:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,X0)) * fun(dB,X0) * dB ) > X0 ) ).
tff(func_def_7,type,
dB_rec:
!>[X0: $tType] : ( ( fun(nat,X0) * fun(dB,fun(dB,fun(X0,fun(X0,X0)))) * fun(dB,fun(X0,X0)) * dB ) > X0 ) ).
tff(func_def_8,type,
dB_size: dB > nat ).
tff(func_def_9,type,
lift: ( dB * nat ) > dB ).
tff(func_def_10,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_11,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_12,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_15,type,
suc: nat > nat ).
tff(func_def_16,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_17,type,
fFalse: bool ).
tff(func_def_18,type,
fTrue: bool ).
tff(func_def_19,type,
i: nat ).
tff(func_def_20,type,
r: dB ).
tff(func_def_21,type,
sK0: dB > dB ).
tff(func_def_22,type,
sK1: dB > dB ).
tff(func_def_23,type,
sK2: dB > list(dB) ).
tff(func_def_24,type,
sK3: dB > dB ).
tff(func_def_25,type,
sK4: dB > list(dB) ).
tff(func_def_26,type,
sK5: dB > nat ).
tff(func_def_27,type,
sK6: nat > nat ).
tff(func_def_28,type,
sK7: fun(nat,bool) > nat ).
tff(func_def_29,type,
sK8: fun(nat,bool) > nat ).
tff(func_def_30,type,
sK9: nat > nat ).
tff(func_def_31,type,
sK10:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(func_def_32,type,
sK11: ( dB * dB ) > dB ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_3,type,
semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_4,type,
comm_monoid_add:
!>[X0: $tType] : $o ).
tff(pred_def_5,type,
ab_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_6,type,
cancel_semigroup_add:
!>[X0: $tType] : $o ).
tff(pred_def_7,type,
cancel146912293up_add:
!>[X0: $tType] : $o ).
tff(pred_def_8,type,
linord219039673up_add:
!>[X0: $tType] : $o ).
tff(pred_def_9,type,
beta: ( dB * dB ) > $o ).
tff(pred_def_10,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_11,type,
pp: bool > $o ).
tff(f1,axiom,
! [X3: nat] : pp(aa(dB,bool,it,var(X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_Var__IT) ).
tff(f110,conjecture,
pp(aa(dB,bool,it,var(i))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_2) ).
tff(f111,negated_conjecture,
~ pp(aa(dB,bool,it,var(i))),
inference(negated_conjecture,[status(cth)],[f110]) ).
tff(f112,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(rectify,[],[f1]) ).
tff(f114,plain,
~ pp(aa(dB,bool,it,var(i))),
inference(flattening,[],[f111]) ).
tff(f152,plain,
! [X0: nat] : pp(aa(dB,bool,it,var(X0))),
inference(cnf_transformation,[],[f112]) ).
tff(f307,plain,
~ pp(aa(dB,bool,it,var(i))),
inference(cnf_transformation,[],[f114]) ).
tff(f348,plain,
$false,
inference(resolution,[],[f152,f307]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL774_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.04 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38 % Computer : n004.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Sun Sep 27 16:47:07 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.41 Running first-order model finding
% 0.10/0.41 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.16/0.47 % (3732851)Will run a generic schedule for satisfiability detection.
% 0.16/0.47 % (3732860)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=27395825:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.16/0.47 % (3732857)% WARNING: option uhcvi not known.
% 0.16/0.47 % (3732860) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3732851-3732860"...
% 0.16/0.47 % (3732860)...printing done.
% 0.16/0.47 % (3732860)Refutation found. Thanks to Tanya!
% 0.16/0.47 % SZS status Theorem for theBenchmark
% 0.16/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47 % (3732860)------------------------------
% 0.16/0.47 % (3732860)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47 % (3732860)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47 % (3732860)CaDiCaL version: 2.1.3
% 0.16/0.47 % (3732860)Termination reason: Refutation
% 0.16/0.47 % (3732860)Time elapsed: 0.005 s
% 0.16/0.47 % (3732860)Peak memory usage: 12 MB
% 0.16/0.47 % (3732860)Instructions burned: 17 (million)
% 0.16/0.47 % (3732851)Success in time 0.039 s
% 0.16/0.47 % Vampire exiting
%------------------------------------------------------------------------------