↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : COM161^1 : TPTP v9.3.1. Released v7.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% 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 : Wed Sep 30 07:46:22 AM UTC 2026

% Result   : Theorem 0.60s 0.40s
% Output   : Refutation 0.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : COM161^1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19  % Computer : n004.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 17:47:07 UTC 2026
% 0.08/0.19  % CPUTime  : 
% 0.08/0.19  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.25  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.60/0.40  % (1626278)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.60/0.40  % (1626288)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2760560879:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.60/0.40  % (1626289)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.60/0.40  % (1626289)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.60/0.40  % (1626284)lrs+10_16_si=on:nwc=1.5:random_seed=3680819599:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.60/0.40  % (1626283)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=169310805:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.60/0.40  % (1626285)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=760765929:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.60/0.40  % (1626287)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3562937520:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.60/0.40  % (1626286)dis+1002_4:1_sfv=off:to=lpo:plsq=on:fde=none:e2e=on:si=on:spb=non_intro:acc=on:uwa=off:fd=preordered:foolp=on:s2agt=32:slsqc=1:slsq=on:random_seed=4077560400:hsq=on:hsqr=16,1:s2a=on:i=634:add=on:nm=16:nicw=on:rtra=on:gtg=position:ss=included:ixr=off:c=on:inj=on:ntd=on:rawr=on_2999 on theBenchmark for (2999ds/634Mi)
% 0.60/0.40  % (1626289)dis+1002_8_to=kbo:sil=128000:tgt=full:drc=off:si=on:sp=const_max:lma=off:spb=non_intro:cbe=off:uwa=interpreted_only:random_seed=2029576371:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.60/0.40  % (1626285)Instruction limit reached! 
% 0.60/0.40  % (1626285)------------------------------
% 0.60/0.40  % (1626285)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626285)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626285)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626285)Termination reason: Instruction limit
% 0.60/0.40  % (1626285)Termination phase: shuffling
% 0.60/0.40  % (1626285)Time elapsed: 0.002 s
% 0.60/0.40  % (1626285)Peak memory usage: 10 MB
% 0.60/0.40  % (1626285)Instructions burned: 3 (million)
% 0.60/0.40  % (1626284)Instruction limit reached! 
% 0.60/0.40  % (1626284)------------------------------
% 0.60/0.40  % (1626284)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626284)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626284)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626284)Termination reason: Instruction limit
% 0.60/0.40  % (1626284)Termination phase: shuffling
% 0.60/0.40  % (1626284)Time elapsed: 0.009 s
% 0.60/0.40  % (1626284)Peak memory usage: 10 MB
% 0.60/0.40  % (1626284)Instructions burned: 18 (million)
% 0.60/0.40  % (1626287)Instruction limit reached! 
% 0.60/0.40  % (1626287)------------------------------
% 0.60/0.40  % (1626287)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626287)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626287)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626287)Termination reason: Instruction limit
% 0.60/0.40  % (1626287)Termination phase: Property scanning
% 0.60/0.40  % (1626287)Time elapsed: 0.012 s
% 0.60/0.40  % (1626287)Peak memory usage: 11 MB
% 0.60/0.40  % (1626287)Instructions burned: 25 (million)
% 0.60/0.40  % (1626288)Instruction limit reached! 
% 0.60/0.40  % (1626288)------------------------------
% 0.60/0.40  % (1626288)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626288)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626288)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626288)Termination reason: Instruction limit
% 0.60/0.40  % (1626288)Termination phase: Property scanning
% 0.60/0.40  % (1626288)Time elapsed: 0.020 s
% 0.60/0.40  % (1626288)Peak memory usage: 12 MB
% 0.60/0.40  % (1626288)Instructions burned: 80 (million)
% 0.60/0.40  % (1626297)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=1526649481:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.60/0.40  % (1626300)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=4248557175:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.60/0.40  % (1626297)Instruction limit reached! 
% 0.60/0.40  % (1626297)------------------------------
% 0.60/0.40  % (1626297)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626297)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626297)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626297)Termination reason: Instruction limit
% 0.60/0.40  % (1626297)Termination phase: shuffling
% 0.60/0.40  % (1626297)Time elapsed: 0.003 s
% 0.60/0.40  % (1626297)Peak memory usage: 10 MB
% 0.60/0.40  % (1626297)Instructions burned: 4 (million)
% 0.60/0.40  % (1626299)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.60/0.40  % (1626300)Instruction limit reached! 
% 0.60/0.40  % (1626300)------------------------------
% 0.60/0.40  % (1626300)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626300)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626300)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626300)Termination reason: Instruction limit
% 0.60/0.40  % (1626300)Termination phase: shuffling
% 0.60/0.40  % (1626300)Time elapsed: 0.003 s
% 0.60/0.40  % (1626300)Peak memory usage: 10 MB
% 0.60/0.40  % (1626300)Instructions burned: 13 (million)
% 0.60/0.40  % (1626299)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=3431082137:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.60/0.40  % (1626299)Instruction limit reached! 
% 0.60/0.40  % (1626299)------------------------------
% 0.60/0.40  % (1626299)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626299)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626299)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626299)Termination reason: Instruction limit
% 0.60/0.40  % (1626299)Termination phase: shuffling
% 0.60/0.40  % (1626299)Time elapsed: 0.004 s
% 0.60/0.40  % (1626299)Peak memory usage: 10 MB
% 0.60/0.40  % (1626299)Instructions burned: 8 (million)
% 0.60/0.40  % (1626298)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=3622027202:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.60/0.40  % (1626303)WARNING Broken Constraint: if sine_to_age_tolerance(5) has been set then sine_to_age(off) is equal to on or sine_to_pred_levels(off) is not equal to off or sine_level_split_queue(off) is equal to on
% 0.60/0.40  % (1626303)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.60/0.40  % (1626283)Instruction limit reached! 
% 0.60/0.40  % (1626283)------------------------------
% 0.60/0.40  % (1626283)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626283)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626283)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626283)Termination reason: Instruction limit
% 0.60/0.40  % (1626283)Termination phase: Function definition elimination
% 0.60/0.40  % (1626283)Time elapsed: 0.041 s
% 0.60/0.40  % (1626283)Peak memory usage: 12 MB
% 0.60/0.40  % (1626283)Instructions burned: 87 (million)
% 0.60/0.40  % (1626298)Instruction limit reached! 
% 0.60/0.40  % (1626298)------------------------------
% 0.60/0.40  % (1626298)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626298)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626298)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626298)Termination reason: Instruction limit
% 0.60/0.40  % (1626298)Termination phase: shuffling
% 0.60/0.40  % (1626298)Time elapsed: 0.003 s
% 0.60/0.40  % (1626298)Peak memory usage: 10 MB
% 0.60/0.40  % (1626298)Instructions burned: 6 (million)
% 0.60/0.40  % (1626303)ott+1010_64_tgt=ground:cnfonf=lazy_simp:si=on:lma=off:spb=goal:lcm=predicate:random_seed=284510200:i=28:s2at=5:piset=not:hud=10:bd=all:av=off:rtra=on:ixr=off:fsdmm=1_2999 on theBenchmark for (2999ds/28Mi)
% 0.60/0.40  % (1626306)lrs+10_1_si=on:cs=on:random_seed=732477056:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.60/0.40  % (1626289)Instruction limit reached! 
% 0.60/0.40  % (1626289)------------------------------
% 0.60/0.40  % (1626289)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626289)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626289)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626289)Termination reason: Instruction limit
% 0.60/0.40  % (1626289)Termination phase: Saturation
% 0.60/0.40  % (1626289)Time elapsed: 0.056 s
% 0.60/0.40  % (1626289)Peak memory usage: 14 MB
% 0.60/0.40  % (1626289)Instructions burned: 161 (million)
% 0.60/0.40  % (1626308)WARNING Broken Constraint: if positive_literal_split_queue_ratios(1,32) has been set then positive_literal_split_queue(off) is equal to on
% 0.60/0.40  % (1626306)Instruction limit reached! 
% 0.60/0.40  % (1626306)------------------------------
% 0.60/0.40  % (1626306)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626306)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626306)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626306)Termination reason: Instruction limit
% 0.60/0.40  % (1626306)Termination phase: shuffling
% 0.60/0.40  % (1626306)Time elapsed: 0.004 s
% 0.60/0.40  % (1626306)Peak memory usage: 10 MB
% 0.60/0.40  % (1626306)Instructions burned: 8 (million)
% 0.60/0.40  % (1626304)lrs+1002_64_sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:sp=occurrence:lma=off:plsqr=32,1:uwa=interpreted_only:random_seed=51821937:i=86:piset=equals:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/86Mi)
% 0.60/0.40  % (1626303)Instruction limit reached! 
% 0.60/0.40  % (1626303)------------------------------
% 0.60/0.40  % (1626303)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626303)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626303)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626303)Termination reason: Instruction limit
% 0.60/0.40  % (1626303)Termination phase: shuffling
% 0.60/0.40  % (1626303)Time elapsed: 0.014 s
% 0.60/0.40  % (1626303)Peak memory usage: 11 MB
% 0.60/0.40  % (1626303)Instructions burned: 30 (million)
% 0.60/0.40  % (1626308)ott+1002_20_sil=128000:cnfonf=lazy_not_gen_be_off:si=on:sp=unary_frequency:plsqr=1,32:bce=on:uwa=interpreted_only:foolp=on:random_seed=2418000617:i=2:add=on:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.60/0.40  % (1626309)lrs+1002_3:1_sil=128000:e2e=on:si=on:urr=on:uwa=one_side_constant:nwc=1.5:random_seed=309284739:i=38:bd=all:rtra=on:amm=off:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/38Mi)
% 0.60/0.40  % (1626308)Instruction limit reached! 
% 0.60/0.40  % (1626308)------------------------------
% 0.60/0.40  % (1626308)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626308)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626308)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626308)Termination reason: Instruction limit
% 0.60/0.40  % (1626308)Termination phase: shuffling
% 0.60/0.40  % (1626308)Time elapsed: 0.002 s
% 0.60/0.40  % (1626308)Peak memory usage: 10 MB
% 0.60/0.40  % (1626308)Instructions burned: 3 (million)
% 0.60/0.40  % (1626312)lrs+1002_1_to=lpo:sil=128000:si=on:sos=on:spb=goal_then_units:uwa=off:random_seed=4195108584:st=2:i=249:sd=1:rtra=on:ss=axioms_2998 on theBenchmark for (2998ds/249Mi)
% 0.60/0.40  % (1626286) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1626278-1626286"...
% 0.60/0.40  % (1626314)dis+1002_1_sil=128000:fde=unused:e2e=on:si=on:cbe=off:uwa=off:random_seed=386049286:hsq=on:st=2:i=25:kws=inv_frequency:rtra=on:ss=axioms:ntd=on_2998 on theBenchmark for (2998ds/25Mi)
% 0.60/0.40  % (1626315)lrs+10_16:1_sil=128000:si=on:lma=off:urr=on:uwa=interpreted_only:random_seed=3526713879:i=14:kws=precedence:aac=none:nm=10:rtra=on:er=filter:ntd=on_2998 on theBenchmark for (2998ds/14Mi)
% 0.60/0.40  % (1626286)...printing done.
% 0.60/0.40  % (1626286)Refutation found. Thanks to Tanya!
% 0.60/0.40  % SZS status Theorem for theBenchmark
% 0.60/0.40  % SZS output start Proof for theBenchmark
% 0.60/0.40  thf(type_def_5, type, abstra2103299360e_tree: $tType > $tType).
% 0.60/0.40  thf(type_def_6, type, product_prod: ($tType * $tType) > $tType).
% 0.60/0.40  thf(type_def_7, type, stream: $tType > $tType).
% 0.60/0.40  thf(type_def_8, type, fset: $tType > $tType).
% 0.60/0.40  thf(type_def_9, type, set: $tType > $tType).
% 0.60/0.40  thf(type_def_10, type, nat: $tType).
% 0.60/0.40  thf(type_def_11, type, state: $tType).
% 0.60/0.40  thf(type_def_12, type, itself: $tType > $tType).
% 0.60/0.40  thf(type_def_13, type, rule: $tType).
% 0.60/0.40  thf(type_def_14, type, sTfun: ($tType * $tType) > $tType).
% 0.60/0.40  thf(func_def_0, type, finite_finite: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_1, type, type: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_2, type, minus: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_3, type, bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_4, type, ord: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_5, type, order: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_6, type, linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_7, type, preorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_8, type, countable: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_9, type, order_bot: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_10, type, dense_linorder: !>[X0: $tType]:((itself @ X0 > $o))).
% 0.60/0.40  thf(func_def_11, type, abstra612932245System: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > set @ X1 > $o))).
% 0.60/0.40  thf(func_def_12, type, abstra1326562878System: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > set @ X1 > $o))).
% 0.60/0.40  thf(func_def_13, type, abstra1332369113inWait: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > X1 > nat))).
% 0.60/0.40  thf(func_def_14, type, abstra2096684367le_per: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > set @ X1 > X0 > $o))).
% 0.60/0.40  thf(func_def_15, type, abstra2097340358le_pos: !>[X0: $tType]:((stream @ X0 > X0 > nat))).
% 0.60/0.40  thf(func_def_16, type, abstra1209608345urated: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > stream @ product_prod @ X1 @ X0 > $o))).
% 0.60/0.40  thf(func_def_17, type, abstra1874422341nabled: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > X0 > X1 > $o))).
% 0.60/0.40  thf(func_def_18, type, abstra523868654_epath: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > stream @ product_prod @ X1 @ X0 > $o))).
% 0.60/0.40  thf(func_def_19, type, abstra928354080m_fair: !>[X0: $tType]:((stream @ X0 > stream @ X0 > $o))).
% 0.60/0.40  thf(func_def_20, type, abstra1774373515_fenum: !>[X0: $tType]:((stream @ X0 > stream @ X0))).
% 0.60/0.40  thf(func_def_21, type, abstra1225283448mkTree: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > X1 > abstra2103299360e_tree @ product_prod @ X1 @ X0))).
% 0.60/0.40  thf(func_def_22, type, abstra1276541928ickEff: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > X0 > X1 > fset @ X1))).
% 0.60/0.40  thf(func_def_23, type, abstra726722745urated: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > X0 > stream @ product_prod @ X1 @ X0 > $o))).
% 0.60/0.40  thf(func_def_24, type, abstra1259602206m_trim: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > X1 > stream @ X0))).
% 0.60/0.40  thf(func_def_25, type, abstra1874736267tem_wf: !>[X0: $tType, X1: $tType]:(((X0 > X1 > fset @ X1 > $o) > stream @ X0 > abstra2103299360e_tree @ product_prod @ X1 @ X0 > $o))).
% 0.60/0.40  thf(func_def_26, type, abstra313004635_ipath: !>[X0: $tType]:((abstra2103299360e_tree @ X0 > stream @ X0 > $o))).
% 0.60/0.40  thf(func_def_27, type, abstra1749095923e_cont: !>[X0: $tType]:((abstra2103299360e_tree @ X0 > fset @ abstra2103299360e_tree @ X0))).
% 0.60/0.40  thf(func_def_28, type, countable_countable: !>[X0: $tType]:((set @ X0 > $o))).
% 0.60/0.40  thf(func_def_29, type, fimage: !>[X0: $tType, X1: $tType]:(((X0 > X1) > fset @ X0 > fset @ X1))).
% 0.60/0.40  thf(func_def_30, type, fmember: !>[X0: $tType]:((X0 > fset @ X0 > $o))).
% 0.60/0.40  thf(func_def_31, type, minus_minus: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.60/0.40  thf(func_def_32, type, if: !>[X0: $tType]:(($o > X0 > X0 > X0))).
% 0.60/0.40  thf(func_def_33, type, suc: (nat > nat)).
% 0.60/0.40  thf(func_def_34, type, bot_bot: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_35, type, ord_less: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.60/0.40  thf(func_def_36, type, ord_less_eq: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.60/0.40  thf(func_def_37, type, type2: !>[X0: $tType]:(itself @ X0)).
% 0.60/0.40  thf(func_def_38, type, collect: !>[X0: $tType]:(((X0 > $o) > set @ X0))).
% 0.60/0.40  thf(func_def_39, type, insert: !>[X0: $tType]:((X0 > set @ X0 > set @ X0))).
% 0.60/0.40  thf(func_def_40, type, is_singleton: !>[X0: $tType]:((set @ X0 > $o))).
% 0.60/0.40  thf(func_def_41, type, sdrop: !>[X0: $tType]:((nat > stream @ X0 > stream @ X0))).
% 0.60/0.40  thf(func_def_42, type, shd: !>[X0: $tType]:((stream @ X0 > X0))).
% 0.60/0.40  thf(func_def_43, type, sset: !>[X0: $tType]:((stream @ X0 > set @ X0))).
% 0.60/0.40  thf(func_def_44, type, stl: !>[X0: $tType]:((stream @ X0 > stream @ X0))).
% 0.60/0.40  thf(func_def_45, type, member: !>[X0: $tType]:((X0 > set @ X0 > $o))).
% 0.60/0.40  thf(func_def_46, type, s: set @ state).
% 0.60/0.40  thf(func_def_47, type, eff: (rule > state > fset @ state > $o)).
% 0.60/0.40  thf(func_def_48, type, rs: stream @ rule).
% 0.60/0.40  thf(func_def_49, type, rules: stream @ rule).
% 0.60/0.40  thf(func_def_50, type, s2: state).
% 0.60/0.40  thf(func_def_51, type, steps: stream @ product_prod @ state @ rule).
% 0.60/0.40  thf(func_def_55, type, db2: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_56, type, db0: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_57, type, db1: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_58, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.60/0.40  thf(func_def_59, type, vAND: ($o > $o > $o)).
% 0.60/0.40  thf(func_def_60, type, vNOT: ($o > $o)).
% 0.60/0.40  thf(func_def_61, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.60/0.40  thf(func_def_62, type, vSIGMA: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.60/0.40  thf(func_def_63, type, vPI: !>[X0: $tType]:(((X0 > $o) > $o))).
% 0.60/0.40  thf(func_def_64, type, vOR: ($o > $o > $o)).
% 0.60/0.40  thf(func_def_65, type, vIMP: ($o > $o > $o)).
% 0.60/0.40  thf(func_def_66, type, db3: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_67, type, db4: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_68, type, db5: !>[X0: $tType]:(X0)).
% 0.60/0.40  thf(func_def_69, type, sP0: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.60/0.40  thf(func_def_70, type, sP1: !>[X0: $tType]:((X0 > X0 > X0 > $o))).
% 0.60/0.40  thf(func_def_71, type, sK2: !>[X0: $tType, X1: $tType]:((stream @ X1 > set @ X0 > (X1 > X0 > fset @ X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_72, type, sK3: !>[X0: $tType, X1: $tType]:((stream @ X1 > set @ X0 > (X1 > X0 > fset @ X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_73, type, sK4: !>[X0: $tType, X1: $tType]:((stream @ X1 > set @ X0 > (X1 > X0 > fset @ X0 > $o) > X1))).
% 0.60/0.40  thf(func_def_74, type, sK5: !>[X0: $tType, X1: $tType]:((stream @ X1 > set @ X0 > (X1 > X0 > fset @ X0 > $o) > fset @ X0))).
% 0.60/0.40  thf(func_def_75, type, sK6: !>[X0: $tType, X1: $tType]:((stream @ X1 > set @ X0 > (X1 > X0 > fset @ X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_76, type, sK7: !>[X0: $tType, X1: $tType]:((set @ X0 > (X1 > X0 > fset @ X0 > $o) > stream @ X1 > X0 > abstra2103299360e_tree @ product_prod @ X0 @ X1 > fset @ X0))).
% 0.60/0.40  thf(func_def_77, type, sK8: !>[X0: $tType, X1: $tType]:((set @ X0 > (X1 > X0 > fset @ X0 > $o) > stream @ X1 > X0 > abstra2103299360e_tree @ product_prod @ X0 @ X1 > X0))).
% 0.60/0.40  thf(func_def_78, type, sK9: !>[X0: $tType]:((set @ X0 > X0))).
% 0.60/0.40  thf(func_def_79, type, sK10: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_80, type, sK11: !>[X0: $tType, X1: $tType]:((set @ X1 > nat > (X0 > X1 > fset @ X1 > $o) > stream @ product_prod @ X1 @ X0 > stream @ X0 > nat))).
% 0.60/0.40  thf(func_def_81, type, sK12: !>[X0: $tType, X1: $tType]:((set @ X1 > nat > (X0 > X1 > fset @ X1 > $o) > stream @ product_prod @ X1 @ X0 > stream @ X0 > X1))).
% 0.60/0.40  thf(func_def_82, type, sK13: !>[X0: $tType]:((set @ X0 > X0))).
% 0.60/0.40  thf(func_def_83, type, sK14: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_84, type, sK15: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_85, type, sK16: (stream @ rule > stream @ product_prod @ state @ rule > nat > state)).
% 0.60/0.40  thf(func_def_86, type, sK17: (stream @ rule > stream @ product_prod @ state @ rule > nat > nat)).
% 0.60/0.40  thf(func_def_87, type, sK18: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_88, type, sK19: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_89, type, sK20: !>[X0: $tType]:((fset @ X0 > X0))).
% 0.60/0.40  thf(func_def_90, type, sK21: !>[X0: $tType, X1: $tType]:((stream @ X0 > (X0 > X1 > fset @ X1 > $o) > X1 > nat))).
% 0.60/0.40  thf(func_def_91, type, sK22: !>[X0: $tType]:((set @ X0 > set @ X0 > X0))).
% 0.60/0.40  thf(func_def_92, type, sK23: rule).
% 0.60/0.40  thf(func_def_93, type, sK24: !>[X0: $tType, X1: $tType]:((stream @ X0 > X1 > (X0 > X1 > fset @ X1 > $o) > X0))).
% 0.60/0.40  thf(func_def_94, type, sK25: !>[X0: $tType, X1: $tType]:((stream @ X0 > X1 > (X0 > X1 > fset @ X1 > $o) > fset @ X1))).
% 0.60/0.40  thf(func_def_95, type, sK26: (state > rule)).
% 0.60/0.40  thf(func_def_96, type, sK27: (state > fset @ state)).
% 0.60/0.40  thf(func_def_97, type, sK28: !>[X0: $tType, X1: $tType]:((fset @ X0 > (X1 > X0) > fset @ X1 > fset @ X1))).
% 0.60/0.40  thf(func_def_98, type, sK29: !>[X0: $tType]:((X0 > set @ X0 > set @ X0 > X0 > set @ X0))).
% 0.60/0.40  thf(func_def_99, type, sK30: !>[X0: $tType, X1: $tType]:((fset @ X1 > (X1 > X0 > $o) > X1 > X0))).
% 0.60/0.40  thf(func_def_100, type, sK31: !>[X0: $tType, X1: $tType]:((fset @ X1 > (X1 > X0 > $o) > X1))).
% 0.60/0.40  thf(func_def_101, type, sK32: !>[X0: $tType, X1: $tType]:(((X1 > X0) > (X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_102, type, sK33: !>[X0: $tType]:((X0 > X0 > X0 > X0))).
% 0.60/0.40  thf(func_def_103, type, sK34: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.60/0.40  thf(func_def_104, type, sK35: !>[X0: $tType]:((set @ X0 > X0))).
% 0.60/0.40  thf(func_def_105, type, sK36: !>[X0: $tType]:((set @ X0 > X0 > set @ X0))).
% 0.60/0.40  thf(func_def_106, type, sK37: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_107, type, sK38: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_108, type, sK39: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_109, type, sK40: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_110, type, sK41: !>[X0: $tType]:(((X0 > X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_111, type, sK42: !>[X0: $tType, X1: $tType]:((X1 > stream @ X1 > (X1 > X0 > fset @ X0 > $o) > set @ X0 > X0))).
% 0.60/0.40  thf(func_def_112, type, sK43: !>[X0: $tType, X1: $tType]:((X1 > stream @ X1 > (X1 > X0 > fset @ X0 > $o) > set @ X0 > X1))).
% 0.60/0.40  thf(func_def_113, type, sK44: !>[X0: $tType, X1: $tType]:((X1 > stream @ X1 > (X1 > X0 > fset @ X0 > $o) > set @ X0 > fset @ X0))).
% 0.60/0.40  thf(func_def_114, type, sK45: !>[X0: $tType, X1: $tType]:((X1 > stream @ X1 > (X1 > X0 > fset @ X0 > $o) > set @ X0 > X0))).
% 0.60/0.40  thf(func_def_115, type, sK46: !>[X0: $tType]:((fset @ X0 > fset @ X0 > X0))).
% 0.60/0.40  thf(func_def_116, type, sK47: !>[X0: $tType]:(((X0 > stream @ X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_117, type, sK48: !>[X0: $tType]:(((X0 > stream @ X0 > $o) > stream @ X0))).
% 0.60/0.40  thf(func_def_118, type, sK49: !>[X0: $tType]:(((X0 > stream @ X0 > $o) > stream @ X0))).
% 0.60/0.40  thf(func_def_119, type, sK50: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.60/0.40  thf(func_def_120, type, sK51: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.60/0.40  thf(func_def_121, type, sK52: !>[X0: $tType]:((set @ X0 > X0))).
% 0.60/0.40  thf(func_def_122, type, sK53: !>[X0: $tType]:(((X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_123, type, sK54: (stream @ product_prod @ state @ rule > rule)).
% 0.60/0.40  thf(func_def_124, type, sK55: !>[X0: $tType]:((set @ X0 > X0))).
% 0.60/0.40  thf(func_def_125, type, sK56: !>[X0: $tType]:((set @ X0 > X0))).
% 0.60/0.40  thf(func_def_126, type, sK57: !>[X0: $tType]:((fset @ X0 > X0))).
% 0.60/0.40  thf(func_def_127, type, sK58: !>[X0: $tType]:((X0 > X0 > X0 > X0))).
% 0.60/0.40  thf(func_def_128, type, sK59: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.60/0.40  thf(func_def_129, type, sK60: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.60/0.40  thf(func_def_130, type, sK61: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.60/0.40  thf(func_def_131, type, sK62: !>[X0: $tType]:((fset @ X0 > fset @ X0 > X0))).
% 0.60/0.40  thf(func_def_132, type, sK63: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_133, type, sK64: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_134, type, sK65: (state > stream @ rule > nat)).
% 0.60/0.40  thf(func_def_135, type, sK66: !>[X0: $tType]:((X0 > X0 > X0))).
% 0.60/0.40  thf(func_def_136, type, sK67: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_137, type, sK68: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_138, type, sK69: !>[X0: $tType]:(((X0 > $o) > (X0 > $o) > X0))).
% 0.60/0.40  thf(func_def_139, type, sK70: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_140, type, sK71: !>[X0: $tType, X1: $tType]:(((X1 > X0) > X1))).
% 0.60/0.40  thf(func_def_141, type, sK72: !>[X0: $tType]:((fset @ X0 > X0))).
% 0.60/0.40  thf(func_def_142, type, sK73: (rule > fset @ state)).
% 0.60/0.40  thf(func_def_143, type, sK74: (rule > state)).
% 0.60/0.40  thf(func_def_144, type, sK75: (rule > state)).
% 0.60/0.40  thf(func_def_145, type, sK76: (rule > rule)).
% 0.60/0.40  thf(func_def_146, type, sK77: (state > abstra2103299360e_tree @ product_prod @ state @ rule > stream @ rule > state)).
% 0.60/0.40  thf(func_def_147, type, sK78: (state > abstra2103299360e_tree @ product_prod @ state @ rule > stream @ rule > fset @ state)).
% 0.60/0.40  thf(func_def_148, type, sK79: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.60/0.40  thf(func_def_149, type, sK80: !>[X0: $tType, X1: $tType]:(((X0 > X1) > X0))).
% 0.60/0.40  thf(func_def_150, type, sK81: (rule > state > fset @ state)).
% 0.60/0.40  thf(f1,axiom,(
% 0.60/0.40    ! [X4 : rule] : ((member @ rule @ X4 @ (sset @ rule @ rules)) => (abstra726722745urated @ rule @ state @ eff @ X4 @ steps))),
% 0.60/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__092_060open_062_092_060And_062ra_O_Ara_A_092_060in_062_AR_A_092_060Longrightarrow_062_Asaturated_Ara_Asteps_092_060close_062)).
% 0.60/0.40  thf(f303,conjecture,(
% 0.60/0.40    ! [X0 : rule] : ((member @ rule @ X0 @ (sset @ rule @ rules)) => (abstra726722745urated @ rule @ state @ eff @ X0 @ steps))),
% 0.60/0.40    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0)).
% 0.60/0.40  thf(f304,negated_conjecture,(
% 0.60/0.40    ~ ! [X0 : rule] : ((member @ rule @ X0 @ (sset @ rule @ rules)) => (abstra726722745urated @ rule @ state @ eff @ X0 @ steps))),
% 0.60/0.40    inference(negated_conjecture,[status(cth)],[f303])).
% 0.60/0.40  thf(f435,plain,(
% 0.60/0.40    ~ ! [X0 : rule] : ((member @ rule @ X0 @ (sset @ rule @ rules)) => (abstra726722745urated @ rule @ state @ eff @ X0 @ steps))),
% 0.60/0.40    inference(rectify,[],[f304])).
% 0.60/0.40  thf(f436,plain,(
% 0.60/0.40    ~ ! [X0 : rule] : ((((member @ rule @ X0 @ (sset @ rule @ rules))) = $true) => (((abstra726722745urated @ rule @ state @ eff @ X0 @ steps)) = $true))),
% 0.60/0.40    inference(fool_elimination,[],[f435])).
% 0.60/0.40  thf(f487,plain,(
% 0.60/0.40    ! [X0 : rule] : ((member @ rule @ X0 @ (sset @ rule @ rules)) => (abstra726722745urated @ rule @ state @ eff @ X0 @ steps))),
% 0.60/0.40    inference(rectify,[],[f1])).
% 0.60/0.40  thf(f488,plain,(
% 0.60/0.40    ! [X0 : rule] : ((((member @ rule @ X0 @ (sset @ rule @ rules))) = $true) => (((abstra726722745urated @ rule @ state @ eff @ X0 @ steps)) = $true))),
% 0.60/0.40    inference(fool_elimination,[],[f487])).
% 0.60/0.40  thf(f926,plain,(
% 0.60/0.40    ? [X0 : rule] : ((((abstra726722745urated @ rule @ state @ eff @ X0 @ steps)) != $true) & (((member @ rule @ X0 @ (sset @ rule @ rules))) = $true))),
% 0.60/0.40    inference(ennf_transformation,[],[f436])).
% 0.60/0.40  thf(f1048,plain,(
% 0.60/0.40    ! [X0 : rule] : ((((member @ rule @ X0 @ (sset @ rule @ rules))) != $true) | (((abstra726722745urated @ rule @ state @ eff @ X0 @ steps)) = $true))),
% 0.60/0.40    inference(ennf_transformation,[],[f488])).
% 0.60/0.40  thf(f1242,plain,(
% 0.60/0.40    ($true != ((abstra726722745urated @ rule @ state @ eff @ sK23 @ steps))) & ($true = ((member @ rule @ sK23 @ (sset @ rule @ rules))))),
% 0.60/0.40    inference(skolemize,[status(esa),new_symbols(skolem,[sK23]),skolemize(X0,sK23)],[f926])).
% 0.60/0.40  thf(f1545,plain,(
% 0.60/0.40    ($true = ((member @ rule @ sK23 @ (sset @ rule @ rules))))),
% 0.60/0.40    inference(cnf_transformation,[],[f1242])).
% 0.60/0.40  thf(f1546,plain,(
% 0.60/0.40    ($true != ((abstra726722745urated @ rule @ state @ eff @ sK23 @ steps)))),
% 0.60/0.40    inference(cnf_transformation,[],[f1242])).
% 0.60/0.40  thf(f1726,plain,(
% 0.60/0.40    ( ! [X0 : rule] : ((((abstra726722745urated @ rule @ state @ eff @ X0 @ steps)) = $true) | (((member @ rule @ X0 @ (sset @ rule @ rules))) != $true)) )),
% 0.60/0.40    inference(cnf_transformation,[],[f1048])).
% 0.60/0.40  thf(f2007,definition,(
% 0.60/0.40    spl82_5 <=> ($true = ((member @ rule @ sK23 @ (sset @ rule @ rules))))),
% 0.60/0.40    introduced(definition,[new_symbols(definition,[spl82_5])],[avatar_definition])).
% 0.60/0.40  thf(f2009,plain,(
% 0.60/0.40    ($true = ((member @ rule @ sK23 @ (sset @ rule @ rules)))) | ~spl82_5),
% 0.60/0.40    inference(avatar_component_clause,[],[f2007])).
% 0.60/0.40  thf(f2010,plain,(
% 0.60/0.40    spl82_5),
% 0.60/0.40    inference(avatar_split_clause,[],[f1545,f2007])).
% 0.60/0.40  thf(f2074,definition,(
% 0.60/0.40    spl82_19 <=> ($true = ((abstra726722745urated @ rule @ state @ eff @ sK23 @ steps)))),
% 0.60/0.40    introduced(definition,[new_symbols(definition,[spl82_19])],[avatar_definition])).
% 0.60/0.40  thf(f2076,plain,(
% 0.60/0.40    ($true != ((abstra726722745urated @ rule @ state @ eff @ sK23 @ steps))) | spl82_19),
% 0.60/0.40    inference(avatar_component_clause,[],[f2074])).
% 0.60/0.40  thf(f2077,plain,(
% 0.60/0.40    ~spl82_19),
% 0.60/0.40    inference(avatar_split_clause,[],[f1546,f2074])).
% 0.60/0.40  thf(f2141,plain,(
% 0.60/0.40    ($true != $true) | ($true != ((member @ rule @ sK23 @ (sset @ rule @ rules)))) | spl82_19),
% 0.60/0.40    inference(superposition,[],[f2076,f1726])).
% 0.60/0.40  thf(f2142,plain,(
% 0.60/0.40    ($true != ((member @ rule @ sK23 @ (sset @ rule @ rules)))) | spl82_19),
% 0.60/0.40    inference(trivial_inequality_removal,[],[f2141])).
% 0.60/0.40  thf(f2143,plain,(
% 0.60/0.40    $false | (~spl82_5 | spl82_19)),
% 0.60/0.40    inference(forward_subsumption_resolution,[],[f2142,f2009])).
% 0.60/0.40  thf(f2144,plain,(
% 0.60/0.40    ~spl82_5 | spl82_19),
% 0.60/0.40    inference(avatar_contradiction_clause,[],[f2143])).
% 0.60/0.40  cnf(s5, plain, spl82_5, inference(sat_conversion,[],[f2010])).
% 0.60/0.40  cnf(s18, plain, ~spl82_19, inference(sat_conversion,[],[f2077])).
% 0.60/0.40  cnf(s31, plain, ~spl82_5 | spl82_19, inference(sat_conversion,[],[f2144])).
% 0.60/0.40  cnf(s32, plain, ~spl82_5, inference(rat,[],[s31,s18])).
% 0.60/0.40  cnf(s33, plain, $false, inference(rat,[],[s5,s32])).
% 0.60/0.40  thf(f2145,plain,(
% 0.60/0.40    $false),
% 0.60/0.40    inference(avatar_sat_refutation,[],[s33])).
% 0.60/0.40  % SZS output end Proof for theBenchmark
% 0.60/0.40  % (1626286)------------------------------
% 0.60/0.40  % (1626286)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.60/0.40  % (1626286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.60/0.40  % (1626286)CaDiCaL version: 2.1.3
% 0.60/0.40  % (1626286)Termination reason: Refutation
% 0.60/0.40  % (1626286)Time elapsed: 0.078 s
% 0.60/0.40  % (1626286)Peak memory usage: 15 MB
% 0.60/0.40  % (1626286)Instructions burned: 155 (million)
% 0.60/0.40  % (1626278)Success in time 0.14 s
% 0.60/0.40  % Vampire exiting
%------------------------------------------------------------------------------