%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : MSC025^2 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:15:37 AM UTC 2026
% Result : Theorem 0.44s 0.37s
% Output : Refutation 0.44s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MSC025^2 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n008.cluster.edu
% 0.10/0.20 % Model : x86_64 x86_64
% 0.10/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.20 % Memory : 8046.5625MB
% 0.10/0.20 % OS : Linux 6.8.0-71-generic
% 0.10/0.20 % CPULimit : 300
% 0.10/0.20 % WCLimit : 300
% 0.10/0.20 % DateTime : Tue Sep 29 11:23:24 UTC 2026
% 0.10/0.20 % CPUTime :
% 0.10/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24 Running higher-order theorem proving
% 0.10/0.25 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.44/0.37 % (3023657)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.44/0.37 % (3023664)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=905479471:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.44/0.37 % (3023663)lrs+10_16_si=on:nwc=1.5:random_seed=2902669486:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.44/0.37 % (3023664)Instruction limit reached!
% 0.44/0.37 % (3023664)------------------------------
% 0.44/0.37 % (3023664)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023664)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023664)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023664)Termination reason: Instruction limit
% 0.44/0.37 % (3023664)Termination phase: Saturation
% 0.44/0.37 % (3023664)Time elapsed: 0.003 s
% 0.44/0.37 % (3023664)Peak memory usage: 12 MB
% 0.44/0.37 % (3023664)Instructions burned: 5 (million)
% 0.44/0.37 % (3023666)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=307214112:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.44/0.37 % (3023667)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2246488253:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.44/0.37 % (3023668)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.44/0.37 % (3023668)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.44/0.37 % (3023663)Instruction limit reached!
% 0.44/0.37 % (3023663)------------------------------
% 0.44/0.37 % (3023663)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023663)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023663)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023663)Termination reason: Instruction limit
% 0.44/0.37 % (3023663)Termination phase: Saturation
% 0.44/0.37 % (3023663)Time elapsed: 0.010 s
% 0.44/0.37 % (3023663)Peak memory usage: 12 MB
% 0.44/0.37 % (3023663)Instructions burned: 18 (million)
% 0.44/0.37 % (3023662)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3980846927:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.44/0.37 % (3023665)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=765308580: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.44/0.37 % (3023668)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=2799573158:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.44/0.37 % (3023666)Instruction limit reached!
% 0.44/0.37 % (3023666)------------------------------
% 0.44/0.37 % (3023666)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023666)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023666)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023666)Termination reason: Instruction limit
% 0.44/0.37 % (3023666)Termination phase: Saturation
% 0.44/0.37 % (3023666)Time elapsed: 0.013 s
% 0.44/0.37 % (3023666)Peak memory usage: 12 MB
% 0.44/0.37 % (3023666)Instructions burned: 25 (million)
% 0.44/0.37 % (3023671)dis+10_1024_sil=128000:si=on:sp=unary_first:urr=on:uwa=all:fd=off:random_seed=3698872115:i=2:hud=10:rtra=on_2999 on theBenchmark for (2999ds/2Mi)
% 0.44/0.37 % (3023671)Instruction limit reached!
% 0.44/0.37 % (3023671)------------------------------
% 0.44/0.37 % (3023671)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023671)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023671)Termination reason: Instruction limit
% 0.44/0.37 % (3023671)Termination phase: Saturation
% 0.44/0.37 % (3023671)Time elapsed: 0.002 s
% 0.44/0.37 % (3023671)Peak memory usage: 12 MB
% 0.44/0.37 % (3023671)Instructions burned: 4 (million)
% 0.44/0.37 % (3023678)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(5) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.44/0.37 % (3023676)lrs+1010_2:3_cha=on:si=on:uwa=off:nwc=1:random_seed=2718419517:i=5:fgj=on:av=off:rtra=on:fe=axiom:ntd=on_2999 on theBenchmark for (2999ds/5Mi)
% 0.44/0.37 % (3023678)dis+21_1_to=kbo:sil=128000:plsq=on:plsqc=1:cnfonf=lazy_gen:si=on:plsqr=64,1:uwa=hol:random_seed=2959195762:uwa_fpi=on:i=7:fgj=on:hud=10:fsr=off:rtra=on:rawr=on:fsdmm=5_2999 on theBenchmark for (2999ds/7Mi)
% 0.44/0.37 % (3023667)Instruction limit reached!
% 0.44/0.37 % (3023667)------------------------------
% 0.44/0.37 % (3023667)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023667)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023667)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023667)Termination reason: Instruction limit
% 0.44/0.37 % (3023667)Termination phase: Saturation
% 0.44/0.37 % (3023667)Time elapsed: 0.041 s
% 0.44/0.37 % (3023667)Peak memory usage: 12 MB
% 0.44/0.37 % (3023667)Instructions burned: 80 (million)
% 0.44/0.37 % (3023676)Instruction limit reached!
% 0.44/0.37 % (3023676)------------------------------
% 0.44/0.37 % (3023676)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023676)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023676)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023676)Termination reason: Instruction limit
% 0.44/0.37 % (3023676)Termination phase: Saturation
% 0.44/0.37 % (3023676)Time elapsed: 0.005 s
% 0.44/0.37 % (3023676)Peak memory usage: 11 MB
% 0.44/0.37 % (3023676)Instructions burned: 7 (million)
% 0.44/0.37 % (3023678)Instruction limit reached!
% 0.44/0.37 % (3023678)------------------------------
% 0.44/0.37 % (3023678)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.37 % (3023678)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.37 % (3023678)CaDiCaL version: 2.1.3
% 0.44/0.37 % (3023678)Termination reason: Instruction limit
% 0.44/0.37 % (3023678)Termination phase: Saturation
% 0.44/0.37 % (3023678)Time elapsed: 0.006 s
% 0.44/0.37 % (3023678)Peak memory usage: 12 MB
% 0.44/0.37 % (3023678)Instructions burned: 9 (million)
% 0.44/0.37 % (3023668) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3023657-3023668"...
% 0.44/0.37 % (3023680)lrs+10_1_sil=128000:si=on:urr=on:slsqc=1:slsq=on:random_seed=3736067289:i=12:s2at=2:kws=inv_frequency:bd=all:rtra=on_2999 on theBenchmark for (2999ds/12Mi)
% 0.44/0.37 % (3023683)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.44/0.37 % (3023683)WARNING Broken Constraint: if forward_subsumption_demodulation_max_matches(1) has been set then forward_subsumption_demodulation(off) is equal to on
% 0.44/0.37 % (3023668)...printing done.
% 0.44/0.37 % (3023685)lrs+10_1_si=on:cs=on:random_seed=804400572:i=8:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/8Mi)
% 0.44/0.37 % (3023668)Refutation found. Thanks to Tanya!
% 0.44/0.37 % SZS status Theorem for theBenchmark
% 0.44/0.37 % SZS output start Proof for theBenchmark
% 0.44/0.37 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.44/0.37 thf(func_def_2, type, b1: ($o > $i)).
% 0.44/0.37 thf(func_def_4, type, b2: ($o > $i)).
% 0.44/0.37 thf(func_def_5, type, vNOT: ($o > $o)).
% 0.44/0.37 thf(func_def_8, type, sK0: ($o > $i)).
% 0.44/0.37 thf(func_def_9, type, sF1: ($o > $o)).
% 0.44/0.37 thf(func_def_10, type, sF2: ($o > $i)).
% 0.44/0.37 thf(func_def_11, type, sF3: ($o > $i)).
% 0.44/0.37 thf(func_def_12, type, sK4: $o).
% 0.44/0.37 thf(func_def_13, type, sK5: $o).
% 0.44/0.37 thf(f1,axiom,(
% 0.44/0.37 ! [X0 : $i] : ((X0 = one) | (X0 = two))),
% 0.44/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binarity_exhaust)).
% 0.44/0.37 thf(f2,axiom,(
% 0.44/0.37 (one != two)),
% 0.44/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binarity_distinc)).
% 0.44/0.37 thf(f3,axiom,(
% 0.44/0.37 ! [X0 : $o] : ((~X0 => (((b1 @ X0)) = two)) & (X0 => (((b1 @ X0)) = one)))),
% 0.44/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b1)).
% 0.44/0.37 thf(f4,axiom,(
% 0.44/0.37 ! [X0 : $o] : ((X0 => (((b2 @ X0)) = two)) & (~X0 => (((b2 @ X0)) = one)))),
% 0.44/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b2)).
% 0.44/0.37 thf(f5,conjecture,(
% 0.44/0.37 ! [X0 : ($o > $i)] : (! [X1 : $o] : (((X0 @ ~X1)) != ((X0 @ X1))) => ((X0 = b2) | (X0 = b1)))),
% 0.44/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal)).
% 0.44/0.37 thf(f6,negated_conjecture,(
% 0.44/0.37 ~ ! [X0 : ($o > $i)] : (! [X1 : $o] : (((X0 @ ~X1)) != ((X0 @ X1))) => ((X0 = b2) | (X0 = b1)))),
% 0.44/0.37 inference(negated_conjecture,[status(cth)],[f5])).
% 0.44/0.37 thf(f7,plain,(
% 0.44/0.37 ~ ! [X0 : ($o > $i)] : (! [X1 : $o] : (((X0 @ ~X1)) != ((X0 @ X1))) => ((X0 = b2) | (X0 = b1)))),
% 0.44/0.37 inference(rectify,[],[f6])).
% 0.44/0.37 thf(f8,plain,(
% 0.44/0.37 ~ ! [X0 : ($o > $i)] : (! [X1 : $o] : (((X0 @ X1)) != ((X0 @ (~ X1)))) => ((b1 = X0) | (b2 = X0)))),
% 0.44/0.37 inference(fool_elimination,[],[f7])).
% 0.44/0.37 thf(f9,plain,(
% 0.44/0.37 ! [X0 : $o] : ((~X0 => (((b1 @ X0)) = two)) & (X0 => (((b1 @ X0)) = one)))),
% 0.44/0.37 inference(rectify,[],[f3])).
% 0.44/0.37 thf(f10,plain,(
% 0.44/0.37 ! [X0 : $o] : ((~ ($true = X0) => (two = ((b1 @ X0)))) & (($true = X0) => (one = ((b1 @ X0)))))),
% 0.44/0.37 inference(fool_elimination,[],[f9])).
% 0.44/0.37 thf(f11,plain,(
% 0.44/0.37 ! [X0 : $o] : ((X0 => (((b2 @ X0)) = two)) & (~X0 => (((b2 @ X0)) = one)))),
% 0.44/0.37 inference(rectify,[],[f4])).
% 0.44/0.37 thf(f12,plain,(
% 0.44/0.37 ! [X0 : $o] : ((($true = X0) => (two = ((b2 @ X0)))) & (~ ($true = X0) => (one = ((b2 @ X0)))))),
% 0.44/0.37 inference(fool_elimination,[],[f11])).
% 0.44/0.37 thf(f13,plain,(
% 0.44/0.37 ! [X0 : $o] : ((($true != X0) => (two = ((b1 @ X0)))) & (($true = X0) => (one = ((b1 @ X0)))))),
% 0.44/0.37 inference(flattening,[],[f10])).
% 0.44/0.37 thf(f14,plain,(
% 0.44/0.37 ! [X0 : $o] : ((($true != X0) => (one = ((b2 @ X0)))) & (($true = X0) => (two = ((b2 @ X0)))))),
% 0.44/0.37 inference(flattening,[],[f12])).
% 0.44/0.37 thf(f15,plain,(
% 0.44/0.37 ! [X0 : $o] : ((($true != X0) | (one = ((b1 @ X0)))) & (($true = X0) | (two = ((b1 @ X0)))))),
% 0.44/0.37 inference(ennf_transformation,[],[f13])).
% 0.44/0.37 thf(f16,plain,(
% 0.44/0.37 ! [X0 : $o] : (((one = ((b2 @ X0))) | ($true = X0)) & (($true != X0) | (two = ((b2 @ X0)))))),
% 0.44/0.37 inference(ennf_transformation,[],[f14])).
% 0.44/0.37 thf(f17,plain,(
% 0.44/0.37 ? [X0 : ($o > $i)] : (((b1 != X0) & (b2 != X0)) & ! [X1 : $o] : (((X0 @ X1)) != ((X0 @ (~ X1)))))),
% 0.44/0.37 inference(ennf_transformation,[],[f8])).
% 0.44/0.37 thf(f18,plain,(
% 0.44/0.37 ? [X0 : ($o > $i)] : (! [X1 : $o] : (((X0 @ X1)) != ((X0 @ (~ X1)))) & (b2 != X0) & (b1 != X0))),
% 0.44/0.37 inference(flattening,[],[f17])).
% 0.44/0.37 thf(f19,plain,(
% 0.44/0.37 ! [X1 : $o] : (((sK0 @ (~ X1))) != ((sK0 @ X1))) & (b2 != sK0) & (b1 != sK0)),
% 0.44/0.37 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f18])).
% 0.44/0.37 thf(f20,plain,(
% 0.44/0.37 ( ! [X0 : $o] : (($true != X0) | (two = ((b2 @ X0)))) )),
% 0.44/0.37 inference(cnf_transformation,[],[f16])).
% 0.44/0.37 thf(f21,plain,(
% 0.44/0.37 ( ! [X0 : $o] : ((one = ((b2 @ X0))) | ($true = X0)) )),
% 0.44/0.37 inference(cnf_transformation,[],[f16])).
% 0.44/0.37 thf(f22,plain,(
% 0.44/0.37 (one != two)),
% 0.44/0.37 inference(cnf_transformation,[],[f2])).
% 0.44/0.37 thf(f23,plain,(
% 0.44/0.37 ( ! [X0 : $o] : ((two = ((b1 @ X0))) | ($true = X0)) )),
% 0.44/0.37 inference(cnf_transformation,[],[f15])).
% 0.44/0.37 thf(f24,plain,(
% 0.44/0.37 ( ! [X0 : $o] : (($true != X0) | (one = ((b1 @ X0)))) )),
% 0.44/0.37 inference(cnf_transformation,[],[f15])).
% 0.44/0.37 thf(f25,plain,(
% 0.44/0.37 (b1 != sK0)),
% 0.44/0.37 inference(cnf_transformation,[],[f19])).
% 0.44/0.37 thf(f26,plain,(
% 0.44/0.37 (b2 != sK0)),
% 0.44/0.37 inference(cnf_transformation,[],[f19])).
% 0.44/0.37 thf(f27,plain,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sK0 @ (~ X1))) != ((sK0 @ X1)))) )),
% 0.44/0.37 inference(cnf_transformation,[],[f19])).
% 0.44/0.37 thf(f28,plain,(
% 0.44/0.37 ( ! [X0 : $i] : ((two = X0) | (one = X0)) )),
% 0.44/0.37 inference(cnf_transformation,[],[f1])).
% 0.44/0.37 thf(f29,definition,(
% 0.44/0.37 ($true != $false)),
% 0.44/0.37 introduced(theory,[fool_distinctness_axiom])).
% 0.44/0.37 thf(f30,definition,(
% 0.44/0.37 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.44/0.37 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.44/0.37 thf(f31,plain,(
% 0.44/0.37 (two = ((b2 @ $true)))),
% 0.44/0.37 inference(equality_resolution,[],[f20])).
% 0.44/0.37 thf(f32,plain,(
% 0.44/0.37 (one = ((b1 @ $true)))),
% 0.44/0.37 inference(equality_resolution,[],[f24])).
% 0.44/0.37 thf(f33,definition,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sF1 @ X1)) = ((~ X1)))) )),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[sF1])],[function_definition])).
% 0.44/0.37 thf(f34,definition,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sF2 @ X1)) = ((sK0 @ (sF1 @ X1))))) )),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[sF2])],[function_definition])).
% 0.44/0.37 thf(f35,definition,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sF3 @ X1)) = ((sK0 @ X1)))) )),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[sF3])],[function_definition])).
% 0.44/0.37 thf(f36,plain,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sK0 @ X1)) = ((sF3 @ X1)))) )),
% 0.44/0.37 inference(reorient_equations,[],[f35])).
% 0.44/0.37 thf(f37,plain,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sF2 @ X1)) != ((sF3 @ X1)))) )),
% 0.44/0.37 inference(definition_folding,[],[f27,f36,f34,f33])).
% 0.44/0.37 thf(f39,plain,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sF1 @ X1)) = $false) | ($true = ((~ X1)))) )),
% 0.44/0.37 inference(iff_proxy_clausification,[],[f33])).
% 0.44/0.37 thf(f40,plain,(
% 0.44/0.37 ( ! [X1 : $o] : ((((sF1 @ X1)) = $false) | ($false = X1)) )),
% 0.44/0.37 inference(not_proxy_clausification,[],[f39])).
% 0.44/0.37 thf(f42,plain,(
% 0.44/0.37 (((b1 @ sK4)) != ((sK0 @ sK4)))),
% 0.44/0.37 inference(negative_extensionality,[],[f25])).
% 0.44/0.37 thf(f43,plain,(
% 0.44/0.37 (((sK0 @ sK5)) != ((b2 @ sK5)))),
% 0.44/0.37 inference(negative_extensionality,[],[f26])).
% 0.44/0.37 thf(f44,plain,(
% 0.44/0.37 ( ! [X0 : $i,X1 : $i] : ((one = X1) | (X0 = X1) | (one = X0)) )),
% 0.44/0.37 inference(constrained_superposition,[],[f28,f28])).
% 0.44/0.37 thf(f48,plain,(
% 0.44/0.37 (two != ((sK0 @ sK5))) | (one = ((b2 @ sK5)))),
% 0.44/0.37 inference(constrained_superposition,[],[f43,f28])).
% 0.44/0.37 thf(f51,definition,(
% 0.44/0.37 spl6_1 <=> (two = ((sK0 @ sK5)))),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_1])],[avatar_definition])).
% 0.44/0.37 thf(f52,plain,(
% 0.44/0.37 (two = ((sK0 @ sK5))) | ~spl6_1),
% 0.44/0.37 inference(avatar_component_clause,[],[f51])).
% 0.44/0.37 thf(f53,plain,(
% 0.44/0.37 (two != ((sK0 @ sK5))) | spl6_1),
% 0.44/0.37 inference(avatar_component_clause,[],[f51])).
% 0.44/0.37 thf(f55,definition,(
% 0.44/0.37 spl6_2 <=> (one = ((b2 @ sK5)))),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_2])],[avatar_definition])).
% 0.44/0.37 thf(f57,plain,(
% 0.44/0.37 (one = ((b2 @ sK5))) | ~spl6_2),
% 0.44/0.37 inference(avatar_component_clause,[],[f55])).
% 0.44/0.37 thf(f58,plain,(
% 0.44/0.37 ~spl6_1 | spl6_2),
% 0.44/0.37 inference(avatar_split_clause,[],[f48,f55,f51])).
% 0.44/0.37 thf(f64,definition,(
% 0.44/0.37 spl6_4 <=> (two = ((sK0 @ sK4)))),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_4])],[avatar_definition])).
% 0.44/0.37 thf(f65,plain,(
% 0.44/0.37 (two = ((sK0 @ sK4))) | ~spl6_4),
% 0.44/0.37 inference(avatar_component_clause,[],[f64])).
% 0.44/0.37 thf(f66,plain,(
% 0.44/0.37 (two != ((sK0 @ sK4))) | spl6_4),
% 0.44/0.37 inference(avatar_component_clause,[],[f64])).
% 0.44/0.37 thf(f68,plain,(
% 0.44/0.37 (one = ((sK0 @ sK5))) | (two != two) | spl6_1),
% 0.44/0.37 inference(constrained_superposition,[],[f53,f28])).
% 0.44/0.37 thf(f69,plain,(
% 0.44/0.37 (one = ((sK0 @ sK5))) | spl6_1),
% 0.44/0.37 inference(trivial_inequality_removal,[],[f68])).
% 0.44/0.37 thf(f75,plain,(
% 0.44/0.37 (sK4 = $false) | (((sK0 @ $true)) != ((b1 @ $true)))),
% 0.44/0.37 inference(constrained_superposition,[],[f42,f30])).
% 0.44/0.37 thf(f76,plain,(
% 0.44/0.37 (two != ((sK0 @ $true))) | (sK5 = $false) | spl6_1),
% 0.44/0.37 inference(constrained_superposition,[],[f53,f30])).
% 0.44/0.37 thf(f84,definition,(
% 0.44/0.37 spl6_5 <=> (two = ((sK0 @ $true)))),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_5])],[avatar_definition])).
% 0.44/0.37 thf(f85,plain,(
% 0.44/0.37 (two = ((sK0 @ $true))) | ~spl6_5),
% 0.44/0.37 inference(avatar_component_clause,[],[f84])).
% 0.44/0.37 thf(f86,plain,(
% 0.44/0.37 (two != ((sK0 @ $true))) | spl6_5),
% 0.44/0.37 inference(avatar_component_clause,[],[f84])).
% 0.44/0.37 thf(f88,definition,(
% 0.44/0.37 spl6_6 <=> (sK4 = $false)),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_6])],[avatar_definition])).
% 0.44/0.37 thf(f90,plain,(
% 0.44/0.37 (sK4 = $false) | ~spl6_6),
% 0.44/0.37 inference(avatar_component_clause,[],[f88])).
% 0.44/0.37 thf(f93,definition,(
% 0.44/0.37 spl6_7 <=> (sK5 = $false)),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_7])],[avatar_definition])).
% 0.44/0.37 thf(f94,plain,(
% 0.44/0.37 (sK5 != $false) | spl6_7),
% 0.44/0.37 inference(avatar_component_clause,[],[f93])).
% 0.44/0.37 thf(f95,plain,(
% 0.44/0.37 (sK5 = $false) | ~spl6_7),
% 0.44/0.37 inference(avatar_component_clause,[],[f93])).
% 0.44/0.37 thf(f96,plain,(
% 0.44/0.37 ~spl6_5 | spl6_7 | spl6_1),
% 0.44/0.37 inference(avatar_split_clause,[],[f76,f51,f93,f84])).
% 0.44/0.37 thf(f98,definition,(
% 0.44/0.37 spl6_8 <=> (((sK0 @ $true)) = ((b1 @ $true)))),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_8])],[avatar_definition])).
% 0.44/0.37 thf(f100,plain,(
% 0.44/0.37 (((sK0 @ $true)) != ((b1 @ $true))) | spl6_8),
% 0.44/0.37 inference(avatar_component_clause,[],[f98])).
% 0.44/0.37 thf(f101,plain,(
% 0.44/0.37 ~spl6_8 | spl6_6),
% 0.44/0.37 inference(avatar_split_clause,[],[f75,f88,f98])).
% 0.44/0.37 thf(f111,definition,(
% 0.44/0.37 spl6_10 <=> (one = ((sK0 @ $true)))),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_10])],[avatar_definition])).
% 0.44/0.37 thf(f113,plain,(
% 0.44/0.37 (one = ((sK0 @ $true))) | ~spl6_10),
% 0.44/0.37 inference(avatar_component_clause,[],[f111])).
% 0.44/0.37 thf(f125,plain,(
% 0.44/0.37 (one = ((sK0 @ $true))) | (two != two) | spl6_5),
% 0.44/0.37 inference(constrained_superposition,[],[f86,f28])).
% 0.44/0.37 thf(f126,plain,(
% 0.44/0.37 (one = ((sK0 @ $true))) | spl6_5),
% 0.44/0.37 inference(trivial_inequality_removal,[],[f125])).
% 0.44/0.37 thf(f127,plain,(
% 0.44/0.37 spl6_10 | spl6_5),
% 0.44/0.37 inference(avatar_split_clause,[],[f126,f84,f111])).
% 0.44/0.37 thf(f203,plain,(
% 0.44/0.37 (one != ((sK0 @ sK5))) | ($true = sK5)),
% 0.44/0.37 inference(constrained_superposition,[],[f43,f21])).
% 0.44/0.37 thf(f206,plain,(
% 0.44/0.37 ($true = sK5) | spl6_1),
% 0.44/0.37 inference(forward_subsumption_resolution,[],[f203,f69])).
% 0.44/0.37 thf(f207,plain,(
% 0.44/0.37 ($true = $false) | (spl6_1 | ~spl6_7)),
% 0.44/0.37 inference(forward_demodulation,[],[f206,f95])).
% 0.44/0.37 thf(f208,plain,(
% 0.44/0.37 $false | (spl6_1 | ~spl6_7)),
% 0.44/0.37 inference(trivial_inequality_removal,[],[f207])).
% 0.44/0.37 thf(f209,plain,(
% 0.44/0.37 spl6_1 | ~spl6_7),
% 0.44/0.37 inference(avatar_contradiction_clause,[],[f208])).
% 0.44/0.37 thf(f291,definition,(
% 0.44/0.37 spl6_11 <=> ! [X0 : $i] : (one = X0)),
% 0.44/0.37 introduced(definition,[new_symbols(definition,[spl6_11])],[avatar_definition])).
% 0.44/0.37 thf(f292,plain,(
% 0.44/0.37 ( ! [X0 : $i] : ((one = X0)) ) | ~spl6_11),
% 0.44/0.37 inference(avatar_component_clause,[],[f291])).
% 0.44/0.37 thf(f319,plain,(
% 0.44/0.37 ($true = sK4) | (two != ((sK0 @ sK4)))),
% 0.44/0.37 inference(constrained_superposition,[],[f42,f23])).
% 0.44/0.37 thf(f322,plain,(
% 0.44/0.37 ($true = sK4) | ~spl6_4),
% 0.44/0.37 inference(forward_subsumption_resolution,[],[f319,f65])).
% 0.44/0.37 thf(f324,plain,(
% 0.44/0.38 (two = ((sK0 @ $true))) | ~spl6_4),
% 0.44/0.38 inference(constrained_superposition,[],[f65,f322])).
% 0.44/0.38 thf(f377,definition,(
% 0.44/0.38 spl6_18 <=> ! [X1 : $o] : ($false = X1)),
% 0.44/0.38 introduced(definition,[new_symbols(definition,[spl6_18])],[avatar_definition])).
% 0.44/0.38 thf(f378,plain,(
% 0.44/0.38 ( ! [X1 : $o] : (($false = X1)) ) | ~spl6_18),
% 0.44/0.38 inference(avatar_component_clause,[],[f377])).
% 0.44/0.38 thf(f391,plain,(
% 0.44/0.38 (one != ((sK0 @ sK5))) | ~spl6_11),
% 0.44/0.38 inference(constrained_superposition,[],[f43,f292])).
% 0.44/0.38 thf(f412,plain,(
% 0.44/0.38 $false | ~spl6_11),
% 0.44/0.38 inference(forward_subsumption_resolution,[],[f391,f292])).
% 0.44/0.38 thf(f413,plain,(
% 0.44/0.38 ~spl6_11),
% 0.44/0.38 inference(avatar_contradiction_clause,[],[f412])).
% 0.44/0.38 thf(f418,plain,(
% 0.44/0.38 spl6_5 | ~spl6_4),
% 0.44/0.38 inference(avatar_split_clause,[],[f324,f64,f84])).
% 0.44/0.38 thf(f462,definition,(
% 0.44/0.38 spl6_25 <=> (one = ((sK0 @ sK5)))),
% 0.44/0.38 introduced(definition,[new_symbols(definition,[spl6_25])],[avatar_definition])).
% 0.44/0.38 thf(f463,plain,(
% 0.44/0.38 (one = ((sK0 @ sK5))) | ~spl6_25),
% 0.44/0.38 inference(avatar_component_clause,[],[f462])).
% 0.44/0.38 thf(f470,definition,(
% 0.44/0.38 spl6_27 <=> (one = ((sK0 @ $false)))),
% 0.44/0.38 introduced(definition,[new_symbols(definition,[spl6_27])],[avatar_definition])).
% 0.44/0.38 thf(f471,plain,(
% 0.44/0.38 (one = ((sK0 @ $false))) | ~spl6_27),
% 0.44/0.38 inference(avatar_component_clause,[],[f470])).
% 0.44/0.38 thf(f479,definition,(
% 0.44/0.38 spl6_29 <=> ($true = sK5)),
% 0.44/0.38 introduced(definition,[new_symbols(definition,[spl6_29])],[avatar_definition])).
% 0.44/0.38 thf(f481,plain,(
% 0.44/0.38 ($true = sK5) | ~spl6_29),
% 0.44/0.38 inference(avatar_component_clause,[],[f479])).
% 0.44/0.38 thf(f482,plain,(
% 0.44/0.38 spl6_29 | ~spl6_25),
% 0.44/0.38 inference(avatar_split_clause,[],[f203,f462,f479])).
% 0.44/0.38 thf(f495,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((((sK0 @ X0)) != ((sF2 @ X0)))) )),
% 0.44/0.38 inference(constrained_superposition,[],[f37,f36])).
% 0.44/0.38 thf(f500,plain,(
% 0.44/0.38 (one = ((b2 @ $true))) | (sK5 = $false) | ~spl6_2),
% 0.44/0.38 inference(constrained_superposition,[],[f57,f30])).
% 0.44/0.38 thf(f505,plain,(
% 0.44/0.38 (one = ((b2 @ $true))) | (~spl6_2 | spl6_7)),
% 0.44/0.38 inference(forward_subsumption_resolution,[],[f500,f94])).
% 0.44/0.38 thf(f506,plain,(
% 0.44/0.38 (one = two) | (~spl6_2 | spl6_7)),
% 0.44/0.38 inference(forward_demodulation,[],[f505,f31])).
% 0.44/0.38 thf(f507,plain,(
% 0.44/0.38 $false | (~spl6_2 | spl6_7)),
% 0.44/0.38 inference(forward_subsumption_resolution,[],[f506,f22])).
% 0.44/0.38 thf(f508,plain,(
% 0.44/0.38 ~spl6_2 | spl6_7),
% 0.44/0.38 inference(avatar_contradiction_clause,[],[f507])).
% 0.44/0.38 thf(f512,plain,(
% 0.44/0.38 (two != two) | (one = ((sK0 @ sK5))) | spl6_1),
% 0.44/0.38 inference(constrained_superposition,[],[f53,f28])).
% 0.44/0.38 thf(f513,plain,(
% 0.44/0.38 (one = ((sK0 @ sK5))) | spl6_1),
% 0.44/0.38 inference(trivial_inequality_removal,[],[f512])).
% 0.44/0.38 thf(f515,plain,(
% 0.44/0.38 spl6_25 | spl6_1),
% 0.44/0.38 inference(avatar_split_clause,[],[f513,f51,f462])).
% 0.44/0.38 thf(f525,plain,(
% 0.44/0.38 (two != ((sK0 @ $false))) | (spl6_4 | ~spl6_6)),
% 0.44/0.38 inference(forward_demodulation,[],[f66,f90])).
% 0.44/0.38 thf(f529,plain,(
% 0.44/0.38 (one = ((sK0 @ $true))) | (~spl6_25 | ~spl6_29)),
% 0.44/0.38 inference(forward_demodulation,[],[f463,f481])).
% 0.44/0.38 thf(f530,plain,(
% 0.44/0.38 spl6_10 | ~spl6_25 | ~spl6_29),
% 0.44/0.38 inference(avatar_split_clause,[],[f529,f479,f462,f111])).
% 0.44/0.38 thf(f531,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((((sK0 @ $true)) = ((sF2 @ X0))) | (((sF1 @ X0)) = $false)) )),
% 0.44/0.38 inference(constrained_superposition,[],[f34,f30])).
% 0.44/0.38 thf(f543,plain,(
% 0.44/0.38 (two != two) | (one = ((sK0 @ $false))) | (spl6_4 | ~spl6_6)),
% 0.44/0.38 inference(constrained_superposition,[],[f525,f28])).
% 0.44/0.38 thf(f544,plain,(
% 0.44/0.38 (one = ((sK0 @ $false))) | (spl6_4 | ~spl6_6)),
% 0.44/0.38 inference(trivial_inequality_removal,[],[f543])).
% 0.44/0.38 thf(f547,plain,(
% 0.44/0.38 spl6_27 | spl6_4 | ~spl6_6),
% 0.44/0.38 inference(avatar_split_clause,[],[f544,f88,f64,f470])).
% 0.44/0.38 thf(f688,plain,(
% 0.44/0.38 (one != ((sF2 @ $true))) | ~spl6_10),
% 0.44/0.38 inference(constrained_superposition,[],[f495,f113])).
% 0.44/0.38 thf(f699,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((((sK0 @ $false)) = ((sF2 @ X0))) | ($false = X0)) )),
% 0.44/0.38 inference(constrained_superposition,[],[f34,f40])).
% 0.44/0.38 thf(f701,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((one = ((sF2 @ X0))) | ($false = X0)) ) | ~spl6_27),
% 0.44/0.38 inference(forward_demodulation,[],[f699,f471])).
% 0.44/0.38 thf(f710,plain,(
% 0.44/0.38 ($true = $false) | (one != one) | (~spl6_10 | ~spl6_27)),
% 0.44/0.38 inference(constrained_superposition,[],[f688,f701])).
% 0.44/0.38 thf(f711,plain,(
% 0.44/0.38 $false | (~spl6_10 | ~spl6_27)),
% 0.44/0.38 inference(trivial_inequality_removal,[],[f710])).
% 0.44/0.38 thf(f712,plain,(
% 0.44/0.38 ~spl6_10 | ~spl6_27),
% 0.44/0.38 inference(avatar_contradiction_clause,[],[f711])).
% 0.44/0.38 thf(f716,plain,(
% 0.44/0.38 (one != ((sK0 @ $true))) | spl6_8),
% 0.44/0.38 inference(forward_demodulation,[],[f100,f32])).
% 0.44/0.38 thf(f719,plain,(
% 0.44/0.38 ~spl6_10 | spl6_8),
% 0.44/0.38 inference(avatar_split_clause,[],[f716,f98,f111])).
% 0.44/0.38 thf(f737,plain,(
% 0.44/0.38 ($false != $false) | ~spl6_18),
% 0.44/0.38 inference(constrained_superposition,[],[f29,f378])).
% 0.44/0.38 thf(f744,plain,(
% 0.44/0.38 $false | ~spl6_18),
% 0.44/0.38 inference(trivial_inequality_removal,[],[f737])).
% 0.44/0.38 thf(f745,plain,(
% 0.44/0.38 ~spl6_18),
% 0.44/0.38 inference(avatar_contradiction_clause,[],[f744])).
% 0.44/0.38 thf(f755,plain,(
% 0.44/0.38 (two = ((sK0 @ $false))) | (~spl6_1 | ~spl6_7)),
% 0.44/0.38 inference(forward_demodulation,[],[f52,f95])).
% 0.44/0.38 thf(f756,plain,(
% 0.44/0.38 $false | (~spl6_1 | spl6_4 | ~spl6_6 | ~spl6_7)),
% 0.44/0.38 inference(forward_subsumption_resolution,[],[f755,f525])).
% 0.44/0.38 thf(f757,plain,(
% 0.44/0.38 ~spl6_1 | spl6_4 | ~spl6_6 | ~spl6_7),
% 0.44/0.38 inference(avatar_contradiction_clause,[],[f756])).
% 0.44/0.38 thf(f814,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((two = ((sK0 @ X0))) | ($false = X0)) ) | ~spl6_5),
% 0.44/0.38 inference(constrained_superposition,[],[f85,f30])).
% 0.44/0.38 thf(f871,plain,(
% 0.44/0.38 ( ! [X0 : $o,X1 : $i] : ((((sK0 @ X0)) = X1) | (one = X1) | ($false = X0) | (one = two)) ) | ~spl6_5),
% 0.44/0.38 inference(constrained_superposition,[],[f814,f44])).
% 0.44/0.38 thf(f875,plain,(
% 0.44/0.38 ( ! [X0 : $o,X1 : $i] : ((((sK0 @ X0)) = X1) | ($false = X0) | (one = X1)) ) | ~spl6_5),
% 0.44/0.38 inference(forward_subsumption_resolution,[],[f871,f22])).
% 0.44/0.38 thf(f908,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((((sF1 @ X0)) = $false) | (two = ((sF2 @ X0)))) ) | ~spl6_5),
% 0.44/0.38 inference(forward_demodulation,[],[f531,f85])).
% 0.44/0.38 thf(f931,plain,(
% 0.44/0.38 ( ! [X0 : $i,X1 : $o] : ((((sF2 @ X1)) != X0) | ($false = X1) | (one = X0)) ) | ~spl6_5),
% 0.44/0.38 inference(constrained_superposition,[],[f495,f875])).
% 0.44/0.38 thf(f994,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((two = ((sF2 @ X0))) | (((sK0 @ $false)) = ((sF2 @ X0)))) ) | ~spl6_5),
% 0.44/0.38 inference(constrained_superposition,[],[f34,f908])).
% 0.44/0.38 thf(f998,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((two = ((sF2 @ X0))) | (two = ((sF2 @ X0)))) ) | (~spl6_1 | ~spl6_5 | ~spl6_7)),
% 0.44/0.38 inference(forward_demodulation,[],[f994,f755])).
% 0.44/0.38 thf(f999,plain,(
% 0.44/0.38 ( ! [X0 : $o] : ((two = ((sF2 @ X0)))) ) | (~spl6_1 | ~spl6_5 | ~spl6_7)),
% 0.44/0.38 inference(duplicate_literal_removal,[],[f998])).
% 0.44/0.38 thf(f1007,plain,(
% 0.44/0.38 ( ! [X0 : $o,X1 : $i] : ((one = X1) | ($false = X0) | (two != X1)) ) | (~spl6_1 | ~spl6_5 | ~spl6_7)),
% 0.44/0.38 inference(constrained_superposition,[],[f931,f999])).
% 0.44/0.38 thf(f1026,plain,(
% 0.44/0.38 ( ! [X0 : $o,X1 : $i] : (($false = X0) | (one = X1)) ) | (~spl6_1 | ~spl6_5 | ~spl6_7)),
% 0.44/0.38 inference(forward_subsumption_resolution,[],[f1007,f28])).
% 0.44/0.38 thf(f1037,plain,(
% 0.44/0.38 spl6_18 | spl6_11 | ~spl6_1 | ~spl6_5 | ~spl6_7),
% 0.44/0.38 inference(avatar_split_clause,[],[f1026,f93,f84,f51,f291,f377])).
% 0.44/0.38 cnf(s1, plain, ~spl6_1 | spl6_2, inference(sat_conversion,[],[f58])).
% 0.44/0.38 cnf(s4, plain, spl6_1 | ~spl6_5 | spl6_7, inference(sat_conversion,[],[f96])).
% 0.44/0.38 cnf(s5, plain, spl6_6 | ~spl6_8, inference(sat_conversion,[],[f101])).
% 0.44/0.38 cnf(s9, plain, spl6_5 | spl6_10, inference(sat_conversion,[],[f127])).
% 0.44/0.38 cnf(s18, plain, spl6_1 | ~spl6_7, inference(sat_conversion,[],[f209])).
% 0.44/0.38 cnf(s30, plain, ~spl6_11, inference(sat_conversion,[],[f413])).
% 0.44/0.38 cnf(s31, plain, ~spl6_4 | spl6_5, inference(sat_conversion,[],[f418])).
% 0.44/0.38 cnf(s44, plain, ~spl6_25 | spl6_29, inference(sat_conversion,[],[f482])).
% 0.44/0.38 cnf(s47, plain, ~spl6_2 | spl6_7, inference(sat_conversion,[],[f508])).
% 0.44/0.38 cnf(s48, plain, spl6_1 | spl6_25, inference(sat_conversion,[],[f515])).
% 0.44/0.38 cnf(s54, plain, spl6_10 | ~spl6_25 | ~spl6_29, inference(sat_conversion,[],[f530])).
% 0.44/0.38 cnf(s56, plain, spl6_4 | ~spl6_6 | spl6_27, inference(sat_conversion,[],[f547])).
% 0.44/0.38 cnf(s72, plain, ~spl6_10 | ~spl6_27, inference(sat_conversion,[],[f712])).
% 0.44/0.38 cnf(s75, plain, spl6_8 | ~spl6_10, inference(sat_conversion,[],[f719])).
% 0.44/0.38 cnf(s78, plain, ~spl6_18, inference(sat_conversion,[],[f745])).
% 0.44/0.38 cnf(s81, plain, ~spl6_1 | spl6_4 | ~spl6_6 | ~spl6_7, inference(sat_conversion,[],[f757])).
% 0.44/0.38 cnf(s110, plain, ~spl6_1 | ~spl6_5 | ~spl6_7 | spl6_11 | spl6_18, inference(sat_conversion,[],[f1037])).
% 0.44/0.38 cnf(s120, plain, spl6_1, inference(rat,[],[s56,s5,s72,s75,s31,s54,s44,s4,s18,s48])).
% 0.44/0.38 cnf(s121, plain, spl6_2, inference(rat,[],[s1,s120])).
% 0.44/0.38 cnf(s122, plain, spl6_7, inference(rat,[],[s47,s121])).
% 0.44/0.38 cnf(s126, plain, ~spl6_5, inference(rat,[],[s110,s78,s30,s120,s122])).
% 0.44/0.38 cnf(s128, plain, ~spl6_4, inference(rat,[],[s31,s126])).
% 0.44/0.38 cnf(s130, plain, spl6_10, inference(rat,[],[s9,s126])).
% 0.44/0.38 cnf(s132, plain, ~spl6_6, inference(rat,[],[s81,s122,s120,s128])).
% 0.44/0.38 cnf(s134, plain, spl6_8, inference(rat,[],[s75,s130])).
% 0.44/0.38 cnf(s135, plain, $false, inference(rat,[],[s5,s134,s132])).
% 0.44/0.38 thf(f1039,plain,(
% 0.44/0.38 $false),
% 0.44/0.38 inference(avatar_sat_refutation,[],[s135])).
% 0.44/0.38 % SZS output end Proof for theBenchmark
% 0.44/0.38 % (3023668)------------------------------
% 0.44/0.38 % (3023668)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.44/0.38 % (3023668)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.44/0.38 % (3023668)CaDiCaL version: 2.1.3
% 0.44/0.38 % (3023668)Termination reason: Refutation
% 0.44/0.38 % (3023668)Time elapsed: 0.046 s
% 0.44/0.38 % (3023668)Peak memory usage: 13 MB
% 0.44/0.38 % (3023668)Instructions burned: 45 (million)
% 0.44/0.38 % (3023657)Success in time 0.111 s
% 0.44/0.38 % Vampire exiting
%------------------------------------------------------------------------------