%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SYO334^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 : n001.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:28 AM UTC 2026
% Result : Theorem 0.48s 0.39s
% Output : Refutation 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SYO334^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.25 % Computer : n001.cluster.edu
% 0.10/0.25 % Model : x86_64 x86_64
% 0.10/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.25 % Memory : 8046.5625MB
% 0.10/0.25 % OS : Linux 6.8.0-71-generic
% 0.10/0.25 % CPULimit : 300
% 0.10/0.25 % WCLimit : 300
% 0.10/0.25 % DateTime : Tue Sep 29 16:52:21 UTC 2026
% 0.10/0.26 % CPUTime :
% 0.10/0.26 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.31 Running higher-order theorem proving
% 0.25/0.32 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.48/0.39 % (1495249)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.48/0.39 % (1495256)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=1986194780:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.48/0.39 % (1495256)Instruction limit reached!
% 0.48/0.39 % (1495256)------------------------------
% 0.48/0.39 % (1495256)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.39 % (1495256)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.39 % (1495256)CaDiCaL version: 2.1.3
% 0.48/0.39 % (1495256)Termination reason: Instruction limit
% 0.48/0.39 % (1495256)Termination phase: Saturation
% 0.48/0.39 % (1495256)Time elapsed: 0.003 s
% 0.48/0.39 % (1495256)Peak memory usage: 11 MB
% 0.48/0.39 % (1495256)Instructions burned: 4 (million)
% 0.48/0.39 % (1495260)WARNING Broken Constraint: if ho_split_queue_ratios(1,8) has been set then ho_split_queue(off) is equal to on
% 0.48/0.39 % (1495260)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.48/0.39 % (1495254)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=1006309652:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.48/0.39 % (1495257)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=2414566115: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.48/0.39 % (1495255)lrs+10_16_si=on:nwc=1.5:random_seed=237761736:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.48/0.39 % (1495258)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=1865000966:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.48/0.39 % (1495260)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=2436024772:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.48/0.39 % (1495259)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=280691367:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.48/0.39 % (1495258) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1495249-1495258"...
% 0.48/0.39 % (1495254) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1495249-1495254"...
% 0.48/0.39 % (1495255)Instruction limit reached!
% 0.48/0.39 % (1495255)------------------------------
% 0.48/0.39 % (1495255)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.39 % (1495255)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.39 % (1495255)CaDiCaL version: 2.1.3
% 0.48/0.39 % (1495255)Termination reason: Instruction limit
% 0.48/0.39 % (1495255)Termination phase: Saturation
% 0.48/0.39 % (1495255)Time elapsed: 0.018 s
% 0.48/0.39 % (1495255)Peak memory usage: 12 MB
% 0.48/0.39 % (1495255)Instructions burned: 18 (million)
% 0.48/0.39 % (1495258)...printing done.
% 0.48/0.39 % (1495254)...printing done.
% 0.48/0.39 % (1495258)Refutation found. Thanks to Tanya!
% 0.48/0.39 % SZS status Theorem for theBenchmark
% 0.48/0.39 % SZS output start Proof for theBenchmark
% 0.48/0.39 thf(type_def_5, type, c: $tType).
% 0.48/0.39 thf(type_def_6, type, b: $tType).
% 0.48/0.39 thf(type_def_7, type, a: $tType).
% 0.48/0.39 thf(type_def_8, type, sTfun: ($tType * $tType) > $tType).
% 0.48/0.39 thf(func_def_0, type, c_starc: (c > c > c)).
% 0.48/0.39 thf(func_def_1, type, c_starb: (b > b > b)).
% 0.48/0.39 thf(func_def_2, type, c_stara: (a > a > a)).
% 0.48/0.39 thf(func_def_6, type, sK0: (a > b)).
% 0.48/0.39 thf(func_def_7, type, sK1: (a > c)).
% 0.48/0.39 thf(func_def_8, type, sK2: (b > c)).
% 0.48/0.39 thf(func_def_9, type, sK3: (b > a)).
% 0.48/0.39 thf(func_def_10, type, sK4: b).
% 0.48/0.39 thf(func_def_11, type, sK5: (c > $o)).
% 0.48/0.39 thf(func_def_12, type, sK6: b).
% 0.48/0.39 thf(func_def_13, type, vNOT: ($o > $o)).
% 0.48/0.39 thf(func_def_14, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.48/0.39 thf(func_def_15, type, db0: !>[X0: $tType]:(X0)).
% 0.48/0.39 thf(func_def_16, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.48/0.39 thf(f1,conjecture,(
% 0.48/0.39 ! [X2 : (b > c),X1 : (a > c),X0 : (a > b)] : ((! [X3 : a,X5 : a,X4 : (c > $o)] : ((X4 @ (X1 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starc @ (X1 @ X3) @ (X1 @ X5)))) & ! [X5 : b] : ? [X3 : a] : ! [X4 : (b > $o)] : ((X4 @ (X0 @ X3)) => (X4 @ X5)) & ! [X3 : a,X4 : (c > $o)] : ((X4 @ (X2 @ (X0 @ X3))) => (X4 @ (X1 @ X3))) & ! [X4 : (b > $o),X3 : a,X5 : a] : ((X4 @ (X0 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starb @ (X0 @ X3) @ (X0 @ X5))))) => ! [X4 : (c > $o),X3 : b,X5 : b] : ((X4 @ (X2 @ (c_starb @ X3 @ X5))) => (X4 @ (c_starc @ (X2 @ X3) @ (X2 @ X5)))))),
% 0.48/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM270_INST)).
% 0.48/0.39 thf(f2,negated_conjecture,(
% 0.48/0.39 ~ ! [X2 : (b > c),X1 : (a > c),X0 : (a > b)] : ((! [X3 : a,X5 : a,X4 : (c > $o)] : ((X4 @ (X1 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starc @ (X1 @ X3) @ (X1 @ X5)))) & ! [X5 : b] : ? [X3 : a] : ! [X4 : (b > $o)] : ((X4 @ (X0 @ X3)) => (X4 @ X5)) & ! [X3 : a,X4 : (c > $o)] : ((X4 @ (X2 @ (X0 @ X3))) => (X4 @ (X1 @ X3))) & ! [X4 : (b > $o),X3 : a,X5 : a] : ((X4 @ (X0 @ (c_stara @ X3 @ X5))) => (X4 @ (c_starb @ (X0 @ X3) @ (X0 @ X5))))) => ! [X4 : (c > $o),X3 : b,X5 : b] : ((X4 @ (X2 @ (c_starb @ X3 @ X5))) => (X4 @ (c_starc @ (X2 @ X3) @ (X2 @ X5)))))),
% 0.48/0.39 inference(negated_conjecture,[status(cth)],[f1])).
% 0.48/0.39 thf(f3,plain,(
% 0.48/0.39 ~ ! [X0 : (b > c),X1 : (a > c),X2 : (a > b)] : ((! [X3 : a,X4 : a,X5 : (c > $o)] : ((X5 @ (X1 @ (c_stara @ X3 @ X4))) => (X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4)))) & ! [X6 : b] : ? [X7 : a] : ! [X8 : (b > $o)] : ((X8 @ (X2 @ X7)) => (X8 @ X6)) & ! [X9 : a,X10 : (c > $o)] : ((X10 @ (X0 @ (X2 @ X9))) => (X10 @ (X1 @ X9))) & ! [X11 : (b > $o),X12 : a,X13 : a] : ((X11 @ (X2 @ (c_stara @ X12 @ X13))) => (X11 @ (c_starb @ (X2 @ X12) @ (X2 @ X13))))) => ! [X14 : (c > $o),X15 : b,X16 : b] : ((X14 @ (X0 @ (c_starb @ X15 @ X16))) => (X14 @ (c_starc @ (X0 @ X15) @ (X0 @ X16)))))),
% 0.48/0.39 inference(rectify,[],[f2])).
% 0.48/0.39 thf(f4,plain,(
% 0.48/0.39 ~ ! [X2 : (a > b),X1 : (a > c),X0 : (b > c)] : ((! [X6 : b] : ? [X7 : a] : ! [X8 : (b > $o)] : ((((X8 @ (X2 @ X7))) = $true) => (((X8 @ X6)) = $true)) & ! [X12 : a,X11 : (b > $o),X13 : a] : (($true = ((X11 @ (X2 @ (c_stara @ X12 @ X13))))) => ($true = ((X11 @ (c_starb @ (X2 @ X12) @ (X2 @ X13)))))) & ! [X5 : (c > $o),X3 : a,X4 : a] : ((((X5 @ (X1 @ (c_stara @ X3 @ X4)))) = $true) => ($true = ((X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4)))))) & ! [X10 : (c > $o),X9 : a] : ((((X10 @ (X0 @ (X2 @ X9)))) = $true) => (((X10 @ (X1 @ X9))) = $true))) => ! [X16 : b,X15 : b,X14 : (c > $o)] : ((((X14 @ (X0 @ (c_starb @ X15 @ X16)))) = $true) => (((X14 @ (c_starc @ (X0 @ X15) @ (X0 @ X16)))) = $true)))),
% 0.48/0.39 inference(fool_elimination,[],[f3])).
% 0.48/0.39 thf(f5,plain,(
% 0.48/0.39 ? [X2 : (a > b),X1 : (a > c),X0 : (b > c)] : (? [X15 : b,X14 : (c > $o),X16 : b] : ((((X14 @ (c_starc @ (X0 @ X15) @ (X0 @ X16)))) != $true) & (((X14 @ (X0 @ (c_starb @ X15 @ X16)))) = $true)) & (! [X6 : b] : ? [X7 : a] : ! [X8 : (b > $o)] : ((((X8 @ (X2 @ X7))) != $true) | (((X8 @ X6)) = $true)) & ! [X13 : a,X11 : (b > $o),X12 : a] : (($true != ((X11 @ (X2 @ (c_stara @ X12 @ X13))))) | ($true = ((X11 @ (c_starb @ (X2 @ X12) @ (X2 @ X13)))))) & ! [X5 : (c > $o),X3 : a,X4 : a] : (($true = ((X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4))))) | (((X5 @ (X1 @ (c_stara @ X3 @ X4)))) != $true)) & ! [X10 : (c > $o),X9 : a] : ((((X10 @ (X1 @ X9))) = $true) | (((X10 @ (X0 @ (X2 @ X9)))) != $true))))),
% 0.48/0.39 inference(ennf_transformation,[],[f4])).
% 0.48/0.39 thf(f6,plain,(
% 0.48/0.39 ? [X2 : (a > b),X1 : (a > c),X0 : (b > c)] : (! [X5 : (c > $o),X3 : a,X4 : a] : (($true = ((X5 @ (c_starc @ (X1 @ X3) @ (X1 @ X4))))) | (((X5 @ (X1 @ (c_stara @ X3 @ X4)))) != $true)) & ! [X13 : a,X11 : (b > $o),X12 : a] : (($true != ((X11 @ (X2 @ (c_stara @ X12 @ X13))))) | ($true = ((X11 @ (c_starb @ (X2 @ X12) @ (X2 @ X13)))))) & ! [X10 : (c > $o),X9 : a] : ((((X10 @ (X1 @ X9))) = $true) | (((X10 @ (X0 @ (X2 @ X9)))) != $true)) & ! [X6 : b] : ? [X7 : a] : ! [X8 : (b > $o)] : ((((X8 @ (X2 @ X7))) != $true) | (((X8 @ X6)) = $true)) & ? [X15 : b,X14 : (c > $o),X16 : b] : ((((X14 @ (c_starc @ (X0 @ X15) @ (X0 @ X16)))) != $true) & (((X14 @ (X0 @ (c_starb @ X15 @ X16)))) = $true)))),
% 0.48/0.39 inference(flattening,[],[f5])).
% 0.48/0.39 thf(f7,plain,(
% 0.48/0.39 ? [X0 : (a > b),X1 : (a > c),X2 : (b > c)] : (! [X3 : (c > $o),X4 : a,X5 : a] : (($true = ((X3 @ (c_starc @ (X1 @ X4) @ (X1 @ X5))))) | (((X3 @ (X1 @ (c_stara @ X4 @ X5)))) != $true)) & ! [X6 : a,X7 : (b > $o),X8 : a] : (($true != ((X7 @ (X0 @ (c_stara @ X8 @ X6))))) | ($true = ((X7 @ (c_starb @ (X0 @ X8) @ (X0 @ X6)))))) & ! [X9 : (c > $o),X10 : a] : ((((X9 @ (X1 @ X10))) = $true) | ($true != ((X9 @ (X2 @ (X0 @ X10)))))) & ! [X11 : b] : ? [X12 : a] : ! [X13 : (b > $o)] : ((((X13 @ (X0 @ X12))) != $true) | (((X13 @ X11)) = $true)) & ? [X14 : b,X15 : (c > $o),X16 : b] : (($true != ((X15 @ (c_starc @ (X2 @ X14) @ (X2 @ X16))))) & ($true = ((X15 @ (X2 @ (c_starb @ X14 @ X16)))))))),
% 0.48/0.39 inference(rectify,[],[f6])).
% 0.48/0.39 thf(f8,plain,(
% 0.48/0.39 ! [X3 : (c > $o),X4 : a,X5 : a] : ((((X3 @ (c_starc @ (sK1 @ X4) @ (sK1 @ X5)))) = $true) | ($true != ((X3 @ (sK1 @ (c_stara @ X4 @ X5)))))) & ! [X6 : a,X7 : (b > $o),X8 : a] : ((((X7 @ (sK0 @ (c_stara @ X8 @ X6)))) != $true) | (((X7 @ (c_starb @ (sK0 @ X8) @ (sK0 @ X6)))) = $true)) & ! [X9 : (c > $o),X10 : a] : ((((X9 @ (sK1 @ X10))) = $true) | (((X9 @ (sK2 @ (sK0 @ X10)))) != $true)) & ! [X11 : b] : ! [X13 : (b > $o)] : ((((X13 @ (sK0 @ (sK3 @ X11)))) != $true) | (((X13 @ X11)) = $true)) & ((((sK5 @ (c_starc @ (sK2 @ sK4) @ (sK2 @ sK6)))) != $true) & (((sK5 @ (sK2 @ (c_starb @ sK4 @ sK6)))) = $true))),
% 0.48/0.39 inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,vAPP,sK4,sK5,sK6]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X12,sK3 @ X11),skolemize(X14,sK4),skolemize(X15,sK5),skolemize(X16,sK6)],[f7])).
% 0.48/0.39 thf(f9,plain,(
% 0.48/0.39 (((sK5 @ (sK2 @ (c_starb @ sK4 @ sK6)))) = $true)),
% 0.48/0.39 inference(cnf_transformation,[],[f8])).
% 0.48/0.39 thf(f10,plain,(
% 0.48/0.39 (((sK5 @ (c_starc @ (sK2 @ sK4) @ (sK2 @ sK6)))) != $true)),
% 0.48/0.39 inference(cnf_transformation,[],[f8])).
% 0.48/0.39 thf(f11,plain,(
% 0.48/0.39 ( ! [X11 : b,X13 : (b > $o)] : ((((X13 @ (sK0 @ (sK3 @ X11)))) != $true) | (((X13 @ X11)) = $true)) )),
% 0.48/0.39 inference(cnf_transformation,[],[f8])).
% 0.48/0.39 thf(f12,plain,(
% 0.48/0.39 ( ! [X10 : a,X9 : (c > $o)] : ((((X9 @ (sK2 @ (sK0 @ X10)))) != $true) | (((X9 @ (sK1 @ X10))) = $true)) )),
% 0.48/0.39 inference(cnf_transformation,[],[f8])).
% 0.48/0.39 thf(f13,plain,(
% 0.48/0.39 ( ! [X8 : a,X6 : a,X7 : (b > $o)] : ((((X7 @ (c_starb @ (sK0 @ X8) @ (sK0 @ X6)))) = $true) | (((X7 @ (sK0 @ (c_stara @ X8 @ X6)))) != $true)) )),
% 0.48/0.39 inference(cnf_transformation,[],[f8])).
% 0.48/0.39 thf(f14,plain,(
% 0.48/0.39 ( ! [X3 : (c > $o),X4 : a,X5 : a] : ((((X3 @ (c_starc @ (sK1 @ X4) @ (sK1 @ X5)))) = $true) | ($true != ((X3 @ (sK1 @ (c_stara @ X4 @ X5)))))) )),
% 0.48/0.39 inference(cnf_transformation,[],[f8])).
% 0.48/0.39 thf(f16,plain,(
% 0.48/0.39 ( ! [X0 : b] : ((((sK0 @ (sK3 @ X0))) = X0)) )),
% 0.48/0.39 inference(leibniz_equality_elimination,[],[f11])).
% 0.48/0.39 thf(f67,plain,(
% 0.48/0.39 ( ! [X0 : a] : ((((sK1 @ X0)) = ((sK2 @ (sK0 @ X0))))) )),
% 0.48/0.39 inference(leibniz_equality_elimination,[],[f12])).
% 0.48/0.39 thf(f80,plain,(
% 0.48/0.39 ( ! [X0 : b] : ((((sK1 @ (sK3 @ X0))) = ((sK2 @ X0)))) )),
% 0.48/0.39 inference(superposition,[],[f67,f16])).
% 0.48/0.39 thf(f83,plain,(
% 0.48/0.39 ( ! [X0 : a,X1 : a] : ((((sK0 @ (c_stara @ X0 @ X1))) = ((c_starb @ (sK0 @ X0) @ (sK0 @ X1))))) )),
% 0.48/0.39 inference(leibniz_equality_elimination,[],[f13])).
% 0.48/0.39 thf(f125,plain,(
% 0.48/0.39 ( ! [X0 : b,X1 : a] : ((((c_starb @ (sK0 @ X1) @ X0)) = ((sK0 @ (c_stara @ X1 @ (sK3 @ X0)))))) )),
% 0.48/0.39 inference(superposition,[],[f83,f16])).
% 0.48/0.39 thf(f128,plain,(
% 0.48/0.39 ( ! [X0 : a,X1 : a] : ((((c_starc @ (sK1 @ X0) @ (sK1 @ X1))) = ((sK1 @ (c_stara @ X0 @ X1))))) )),
% 0.48/0.39 inference(leibniz_equality_elimination,[],[f14])).
% 0.48/0.39 thf(f140,plain,(
% 0.48/0.39 ( ! [X0 : b,X1 : a] : ((((c_starc @ (sK1 @ X1) @ (sK2 @ X0))) = ((sK1 @ (c_stara @ X1 @ (sK3 @ X0)))))) )),
% 0.48/0.39 inference(superposition,[],[f128,f80])).
% 0.48/0.39 thf(f147,plain,(
% 0.48/0.39 ( ! [X0 : a,X1 : b] : ((((sK1 @ (c_stara @ X0 @ (sK3 @ X1)))) = ((sK2 @ (c_starb @ (sK0 @ X0) @ X1))))) )),
% 0.48/0.39 inference(superposition,[],[f67,f125])).
% 0.48/0.39 thf(f174,plain,(
% 0.48/0.39 ( ! [X0 : a,X1 : b] : ((((sK2 @ (c_starb @ (sK0 @ X0) @ X1))) = ((c_starc @ (sK1 @ X0) @ (sK2 @ X1))))) )),
% 0.48/0.39 inference(forward_demodulation,[],[f147,f140])).
% 0.48/0.39 thf(f177,plain,(
% 0.48/0.39 ( ! [X0 : b,X1 : b] : ((((sK2 @ (c_starb @ X0 @ X1))) = ((c_starc @ (sK1 @ (sK3 @ X0)) @ (sK2 @ X1))))) )),
% 0.48/0.39 inference(superposition,[],[f174,f16])).
% 0.48/0.39 thf(f182,plain,(
% 0.48/0.39 ( ! [X0 : b,X1 : b] : ((((c_starc @ (sK2 @ X0) @ (sK2 @ X1))) = ((sK2 @ (c_starb @ X0 @ X1))))) )),
% 0.48/0.39 inference(forward_demodulation,[],[f177,f80])).
% 0.48/0.39 thf(f191,plain,(
% 0.48/0.39 (((sK5 @ (sK2 @ (c_starb @ sK4 @ sK6)))) != $true)),
% 0.48/0.39 inference(superposition,[],[f10,f182])).
% 0.48/0.39 thf(f192,plain,(
% 0.48/0.39 $false),
% 0.48/0.39 inference(forward_subsumption_resolution,[],[f191,f9])).
% 0.48/0.39 % SZS output end Proof for theBenchmark
% 0.48/0.39 % (1495258)------------------------------
% 0.48/0.39 % (1495258)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.48/0.39 % (1495258)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.48/0.39 % (1495258)CaDiCaL version: 2.1.3
% 0.48/0.39 % (1495258)Termination reason: Refutation
% 0.48/0.39 % (1495258)Time elapsed: 0.018 s
% 0.48/0.39 % (1495258)Peak memory usage: 12 MB
% 0.48/0.39 % (1495258)Instructions burned: 18 (million)
% 0.48/0.39 % (1495249)Success in time 0.057 s
% 0.48/0.39 % Vampire exiting
%------------------------------------------------------------------------------