%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SEV009^5 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:37:27 AM UTC 2026
% Result : Theorem 0.20s 0.31s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEV009^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.20 % Computer : n026.cluster.edu
% 0.09/0.20 % Model : x86_64 x86_64
% 0.09/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.20 % Memory : 8046.5625MB
% 0.09/0.20 % OS : Linux 6.8.0-71-generic
% 0.09/0.20 % CPULimit : 300
% 0.09/0.20 % WCLimit : 300
% 0.09/0.20 % DateTime : Tue Sep 29 15:02:36 UTC 2026
% 0.09/0.21 % CPUTime :
% 0.09/0.21 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.24 Running higher-order theorem proving
% 0.09/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.20/0.31 % (707715)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.20/0.31 % (707726)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.20/0.31 % (707726)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.20/0.31 % (707720)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=2175417576:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.20/0.31 % (707721)lrs+10_16_si=on:nwc=1.5:random_seed=3309996957:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.20/0.31 % (707722)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2103636274:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.20/0.31 % (707725)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=3081445587:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.20/0.31 % (707726)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=3225706022:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.20/0.31 % (707723)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=3779065021: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.20/0.31 % (707724)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=3314111187:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.20/0.31 % (707722)Instruction limit reached!
% 0.20/0.31 % (707722)------------------------------
% 0.20/0.31 % (707722)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (707722)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (707722)CaDiCaL version: 2.1.3
% 0.20/0.31 % (707722)Termination reason: Instruction limit
% 0.20/0.31 % (707722)Termination phase: Saturation
% 0.20/0.31 % (707722)Time elapsed: 0.003 s
% 0.20/0.31 % (707722)Peak memory usage: 12 MB
% 0.20/0.31 % (707722)Instructions burned: 4 (million)
% 0.20/0.31 % (707720) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-707715-707720"...
% 0.20/0.31 % (707724) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-707715-707724"...
% 0.20/0.31 % (707721)Instruction limit reached!
% 0.20/0.31 % (707721)------------------------------
% 0.20/0.31 % (707721)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (707721)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (707721)CaDiCaL version: 2.1.3
% 0.20/0.31 % (707721)Termination reason: Instruction limit
% 0.20/0.31 % (707721)Termination phase: Saturation
% 0.20/0.31 % (707721)Time elapsed: 0.010 s
% 0.20/0.31 % (707721)Peak memory usage: 12 MB
% 0.20/0.31 % (707721)Instructions burned: 19 (million)
% 0.20/0.31 % (707720)...printing done.
% 0.20/0.31 % (707724)...printing done.
% 0.20/0.31 % (707720)Refutation found. Thanks to Tanya!
% 0.20/0.31 % SZS status Theorem for theBenchmark
% 0.20/0.31 % SZS output start Proof for theBenchmark
% 0.20/0.31 thf(type_def_5, type, a: $tType).
% 0.20/0.31 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.20/0.31 thf(func_def_3, type, sP0: (((a > $o) > $o) > $o)).
% 0.20/0.31 thf(func_def_4, type, sK1: (((a > $o) > $o) > a)).
% 0.20/0.31 thf(func_def_5, type, sK2: (((a > $o) > $o) > a)).
% 0.20/0.31 thf(func_def_6, type, sK3: (((a > $o) > $o) > a)).
% 0.20/0.31 thf(func_def_7, type, sK4: (((a > $o) > $o) > a > $o)).
% 0.20/0.31 thf(func_def_8, type, sK5: (((a > $o) > $o) > a > $o)).
% 0.20/0.31 thf(func_def_9, type, sK6: ((a > $o) > $o)).
% 0.20/0.31 thf(func_def_10, type, sK7: a).
% 0.20/0.31 thf(func_def_11, type, sK8: a).
% 0.20/0.31 thf(func_def_12, type, sK9: a).
% 0.20/0.31 thf(func_def_13, type, sK10: (a > $o)).
% 0.20/0.31 thf(func_def_14, type, sK11: (a > a > $o)).
% 0.20/0.31 thf(func_def_15, type, vNOT: ($o > $o)).
% 0.20/0.31 thf(func_def_17, type, db0: !>[X0: $tType]:(X0)).
% 0.20/0.31 thf(func_def_18, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.20/0.31 thf(f1,conjecture,(
% 0.20/0.31 ! [X0 : ((a > $o) > $o)] : (! [X1 : a] : ? [X2 : (a > $o)] : ((X2 @ X1) & (X0 @ X2) & ! [X3 : (a > $o)] : (((X3 @ X1) & (X0 @ X3)) => (X3 = X2))) => (! [X1 : a,X5 : a] : (? [X4 : (a > $o)] : ((X4 @ X5) & (X4 @ X1) & (X0 @ X4)) => ? [X4 : (a > $o)] : ((X0 @ X4) & (X4 @ X1) & (X4 @ X5))) & ! [X1 : a,X5 : a,X6 : a] : ((? [X4 : (a > $o)] : ((X4 @ X5) & (X0 @ X4) & (X4 @ X1)) & ? [X4 : (a > $o)] : ((X4 @ X6) & (X0 @ X4) & (X4 @ X5))) => ? [X4 : (a > $o)] : ((X4 @ X1) & (X0 @ X4) & (X4 @ X6))) & ! [X1 : a] : ? [X4 : (a > $o)] : ((X4 @ X1) & (X0 @ X4) & (X4 @ X1))))),
% 0.20/0.31 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM261_B_pme)).
% 0.20/0.31 thf(f2,negated_conjecture,(
% 0.20/0.31 ~ ! [X0 : ((a > $o) > $o)] : (! [X1 : a] : ? [X2 : (a > $o)] : ((X2 @ X1) & (X0 @ X2) & ! [X3 : (a > $o)] : (((X3 @ X1) & (X0 @ X3)) => (X3 = X2))) => (! [X1 : a,X5 : a] : (? [X4 : (a > $o)] : ((X4 @ X5) & (X4 @ X1) & (X0 @ X4)) => ? [X4 : (a > $o)] : ((X0 @ X4) & (X4 @ X1) & (X4 @ X5))) & ! [X1 : a,X5 : a,X6 : a] : ((? [X4 : (a > $o)] : ((X4 @ X5) & (X0 @ X4) & (X4 @ X1)) & ? [X4 : (a > $o)] : ((X4 @ X6) & (X0 @ X4) & (X4 @ X5))) => ? [X4 : (a > $o)] : ((X4 @ X1) & (X0 @ X4) & (X4 @ X6))) & ! [X1 : a] : ? [X4 : (a > $o)] : ((X4 @ X1) & (X0 @ X4) & (X4 @ X1))))),
% 0.20/0.31 inference(negated_conjecture,[status(cth)],[f1])).
% 0.20/0.31 thf(f3,plain,(
% 0.20/0.31 ~ ! [X0 : ((a > $o) > $o)] : (! [X1 : a] : ? [X2 : (a > $o)] : ((X2 @ X1) & (X0 @ X2) & ! [X3 : (a > $o)] : (((X3 @ X1) & (X0 @ X3)) => (X3 = X2))) => (! [X4 : a,X5 : a] : (? [X6 : (a > $o)] : ((X6 @ X5) & (X6 @ X4) & (X0 @ X6)) => ? [X7 : (a > $o)] : ((X0 @ X7) & (X7 @ X4) & (X7 @ X5))) & ! [X8 : a,X9 : a,X10 : a] : ((? [X11 : (a > $o)] : ((X11 @ X9) & (X0 @ X11) & (X11 @ X8)) & ? [X12 : (a > $o)] : ((X12 @ X10) & (X0 @ X12) & (X12 @ X9))) => ? [X13 : (a > $o)] : ((X13 @ X8) & (X0 @ X13) & (X13 @ X10))) & ! [X14 : a] : ? [X15 : (a > $o)] : ((X15 @ X14) & (X0 @ X15) & (X15 @ X14))))),
% 0.20/0.31 inference(rectify,[],[f2])).
% 0.20/0.31 thf(f4,plain,(
% 0.20/0.31 ~ ! [X0 : ((a > $o) > $o)] : (! [X1 : a] : ? [X2 : (a > $o)] : ((((X0 @ X2)) = $true) & (((X2 @ X1)) = $true) & ! [X3 : (a > $o)] : (((((X3 @ X1)) = $true) & (((X0 @ X3)) = $true)) => (X2 = X3))) => (! [X4 : a,X5 : a] : (? [X6 : (a > $o)] : (($true = ((X0 @ X6))) & ($true = ((X6 @ X5))) & ($true = ((X6 @ X4)))) => ? [X7 : (a > $o)] : (($true = ((X7 @ X5))) & ($true = ((X7 @ X4))) & ($true = ((X0 @ X7))))) & ! [X10 : a,X8 : a,X9 : a] : ((? [X12 : (a > $o)] : (($true = ((X12 @ X9))) & ($true = ((X0 @ X12))) & ($true = ((X12 @ X10)))) & ? [X11 : (a > $o)] : (($true = ((X11 @ X8))) & ($true = ((X11 @ X9))) & ($true = ((X0 @ X11))))) => ? [X13 : (a > $o)] : (($true = ((X13 @ X10))) & ($true = ((X13 @ X8))) & (((X0 @ X13)) = $true))) & ! [X14 : a] : ? [X15 : (a > $o)] : (($true = ((X0 @ X15))) & ($true = ((X15 @ X14))) & ($true = ((X15 @ X14))))))),
% 0.20/0.31 inference(fool_elimination,[],[f3])).
% 0.20/0.31 thf(f5,plain,(
% 0.20/0.31 ? [X0 : ((a > $o) > $o)] : ((? [X4 : a,X5 : a] : (? [X6 : (a > $o)] : (($true = ((X0 @ X6))) & ($true = ((X6 @ X5))) & ($true = ((X6 @ X4)))) & ! [X7 : (a > $o)] : (($true != ((X0 @ X7))) | ($true != ((X7 @ X5))) | ($true != ((X7 @ X4))))) | ? [X10 : a,X8 : a,X9 : a] : (! [X13 : (a > $o)] : (($true != ((X13 @ X10))) | (((X0 @ X13)) != $true) | ($true != ((X13 @ X8)))) & (? [X12 : (a > $o)] : (($true = ((X12 @ X9))) & ($true = ((X0 @ X12))) & ($true = ((X12 @ X10)))) & ? [X11 : (a > $o)] : (($true = ((X11 @ X8))) & ($true = ((X11 @ X9))) & ($true = ((X0 @ X11)))))) | ? [X14 : a] : ! [X15 : (a > $o)] : (($true != ((X15 @ X14))) | ($true != ((X15 @ X14))) | ($true != ((X0 @ X15))))) & ! [X1 : a] : ? [X2 : (a > $o)] : ((((X0 @ X2)) = $true) & (((X2 @ X1)) = $true) & ! [X3 : (a > $o)] : ((X2 = X3) | ((((X3 @ X1)) != $true) | (((X0 @ X3)) != $true)))))),
% 0.20/0.31 inference(ennf_transformation,[],[f4])).
% 0.20/0.31 thf(f6,plain,(
% 0.20/0.31 ? [X0 : ((a > $o) > $o)] : ((? [X10 : a,X8 : a,X9 : a] : (? [X12 : (a > $o)] : (($true = ((X12 @ X9))) & ($true = ((X0 @ X12))) & ($true = ((X12 @ X10)))) & ? [X11 : (a > $o)] : (($true = ((X11 @ X8))) & ($true = ((X11 @ X9))) & ($true = ((X0 @ X11)))) & ! [X13 : (a > $o)] : (($true != ((X13 @ X10))) | (((X0 @ X13)) != $true) | ($true != ((X13 @ X8))))) | ? [X14 : a] : ! [X15 : (a > $o)] : (($true != ((X15 @ X14))) | ($true != ((X15 @ X14))) | ($true != ((X0 @ X15)))) | ? [X4 : a,X5 : a] : (? [X6 : (a > $o)] : (($true = ((X0 @ X6))) & ($true = ((X6 @ X5))) & ($true = ((X6 @ X4)))) & ! [X7 : (a > $o)] : (($true != ((X0 @ X7))) | ($true != ((X7 @ X5))) | ($true != ((X7 @ X4)))))) & ! [X1 : a] : ? [X2 : (a > $o)] : ((((X0 @ X2)) = $true) & (((X2 @ X1)) = $true) & ! [X3 : (a > $o)] : ((((X0 @ X3)) != $true) | (((X3 @ X1)) != $true) | (X2 = X3))))),
% 0.20/0.31 inference(flattening,[],[f5])).
% 0.20/0.31 thf(f7,definition,(
% 0.20/0.31 ! [X0 : ((a > $o) > $o)] : (? [X10 : a,X8 : a,X9 : a] : (? [X12 : (a > $o)] : (($true = ((X12 @ X9))) & ($true = ((X0 @ X12))) & ($true = ((X12 @ X10)))) & ? [X11 : (a > $o)] : (($true = ((X11 @ X8))) & ($true = ((X11 @ X9))) & ($true = ((X0 @ X11)))) & ! [X13 : (a > $o)] : (($true != ((X13 @ X10))) | (((X0 @ X13)) != $true) | ($true != ((X13 @ X8))))) | ~ ($true = ((sP0 @ X0))))),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[=])],[predicate_definition_introduction])).
% 0.20/0.31 thf(f8,plain,(
% 0.20/0.31 ? [X0 : ((a > $o) > $o)] : ((($true = ((sP0 @ X0))) | ? [X14 : a] : ! [X15 : (a > $o)] : (($true != ((X15 @ X14))) | ($true != ((X15 @ X14))) | ($true != ((X0 @ X15)))) | ? [X4 : a,X5 : a] : (? [X6 : (a > $o)] : (($true = ((X0 @ X6))) & ($true = ((X6 @ X5))) & ($true = ((X6 @ X4)))) & ! [X7 : (a > $o)] : (($true != ((X0 @ X7))) | ($true != ((X7 @ X5))) | ($true != ((X7 @ X4)))))) & ! [X1 : a] : ? [X2 : (a > $o)] : ((((X0 @ X2)) = $true) & (((X2 @ X1)) = $true) & ! [X3 : (a > $o)] : ((((X0 @ X3)) != $true) | (((X3 @ X1)) != $true) | (X2 = X3))))),
% 0.20/0.31 inference(definition_folding,[],[f6,f7])).
% 0.20/0.31 thf(f9,plain,(
% 0.20/0.31 ! [X0 : ((a > $o) > $o)] : (? [X10 : a,X8 : a,X9 : a] : (? [X12 : (a > $o)] : (($true = ((X12 @ X9))) & ($true = ((X0 @ X12))) & ($true = ((X12 @ X10)))) & ? [X11 : (a > $o)] : (($true = ((X11 @ X8))) & ($true = ((X11 @ X9))) & ($true = ((X0 @ X11)))) & ! [X13 : (a > $o)] : (($true != ((X13 @ X10))) | (((X0 @ X13)) != $true) | ($true != ((X13 @ X8))))) | ($true != ((sP0 @ X0))))),
% 0.20/0.31 inference(nnf_transformation,[],[f7])).
% 0.20/0.31 thf(f10,plain,(
% 0.20/0.31 ! [X0 : ((a > $o) > $o)] : (? [X1 : a,X2 : a,X3 : a] : (? [X4 : (a > $o)] : ((((X4 @ X3)) = $true) & (((X0 @ X4)) = $true) & (((X4 @ X1)) = $true)) & ? [X5 : (a > $o)] : (($true = ((X5 @ X2))) & ($true = ((X5 @ X3))) & ($true = ((X0 @ X5)))) & ! [X6 : (a > $o)] : ((((X6 @ X1)) != $true) | ($true != ((X0 @ X6))) | (((X6 @ X2)) != $true))) | ($true != ((sP0 @ X0))))),
% 0.20/0.31 inference(rectify,[],[f9])).
% 0.20/0.31 thf(f11,plain,(
% 0.20/0.31 ! [X0 : ((a > $o) > $o)] : (((($true = ((sK4 @ X0 @ (sK3 @ X0)))) & ($true = ((X0 @ (sK4 @ X0)))) & (((sK4 @ X0 @ (sK1 @ X0))) = $true)) & (($true = ((sK5 @ X0 @ (sK2 @ X0)))) & ($true = ((sK5 @ X0 @ (sK3 @ X0)))) & ($true = ((X0 @ (sK5 @ X0))))) & ! [X6 : (a > $o)] : (($true != ((X6 @ (sK1 @ X0)))) | ($true != ((X0 @ X6))) | (((X6 @ (sK2 @ X0))) != $true))) | ($true != ((sP0 @ X0))))),
% 0.20/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[vAPP,vAPP,vAPP,vAPP,vAPP]),skolemize(X5,sK5 @ X0),skolemize(X5,sK5 @ X0),skolemize(X5,sK5 @ X0),skolemize(X5,sK5 @ X0),skolemize(X5,sK5 @ X0)],[f10])).
% 0.20/0.31 thf(f12,plain,(
% 0.20/0.31 ? [X0 : ((a > $o) > $o)] : ((($true = ((sP0 @ X0))) | ? [X1 : a] : ! [X2 : (a > $o)] : ((((X2 @ X1)) != $true) | (((X2 @ X1)) != $true) | (((X0 @ X2)) != $true)) | ? [X3 : a,X4 : a] : (? [X5 : (a > $o)] : (($true = ((X0 @ X5))) & ($true = ((X5 @ X4))) & ($true = ((X5 @ X3)))) & ! [X6 : (a > $o)] : (($true != ((X0 @ X6))) | ($true != ((X6 @ X4))) | ($true != ((X6 @ X3)))))) & ! [X7 : a] : ? [X8 : (a > $o)] : ((((X0 @ X8)) = $true) & (((X8 @ X7)) = $true) & ! [X9 : (a > $o)] : (($true != ((X0 @ X9))) | ($true != ((X9 @ X7))) | (X8 = X9))))),
% 0.20/0.31 inference(rectify,[],[f8])).
% 0.20/0.31 thf(f13,plain,(
% 0.20/0.31 ((((sP0 @ sK6)) = $true) | ! [X2 : (a > $o)] : (($true != ((X2 @ sK7))) | ($true != ((X2 @ sK7))) | ($true != ((sK6 @ X2)))) | ((($true = ((sK6 @ sK10))) & ($true = ((sK10 @ sK9))) & ($true = ((sK10 @ sK8)))) & ! [X6 : (a > $o)] : (($true != ((sK6 @ X6))) | ($true != ((X6 @ sK9))) | ($true != ((X6 @ sK8)))))) & ! [X7 : a] : (($true = ((sK6 @ (sK11 @ X7)))) & ($true = ((sK11 @ X7 @ X7))) & ! [X9 : (a > $o)] : (($true != ((sK6 @ X9))) | ($true != ((X9 @ X7))) | (((sK11 @ X7)) = X9)))),
% 0.20/0.31 inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,vAPP]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X3,sK8),skolemize(X4,sK9),skolemize(X5,sK10),skolemize(X5,sK5 @ X0)],[f12])).
% 0.20/0.31 thf(f14,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o),X6 : (a > $o)] : (($true != ((X6 @ (sK1 @ X0)))) | ($true != ((X0 @ X6))) | (((X6 @ (sK2 @ X0))) != $true) | ($true != ((sP0 @ X0)))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f15,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o)] : (($true != ((sP0 @ X0))) | ($true = ((X0 @ (sK5 @ X0))))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f16,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o)] : (($true != ((sP0 @ X0))) | ($true = ((sK5 @ X0 @ (sK3 @ X0))))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f17,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o)] : (($true != ((sP0 @ X0))) | ($true = ((sK5 @ X0 @ (sK2 @ X0))))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f18,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o)] : (($true != ((sP0 @ X0))) | (((sK4 @ X0 @ (sK1 @ X0))) = $true)) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f19,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o)] : (($true != ((sP0 @ X0))) | ($true = ((X0 @ (sK4 @ X0))))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f20,plain,(
% 0.20/0.31 ( ! [X0 : ((a > $o) > $o)] : (($true != ((sP0 @ X0))) | ($true = ((sK4 @ X0 @ (sK3 @ X0))))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f11])).
% 0.20/0.31 thf(f21,plain,(
% 0.20/0.31 ( ! [X9 : (a > $o),X7 : a] : (($true != ((sK6 @ X9))) | ($true != ((X9 @ X7))) | (((sK11 @ X7)) = X9)) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f22,plain,(
% 0.20/0.31 ( ! [X7 : a] : (($true = ((sK11 @ X7 @ X7)))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f23,plain,(
% 0.20/0.31 ( ! [X7 : a] : (($true = ((sK6 @ (sK11 @ X7))))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f24,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o),X6 : (a > $o)] : ((((sP0 @ sK6)) = $true) | ($true != ((X2 @ sK7))) | ($true != ((sK6 @ X6))) | ($true != ((X6 @ sK8))) | ($true != ((sK6 @ X2))) | ($true != ((X6 @ sK9))) | ($true != ((X2 @ sK7)))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f25,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true != ((X2 @ sK7))) | ($true != ((sK6 @ X2))) | ($true != ((X2 @ sK7))) | (((sP0 @ sK6)) = $true) | ($true = ((sK10 @ sK8)))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f26,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true != ((X2 @ sK7))) | ($true != ((sK6 @ X2))) | ($true != ((X2 @ sK7))) | ($true = ((sK10 @ sK9))) | (((sP0 @ sK6)) = $true)) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f27,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true = ((sK6 @ sK10))) | (((sP0 @ sK6)) = $true) | ($true != ((X2 @ sK7))) | ($true != ((sK6 @ X2))) | ($true != ((X2 @ sK7)))) )),
% 0.20/0.31 inference(cnf_transformation,[],[f13])).
% 0.20/0.31 thf(f30,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o),X6 : (a > $o)] : ((((sP0 @ sK6)) = $true) | ($true != ((X6 @ sK8))) | ($true != ((X2 @ sK7))) | ($true != ((sK6 @ X2))) | ($true != ((sK6 @ X6))) | ($true != ((X6 @ sK9)))) )),
% 0.20/0.31 inference(duplicate_literal_removal,[],[f24])).
% 0.20/0.31 thf(f31,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true != ((X2 @ sK7))) | (((sP0 @ sK6)) = $true) | ($true = ((sK10 @ sK8))) | ($true != ((sK6 @ X2)))) )),
% 0.20/0.31 inference(duplicate_literal_removal,[],[f25])).
% 0.20/0.31 thf(f32,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true != ((sK6 @ X2))) | (((sP0 @ sK6)) = $true) | ($true != ((X2 @ sK7))) | ($true = ((sK6 @ sK10)))) )),
% 0.20/0.31 inference(duplicate_literal_removal,[],[f27])).
% 0.20/0.31 thf(f33,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true = ((sK10 @ sK9))) | ($true != ((sK6 @ X2))) | ($true != ((X2 @ sK7))) | (((sP0 @ sK6)) = $true)) )),
% 0.20/0.31 inference(duplicate_literal_removal,[],[f26])).
% 0.20/0.31 thf(f35,definition,(
% 0.20/0.31 spl12_1 <=> ! [X6 : (a > $o)] : (($true != ((X6 @ sK8))) | ($true != ((X6 @ sK9))) | ($true != ((sK6 @ X6))))),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[spl12_1])],[avatar_definition])).
% 0.20/0.31 thf(f36,plain,(
% 0.20/0.31 ( ! [X6 : (a > $o)] : (($true != ((sK6 @ X6))) | ($true != ((X6 @ sK9))) | ($true != ((X6 @ sK8)))) ) | ~spl12_1),
% 0.20/0.31 inference(avatar_component_clause,[],[f35])).
% 0.20/0.31 thf(f38,definition,(
% 0.20/0.31 spl12_2 <=> (((sP0 @ sK6)) = $true)),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[spl12_2])],[avatar_definition])).
% 0.20/0.31 thf(f40,plain,(
% 0.20/0.31 (((sP0 @ sK6)) = $true) | ~spl12_2),
% 0.20/0.31 inference(avatar_component_clause,[],[f38])).
% 0.20/0.31 thf(f42,definition,(
% 0.20/0.31 spl12_3 <=> ! [X2 : (a > $o)] : (($true != ((X2 @ sK7))) | ($true != ((sK6 @ X2))))),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[spl12_3])],[avatar_definition])).
% 0.20/0.31 thf(f43,plain,(
% 0.20/0.31 ( ! [X2 : (a > $o)] : (($true != ((sK6 @ X2))) | ($true != ((X2 @ sK7)))) ) | ~spl12_3),
% 0.20/0.31 inference(avatar_component_clause,[],[f42])).
% 0.20/0.31 thf(f44,plain,(
% 0.20/0.31 spl12_1 | spl12_2 | spl12_3),
% 0.20/0.31 inference(avatar_split_clause,[],[f30,f42,f38,f35])).
% 0.20/0.31 thf(f46,definition,(
% 0.20/0.31 spl12_4 <=> ($true = ((sK10 @ sK8)))),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[spl12_4])],[avatar_definition])).
% 0.20/0.31 thf(f48,plain,(
% 0.20/0.31 ($true = ((sK10 @ sK8))) | ~spl12_4),
% 0.20/0.31 inference(avatar_component_clause,[],[f46])).
% 0.20/0.31 thf(f49,plain,(
% 0.20/0.31 spl12_4 | spl12_2 | spl12_3),
% 0.20/0.31 inference(avatar_split_clause,[],[f31,f42,f38,f46])).
% 0.20/0.31 thf(f51,definition,(
% 0.20/0.31 spl12_5 <=> ($true = ((sK6 @ sK10)))),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[spl12_5])],[avatar_definition])).
% 0.20/0.31 thf(f53,plain,(
% 0.20/0.31 ($true = ((sK6 @ sK10))) | ~spl12_5),
% 0.20/0.31 inference(avatar_component_clause,[],[f51])).
% 0.20/0.31 thf(f54,plain,(
% 0.20/0.31 spl12_5 | spl12_2 | spl12_3),
% 0.20/0.31 inference(avatar_split_clause,[],[f32,f42,f38,f51])).
% 0.20/0.31 thf(f56,definition,(
% 0.20/0.31 spl12_6 <=> ($true = ((sK10 @ sK9)))),
% 0.20/0.31 introduced(definition,[new_symbols(definition,[spl12_6])],[avatar_definition])).
% 0.20/0.31 thf(f58,plain,(
% 0.20/0.31 ($true = ((sK10 @ sK9))) | ~spl12_6),
% 0.20/0.31 inference(avatar_component_clause,[],[f56])).
% 0.20/0.31 thf(f59,plain,(
% 0.20/0.31 spl12_3 | spl12_2 | spl12_6),
% 0.20/0.31 inference(avatar_split_clause,[],[f33,f56,f38,f42])).
% 0.20/0.31 thf(f60,plain,(
% 0.20/0.31 ( ! [X0 : a,X1 : a] : (($true != $true) | ($true != ((sK11 @ X0 @ X1))) | (((sK11 @ X0)) = ((sK11 @ X1)))) )),
% 0.20/0.31 inference(constrained_superposition,[],[f21,f23])).
% 0.20/0.31 thf(f61,plain,(
% 0.20/0.31 ( ! [X0 : a,X1 : a] : (($true != ((sK11 @ X0 @ X1))) | (((sK11 @ X0)) = ((sK11 @ X1)))) )),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f60])).
% 0.20/0.31 thf(f62,plain,(
% 0.20/0.31 ($true != $true) | ($true = ((sK6 @ (sK5 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f15,f40])).
% 0.20/0.31 thf(f63,plain,(
% 0.20/0.31 ($true = ((sK6 @ (sK5 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f62])).
% 0.20/0.31 thf(f64,plain,(
% 0.20/0.31 ( ! [X0 : a] : ((((sK5 @ sK6 @ X0)) != $true) | (((sK11 @ X0)) = ((sK5 @ sK6))) | ($true != $true)) ) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f21,f63])).
% 0.20/0.31 thf(f65,plain,(
% 0.20/0.31 ( ! [X0 : a] : ((((sK5 @ sK6 @ X0)) != $true) | (((sK11 @ X0)) = ((sK5 @ sK6)))) ) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f64])).
% 0.20/0.31 thf(f66,plain,(
% 0.20/0.31 ($true != $true) | ($true = ((sK6 @ (sK4 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f19,f40])).
% 0.20/0.31 thf(f67,plain,(
% 0.20/0.31 ($true = ((sK6 @ (sK4 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f66])).
% 0.20/0.31 thf(f68,plain,(
% 0.20/0.31 ( ! [X0 : a] : (($true != ((sK4 @ sK6 @ X0))) | (((sK4 @ sK6)) = ((sK11 @ X0))) | ($true != $true)) ) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f21,f67])).
% 0.20/0.31 thf(f69,plain,(
% 0.20/0.31 ( ! [X0 : a] : (($true != ((sK4 @ sK6 @ X0))) | (((sK4 @ sK6)) = ((sK11 @ X0)))) ) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f68])).
% 0.20/0.31 thf(f70,plain,(
% 0.20/0.31 ($true != $true) | ($true = ((sK5 @ sK6 @ (sK3 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f16,f40])).
% 0.20/0.31 thf(f71,plain,(
% 0.20/0.31 ($true = ((sK5 @ sK6 @ (sK3 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f70])).
% 0.20/0.31 thf(f72,plain,(
% 0.20/0.31 ($true != $true) | (((sK11 @ (sK3 @ sK6))) = ((sK5 @ sK6))) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f65,f71])).
% 0.20/0.31 thf(f73,plain,(
% 0.20/0.31 (((sK11 @ (sK3 @ sK6))) = ((sK5 @ sK6))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f72])).
% 0.20/0.31 thf(f94,plain,(
% 0.20/0.31 ($true != $true) | (((sK5 @ sK6 @ (sK2 @ sK6))) = $true) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f17,f40])).
% 0.20/0.31 thf(f95,plain,(
% 0.20/0.31 (((sK5 @ sK6 @ (sK2 @ sK6))) = $true) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f94])).
% 0.20/0.31 thf(f116,plain,(
% 0.20/0.31 ($true = ((sK4 @ sK6 @ (sK1 @ sK6)))) | ($true != $true) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f18,f40])).
% 0.20/0.31 thf(f117,plain,(
% 0.20/0.31 ($true = ((sK4 @ sK6 @ (sK1 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f116])).
% 0.20/0.31 thf(f118,plain,(
% 0.20/0.31 (((sK4 @ sK6)) = ((sK11 @ (sK1 @ sK6)))) | ($true != $true) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f69,f117])).
% 0.20/0.31 thf(f119,plain,(
% 0.20/0.31 (((sK4 @ sK6)) = ((sK11 @ (sK1 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f118])).
% 0.20/0.31 thf(f120,plain,(
% 0.20/0.31 ( ! [X1 : a] : ((((sK11 @ (sK1 @ sK6) @ X1)) = ((sK4 @ sK6 @ X1)))) ) | ~spl12_2),
% 0.20/0.31 inference(argument_congruence,[],[f119])).
% 0.20/0.31 thf(f122,plain,(
% 0.20/0.31 ( ! [X1 : a] : (($true = ((sK11 @ (sK1 @ sK6) @ X1))) | (((sK4 @ sK6 @ X1)) = $false)) ) | ~spl12_2),
% 0.20/0.31 inference(iff_proxy_clausification,[],[f120])).
% 0.20/0.31 thf(f124,plain,(
% 0.20/0.31 ( ! [X0 : a] : ((((sK11 @ (sK1 @ sK6))) = ((sK11 @ X0))) | ($false = ((sK4 @ sK6 @ X0))) | ($true != $true)) ) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f61,f122])).
% 0.20/0.31 thf(f125,plain,(
% 0.20/0.31 ( ! [X0 : a] : (($false = ((sK4 @ sK6 @ X0))) | (((sK11 @ (sK1 @ sK6))) = ((sK11 @ X0)))) ) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f124])).
% 0.20/0.31 thf(f126,plain,(
% 0.20/0.31 ( ! [X0 : a] : (($false = ((sK4 @ sK6 @ X0))) | (((sK4 @ sK6)) = ((sK11 @ X0)))) ) | ~spl12_2),
% 0.20/0.31 inference(forward_demodulation,[],[f125,f119])).
% 0.20/0.31 thf(f140,plain,(
% 0.20/0.31 ($true = ((sK4 @ sK6 @ (sK3 @ sK6)))) | ($true != $true) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f20,f40])).
% 0.20/0.31 thf(f141,plain,(
% 0.20/0.31 ($true = ((sK4 @ sK6 @ (sK3 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f140])).
% 0.20/0.31 thf(f142,plain,(
% 0.20/0.31 (((sK4 @ sK6)) = ((sK11 @ (sK3 @ sK6)))) | ($true = $false) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f141,f126])).
% 0.20/0.31 thf(f145,plain,(
% 0.20/0.31 (((sK4 @ sK6)) = ((sK11 @ (sK3 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f142])).
% 0.20/0.31 thf(f148,plain,(
% 0.20/0.31 (((sK4 @ sK6)) = ((sK5 @ sK6))) | ~spl12_2),
% 0.20/0.31 inference(forward_demodulation,[],[f145,f73])).
% 0.20/0.31 thf(f151,plain,(
% 0.20/0.31 ( ! [X1 : a] : ((((sK5 @ sK6 @ X1)) = ((sK4 @ sK6 @ X1)))) ) | ~spl12_2),
% 0.20/0.31 inference(argument_congruence,[],[f148])).
% 0.20/0.31 thf(f154,plain,(
% 0.20/0.31 ( ! [X1 : a] : ((((sK5 @ sK6 @ X1)) = $false) | ($true = ((sK4 @ sK6 @ X1)))) ) | ~spl12_2),
% 0.20/0.31 inference(iff_proxy_clausification,[],[f151])).
% 0.20/0.31 thf(f166,plain,(
% 0.20/0.31 ($true = $false) | ($true = ((sK4 @ sK6 @ (sK2 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f154,f95])).
% 0.20/0.31 thf(f171,plain,(
% 0.20/0.31 ($true = ((sK4 @ sK6 @ (sK2 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f166])).
% 0.20/0.31 thf(f199,plain,(
% 0.20/0.31 ($true != ((sK4 @ sK6 @ (sK2 @ sK6)))) | (((sP0 @ sK6)) != $true) | ($true != ((sK6 @ (sK4 @ sK6)))) | ($true != $true) | ~spl12_2),
% 0.20/0.31 inference(constrained_superposition,[],[f14,f117])).
% 0.20/0.31 thf(f213,plain,(
% 0.20/0.31 (((sP0 @ sK6)) != $true) | ($true != ((sK4 @ sK6 @ (sK2 @ sK6)))) | ($true != ((sK6 @ (sK4 @ sK6)))) | ~spl12_2),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f199])).
% 0.20/0.31 thf(f221,plain,(
% 0.20/0.31 ($true != ((sK4 @ sK6 @ (sK2 @ sK6)))) | (((sP0 @ sK6)) != $true) | ~spl12_2),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f213,f19])).
% 0.20/0.31 thf(f224,plain,(
% 0.20/0.31 (((sP0 @ sK6)) != $true) | ~spl12_2),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f221,f171])).
% 0.20/0.31 thf(f225,plain,(
% 0.20/0.31 $false | ~spl12_2),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f224,f40])).
% 0.20/0.31 thf(f226,plain,(
% 0.20/0.31 ~spl12_2),
% 0.20/0.31 inference(avatar_contradiction_clause,[],[f225])).
% 0.20/0.31 thf(f227,plain,(
% 0.20/0.31 ( ! [X0 : a] : (($true != $true) | (((sK11 @ X0 @ sK7)) != $true)) ) | ~spl12_3),
% 0.20/0.31 inference(constrained_superposition,[],[f43,f23])).
% 0.20/0.31 thf(f228,plain,(
% 0.20/0.31 ( ! [X0 : a] : ((((sK11 @ X0 @ sK7)) != $true)) ) | ~spl12_3),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f227])).
% 0.20/0.31 thf(f229,plain,(
% 0.20/0.31 ($true != $true) | ~spl12_3),
% 0.20/0.31 inference(constrained_superposition,[],[f228,f22])).
% 0.20/0.31 thf(f230,plain,(
% 0.20/0.31 $false | ~spl12_3),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f229])).
% 0.20/0.31 thf(f231,plain,(
% 0.20/0.31 ~spl12_3),
% 0.20/0.31 inference(avatar_contradiction_clause,[],[f230])).
% 0.20/0.31 thf(f239,plain,(
% 0.20/0.31 ($true != ((sK10 @ sK8))) | ($true != ((sK10 @ sK9))) | ($true != $true) | (~spl12_1 | ~spl12_5)),
% 0.20/0.31 inference(constrained_superposition,[],[f36,f53])).
% 0.20/0.31 thf(f241,plain,(
% 0.20/0.31 ($true != ((sK10 @ sK8))) | ($true != ((sK10 @ sK9))) | (~spl12_1 | ~spl12_5)),
% 0.20/0.31 inference(trivial_inequality_removal,[],[f239])).
% 0.20/0.31 thf(f242,plain,(
% 0.20/0.31 ($true != ((sK10 @ sK9))) | (~spl12_1 | ~spl12_4 | ~spl12_5)),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f241,f48])).
% 0.20/0.31 thf(f243,plain,(
% 0.20/0.31 $false | (~spl12_1 | ~spl12_4 | ~spl12_5 | ~spl12_6)),
% 0.20/0.31 inference(forward_subsumption_resolution,[],[f242,f58])).
% 0.20/0.31 thf(f244,plain,(
% 0.20/0.31 ~spl12_1 | ~spl12_4 | ~spl12_5 | ~spl12_6),
% 0.20/0.31 inference(avatar_contradiction_clause,[],[f243])).
% 0.20/0.31 cnf(s1, plain, spl12_1 | spl12_2 | spl12_3, inference(sat_conversion,[],[f44])).
% 0.20/0.31 cnf(s2, plain, spl12_2 | spl12_3 | spl12_4, inference(sat_conversion,[],[f49])).
% 0.20/0.31 cnf(s3, plain, spl12_2 | spl12_3 | spl12_5, inference(sat_conversion,[],[f54])).
% 0.20/0.31 cnf(s4, plain, spl12_2 | spl12_3 | spl12_6, inference(sat_conversion,[],[f59])).
% 0.20/0.31 cnf(s5, plain, ~spl12_2, inference(sat_conversion,[],[f226])).
% 0.20/0.31 cnf(s6, plain, ~spl12_3, inference(sat_conversion,[],[f231])).
% 0.20/0.31 cnf(s7, plain, ~spl12_1 | ~spl12_4 | ~spl12_5 | ~spl12_6, inference(sat_conversion,[],[f244])).
% 0.20/0.31 cnf(s8, plain, spl12_6, inference(rat,[],[s4,s6,s5])).
% 0.20/0.31 cnf(s9, plain, spl12_5, inference(rat,[],[s3,s6,s5])).
% 0.20/0.31 cnf(s10, plain, spl12_4, inference(rat,[],[s2,s6,s5])).
% 0.20/0.31 cnf(s11, plain, ~spl12_1, inference(rat,[],[s7,s8,s9,s10])).
% 0.20/0.31 cnf(s12, plain, $false, inference(rat,[],[s1,s6,s5,s11])).
% 0.20/0.31 thf(f245,plain,(
% 0.20/0.31 $false),
% 0.20/0.31 inference(avatar_sat_refutation,[],[s12])).
% 0.20/0.31 % SZS output end Proof for theBenchmark
% 0.20/0.31 % (707720)------------------------------
% 0.20/0.31 % (707720)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.31 % (707720)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.31 % (707720)CaDiCaL version: 2.1.3
% 0.20/0.31 % (707720)Termination reason: Refutation
% 0.20/0.31 % (707720)Time elapsed: 0.012 s
% 0.20/0.31 % (707720)Peak memory usage: 13 MB
% 0.20/0.31 % (707720)Instructions burned: 19 (million)
% 0.20/0.31 % (707715)Success in time 0.045 s
% 0.20/0.31 % Vampire exiting
%------------------------------------------------------------------------------