%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO309^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:47:25 AM UTC 2026
% Result : Theorem 0.22s 0.30s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYO309^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.19 % Computer : n018.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 16:46:56 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.24 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.22/0.30 % (327254)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.30 % (327274)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.22/0.30 % (327274)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.22/0.30 % (327274)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=2544254208:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.30 % (327268)lrs+10_16_si=on:nwc=1.5:random_seed=4212632258:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.30 % (327267)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=226807420:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.30 % (327271)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3322805363:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.30 % (327269)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=498597108:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.30 % (327270)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=1451752577: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.22/0.30 % (327272)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2965956438:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.30 % (327269)Refutation not found, incomplete strategy
% 0.22/0.30 % (327269)------------------------------
% 0.22/0.30 % (327269)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (327269)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (327269)CaDiCaL version: 2.1.3
% 0.22/0.30 % (327269)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (327269)Time elapsed: 0.002 s
% 0.22/0.30 % (327269)Peak memory usage: 12 MB
% 0.22/0.30 % (327269)Instructions burned: 2 (million)
% 0.22/0.30 % (327267)Refutation not found, incomplete strategy
% 0.22/0.30 % (327267)------------------------------
% 0.22/0.30 % (327267)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (327267)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (327267)CaDiCaL version: 2.1.3
% 0.22/0.30 % (327267)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (327267)Time elapsed: 0.003 s
% 0.22/0.30 % (327267)Peak memory usage: 12 MB
% 0.22/0.30 % (327267)Instructions burned: 4 (million)
% 0.22/0.30 % (327269)------------------------------
% 0.22/0.30 % (327269)------------------------------
% 0.22/0.30 % (327270)Refutation not found, incomplete strategy
% 0.22/0.30 % (327270)------------------------------
% 0.22/0.30 % (327270)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (327270)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (327270)CaDiCaL version: 2.1.3
% 0.22/0.30 % (327271)Refutation not found, incomplete strategy
% 0.22/0.30 % (327271)------------------------------
% 0.22/0.30 % (327271)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (327270)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (327270)Time elapsed: 0.003 s
% 0.22/0.30 % (327271)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (327270)Peak memory usage: 12 MB
% 0.22/0.30 % (327270)Instructions burned: 4 (million)
% 0.22/0.30 % (327271)CaDiCaL version: 2.1.3
% 0.22/0.30 % (327271)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (327271)Time elapsed: 0.004 s
% 0.22/0.30 % (327271)Peak memory usage: 12 MB
% 0.22/0.30 % (327271)Instructions burned: 6 (million)
% 0.22/0.30 % (327267)------------------------------
% 0.22/0.30 % (327267)------------------------------
% 0.22/0.30 % (327270)------------------------------
% 0.22/0.30 % (327270)------------------------------
% 0.22/0.30 % (327271)------------------------------
% 0.22/0.30 % (327271)------------------------------
% 0.22/0.30 % (327274) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-327254-327274"...
% 0.22/0.30 % (327268)Instruction limit reached!
% 0.22/0.30 % (327268)------------------------------
% 0.22/0.30 % (327268)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (327268)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (327268)CaDiCaL version: 2.1.3
% 0.22/0.30 % (327268)Termination reason: Instruction limit
% 0.22/0.30 % (327268)Termination phase: Saturation
% 0.22/0.30 % (327268)Time elapsed: 0.011 s
% 0.22/0.30 % (327268)Peak memory usage: 12 MB
% 0.22/0.30 % (327268)Instructions burned: 19 (million)
% 0.22/0.30 % (327274)...printing done.
% 0.22/0.30 % (327274)Refutation found. Thanks to Tanya!
% 0.22/0.30 % SZS status Theorem for theBenchmark
% 0.22/0.30 % SZS output start Proof for theBenchmark
% 0.22/0.30 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.30 thf(func_def_0, type, cS: ($i > $i)).
% 0.22/0.30 thf(func_def_1, type, cQ: ($i > $i)).
% 0.22/0.30 thf(func_def_2, type, cR: ($i > $i > $o)).
% 0.22/0.30 thf(func_def_6, type, sK0: (($i > $o) > $i)).
% 0.22/0.30 thf(func_def_7, type, sK1: ($i > $i)).
% 0.22/0.30 thf(func_def_8, type, sK2: ($i > $i)).
% 0.22/0.30 thf(func_def_9, type, sF3: (($i > $o) > $i)).
% 0.22/0.30 thf(func_def_10, type, sF4: (($i > $o) > $i)).
% 0.22/0.30 thf(func_def_11, type, sF5: (($i > $o) > $o)).
% 0.22/0.30 thf(func_def_12, type, sF6: (($i > $o) > $o)).
% 0.22/0.30 thf(func_def_13, type, sF7: ($i > $i)).
% 0.22/0.30 thf(func_def_14, type, sF8: ($i > $i)).
% 0.22/0.30 thf(func_def_15, type, sF9: ($i > $o)).
% 0.22/0.30 thf(func_def_16, type, sF10: ($i > $i)).
% 0.22/0.30 thf(func_def_17, type, sF11: ($i > $i)).
% 0.22/0.30 thf(func_def_18, type, sF12: ($i > $i)).
% 0.22/0.30 thf(func_def_19, type, sF13: ($i > $o)).
% 0.22/0.30 thf(func_def_20, type, sF14: ($i > $i)).
% 0.22/0.30 thf(func_def_21, type, sF15: ($i > $i > $o)).
% 0.22/0.30 thf(func_def_22, type, sF16: ($i > $i > $o)).
% 0.22/0.30 thf(f1,conjecture,(
% 0.22/0.30 ! [X0 : $i] : (~ ? [X2 : $i] : (cR @ (cS @ X0) @ (cQ @ X2)) <=> ? [X1 : $i] : (cR @ X0 @ (cQ @ X1))) => ? [X3 : ($i > $o)] : ! [X0 : $i] : (~(X3 @ (cS @ X0)) <=> (X3 @ X0))),
% 0.22/0.30 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cEO1)).
% 0.22/0.30 thf(f2,negated_conjecture,(
% 0.22/0.30 ~(! [X0 : $i] : (~ ? [X2 : $i] : (cR @ (cS @ X0) @ (cQ @ X2)) <=> ? [X1 : $i] : (cR @ X0 @ (cQ @ X1))) => ? [X3 : ($i > $o)] : ! [X0 : $i] : (~(X3 @ (cS @ X0)) <=> (X3 @ X0)))),
% 0.22/0.30 inference(negated_conjecture,[status(cth)],[f1])).
% 0.22/0.30 thf(f3,plain,(
% 0.22/0.30 ~(! [X0 : $i] : (~ ? [X1 : $i] : (cR @ (cS @ X0) @ (cQ @ X1)) <=> ? [X2 : $i] : (cR @ X0 @ (cQ @ X2))) => ? [X3 : ($i > $o)] : ! [X4 : $i] : (~(X3 @ (cS @ X4)) <=> (X3 @ X4)))),
% 0.22/0.30 inference(rectify,[],[f2])).
% 0.22/0.30 thf(f4,plain,(
% 0.22/0.30 ~(! [X0 : $i] : (~ ? [X1 : $i] : (((cR @ (cS @ X0) @ (cQ @ X1))) = $true) <=> ? [X2 : $i] : (((cR @ X0 @ (cQ @ X2))) = $true)) => ? [X3 : ($i > $o)] : ! [X4 : $i] : (~ (((X3 @ (cS @ X4))) = $true) <=> (((X3 @ X4)) = $true)))),
% 0.22/0.30 inference(fool_elimination,[],[f3])).
% 0.22/0.30 thf(f5,plain,(
% 0.22/0.30 ~(! [X0 : $i] : (~ ? [X1 : $i] : (((cR @ (cS @ X0) @ (cQ @ X1))) = $true) <=> ? [X2 : $i] : (((cR @ X0 @ (cQ @ X2))) = $true)) => ? [X3 : ($i > $o)] : ! [X4 : $i] : ((((X3 @ (cS @ X4))) != $true) <=> (((X3 @ X4)) = $true)))),
% 0.22/0.30 inference(flattening,[],[f4])).
% 0.22/0.30 thf(f6,plain,(
% 0.22/0.30 ! [X3 : ($i > $o)] : ? [X4 : $i] : ((((X3 @ X4)) = $true) <~> (((X3 @ (cS @ X4))) != $true)) & ! [X0 : $i] : (? [X2 : $i] : (((cR @ X0 @ (cQ @ X2))) = $true) <=> ! [X1 : $i] : (((cR @ (cS @ X0) @ (cQ @ X1))) != $true))),
% 0.22/0.30 inference(ennf_transformation,[],[f5])).
% 0.22/0.30 thf(f7,plain,(
% 0.22/0.30 ! [X3 : ($i > $o)] : ? [X4 : $i] : (((((X3 @ (cS @ X4))) = $true) | (((X3 @ X4)) != $true)) & ((((X3 @ (cS @ X4))) != $true) | (((X3 @ X4)) = $true))) & ! [X0 : $i] : ((? [X2 : $i] : (((cR @ X0 @ (cQ @ X2))) = $true) | ? [X1 : $i] : (((cR @ (cS @ X0) @ (cQ @ X1))) = $true)) & (! [X1 : $i] : (((cR @ (cS @ X0) @ (cQ @ X1))) != $true) | ! [X2 : $i] : (((cR @ X0 @ (cQ @ X2))) != $true)))),
% 0.22/0.30 inference(nnf_transformation,[],[f6])).
% 0.22/0.30 thf(f8,plain,(
% 0.22/0.30 ! [X0 : ($i > $o)] : ? [X1 : $i] : (((((X0 @ (cS @ X1))) = $true) | ($true != ((X0 @ X1)))) & ((((X0 @ (cS @ X1))) != $true) | ($true = ((X0 @ X1))))) & ! [X2 : $i] : ((? [X3 : $i] : (((cR @ X2 @ (cQ @ X3))) = $true) | ? [X4 : $i] : (((cR @ (cS @ X2) @ (cQ @ X4))) = $true)) & (! [X5 : $i] : (((cR @ (cS @ X2) @ (cQ @ X5))) != $true) | ! [X6 : $i] : ($true != ((cR @ X2 @ (cQ @ X6))))))),
% 0.22/0.30 inference(rectify,[],[f7])).
% 0.22/0.30 thf(f9,plain,(
% 0.22/0.30 ! [X0 : ($i > $o)] : (((((X0 @ (cS @ (sK0 @ X0)))) = $true) | (((X0 @ (sK0 @ X0))) != $true)) & ((((X0 @ (cS @ (sK0 @ X0)))) != $true) | (((X0 @ (sK0 @ X0))) = $true))) & ! [X2 : $i] : (((((cR @ X2 @ (cQ @ (sK1 @ X2)))) = $true) | (((cR @ (cS @ X2) @ (cQ @ (sK2 @ X2)))) = $true)) & (! [X5 : $i] : (((cR @ (cS @ X2) @ (cQ @ X5))) != $true) | ! [X6 : $i] : ($true != ((cR @ X2 @ (cQ @ X6))))))),
% 0.22/0.30 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,vAPP]),skolemize(X4,sK2 @ X2),skolemize(X4,sK2 @ X2),skolemize(X4,sK2 @ X2)],[f8])).
% 0.22/0.30 thf(f10,plain,(
% 0.22/0.30 ( ! [X2 : $i,X6 : $i,X5 : $i] : ((((cR @ (cS @ X2) @ (cQ @ X5))) != $true) | ($true != ((cR @ X2 @ (cQ @ X6))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f9])).
% 0.22/0.30 thf(f11,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((cR @ X2 @ (cQ @ (sK1 @ X2)))) = $true) | (((cR @ (cS @ X2) @ (cQ @ (sK2 @ X2)))) = $true)) )),
% 0.22/0.30 inference(cnf_transformation,[],[f9])).
% 0.22/0.30 thf(f12,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((X0 @ (cS @ (sK0 @ X0)))) != $true) | (((X0 @ (sK0 @ X0))) = $true)) )),
% 0.22/0.30 inference(cnf_transformation,[],[f9])).
% 0.22/0.30 thf(f13,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((X0 @ (cS @ (sK0 @ X0)))) = $true) | (((X0 @ (sK0 @ X0))) != $true)) )),
% 0.22/0.30 inference(cnf_transformation,[],[f9])).
% 0.22/0.30 thf(f15,definition,(
% 0.22/0.30 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.22/0.30 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.22/0.30 thf(f16,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((sF3 @ X0)) = ((sK0 @ X0)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF3])],[function_definition])).
% 0.22/0.30 thf(f17,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((sF4 @ X0)) = ((cS @ (sF3 @ X0))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF4])],[function_definition])).
% 0.22/0.30 thf(f18,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((sF5 @ X0)) = ((X0 @ (sF4 @ X0))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF5])],[function_definition])).
% 0.22/0.30 thf(f19,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((X0 @ (sF4 @ X0))) = ((sF5 @ X0)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f18])).
% 0.22/0.30 thf(f20,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((sF6 @ X0)) = ((X0 @ (sF3 @ X0))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF6])],[function_definition])).
% 0.22/0.30 thf(f21,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : (($true = ((sF5 @ X0))) | ($true != ((sF6 @ X0)))) )),
% 0.22/0.30 inference(definition_folding,[],[f13,f20,f16,f19,f17,f16])).
% 0.22/0.30 thf(f22,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : (($true = ((sF6 @ X0))) | ($true != ((sF5 @ X0)))) )),
% 0.22/0.30 inference(definition_folding,[],[f12,f20,f16,f19,f17,f16])).
% 0.22/0.30 thf(f23,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF7 @ X2)) = ((sK1 @ X2)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF7])],[function_definition])).
% 0.22/0.30 thf(f24,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF8 @ X2)) = ((cQ @ (sF7 @ X2))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF8])],[function_definition])).
% 0.22/0.30 thf(f25,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((cQ @ (sF7 @ X2))) = ((sF8 @ X2)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f24])).
% 0.22/0.30 thf(f26,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF9 @ X2)) = ((cR @ X2 @ (sF8 @ X2))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF9])],[function_definition])).
% 0.22/0.30 thf(f27,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((cR @ X2 @ (sF8 @ X2))) = ((sF9 @ X2)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f26])).
% 0.22/0.30 thf(f28,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF10 @ X2)) = ((cS @ X2)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF10])],[function_definition])).
% 0.22/0.30 thf(f29,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((cS @ X2)) = ((sF10 @ X2)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f28])).
% 0.22/0.30 thf(f30,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF11 @ X2)) = ((sK2 @ X2)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF11])],[function_definition])).
% 0.22/0.30 thf(f31,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sK2 @ X2)) = ((sF11 @ X2)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f30])).
% 0.22/0.30 thf(f32,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF12 @ X2)) = ((cQ @ (sF11 @ X2))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF12])],[function_definition])).
% 0.22/0.30 thf(f33,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((cQ @ (sF11 @ X2))) = ((sF12 @ X2)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f32])).
% 0.22/0.30 thf(f34,definition,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF13 @ X2)) = ((cR @ (sF10 @ X2) @ (sF12 @ X2))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF13])],[function_definition])).
% 0.22/0.30 thf(f35,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF13 @ X2)) = $true) | (((sF9 @ X2)) = $true)) )),
% 0.22/0.30 inference(definition_folding,[],[f11,f34,f33,f31,f29,f27,f25,f23])).
% 0.22/0.30 thf(f36,definition,(
% 0.22/0.30 ( ! [X5 : $i] : ((((sF14 @ X5)) = ((cQ @ X5)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF14])],[function_definition])).
% 0.22/0.30 thf(f37,definition,(
% 0.22/0.30 ( ! [X2 : $i,X5 : $i] : ((((sF15 @ X5 @ X2)) = ((cR @ (sF10 @ X2) @ (sF14 @ X5))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF15])],[function_definition])).
% 0.22/0.30 thf(f38,definition,(
% 0.22/0.30 ( ! [X2 : $i,X6 : $i] : ((((sF16 @ X6 @ X2)) = ((cR @ X2 @ (sF14 @ X6))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF16])],[function_definition])).
% 0.22/0.30 thf(f39,plain,(
% 0.22/0.30 ( ! [X2 : $i,X6 : $i,X5 : $i] : ((((sF16 @ X6 @ X2)) != $true) | (((sF15 @ X5 @ X2)) != $true)) )),
% 0.22/0.30 inference(definition_folding,[],[f10,f38,f36,f37,f36,f29])).
% 0.22/0.30 thf(f40,plain,(
% 0.22/0.30 ( ! [X2 : $i,X5 : $i] : ((((cR @ (sF10 @ X2) @ (sF14 @ X5))) = $false) | (((sF15 @ X5 @ X2)) = $true)) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f37])).
% 0.22/0.30 thf(f42,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((X0 @ (sF4 @ X0))) = $true) | ($false = ((sF5 @ X0)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f19])).
% 0.22/0.30 thf(f43,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((X0 @ (sF4 @ X0))) = $false) | ($true = ((sF5 @ X0)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f19])).
% 0.22/0.30 thf(f45,plain,(
% 0.22/0.30 ( ! [X2 : $i] : (($true = ((cR @ (sF10 @ X2) @ (sF12 @ X2)))) | (((sF13 @ X2)) = $false)) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f34])).
% 0.22/0.30 thf(f46,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((cR @ X2 @ (sF8 @ X2))) = $true) | (((sF9 @ X2)) = $false)) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f27])).
% 0.22/0.30 thf(f48,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : (($false = ((X0 @ (sF3 @ X0)))) | ($true = ((sF6 @ X0)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f20])).
% 0.22/0.30 thf(f49,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : (($true = ((X0 @ (sF3 @ X0)))) | ($false = ((sF6 @ X0)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f20])).
% 0.22/0.30 thf(f50,plain,(
% 0.22/0.30 ( ! [X2 : $i,X6 : $i] : (($false = ((cR @ X2 @ (sF14 @ X6)))) | (((sF16 @ X6 @ X2)) = $true)) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f38])).
% 0.22/0.30 thf(f54,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((sF15 @ X2 @ X1)) != $true) | (((sF16 @ X0 @ X1)) = $false) | ($true != $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f39,f15])).
% 0.22/0.30 thf(f56,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((sF16 @ X0 @ X1)) = $false) | (((sF15 @ X2 @ X1)) != $true)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f54])).
% 0.22/0.30 thf(f64,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF14 @ (sF7 @ X2))) = ((sF8 @ X2)))) )),
% 0.22/0.30 inference(forward_demodulation,[],[f25,f36])).
% 0.22/0.30 thf(f65,plain,(
% 0.22/0.30 ( ! [X2 : $i] : ((((sF12 @ X2)) = ((sF14 @ (sF11 @ X2))))) )),
% 0.22/0.30 inference(forward_demodulation,[],[f33,f36])).
% 0.22/0.30 thf(f66,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((sF4 @ X0)) = ((sF10 @ (sF3 @ X0))))) )),
% 0.22/0.30 inference(forward_demodulation,[],[f17,f29])).
% 0.22/0.30 thf(f74,plain,(
% 0.22/0.30 (((sF5 @ sF13)) = $true) | (((sF9 @ (sF4 @ sF13))) = $true) | ($true = $false)),
% 0.22/0.30 inference(constrained_superposition,[],[f43,f35])).
% 0.22/0.30 thf(f81,plain,(
% 0.22/0.30 (((sF5 @ sF13)) = $true) | (((sF9 @ (sF4 @ sF13))) = $true)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f74])).
% 0.22/0.30 thf(f85,definition,(
% 0.22/0.30 spl17_1 <=> (((sF5 @ sF13)) = $true)),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl17_1])],[avatar_definition])).
% 0.22/0.30 thf(f87,plain,(
% 0.22/0.30 (((sF5 @ sF13)) = $true) | ~spl17_1),
% 0.22/0.30 inference(avatar_component_clause,[],[f85])).
% 0.22/0.30 thf(f89,definition,(
% 0.22/0.30 spl17_2 <=> (((sF9 @ (sF4 @ sF13))) = $true)),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl17_2])],[avatar_definition])).
% 0.22/0.30 thf(f91,plain,(
% 0.22/0.30 (((sF9 @ (sF4 @ sF13))) = $true) | ~spl17_2),
% 0.22/0.30 inference(avatar_component_clause,[],[f89])).
% 0.22/0.30 thf(f93,plain,(
% 0.22/0.30 spl17_1 | spl17_2),
% 0.22/0.30 inference(avatar_split_clause,[],[f81,f89,f85])).
% 0.22/0.30 thf(f100,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $true) | ($true = $false) | (((sF6 @ sF13)) = $true)),
% 0.22/0.30 inference(constrained_superposition,[],[f48,f35])).
% 0.22/0.30 thf(f105,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $true) | (((sF6 @ sF13)) = $true)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f100])).
% 0.22/0.30 thf(f108,definition,(
% 0.22/0.30 spl17_3 <=> (((sF6 @ sF13)) = $true)),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl17_3])],[avatar_definition])).
% 0.22/0.30 thf(f109,plain,(
% 0.22/0.30 (((sF6 @ sF13)) != $true) | spl17_3),
% 0.22/0.30 inference(avatar_component_clause,[],[f108])).
% 0.22/0.30 thf(f110,plain,(
% 0.22/0.30 (((sF6 @ sF13)) = $true) | ~spl17_3),
% 0.22/0.30 inference(avatar_component_clause,[],[f108])).
% 0.22/0.30 thf(f112,definition,(
% 0.22/0.30 spl17_4 <=> (((sF9 @ (sF3 @ sF13))) = $true)),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl17_4])],[avatar_definition])).
% 0.22/0.30 thf(f114,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $true) | ~spl17_4),
% 0.22/0.30 inference(avatar_component_clause,[],[f112])).
% 0.22/0.30 thf(f115,plain,(
% 0.22/0.30 spl17_3 | spl17_4),
% 0.22/0.30 inference(avatar_split_clause,[],[f105,f112,f108])).
% 0.22/0.30 thf(f147,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF16 @ (sF7 @ X0) @ X1)) = $true) | (((cR @ X1 @ (sF8 @ X0))) = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f50,f64])).
% 0.22/0.30 thf(f148,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF16 @ (sF11 @ X0) @ X1)) = $true) | (((cR @ X1 @ (sF12 @ X0))) = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f50,f65])).
% 0.22/0.30 thf(f157,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((cR @ (sF10 @ X1) @ (sF8 @ X0))) = $false) | (((sF15 @ (sF7 @ X0) @ X1)) = $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f40,f64])).
% 0.22/0.30 thf(f158,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((cR @ (sF10 @ X1) @ (sF12 @ X0))) = $false) | (((sF15 @ (sF11 @ X0) @ X1)) = $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f40,f65])).
% 0.22/0.30 thf(f238,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((cR @ X1 @ (sF8 @ X0))) = $false) | (((sF15 @ X2 @ X1)) != $true) | ($true = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f147,f56])).
% 0.22/0.30 thf(f247,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((cR @ X1 @ (sF8 @ X0))) = $false) | (((sF15 @ X2 @ X1)) != $true)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f238])).
% 0.22/0.30 thf(f267,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF9 @ X0)) = $false) | (((sF15 @ X1 @ X0)) != $true) | ($true = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f46,f247])).
% 0.22/0.30 thf(f268,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF15 @ X1 @ X0)) != $true) | (((sF9 @ X0)) = $false)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f267])).
% 0.22/0.30 thf(f300,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = $false) | (((cR @ X1 @ (sF12 @ X0))) = $false) | (((sF15 @ X2 @ X1)) != $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f148,f56])).
% 0.22/0.30 thf(f310,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : $i,X1 : $i] : ((((cR @ X1 @ (sF12 @ X0))) = $false) | (((sF15 @ X2 @ X1)) != $true)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f300])).
% 0.22/0.30 thf(f320,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF15 @ X1 @ (sF10 @ X0))) != $true) | ($true = $false) | ($false = ((sF13 @ X0)))) )),
% 0.22/0.30 inference(constrained_superposition,[],[f45,f310])).
% 0.22/0.30 thf(f321,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : ((((sF15 @ X1 @ (sF10 @ X0))) != $true) | ($false = ((sF13 @ X0)))) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f320])).
% 0.22/0.30 thf(f324,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o),X1 : $i] : ((((sF15 @ X1 @ (sF4 @ X0))) != $true) | ($false = ((sF13 @ (sF3 @ X0))))) )),
% 0.22/0.30 inference(constrained_superposition,[],[f321,f66])).
% 0.22/0.30 thf(f393,plain,(
% 0.22/0.30 ( ! [X0 : $i] : (($true = $false) | ($true = ((sF15 @ (sF7 @ (sF10 @ X0)) @ X0))) | (((sF9 @ (sF10 @ X0))) = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f157,f46])).
% 0.22/0.30 thf(f396,plain,(
% 0.22/0.30 ( ! [X0 : $i] : (($true = ((sF15 @ (sF7 @ (sF10 @ X0)) @ X0))) | (((sF9 @ (sF10 @ X0))) = $false)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f393])).
% 0.22/0.30 thf(f409,plain,(
% 0.22/0.30 ( ! [X0 : $i] : ((((sF9 @ (sF10 @ X0))) = $false) | (((sF9 @ X0)) = $false) | ($true != $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f268,f396])).
% 0.22/0.30 thf(f441,plain,(
% 0.22/0.30 ( ! [X0 : $i] : ((((sF9 @ (sF10 @ X0))) = $false) | (((sF9 @ X0)) = $false)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f409])).
% 0.22/0.30 thf(f454,plain,(
% 0.22/0.30 ( ! [X0 : $i] : ((((sF15 @ (sF11 @ X0) @ X0)) = $true) | ($false = ((sF13 @ X0))) | ($true = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f158,f45])).
% 0.22/0.30 thf(f457,plain,(
% 0.22/0.30 ( ! [X0 : $i] : ((((sF15 @ (sF11 @ X0) @ X0)) = $true) | ($false = ((sF13 @ X0)))) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f454])).
% 0.22/0.30 thf(f460,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : ((((sF9 @ (sF4 @ X0))) = $false) | (((sF9 @ (sF3 @ X0))) = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f441,f66])).
% 0.22/0.30 thf(f569,plain,(
% 0.22/0.30 ( ! [X0 : $i] : (($false = ((sF13 @ X0))) | (((sF9 @ X0)) = $false) | ($true != $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f268,f457])).
% 0.22/0.30 thf(f574,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : (($false = ((sF13 @ (sF3 @ X0)))) | ($false = ((sF13 @ (sF4 @ X0)))) | ($true != $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f324,f457])).
% 0.22/0.30 thf(f585,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $o)] : (($false = ((sF13 @ (sF4 @ X0)))) | ($false = ((sF13 @ (sF3 @ X0))))) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f574])).
% 0.22/0.30 thf(f591,plain,(
% 0.22/0.30 ( ! [X0 : $i] : (($false = ((sF13 @ X0))) | (((sF9 @ X0)) = $false)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f569])).
% 0.22/0.30 thf(f610,plain,(
% 0.22/0.30 ($true = $false) | (((sF9 @ (sF4 @ sF13))) = $false) | (((sF5 @ sF13)) = $false)),
% 0.22/0.30 inference(constrained_superposition,[],[f591,f42])).
% 0.22/0.30 thf(f615,plain,(
% 0.22/0.30 ($true = $false) | (((sF9 @ (sF3 @ sF13))) = $false) | (((sF6 @ sF13)) = $false)),
% 0.22/0.30 inference(constrained_superposition,[],[f49,f591])).
% 0.22/0.30 thf(f618,plain,(
% 0.22/0.30 (((sF9 @ (sF4 @ sF13))) = $false) | (((sF5 @ sF13)) = $false)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f610])).
% 0.22/0.30 thf(f621,plain,(
% 0.22/0.30 (((sF6 @ sF13)) = $false) | (((sF9 @ (sF3 @ sF13))) = $false)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f615])).
% 0.22/0.30 thf(f623,plain,(
% 0.22/0.30 (((sF5 @ sF13)) = $false) | ($true = $false) | ~spl17_2),
% 0.22/0.30 inference(forward_demodulation,[],[f618,f91])).
% 0.22/0.30 thf(f624,plain,(
% 0.22/0.30 (((sF5 @ sF13)) = $false) | ~spl17_2),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f623])).
% 0.22/0.30 thf(f629,plain,(
% 0.22/0.30 ($true = $false) | (((sF6 @ sF13)) != $true) | ~spl17_2),
% 0.22/0.30 inference(constrained_superposition,[],[f21,f624])).
% 0.22/0.30 thf(f631,plain,(
% 0.22/0.30 (((sF6 @ sF13)) != $true) | ~spl17_2),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f629])).
% 0.22/0.30 thf(f635,plain,(
% 0.22/0.30 $false | (~spl17_2 | ~spl17_3)),
% 0.22/0.30 inference(forward_subsumption_resolution,[],[f631,f110])).
% 0.22/0.30 thf(f636,plain,(
% 0.22/0.30 ~spl17_2 | ~spl17_3),
% 0.22/0.30 inference(avatar_contradiction_clause,[],[f635])).
% 0.22/0.30 thf(f637,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $false) | ($true = $false) | ~spl17_3),
% 0.22/0.30 inference(forward_demodulation,[],[f621,f110])).
% 0.22/0.30 thf(f638,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $false) | ~spl17_3),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f637])).
% 0.22/0.30 thf(f729,plain,(
% 0.22/0.30 ($true = $false) | (((sF5 @ sF13)) = $false) | (((sF13 @ (sF3 @ sF13))) = $false)),
% 0.22/0.30 inference(constrained_superposition,[],[f585,f42])).
% 0.22/0.30 thf(f735,plain,(
% 0.22/0.30 (((sF13 @ (sF3 @ sF13))) = $false) | (((sF5 @ sF13)) = $false)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f729])).
% 0.22/0.30 thf(f739,plain,(
% 0.22/0.30 ($true = $false) | (((sF13 @ (sF3 @ sF13))) = $false) | ~spl17_1),
% 0.22/0.30 inference(forward_demodulation,[],[f735,f87])).
% 0.22/0.30 thf(f740,plain,(
% 0.22/0.30 (((sF13 @ (sF3 @ sF13))) = $false) | ~spl17_1),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f739])).
% 0.22/0.30 thf(f757,plain,(
% 0.22/0.30 ($true = $false) | (((sF9 @ (sF3 @ sF13))) = $true) | ~spl17_1),
% 0.22/0.30 inference(constrained_superposition,[],[f35,f740])).
% 0.22/0.30 thf(f758,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $true) | ~spl17_1),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f757])).
% 0.22/0.30 thf(f763,plain,(
% 0.22/0.30 ($true = $false) | (~spl17_1 | ~spl17_3)),
% 0.22/0.30 inference(forward_demodulation,[],[f758,f638])).
% 0.22/0.30 thf(f764,plain,(
% 0.22/0.30 $false | (~spl17_1 | ~spl17_3)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f763])).
% 0.22/0.30 thf(f765,plain,(
% 0.22/0.30 ~spl17_1 | ~spl17_3),
% 0.22/0.30 inference(avatar_contradiction_clause,[],[f764])).
% 0.22/0.30 thf(f780,definition,(
% 0.22/0.30 spl17_10 <=> (((sF9 @ (sF3 @ sF13))) = $false)),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[spl17_10])],[avatar_definition])).
% 0.22/0.30 thf(f782,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $false) | ~spl17_10),
% 0.22/0.30 inference(avatar_component_clause,[],[f780])).
% 0.22/0.30 thf(f794,plain,(
% 0.22/0.30 (((sF5 @ sF13)) != $true) | ($true != $true) | spl17_3),
% 0.22/0.30 inference(constrained_superposition,[],[f109,f22])).
% 0.22/0.30 thf(f797,plain,(
% 0.22/0.30 (((sF5 @ sF13)) != $true) | spl17_3),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f794])).
% 0.22/0.30 thf(f799,plain,(
% 0.22/0.30 ~spl17_1 | spl17_3),
% 0.22/0.30 inference(avatar_split_clause,[],[f797,f108,f85])).
% 0.22/0.30 thf(f819,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $false) | ($true = $false) | ~spl17_2),
% 0.22/0.30 inference(constrained_superposition,[],[f91,f460])).
% 0.22/0.30 thf(f821,plain,(
% 0.22/0.30 (((sF9 @ (sF3 @ sF13))) = $false) | ~spl17_2),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f819])).
% 0.22/0.30 thf(f823,plain,(
% 0.22/0.30 spl17_10 | ~spl17_2),
% 0.22/0.30 inference(avatar_split_clause,[],[f821,f89,f780])).
% 0.22/0.30 thf(f825,plain,(
% 0.22/0.30 ($true = $false) | (~spl17_4 | ~spl17_10)),
% 0.22/0.30 inference(forward_demodulation,[],[f782,f114])).
% 0.22/0.30 thf(f826,plain,(
% 0.22/0.30 $false | (~spl17_4 | ~spl17_10)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f825])).
% 0.22/0.30 thf(f827,plain,(
% 0.22/0.30 ~spl17_4 | ~spl17_10),
% 0.22/0.30 inference(avatar_contradiction_clause,[],[f826])).
% 0.22/0.30 cnf(s2, plain, spl17_1 | spl17_2, inference(sat_conversion,[],[f93])).
% 0.22/0.30 cnf(s3, plain, spl17_3 | spl17_4, inference(sat_conversion,[],[f115])).
% 0.22/0.30 cnf(s8, plain, ~spl17_2 | ~spl17_3, inference(sat_conversion,[],[f636])).
% 0.22/0.30 cnf(s12, plain, ~spl17_1 | ~spl17_3, inference(sat_conversion,[],[f765])).
% 0.22/0.30 cnf(s22, plain, ~spl17_1 | spl17_3, inference(sat_conversion,[],[f799])).
% 0.22/0.30 cnf(s24, plain, ~spl17_2 | spl17_10, inference(sat_conversion,[],[f823])).
% 0.22/0.30 cnf(s26, plain, ~spl17_4 | ~spl17_10, inference(sat_conversion,[],[f827])).
% 0.22/0.30 cnf(s27, plain, ~spl17_2, inference(rat,[],[s3,s26,s8,s24])).
% 0.22/0.30 cnf(s29, plain, spl17_1, inference(rat,[],[s2,s27])).
% 0.22/0.30 cnf(s30, plain, spl17_3, inference(rat,[],[s22,s29])).
% 0.22/0.30 cnf(s31, plain, $false, inference(rat,[],[s12,s30,s29])).
% 0.22/0.30 thf(f828,plain,(
% 0.22/0.30 $false),
% 0.22/0.30 inference(avatar_sat_refutation,[],[s31])).
% 0.22/0.30 % SZS output end Proof for theBenchmark
% 0.22/0.30 % (327274)------------------------------
% 0.22/0.30 % (327274)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (327274)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (327274)CaDiCaL version: 2.1.3
% 0.22/0.30 % (327274)Termination reason: Refutation
% 0.22/0.30 % (327274)Time elapsed: 0.018 s
% 0.22/0.30 % (327274)Peak memory usage: 13 MB
% 0.22/0.30 % (327274)Instructions burned: 58 (million)
% 0.22/0.30 % (327254)Success in time 0.054 s
% 0.22/0.30 % Vampire exiting
%------------------------------------------------------------------------------