%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : LCL762_5 : TPTP v9.3.1. Released v6.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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 11:56:29 AM UTC 2026
% Result : Theorem 3.70s 1.51s
% Output : Refutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 2 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 4 ( 3 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 43 ( 43 usr; 6 con; 0-5 aty)
% Number of variables : 8 ( 8 !; 0 ?; 8 :)
% 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,
zero_zero:
!>[X0: $tType] : X0 ).
tff(func_def_1,type,
it: fun(dB,bool) ).
tff(func_def_2,type,
beta: fun(dB,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_size: dB > nat ).
tff(func_def_8,type,
liftn: ( nat * dB * nat ) > dB ).
tff(func_def_9,type,
subst: ( dB * dB * nat ) > dB ).
tff(func_def_10,type,
substn: ( dB * dB * nat ) > dB ).
tff(func_def_11,type,
step1:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(list(X0),fun(list(X0),bool)) ) ).
tff(func_def_12,type,
append:
!>[X0: $tType] : ( ( list(X0) * list(X0) ) > list(X0) ) ).
tff(func_def_13,type,
foldl:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,fun(X1,X0)) * X0 * list(X1) ) > X0 ) ).
tff(func_def_14,type,
insert:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_15,type,
cons:
!>[X0: $tType] : ( ( X0 * list(X0) ) > list(X0) ) ).
tff(func_def_16,type,
nil:
!>[X0: $tType] : list(X0) ).
tff(func_def_17,type,
list_case:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),X0)) * list(X1) ) > X0 ) ).
tff(func_def_18,type,
list_rec:
!>[X0: $tType,X1: $tType] : ( ( X0 * fun(X1,fun(list(X1),fun(X0,X0))) * list(X1) ) > X0 ) ).
tff(func_def_19,type,
list_size:
!>[X0: $tType] : ( ( fun(X0,nat) * list(X0) ) > nat ) ).
tff(func_def_20,type,
sublist:
!>[X0: $tType] : ( ( list(X0) * fun(nat,bool) ) > list(X0) ) ).
tff(func_def_21,type,
size_size:
!>[X0: $tType] : ( X0 > nat ) ).
tff(func_def_22,type,
conversep:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,bool)) > fun(X1,fun(X0,bool)) ) ).
tff(func_def_23,type,
accp:
!>[X0: $tType] : ( fun(X0,fun(X0,bool)) > fun(X0,bool) ) ).
tff(func_def_24,type,
aa:
!>[X0: $tType,X1: $tType] : ( ( fun(X0,X1) * X0 ) > X1 ) ).
tff(func_def_25,type,
fFalse: bool ).
tff(func_def_26,type,
fTrue: bool ).
tff(func_def_27,type,
fequal:
!>[X0: $tType] : fun(X0,fun(X0,bool)) ).
tff(func_def_28,type,
n: nat ).
tff(func_def_29,type,
sK0: dB > list(dB) ).
tff(func_def_30,type,
sK1: dB > dB ).
tff(func_def_31,type,
sK2: dB > nat ).
tff(func_def_32,type,
sK3: dB > dB ).
tff(func_def_33,type,
sK4: dB > dB ).
tff(func_def_34,type,
sK5: dB > dB ).
tff(func_def_35,type,
sK6: dB > dB ).
tff(func_def_36,type,
sK7: dB > nat ).
tff(func_def_37,type,
sK8:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_38,type,
sK9:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X1 ) ).
tff(func_def_39,type,
sK10:
!>[X0: $tType,X1: $tType] : ( fun(X0,fun(X1,X0)) > X0 ) ).
tff(func_def_40,type,
sK11:
!>[X0: $tType,X1: $tType] : ( ( fun(X1,X0) * fun(X1,X0) ) > X1 ) ).
tff(pred_def_1,type,
zero:
!>[X0: $tType] : $o ).
tff(pred_def_2,type,
list_ex1:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_3,type,
listsp:
!>[X0: $tType] : ( ( fun(X0,bool) * list(X0) ) > $o ) ).
tff(pred_def_4,type,
member:
!>[X0: $tType] : ( ( X0 * fun(X0,bool) ) > $o ) ).
tff(pred_def_5,type,
pp: bool > $o ).
tff(pred_def_6,type,
sP12: list(dB) > $o ).
tff(pred_def_7,type,
sP13: list(dB) > $o ).
tff(pred_def_8,type,
sP14: list(dB) > $o ).
tff(f8,axiom,
! [X0: $tType,X1: $tType,X2: X1,X3: fun(X1,fun(X0,X1))] : ( foldl(X1,X0,X3,X2,nil(X0)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_foldl__Nil) ).
tff(f105,axiom,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f106,conjecture,
pp(aa(dB,bool,it,var(n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).
tff(f107,negated_conjecture,
~ pp(aa(dB,bool,it,var(n))),
inference(negated_conjecture,[status(cth)],[f106]) ).
tff(f108,plain,
~ pp(aa(dB,bool,it,var(n))),
inference(flattening,[],[f107]) ).
tff(f137,plain,
pp(aa(dB,bool,it,foldl(dB,dB,app,var(n),nil(dB)))),
inference(cnf_transformation,[],[f105]) ).
tff(f138,plain,
~ pp(aa(dB,bool,it,var(n))),
inference(cnf_transformation,[],[f108]) ).
tff(f172,plain,
! [X1: $tType,X0: $tType,X2: X1,X3: fun(X1,fun(X0,X1))] : ( foldl(X1,X0,X3,X2,nil(X0)) = X2 ),
inference(cnf_transformation,[],[f8]) ).
tff(f193,plain,
pp(aa(dB,bool,it,var(n))),
inference(forward_demodulation,[],[f137,f172]) ).
tff(f194,plain,
$false,
inference(forward_subsumption_resolution,[],[f193,f138]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL762_5 : TPTP v9.3.1. Released v6.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n003.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 27 16:47:41 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 Running: /export/starexec/sandbox2/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.70/1.51 % (772137)Detected formulas, will run a generic FOF schedule.
% 3.70/1.51 % (772142)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=3953083086:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.70/1.51 % (772145)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=3206404015:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.70/1.51 % (772144)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=2936365908:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.70/1.51 % (772143)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1369935079:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.70/1.51 % (772145)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.70/1.51 % (772145)First to succeed.
% 3.70/1.51 % (772145)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-772137"
% 3.70/1.51 % (772144)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 3.70/1.51 % (772147)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2334645260:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.70/1.51 % (772148)dis-21_1_sil=8000:lcm=predicate:random_seed=2688234319:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.70/1.51 % (772146)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=165595510:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.70/1.51 % (772146)Also succeeded, but the first one will report.
% 3.70/1.51 % (772147)Also succeeded, but the first one will report.
% 3.70/1.51 % (772148)Instruction limit reached!
% 3.70/1.51 % (772148)------------------------------
% 3.70/1.51 % (772148)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.51 % (772148)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.51 % (772148)CaDiCaL version: 2.1.3
% 3.70/1.51 % (772148)Termination reason: Instruction limit
% 3.70/1.51 % (772148)Termination phase: Saturation
% 3.70/1.51 % (772148)Time elapsed: 0.074 s
% 3.70/1.51 % (772148)Peak memory usage: 89 MB
% 3.70/1.51 % (772148)Instructions burned: 130 (million)
% 3.70/1.51 % Exception at run slice level
% 3.70/1.51 User error: GNN currently only supports monomorphic FOL.
% 3.70/1.51 % (772156)lrs+10_1_sil=8000:sp=occurrence:random_seed=3149893134:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.70/1.51 % (772145)Refutation found. Thanks to Tanya!
% 3.70/1.51 % SZS status Theorem for theBenchmark
% 3.70/1.51 % SZS output start Proof for theBenchmark
% See solution above
% 3.70/1.51 % (772145)------------------------------
% 3.70/1.51 % (772145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.51 % (772145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.51 % (772145)CaDiCaL version: 2.1.3
% 3.70/1.51 % (772145)Termination reason: Refutation
% 3.70/1.51 % (772145)Time elapsed: 0.004 s
% 3.70/1.51 % (772145)Peak memory usage: 88 MB
% 3.70/1.51 % (772145)Instructions burned: 4 (million)
% 3.70/1.51 % (772145)------------------------------
% 3.70/1.51 % (772145)------------------------------
% 3.70/1.51 % (772137)Success in time 0.438 s
% 3.70/1.51 % Vampire exiting
%------------------------------------------------------------------------------