%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : ITP061^2 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 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 : Wed Sep 30 08:10:33 AM UTC 2026
% Result : Theorem 15.19s 2.41s
% Output : Refutation 15.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ITP061^2 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.19 % Computer : n003.cluster.edu
% 0.08/0.19 % Model : x86_64 x86_64
% 0.08/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.19 % Memory : 8046.5625MB
% 0.08/0.19 % OS : Linux 6.8.0-71-generic
% 0.08/0.19 % CPULimit : 300
% 0.08/0.19 % WCLimit : 300
% 0.08/0.19 % DateTime : Tue Sep 29 19:47:44 UTC 2026
% 0.08/0.19 % CPUTime :
% 0.08/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.22 Running first-order model finding
% 0.08/0.22 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
% 5.51/1.13 % (2973709)Will run a generic schedule for satisfiability detection.
% 5.51/1.13 % (2973715)% WARNING: option uhcvi not known.
% 5.51/1.13 % (2973715)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3306305497:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 5.51/1.13 % (2973717)dis+10_1_sil=32000:sp=arity:random_seed=1494443515:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 5.51/1.13 % (2973714)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1883145443_2999 on theBenchmark for (2999ds/0Mi)
% 5.51/1.13 % (2973716)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1865154485:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 5.51/1.13 % (2973718)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3045849382:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 5.51/1.13 % (2973715)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.51/1.13 % (2973719)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2396321006:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 5.51/1.13 % (2973720)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3446763124:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 5.51/1.13 % (2973715)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 5.51/1.13 % (2973718)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.51/1.13 % Exception at run slice level
% 5.51/1.13 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.51/1.13 % (2973717)Instruction limit reached!
% 5.51/1.13 % (2973717)------------------------------
% 5.51/1.13 % (2973717)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.51/1.13 % (2973717)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.13 % (2973717)CaDiCaL version: 2.1.3
% 5.51/1.13 % (2973717)Termination reason: Instruction limit
% 5.51/1.13 % (2973717)Termination phase: Saturation
% 5.51/1.13 % (2973717)Time elapsed: 0.048 s
% 5.51/1.13 % (2973717)Peak memory usage: 13 MB
% 5.51/1.13 % (2973717)Instructions burned: 104 (million)
% 5.51/1.13 % (2973728)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=898746600:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 5.51/1.13 % (2973718)Instruction limit reached!
% 5.51/1.13 % (2973718)------------------------------
% 5.51/1.13 % (2973718)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.51/1.13 % (2973718)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.13 % (2973718)CaDiCaL version: 2.1.3
% 5.51/1.13 % (2973718)Termination reason: Instruction limit
% 5.51/1.13 % (2973718)Termination phase: Saturation
% 5.51/1.13 % (2973718)Time elapsed: 0.052 s
% 5.51/1.13 % (2973718)Peak memory usage: 13 MB
% 5.51/1.13 % (2973718)Instructions burned: 117 (million)
% 5.51/1.13 % (2973719)Instruction limit reached!
% 5.51/1.13 % (2973719)------------------------------
% 5.51/1.13 % (2973719)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 5.51/1.13 % (2973719)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 5.51/1.13 % (2973719)CaDiCaL version: 2.1.3
% 5.51/1.13 % (2973719)Termination reason: Instruction limit
% 5.51/1.13 % (2973719)Termination phase: Saturation
% 5.51/1.13 % (2973719)Time elapsed: 0.063 s
% 5.51/1.13 % (2973719)Peak memory usage: 14 MB
% 5.51/1.13 % (2973719)Instructions burned: 131 (million)
% 5.51/1.13 % (2973729)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1997515138:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 5.51/1.13 % (2973731)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=563643728:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 5.51/1.13 % Exception at run slice level
% 5.51/1.13 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 5.51/1.13 % (2973731)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 5.51/1.13 % (2973732)ott-21_1_sil=16000:fs=off:random_seed=2739595662:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 5.51/1.13 % (2973735)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3289630470:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 15.19/2.41 % (2973731)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.19/2.41 % (2973720)Instruction limit reached!
% 15.19/2.41 % (2973720)------------------------------
% 15.19/2.41 % (2973720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973720)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973720)Termination reason: Instruction limit
% 15.19/2.41 % (2973720)Termination phase: Saturation
% 15.19/2.41 % (2973720)Time elapsed: 0.113 s
% 15.19/2.41 % (2973720)Peak memory usage: 14 MB
% 15.19/2.41 % (2973720)Instructions burned: 159 (million)
% 15.19/2.41 % (2973738)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3942329786:fmbsr=1.3:i=865:ins=25_2998 on theBenchmark for (2998ds/865Mi)
% 15.19/2.41 % (2973729)Instruction limit reached!
% 15.19/2.41 % (2973729)------------------------------
% 15.19/2.41 % (2973729)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973729)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973729)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973729)Termination reason: Instruction limit
% 15.19/2.41 % (2973729)Termination phase: Saturation
% 15.19/2.41 % (2973729)Time elapsed: 0.062 s
% 15.19/2.41 % (2973729)Peak memory usage: 13 MB
% 15.19/2.41 % (2973729)Instructions burned: 132 (million)
% 15.19/2.41 % (2973740)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=3574895626:i=1179_2998 on theBenchmark for (2998ds/1179Mi)
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973742)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3044781010:i=889:ins=1_2997 on theBenchmark for (2997ds/889Mi)
% 15.19/2.41 % (2973732)Instruction limit reached!
% 15.19/2.41 % (2973732)------------------------------
% 15.19/2.41 % (2973732)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973732)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973732)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973732)Termination reason: Instruction limit
% 15.19/2.41 % (2973732)Termination phase: Saturation
% 15.19/2.41 % (2973732)Time elapsed: 0.125 s
% 15.19/2.41 % (2973732)Peak memory usage: 13 MB
% 15.19/2.41 % (2973732)Instructions burned: 181 (million)
% 15.19/2.41 % (2973744)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3882396850:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2997 on theBenchmark for (2997ds/692Mi)
% 15.19/2.41 % (2973744)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973746)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=1063390915:i=879:kws=inv_precedence:fsr=off_2996 on theBenchmark for (2996ds/879Mi)
% 15.19/2.41 % (2973746)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.19/2.41 % (2973735)Instruction limit reached!
% 15.19/2.41 % (2973735)------------------------------
% 15.19/2.41 % (2973735)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973735)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973735)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973735)Termination reason: Instruction limit
% 15.19/2.41 % (2973735)Termination phase: Saturation
% 15.19/2.41 % (2973735)Time elapsed: 0.227 s
% 15.19/2.41 % (2973735)Peak memory usage: 14 MB
% 15.19/2.41 % (2973735)Instructions burned: 477 (million)
% 15.19/2.41 % (2973748)fmb+10_1_sil=64000:random_seed=959554858:i=22061:nm=2:gsp=on_2996 on theBenchmark for (2996ds/22061Mi)
% 15.19/2.41 % (2973748)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973750)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=3789996944:i=9515:nm=5_2995 on theBenchmark for (2995ds/9515Mi)
% 15.19/2.41 % (2973731)Instruction limit reached!
% 15.19/2.41 % (2973731)------------------------------
% 15.19/2.41 % (2973731)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973731)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973731)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973731)Termination reason: Instruction limit
% 15.19/2.41 % (2973731)Termination phase: Saturation
% 15.19/2.41 % (2973731)Time elapsed: 0.352 s
% 15.19/2.41 % (2973731)Peak memory usage: 17 MB
% 15.19/2.41 % (2973731)Instructions burned: 685 (million)
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973752)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1505196811:fmbsr=1.7:i=920_2995 on theBenchmark for (2995ds/920Mi)
% 15.19/2.41 % (2973753)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=1826369125:i=5131_2995 on theBenchmark for (2995ds/5131Mi)
% 15.19/2.41 % (2973753)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973756)ott+11_16_sil=32000:fde=unused:bsd=on:sas=cadical:sp=arity:spb=units:lsd=10:nwc=3:random_seed=1402474462:i=1472:ins=7:fdi=8:gsp=on_2994 on theBenchmark for (2994ds/1472Mi)
% 15.19/2.41 % (2973756)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 15.19/2.41 % (2973756)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.19/2.41 % (2973744)Instruction limit reached!
% 15.19/2.41 % (2973744)------------------------------
% 15.19/2.41 % (2973744)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973744)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973744)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973744)Termination reason: Instruction limit
% 15.19/2.41 % (2973744)Termination phase: Saturation
% 15.19/2.41 % (2973744)Time elapsed: 0.411 s
% 15.19/2.41 % (2973744)Peak memory usage: 16 MB
% 15.19/2.41 % (2973744)Instructions burned: 693 (million)
% 15.19/2.41 % (2973758)fmb+10_1_sil=16000:sas=cadical:bce=on:fmbss=77:random_seed=2793140819:i=6324_2993 on theBenchmark for (2993ds/6324Mi)
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973746)Instruction limit reached!
% 15.19/2.41 % (2973746)------------------------------
% 15.19/2.41 % (2973746)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973746)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973746)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973746)Termination reason: Instruction limit
% 15.19/2.41 % (2973746)Termination phase: Saturation
% 15.19/2.41 % (2973746)Time elapsed: 0.436 s
% 15.19/2.41 % (2973746)Peak memory usage: 20 MB
% 15.19/2.41 % (2973746)Instructions burned: 880 (million)
% 15.19/2.41 % (2973760)fmb+10_1_fmbas=function:sil=32000:sas=cadical:fmbss=16:random_seed=213440253:fmbsr=2.30978:i=2174_2992 on theBenchmark for (2992ds/2174Mi)
% 15.19/2.41 % (2973740)Instruction limit reached!
% 15.19/2.41 % (2973740)------------------------------
% 15.19/2.41 % (2973740)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973740)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973740)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973740)Termination reason: Instruction limit
% 15.19/2.41 % (2973740)Termination phase: Saturation
% 15.19/2.41 % (2973740)Time elapsed: 0.592 s
% 15.19/2.41 % (2973740)Peak memory usage: 19 MB
% 15.19/2.41 % (2973740)Instructions burned: 1184 (million)
% 15.19/2.41 % (2973761)ott-2_1_sil=16000:newcnf=on:random_seed=3836516873:avsq=on:i=869:avsqr=1,16:kws=inv_arity_squared_2992 on theBenchmark for (2992ds/869Mi)
% 15.19/2.41 % (2973761)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 15.19/2.41 % (2973764)ott+10_1_sil=32000:tgt=ground:random_seed=3663893693:i=5114:av=off_2992 on theBenchmark for (2992ds/5114Mi)
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973766)fmb+10_1_sil=64000:sas=cadical:bce=on:rp=on:random_seed=2875746584:i=54282_2991 on theBenchmark for (2991ds/54282Mi)
% 15.19/2.41 % Exception at run slice level
% 15.19/2.41 User error: Finite model building is currently not compatible with polymorphism or higher-order constructs
% 15.19/2.41 % (2973768)dis-11_1_sil=16000:sp=reverse_frequency:alpa=true:random_seed=1421219061:i=3512:aac=none_2991 on theBenchmark for (2991ds/3512Mi)
% 15.19/2.41 % (2973768)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.19/2.41 % (2973756)Instruction limit reached!
% 15.19/2.41 % (2973756)------------------------------
% 15.19/2.41 % (2973756)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973756)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973756)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973756)Termination reason: Instruction limit
% 15.19/2.41 % (2973756)Termination phase: Saturation
% 15.19/2.41 % (2973756)Time elapsed: 0.635 s
% 15.19/2.41 % (2973756)Peak memory usage: 17 MB
% 15.19/2.41 % (2973756)Instructions burned: 1473 (million)
% 15.19/2.41 % (2973770)dis+21_1_sil=32000:sas=cadical:random_seed=2624120915:i=3773:amm=off_2988 on theBenchmark for (2988ds/3773Mi)
% 15.19/2.41 % (2973761)Instruction limit reached!
% 15.19/2.41 % (2973761)------------------------------
% 15.19/2.41 % (2973761)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973761)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973761)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973761)Termination reason: Instruction limit
% 15.19/2.41 % (2973761)Termination phase: Saturation
% 15.19/2.41 % (2973761)Time elapsed: 0.429 s
% 15.19/2.41 % (2973761)Peak memory usage: 18 MB
% 15.19/2.41 % (2973761)Instructions burned: 869 (million)
% 15.19/2.41 % (2973772)ott+11_1_sil=16000:gs=on:random_seed=1743750312:s2a=on:i=2251:s2at=3:kws=inv_arity_squared:nm=2:fsr=off:fsd=on_2987 on theBenchmark for (2987ds/2251Mi)
% 15.19/2.41 % (2973772)WARNING: Look ahead literal selection is not currently compatible with higher-order. Ignoring request to use
% 15.19/2.41 % (2973764) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2973709-2973764"...
% 15.19/2.41 % (2973764)...printing done.
% 15.19/2.41 % (2973764)Refutation found. Thanks to Tanya!
% 15.19/2.41 % SZS status Theorem for theBenchmark
% 15.19/2.41 % SZS output start Proof for theBenchmark
% 15.19/2.41 thf(type_def_5, type, configuration_ext: ($tType * $tType * $tType * $tType) > $tType).
% 15.19/2.41 thf(type_def_6, type, message: ($tType * $tType) > $tType).
% 15.19/2.41 thf(type_def_7, type, product_unit: $tType).
% 15.19/2.41 thf(type_def_8, type, list: $tType > $tType).
% 15.19/2.41 thf(type_def_9, type, set: $tType > $tType).
% 15.19/2.41 thf(type_def_10, type, nat: $tType).
% 15.19/2.41 thf(type_def_11, type, v: $tType).
% 15.19/2.41 thf(type_def_12, type, s: $tType).
% 15.19/2.41 thf(type_def_13, type, p: $tType).
% 15.19/2.41 thf(type_def_14, type, sTfun: ($tType * $tType) > $tType).
% 15.19/2.41 thf(func_def_0, type, type: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_1, type, size: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_2, type, one: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_3, type, minus: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_4, type, ord: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_5, type, order: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_6, type, group_add: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_7, type, no_bot: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_8, type, no_top: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_9, type, linorder: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_10, type, preorder: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_11, type, wellorder: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_12, type, dense_order: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_13, type, dense_linorder: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_14, type, ordered_ab_group_add: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_15, type, cancel146912293up_add: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_16, type, linord1659791738miring: !>[X0: $tType]:($o)).
% 15.19/2.41 thf(func_def_17, type, enabled: !>[X0: $tType, X1: $tType, X2: $tType]:((configuration_ext @ X0 @ X1 @ X2 @ product_unit > message @ X0 @ X1 > $o))).
% 15.19/2.41 thf(func_def_18, type, isReceiverOf: !>[X0: $tType, X1: $tType]:((X0 > message @ X0 @ X1 > $o))).
% 15.19/2.41 thf(func_def_19, type, firstOccurrence: !>[X0: $tType, X1: $tType, X2: $tType]:((list @ configuration_ext @ X0 @ X1 @ X2 @ product_unit > list @ message @ X0 @ X1 > message @ X0 @ X1 > nat > $o))).
% 15.19/2.41 thf(func_def_20, type, minimalEnabled: !>[X0: $tType, X1: $tType, X2: $tType]:((list @ configuration_ext @ X0 @ X1 @ X2 @ product_unit > list @ message @ X0 @ X1 > message @ X0 @ X1 > $o))).
% 15.19/2.41 thf(func_def_21, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 15.19/2.41 thf(func_def_22, type, one_one: !>[X0: $tType]:(X0)).
% 15.19/2.41 thf(func_def_23, type, prefixList: !>[X0: $tType]:((list @ X0 > list @ X0 > $o))).
% 15.19/2.41 thf(func_def_24, type, nil: !>[X0: $tType]:(list @ X0)).
% 15.19/2.41 thf(func_def_25, type, nth: !>[X0: $tType]:((list @ X0 > nat > X0))).
% 15.19/2.41 thf(func_def_26, type, suc: (nat > nat)).
% 15.19/2.41 thf(func_def_27, type, size_size: !>[X0: $tType]:((X0 > nat))).
% 15.19/2.41 thf(func_def_28, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 15.19/2.41 thf(func_def_29, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 15.19/2.41 thf(func_def_30, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 15.19/2.41 thf(func_def_31, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 15.19/2.41 thf(func_def_32, type, occM: nat).
% 15.19/2.41 thf(func_def_33, type, occM2: nat).
% 15.19/2.41 thf(func_def_34, type, consumedMsg: message @ p @ v).
% 15.19/2.41 thf(func_def_35, type, fe: (nat > list @ configuration_ext @ p @ v @ s @ product_unit)).
% 15.19/2.41 thf(func_def_36, type, firstOccSet: (nat > set @ message @ p @ v)).
% 15.19/2.41 thf(func_def_37, type, ft: (nat > list @ message @ p @ v)).
% 15.19/2.41 thf(func_def_38, type, index: nat).
% 15.19/2.41 thf(func_def_39, type, msg: message @ p @ v).
% 15.19/2.41 thf(func_def_40, type, msg2: message @ p @ v).
% 15.19/2.41 thf(func_def_41, type, msga: message @ p @ v).
% 15.19/2.41 thf(func_def_42, type, n0: nat).
% 15.19/2.41 thf(func_def_43, type, n: nat).
% 15.19/2.41 thf(func_def_44, type, p2: p).
% 15.19/2.41 thf(func_def_48, type, db2: !>[X0: $tType]:(X0)).
% 15.19/2.41 thf(func_def_49, type, db0: !>[X0: $tType]:(X0)).
% 15.19/2.41 thf(func_def_50, type, db1: !>[X0: $tType]:(X0)).
% 15.19/2.41 thf(func_def_51, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 15.19/2.41 thf(func_def_52, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 15.19/2.41 thf(func_def_53, type, vOR: ($o > $o > $o)).
% 15.19/2.41 thf(func_def_54, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 15.19/2.41 thf(func_def_55, type, vAND: ($o > $o > $o)).
% 15.19/2.41 thf(func_def_56, type, vNOT: ($o > $o)).
% 15.19/2.41 thf(func_def_57, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 15.19/2.41 thf(func_def_58, type, vIMP: ($o > $o > $o)).
% 15.19/2.41 thf(func_def_59, type, sP0: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 15.19/2.41 thf(func_def_60, type, sP1: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 15.19/2.41 thf(func_def_61, type, sP2: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 15.19/2.41 thf(func_def_62, type, sK3: !>[X0: $tType]:((nat > list @ X0))).
% 15.19/2.41 thf(func_def_63, type, sK4: (nat > nat > nat)).
% 15.19/2.41 thf(func_def_64, type, sK5: (nat > nat)).
% 15.19/2.41 thf(func_def_65, type, sK6: (nat > nat > nat)).
% 15.19/2.41 thf(func_def_66, type, sK7: ((nat > $o) > nat > nat > nat)).
% 15.19/2.41 thf(func_def_67, type, sK8: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_68, type, sK9: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_69, type, sK10: ((nat > $o) > nat > nat > nat)).
% 15.19/2.41 thf(func_def_70, type, sK11: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_71, type, sK12: ((nat > $o) > nat)).
% 15.19/2.41 thf(func_def_72, type, sK13: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_73, type, sK14: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_74, type, sK15: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_75, type, sK16: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_76, type, sK17: ((nat > $o) > nat)).
% 15.19/2.41 thf(func_def_77, type, sK18: ((nat > $o) > nat)).
% 15.19/2.41 thf(func_def_78, type, sK19: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_79, type, sK20: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_80, type, sK21: ((nat > $o) > nat)).
% 15.19/2.41 thf(func_def_81, type, sK22: (nat > (nat > $o) > nat)).
% 15.19/2.41 thf(func_def_82, type, sK23: !>[X0: $tType, X1: $tType]:(((X1 > $o) > (X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_83, type, sK24: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_84, type, sK25: ((nat > nat) > nat)).
% 15.19/2.41 thf(func_def_85, type, sK26: ((nat > nat) > nat)).
% 15.19/2.41 thf(func_def_86, type, sK27: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_87, type, sK28: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_88, type, sK29: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_89, type, sK30: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_90, type, sK31: ((nat > nat > $o) > nat)).
% 15.19/2.41 thf(func_def_91, type, sK32: !>[X0: $tType]:(((X0 > nat) > (X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_92, type, sK33: !>[X0: $tType]:(((nat > X0) > nat))).
% 15.19/2.41 thf(func_def_93, type, sK34: !>[X0: $tType]:(((nat > X0) > nat))).
% 15.19/2.41 thf(func_def_94, type, sK35: !>[X0: $tType]:(((nat > X0) > nat))).
% 15.19/2.41 thf(func_def_95, type, sK36: !>[X0: $tType]:(((nat > X0) > nat))).
% 15.19/2.41 thf(func_def_96, type, sK37: ((nat > $o) > nat)).
% 15.19/2.41 thf(func_def_97, type, sK38: !>[X0: $tType]:(((list @ X0 > $o) > list @ X0))).
% 15.19/2.41 thf(func_def_98, type, sK39: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_99, type, sK40: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_100, type, sK41: !>[X0: $tType]:(((X0 > nat) > (X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_101, type, sK42: !>[X0: $tType]:((nat > (X0 > nat) > (X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_102, type, sK43: ((nat > $o) > (nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_103, type, sK44: !>[X0: $tType]:((list @ X0 > list @ X0 > nat))).
% 15.19/2.41 thf(func_def_104, type, sK45: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_105, type, sK46: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_106, type, sK47: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_107, type, sK48: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_108, type, sK49: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_109, type, sK50: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_110, type, sK51: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_111, type, sK52: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_112, type, sK53: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_113, type, sK54: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_114, type, sK55: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_115, type, sK56: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_116, type, sK57: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_117, type, sK58: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_118, type, sK59: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_119, type, sK60: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_120, type, sK61: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_121, type, sK62: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_122, type, sK63: !>[X0: $tType]:(((X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_123, type, sK64: !>[X0: $tType]:((X0 > X0 > X0))).
% 15.19/2.41 thf(func_def_124, type, sK65: !>[X0: $tType]:((X0 > X0))).
% 15.19/2.41 thf(func_def_125, type, sK66: !>[X0: $tType]:((X0 > X0))).
% 15.19/2.41 thf(func_def_126, type, sK67: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_127, type, sK68: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_128, type, sK69: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_129, type, sK70: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_130, type, sK71: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_131, type, sK72: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_132, type, sK73: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_133, type, sK74: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_134, type, sK75: !>[X0: $tType]:(((X0 > nat) > (X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_135, type, sK76: ((nat > $o) > nat)).
% 15.19/2.41 thf(func_def_136, type, sK77: !>[X0: $tType]:((X0 > X0 > X0 > X0))).
% 15.19/2.41 thf(func_def_137, type, sK78: !>[X0: $tType]:((X0 > X0 > X0 > X0))).
% 15.19/2.41 thf(func_def_138, type, sK79: !>[X0: $tType]:((X0 > X0 > X0))).
% 15.19/2.41 thf(func_def_139, type, sK80: !>[X0: $tType]:((X0 > X0 > X0))).
% 15.19/2.41 thf(func_def_140, type, sK81: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_141, type, sK82: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_142, type, sK83: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_143, type, sK84: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_144, type, sK85: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_145, type, sK86: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 15.19/2.41 thf(func_def_146, type, sK87: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_147, type, sK88: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 15.19/2.41 thf(func_def_148, type, sK89: p).
% 15.19/2.41 thf(func_def_149, type, sK90: (message @ p @ v > nat > nat > nat)).
% 15.19/2.41 thf(func_def_150, type, sK91: p).
% 15.19/2.41 thf(func_def_151, type, sF92: list @ configuration_ext @ p @ v @ s @ product_unit).
% 15.19/2.41 thf(func_def_152, type, sF93: nat).
% 15.19/2.41 thf(func_def_153, type, sF94: nat).
% 15.19/2.41 thf(func_def_154, type, sF95: nat).
% 15.19/2.41 thf(func_def_155, type, sK96: !>[X0: $tType]:((nat > (nat > X0 > $o) > nat))).
% 15.19/2.41 thf(func_def_156, type, sK97: !>[X0: $tType]:((nat > (nat > X0 > $o) > list @ X0))).
% 15.19/2.41 thf(func_def_157, type, sK98: !>[X0: $tType]:((list @ X0 > nat > (nat > X0 > $o) > nat))).
% 15.19/2.41 thf(func_def_158, type, sK99: !>[X0: $tType]:((nat > (nat > X0 > $o) > X0))).
% 15.19/2.41 thf(func_def_159, type, sK100: (nat > nat > nat)).
% 15.19/2.41 thf(func_def_160, type, sK101: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_161, type, sK102: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_162, type, sK103: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_163, type, sK104: ((nat > $o) > nat > nat)).
% 15.19/2.41 thf(func_def_164, type, db4: !>[X0: $tType]:(X0)).
% 15.19/2.41 thf(func_def_165, type, db3: !>[X0: $tType]:(X0)).
% 15.19/2.41 thf(f1,axiom,(
% 15.19/2.41 (ord_less @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0_AssumpOccMFirstOccurrence_I3_J)).
% 15.19/2.41 thf(f2,axiom,(
% 15.19/2.41 (ord_less_eq @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__092_060open_062length_A_Ife_Aindex_J_A_N_A1_A_092_060le_062_AOccM_092_060close_062)).
% 15.19/2.41 thf(f16,axiom,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((suc @ X0)) = ((suc @ X1))) = (X0 = X1))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_15_old_Onat_Oinject)).
% 15.19/2.41 thf(f25,axiom,(
% 15.19/2.41 ! [X0 : nat] : (((minus_minus @ nat @ (suc @ X0) @ one_one @ nat)) = X0)),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_24_diff__Suc__1)).
% 15.19/2.41 thf(f28,axiom,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((ord_less @ nat @ X0 @ X1) => (ord_less_eq @ nat @ (suc @ X0) @ X1))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_27_Suc__leI)).
% 15.19/2.41 thf(f32,axiom,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((ord_less_eq @ nat @ (suc @ X0) @ X1) => ? [X2 : nat] : (X1 = ((suc @ X2))))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_31_Suc__le__D)).
% 15.19/2.41 thf(f80,axiom,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : (((X0 = X1) | (ord_less @ nat @ X0 @ X1)) => (ord_less_eq @ nat @ X0 @ X1))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_79_less__or__eq__imp__le)).
% 15.19/2.41 thf(f84,axiom,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((ord_less_eq @ nat @ X0 @ X1) => ((X0 != X1) => (ord_less @ nat @ X0 @ X1)))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_83_le__neq__implies__less)).
% 15.19/2.41 thf(f237,axiom,(
% 15.19/2.41 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0,X2 : X0] : ((ord_less_eq @ X0 @ X1 @ X2) => ~(ord_less @ X0 @ X2 @ X1)))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_236_leD)).
% 15.19/2.41 thf(f264,axiom,(
% 15.19/2.41 order @ nat),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',tcon_Nat_Onat___Orderings_Oorder_2)).
% 15.19/2.41 thf(f286,conjecture,(
% 15.19/2.41 (occM2 = ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat)))),
% 15.19/2.41 file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 15.19/2.41 thf(f287,negated_conjecture,(
% 15.19/2.41 ~ (occM2 = ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat)))),
% 15.19/2.41 inference(negated_conjecture,[status(cth)],[f286])).
% 15.19/2.41 thf(f288,plain,(
% 15.19/2.41 (ord_less @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)))),
% 15.19/2.41 inference(rectify,[],[f1])).
% 15.19/2.41 thf(f289,plain,(
% 15.19/2.41 (((ord_less @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)))) = $true)),
% 15.19/2.41 inference(fool_elimination,[],[f288])).
% 15.19/2.41 thf(f290,plain,(
% 15.19/2.41 (ord_less_eq @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)),
% 15.19/2.41 inference(rectify,[],[f2])).
% 15.19/2.41 thf(f291,plain,(
% 15.19/2.41 (((ord_less_eq @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)) = $true)),
% 15.19/2.41 inference(fool_elimination,[],[f290])).
% 15.19/2.41 thf(f307,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((suc @ X0) = (suc @ X1))) = ((X0 = X1)))),
% 15.19/2.41 inference(fool_elimination,[],[f16])).
% 15.19/2.41 thf(f318,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((ord_less @ nat @ X0 @ X1) => (ord_less_eq @ nat @ (suc @ X0) @ X1))),
% 15.19/2.41 inference(rectify,[],[f28])).
% 15.19/2.41 thf(f319,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X0 @ X1)) = $true) => (((ord_less_eq @ nat @ (suc @ X0) @ X1)) = $true))),
% 15.19/2.41 inference(fool_elimination,[],[f318])).
% 15.19/2.41 thf(f326,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((ord_less_eq @ nat @ (suc @ X0) @ X1) => ? [X2 : nat] : (X1 = ((suc @ X2))))),
% 15.19/2.41 inference(rectify,[],[f32])).
% 15.19/2.41 thf(f327,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ (suc @ X0) @ X1)) = $true) => ? [X2 : nat] : (((suc @ X2)) = X1))),
% 15.19/2.41 inference(fool_elimination,[],[f326])).
% 15.19/2.41 thf(f407,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : (((X0 = X1) | (ord_less @ nat @ X0 @ X1)) => (ord_less_eq @ nat @ X0 @ X1))),
% 15.19/2.41 inference(rectify,[],[f80])).
% 15.19/2.41 thf(f408,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : (((X0 = X1) | (((ord_less @ nat @ X0 @ X1)) = $true)) => (((ord_less_eq @ nat @ X0 @ X1)) = $true))),
% 15.19/2.41 inference(fool_elimination,[],[f407])).
% 15.19/2.41 thf(f415,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((ord_less_eq @ nat @ X0 @ X1) => ((X0 != X1) => (ord_less @ nat @ X0 @ X1)))),
% 15.19/2.41 inference(rectify,[],[f84])).
% 15.19/2.41 thf(f416,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X0 @ X1)) = $true) => ((X0 != X1) => (((ord_less @ nat @ X0 @ X1)) = $true)))),
% 15.19/2.41 inference(fool_elimination,[],[f415])).
% 15.19/2.41 thf(f719,plain,(
% 15.19/2.41 ! [X0 : $tType] : (order @ X0 => ! [X1 : X0,X2 : X0] : ((ord_less_eq @ X0 @ X1 @ X2) => ~(ord_less @ X0 @ X2 @ X1)))),
% 15.19/2.41 inference(rectify,[],[f237])).
% 15.19/2.41 thf(f720,plain,(
% 15.19/2.41 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0,X2 : X0] : ((((ord_less_eq @ X0 @ X1 @ X2)) = $true) => ~ (((ord_less @ X0 @ X2 @ X1)) = $true)))),
% 15.19/2.41 inference(fool_elimination,[],[f719])).
% 15.19/2.41 thf(f773,plain,(
% 15.19/2.41 order @ nat),
% 15.19/2.41 inference(rectify,[],[f264])).
% 15.19/2.41 thf(f774,plain,(
% 15.19/2.41 (order @ nat = $true)),
% 15.19/2.41 inference(fool_elimination,[],[f773])).
% 15.19/2.41 thf(f845,plain,(
% 15.19/2.41 ! [X0 : $tType] : ((order @ X0 = $true) => ! [X1 : X0,X2 : X0] : ((((ord_less_eq @ X0 @ X1 @ X2)) = $true) => (((ord_less @ X0 @ X2 @ X1)) != $true)))),
% 15.19/2.41 inference(flattening,[],[f720])).
% 15.19/2.41 thf(f846,plain,(
% 15.19/2.41 (occM2 != ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat)))),
% 15.19/2.41 inference(flattening,[],[f287])).
% 15.19/2.41 thf(f857,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ (suc @ X0) @ X1)) = $true) | (((ord_less @ nat @ X0 @ X1)) != $true))),
% 15.19/2.41 inference(ennf_transformation,[],[f319])).
% 15.19/2.41 thf(f861,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : (? [X2 : nat] : (((suc @ X2)) = X1) | (((ord_less_eq @ nat @ (suc @ X0) @ X1)) != $true))),
% 15.19/2.41 inference(ennf_transformation,[],[f327])).
% 15.19/2.41 thf(f898,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X0 @ X1)) = $true) | ((X0 != X1) & (((ord_less @ nat @ X0 @ X1)) != $true)))),
% 15.19/2.41 inference(ennf_transformation,[],[f408])).
% 15.19/2.41 thf(f905,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : (((((ord_less @ nat @ X0 @ X1)) = $true) | (X0 = X1)) | (((ord_less_eq @ nat @ X0 @ X1)) != $true))),
% 15.19/2.41 inference(ennf_transformation,[],[f416])).
% 15.19/2.41 thf(f906,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X0 @ X1)) = $true) | (X0 = X1) | (((ord_less_eq @ nat @ X0 @ X1)) != $true))),
% 15.19/2.41 inference(flattening,[],[f905])).
% 15.19/2.41 thf(f1113,plain,(
% 15.19/2.41 ! [X0 : $tType] : (! [X1 : X0,X2 : X0] : ((((ord_less @ X0 @ X2 @ X1)) != $true) | (((ord_less_eq @ X0 @ X1 @ X2)) != $true)) | (order @ X0 != $true))),
% 15.19/2.41 inference(ennf_transformation,[],[f845])).
% 15.19/2.41 thf(f1135,plain,(
% 15.19/2.41 ! [X0 : nat,X1 : nat] : ((((suc @ (sK5 @ X1))) = X1) | (((ord_less_eq @ nat @ (suc @ X0) @ X1)) != $true))),
% 15.19/2.41 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP]),skolemize(X2,sK3 @ X0 @ X1)],[f861])).
% 15.19/2.41 thf(f1207,plain,(
% 15.19/2.41 (((ord_less @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)))) = $true)),
% 15.19/2.41 inference(cnf_transformation,[],[f289])).
% 15.19/2.41 thf(f1208,plain,(
% 15.19/2.41 (((ord_less_eq @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)) = $true)),
% 15.19/2.41 inference(cnf_transformation,[],[f291])).
% 15.19/2.41 thf(f1222,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : (((((suc @ X0) = (suc @ X1))) = ((X0 = X1)))) )),
% 15.19/2.41 inference(cnf_transformation,[],[f307])).
% 15.19/2.41 thf(f1231,plain,(
% 15.19/2.41 ( ! [X0 : nat] : ((((minus_minus @ nat @ (suc @ X0) @ one_one @ nat)) = X0)) )),
% 15.19/2.41 inference(cnf_transformation,[],[f25])).
% 15.19/2.41 thf(f1235,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X0 @ X1)) != $true) | (((ord_less_eq @ nat @ (suc @ X0) @ X1)) = $true)) )),
% 15.19/2.41 inference(cnf_transformation,[],[f857])).
% 15.19/2.41 thf(f1239,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ (suc @ X0) @ X1)) != $true) | (((suc @ (sK5 @ X1))) = X1)) )),
% 15.19/2.41 inference(cnf_transformation,[],[f1135])).
% 15.19/2.41 thf(f1302,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : ((((ord_less @ nat @ X0 @ X1)) != $true) | (((ord_less_eq @ nat @ X0 @ X1)) = $true)) )),
% 15.19/2.41 inference(cnf_transformation,[],[f898])).
% 15.19/2.41 thf(f1315,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : ((((ord_less_eq @ nat @ X0 @ X1)) != $true) | (X0 = X1) | (((ord_less @ nat @ X0 @ X1)) = $true)) )),
% 15.19/2.41 inference(cnf_transformation,[],[f906])).
% 15.19/2.41 thf(f1529,plain,(
% 15.19/2.41 ( ! [X0 : $tType,X2 : X0,X1 : X0] : ((((ord_less_eq @ X0 @ X1 @ X2)) != $true) | (((ord_less @ X0 @ X2 @ X1)) != $true) | (order @ X0 != $true)) )),
% 15.19/2.41 inference(cnf_transformation,[],[f1113])).
% 15.19/2.41 thf(f1558,plain,(
% 15.19/2.41 (order @ nat = $true)),
% 15.19/2.41 inference(cnf_transformation,[],[f774])).
% 15.19/2.41 thf(f1580,plain,(
% 15.19/2.41 (occM2 != ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat)))),
% 15.19/2.41 inference(cnf_transformation,[],[f846])).
% 15.19/2.41 thf(f1607,definition,(
% 15.19/2.41 (sF92 = ((fe @ index)))),
% 15.19/2.41 introduced(definition,[new_symbols(definition,[sF92])],[function_definition])).
% 15.19/2.41 thf(f1608,plain,(
% 15.19/2.41 (((fe @ index)) = sF92)),
% 15.19/2.41 inference(reorient_equations,[],[f1607])).
% 15.19/2.41 thf(f1609,definition,(
% 15.19/2.41 (sF93 = ((size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ sF92)))),
% 15.19/2.41 introduced(definition,[new_symbols(definition,[sF93])],[function_definition])).
% 15.19/2.41 thf(f1610,plain,(
% 15.19/2.41 (((size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ sF92)) = sF93)),
% 15.19/2.41 inference(reorient_equations,[],[f1609])).
% 15.19/2.41 thf(f1611,definition,(
% 15.19/2.41 (sF94 = one_one @ nat)),
% 15.19/2.41 introduced(definition,[new_symbols(definition,[sF94])],[function_definition])).
% 15.19/2.41 thf(f1612,plain,(
% 15.19/2.41 (one_one @ nat = sF94)),
% 15.19/2.41 inference(reorient_equations,[],[f1611])).
% 15.19/2.41 thf(f1613,definition,(
% 15.19/2.41 (sF95 = ((minus_minus @ nat @ sF93 @ sF94)))),
% 15.19/2.41 introduced(definition,[new_symbols(definition,[sF95])],[function_definition])).
% 15.19/2.41 thf(f1614,plain,(
% 15.19/2.41 (((minus_minus @ nat @ sF93 @ sF94)) = sF95)),
% 15.19/2.41 inference(reorient_equations,[],[f1613])).
% 15.19/2.41 thf(f1615,plain,(
% 15.19/2.41 (occM2 != sF95)),
% 15.19/2.41 inference(definition_folding,[],[f1580,f1614,f1612,f1610,f1608])).
% 15.19/2.41 thf(f1828,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : (($true = (((suc @ X0) = (suc @ X1)))) | (((X0 = X1)) = $false)) )),
% 15.19/2.41 inference(iff_proxy_clausification,[],[f1222])).
% 15.19/2.41 thf(f1832,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : ((((suc @ X0)) = ((suc @ X1))) | (((X0 = X1)) = $false)) )),
% 15.19/2.41 inference(equality_proxy_clausification,[],[f1828])).
% 15.19/2.41 thf(f1833,plain,(
% 15.19/2.41 ( ! [X0 : nat,X1 : nat] : ((((suc @ X0)) = ((suc @ X1))) | (X0 != X1)) )),
% 15.19/2.41 inference(equality_proxy_clausification,[],[f1832])).
% 15.19/2.41 thf(f6693,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ sF92))))),
% 15.19/2.41 inference(constrained_superposition,[],[f1207,f1608])).
% 15.19/2.41 thf(f6711,plain,(
% 15.19/2.41 ($true != $true) | ($true = ((ord_less_eq @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)))))),
% 15.19/2.41 inference(constrained_superposition,[],[f1302,f1207])).
% 15.19/2.41 thf(f6721,plain,(
% 15.19/2.41 ($true = ((ord_less_eq @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)))))),
% 15.19/2.41 inference(trivial_inequality_removal,[],[f6711])).
% 15.19/2.41 thf(f6752,plain,(
% 15.19/2.41 ($true = ((ord_less_eq @ nat @ occM2 @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ sF92))))),
% 15.19/2.41 inference(forward_demodulation,[],[f6721,f1608])).
% 15.19/2.41 thf(f6770,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ occM2 @ sF93)))),
% 15.19/2.41 inference(forward_demodulation,[],[f6693,f1610])).
% 15.19/2.41 thf(f6771,plain,(
% 15.19/2.41 ($true = ((ord_less_eq @ nat @ occM2 @ sF93)))),
% 15.19/2.41 inference(forward_demodulation,[],[f6752,f1610])).
% 15.19/2.41 thf(f11357,plain,(
% 15.19/2.41 ($true != $true) | (occM2 = ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat))) | ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(constrained_superposition,[],[f1315,f1208])).
% 15.19/2.41 thf(f11377,plain,(
% 15.19/2.41 (occM2 = ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat))) | ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(trivial_inequality_removal,[],[f11357])).
% 15.19/2.41 thf(f11427,plain,(
% 15.19/2.41 (occM2 = ((minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ sF92) @ one_one @ nat))) | ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11377,f1608])).
% 15.19/2.41 thf(f11465,plain,(
% 15.19/2.41 (occM2 = ((minus_minus @ nat @ sF93 @ one_one @ nat))) | ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11427,f1610])).
% 15.19/2.41 thf(f11503,plain,(
% 15.19/2.41 (occM2 = ((minus_minus @ nat @ sF93 @ sF94))) | ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11465,f1612])).
% 15.19/2.41 thf(f11541,plain,(
% 15.19/2.41 (occM2 = sF95) | ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11503,f1614])).
% 15.19/2.41 thf(f11571,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ (fe @ index)) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_subsumption_resolution,[],[f11541,f1615])).
% 15.19/2.41 thf(f11583,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ (minus_minus @ nat @ (size_size @ list @ configuration_ext @ p @ v @ s @ product_unit @ sF92) @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11571,f1608])).
% 15.19/2.41 thf(f11588,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ (minus_minus @ nat @ sF93 @ one_one @ nat) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11583,f1610])).
% 15.19/2.41 thf(f11593,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ (minus_minus @ nat @ sF93 @ sF94) @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11588,f1612])).
% 15.19/2.41 thf(f11597,plain,(
% 15.19/2.41 ($true = ((ord_less @ nat @ sF95 @ occM2)))),
% 15.19/2.41 inference(forward_demodulation,[],[f11593,f1614])).
% 15.19/2.41 thf(f11628,plain,(
% 15.19/2.41 ($true != $true) | ($true = ((ord_less_eq @ nat @ (suc @ sF95) @ occM2)))),
% 15.19/2.41 inference(constrained_superposition,[],[f1235,f11597])).
% 15.19/2.41 thf(f11656,plain,(
% 15.19/2.41 ($true = ((ord_less_eq @ nat @ (suc @ sF95) @ occM2)))),
% 15.19/2.41 inference(trivial_inequality_removal,[],[f11628])).
% 15.19/2.41 thf(f12326,plain,(
% 15.19/2.41 ($true != $true) | ($true != ((ord_less @ nat @ occM2 @ (suc @ sF95)))) | (order @ nat != $true)),
% 15.19/2.41 inference(constrained_superposition,[],[f1529,f11656])).
% 15.19/2.41 thf(f12353,plain,(
% 15.19/2.41 ($true != $true) | (occM2 = ((suc @ (sK5 @ occM2))))),
% 15.19/2.41 inference(constrained_superposition,[],[f1239,f11656])).
% 15.19/2.41 thf(f12372,plain,(
% 15.19/2.41 (occM2 = ((suc @ (sK5 @ occM2))))),
% 15.19/2.41 inference(trivial_inequality_removal,[],[f12353])).
% 15.19/2.41 thf(f12413,plain,(
% 15.19/2.41 ($true != ((ord_less @ nat @ occM2 @ (suc @ sF95)))) | (order @ nat != $true)),
% 15.19/2.41 inference(trivial_inequality_removal,[],[f12326])).
% 15.19/2.41 thf(f12423,plain,(
% 15.19/2.41 ($true != ((ord_less @ nat @ occM2 @ (suc @ sF95))))),
% 15.19/2.41 inference(forward_subsumption_resolution,[],[f12413,f1558])).
% 15.19/2.41 thf(f12440,plain,(
% 15.19/2.41 ( ! [X0 : nat] : ((((ord_less_eq @ nat @ occM2 @ X0)) != $true) | (((suc @ (sK5 @ X0))) = X0)) )),
% 15.19/2.41 inference(constrained_superposition,[],[f1239,f12372])).
% 15.19/2.41 thf(f14203,plain,(
% 15.19/2.41 ( ! [X0 : nat] : (($true != ((ord_less @ nat @ occM2 @ (suc @ X0)))) | (sF95 != X0)) )),
% 15.19/2.41 inference(constrained_superposition,[],[f12423,f1833])).
% 15.19/2.41 thf(f25151,plain,(
% 15.19/2.41 ($true != $true) | (sF93 = ((suc @ (sK5 @ sF93))))),
% 15.19/2.41 inference(constrained_superposition,[],[f12440,f6771])).
% 15.19/2.41 thf(f25160,plain,(
% 15.19/2.41 (sF93 = ((suc @ (sK5 @ sF93))))),
% 15.19/2.41 inference(trivial_inequality_removal,[],[f25151])).
% 15.19/2.41 thf(f25882,plain,(
% 15.19/2.41 (((minus_minus @ nat @ sF93 @ one_one @ nat)) = ((sK5 @ sF93)))),
% 15.19/2.41 inference(constrained_superposition,[],[f1231,f25160])).
% 15.19/2.41 thf(f25909,plain,(
% 15.19/2.41 ($true != ((ord_less @ nat @ occM2 @ sF93))) | (sF95 != ((sK5 @ sF93)))),
% 15.19/2.41 inference(constrained_superposition,[],[f14203,f25160])).
% 15.19/2.41 thf(f25923,plain,(
% 15.19/2.41 (sF95 != ((sK5 @ sF93)))),
% 15.19/2.41 inference(forward_subsumption_resolution,[],[f25909,f6770])).
% 15.19/2.41 thf(f25924,plain,(
% 15.19/2.41 (((minus_minus @ nat @ sF93 @ sF94)) = ((sK5 @ sF93)))),
% 15.19/2.41 inference(forward_demodulation,[],[f25882,f1612])).
% 15.19/2.41 thf(f25930,plain,(
% 15.19/2.41 (sF95 = ((sK5 @ sF93)))),
% 15.19/2.41 inference(forward_demodulation,[],[f25924,f1614])).
% 15.19/2.41 thf(f25931,plain,(
% 15.19/2.41 $false),
% 15.19/2.41 inference(forward_subsumption_resolution,[],[f25930,f25923])).
% 15.19/2.41 % SZS output end Proof for theBenchmark
% 15.19/2.41 % (2973764)------------------------------
% 15.19/2.41 % (2973764)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 15.19/2.41 % (2973764)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 15.19/2.41 % (2973764)CaDiCaL version: 2.1.3
% 15.19/2.41 % (2973764)Termination reason: Refutation
% 15.19/2.41 % (2973764)Time elapsed: 1.356 s
% 15.19/2.41 % (2973764)Peak memory usage: 28 MB
% 15.19/2.41 % (2973764)Instructions burned: 2765 (million)
% 15.19/2.41 % (2973709)Success in time 2.178 s
% 15.19/2.41 % Vampire exiting
%------------------------------------------------------------------------------