%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : CSR145^1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 07:47:10 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.03 % Problem : CSR145^1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.20 % Computer : n016.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 18:01:50 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.22/0.30 % (698239)Detected a higher-order problem, will run a greedy HOL sequence.
% 0.22/0.30 % (698250)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 % (698250)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 % (698244)lrs+10_40_drc=off:e2e=on:si=on:uwa=one_side_interpreted:random_seed=3907943244:s2a=on:i=87:rtra=on:ntd=on_2999 on theBenchmark for (2999ds/87Mi)
% 0.22/0.30 % (698245)lrs+10_16_si=on:nwc=1.5:random_seed=268576017:i=18:kws=arity_squared:rtra=on:fe=abstraction:ntd=on_2999 on theBenchmark for (2999ds/18Mi)
% 0.22/0.30 % (698246)lrs+10_1_cnfonf=off:si=on:uwa=one_side_interpreted:random_seed=2662216848:i=3:rtra=on:inj=on:ntd=on_2999 on theBenchmark for (2999ds/3Mi)
% 0.22/0.30 % (698249)lrs+10_1_to=lpo:sil=128000:e2e=on:si=on:random_seed=2929388286:s2a=on:i=75:s2at=3:aac=none:bd=preordered:rtra=on:fe=abstraction_2999 on theBenchmark for (2999ds/75Mi)
% 0.22/0.30 % (698248)dis+21_4_fde=none:e2e=on:si=on:uwa=off:foolp=on:random_seed=4026884449:i=24:av=off:rtra=on_2999 on theBenchmark for (2999ds/24Mi)
% 0.22/0.30 % (698247)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=885787849: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 % (698250)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=2718838644:hsqr=1,8:i=157:s2at=5:add=on:nm=2:rtra=on_2999 on theBenchmark for (2999ds/157Mi)
% 0.22/0.30 % (698246)Refutation not found, incomplete strategy
% 0.22/0.30 % (698246)------------------------------
% 0.22/0.30 % (698246)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (698246)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (698246)CaDiCaL version: 2.1.3
% 0.22/0.30 % (698246)Termination reason: Refutation not found, incomplete strategy
% 0.22/0.30 % (698246)Time elapsed: 0.002 s
% 0.22/0.30 % (698246)Peak memory usage: 12 MB
% 0.22/0.30 % (698246)Instructions burned: 2 (million)
% 0.22/0.30 % (698246)------------------------------
% 0.22/0.30 % (698246)------------------------------
% 0.22/0.30 % (698250) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-698239-698250"...
% 0.22/0.30 % (698247) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-698239-698247"...
% 0.22/0.30 % (698250)...printing done.
% 0.22/0.30 % (698248) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-698239-698248"...
% 0.22/0.30 % (698250)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, num: $tType).
% 0.22/0.30 thf(type_def_6, type, sTfun: ($tType * $tType) > $tType).
% 0.22/0.30 thf(func_def_0, type, husband_THFTYPE_IiioI: ($i > $i > $o)).
% 0.22/0.30 thf(func_def_3, type, wife_THFTYPE_IiioI: ($i > $i > $o)).
% 0.22/0.30 thf(func_def_4, type, inverse_THFTYPE_IIiioIIiioIoI: (($i > $i > $o) > ($i > $i > $o) > $o)).
% 0.22/0.30 thf(func_def_6, type, vNOT: ($o > $o)).
% 0.22/0.30 thf(func_def_9, type, vLAM: !>[X0: $tType, X1: $tType]:((X1) > (X0 > X1))).
% 0.22/0.30 thf(func_def_10, type, vEQ: !>[X0: $tType]:((X0 > X0 > $o))).
% 0.22/0.30 thf(func_def_12, type, sF1: (($i > $i > $o) > $o)).
% 0.22/0.30 thf(func_def_13, type, sF2: (($i > $i > $o) > $o)).
% 0.22/0.30 thf(func_def_14, type, sF3: (($i > $i > $o) > $o)).
% 0.22/0.30 thf(func_def_15, type, db0: !>[X0: $tType]:(X0)).
% 0.22/0.30 thf(func_def_16, type, db1: !>[X0: $tType]:(X0)).
% 0.22/0.30 thf(func_def_17, type, sK4: (($i > $i > $o) > $i)).
% 0.22/0.30 thf(f1,axiom,(
% 0.22/0.30 (inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI)),
% 0.22/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax)).
% 0.22/0.30 thf(f2,axiom,(
% 0.22/0.30 ! [X1 : ($i > $i > $o),X0 : ($i > $i > $o)] : ((inverse_THFTYPE_IIiioIIiioIoI @ X1 @ X0) => ! [X2 : $i,X3 : $i] : ((X0 @ X3 @ X2) <=> (X1 @ X2 @ X3)))),
% 0.22/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_001)).
% 0.22/0.30 thf(f3,axiom,(
% 0.22/0.30 ? [X0 : $i] : (~ (husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X0))),
% 0.22/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_002)).
% 0.22/0.30 thf(f4,axiom,(
% 0.22/0.30 (wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)),
% 0.22/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_003)).
% 0.22/0.30 thf(f5,conjecture,(
% 0.22/0.30 ? [X0 : ($i > $i > $o)] : ((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i) & (~ ((^[X1 : $i, X2 : $i] : ($true)) = X0)))),
% 0.22/0.30 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',con)).
% 0.22/0.30 thf(f6,negated_conjecture,(
% 0.22/0.30 ~ ? [X0 : ($i > $i > $o)] : ((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i) & (~ ((^[X1 : $i, X2 : $i] : ($true)) = X0)))),
% 0.22/0.30 inference(negated_conjecture,[status(cth)],[f5])).
% 0.22/0.30 thf(f7,plain,(
% 0.22/0.30 (inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI)),
% 0.22/0.30 inference(rectify,[],[f1])).
% 0.22/0.30 thf(f8,plain,(
% 0.22/0.30 (((inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI)) = $true)),
% 0.22/0.30 inference(fool_elimination,[],[f7])).
% 0.22/0.30 thf(f9,plain,(
% 0.22/0.30 ? [X0 : $i] : (~ (husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X0))),
% 0.22/0.30 inference(rectify,[],[f3])).
% 0.22/0.30 thf(f10,plain,(
% 0.22/0.30 ? [X0 : $i] : (((~ (husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ X0))) = $true)),
% 0.22/0.30 inference(fool_elimination,[],[f9])).
% 0.22/0.30 thf(f11,plain,(
% 0.22/0.30 (wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)),
% 0.22/0.30 inference(rectify,[],[f4])).
% 0.22/0.30 thf(f12,plain,(
% 0.22/0.30 (((wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)) = $true)),
% 0.22/0.30 inference(fool_elimination,[],[f11])).
% 0.22/0.30 thf(f13,plain,(
% 0.22/0.30 ~ ? [X0 : ($i > $i > $o)] : ((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i) & (~ ((^[X1 : $i, X2 : $i] : ($true)) = X0)))),
% 0.22/0.30 inference(rectify,[],[f6])).
% 0.22/0.30 thf(f14,plain,(
% 0.22/0.30 ~ ? [X0 : ($i > $i > $o)] : ((((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i)) = $true) & ($true = ((~ ((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) = X0)))))),
% 0.22/0.30 inference(fool_elimination,[],[f13])).
% 0.22/0.30 thf(f15,plain,(
% 0.22/0.30 ! [X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : ((inverse_THFTYPE_IIiioIIiioIoI @ X0 @ X1) => ! [X2 : $i,X3 : $i] : ((X1 @ X3 @ X2) <=> (X0 @ X2 @ X3)))),
% 0.22/0.30 inference(rectify,[],[f2])).
% 0.22/0.30 thf(f16,plain,(
% 0.22/0.30 ! [X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : (($true = ((inverse_THFTYPE_IIiioIIiioIoI @ X0 @ X1))) => ! [X2 : $i,X3 : $i] : (((X0 @ X2 @ X3)) = ((X1 @ X3 @ X2))))),
% 0.22/0.30 inference(fool_elimination,[],[f15])).
% 0.22/0.30 thf(f17,plain,(
% 0.22/0.30 ! [X0 : ($i > $i > $o)] : ((((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i)) != $true) | ($true != ((~ ((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) = X0)))))),
% 0.22/0.30 inference(ennf_transformation,[],[f14])).
% 0.22/0.30 thf(f18,plain,(
% 0.22/0.30 ! [X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : (($true != ((inverse_THFTYPE_IIiioIIiioIoI @ X0 @ X1))) | ! [X2 : $i,X3 : $i] : (((X0 @ X2 @ X3)) = ((X1 @ X3 @ X2))))),
% 0.22/0.30 inference(ennf_transformation,[],[f16])).
% 0.22/0.30 thf(f19,plain,(
% 0.22/0.30 ($true = ((~ (husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ sK0))))),
% 0.22/0.30 inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10])).
% 0.22/0.30 thf(f20,plain,(
% 0.22/0.30 (((inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI)) = $true)),
% 0.22/0.30 inference(cnf_transformation,[],[f8])).
% 0.22/0.30 thf(f21,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i)) != $true) | ($true != ((~ ((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) = X0))))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f17])).
% 0.22/0.30 thf(f22,plain,(
% 0.22/0.30 ( ! [X2 : $i,X3 : $i,X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : ((((X0 @ X2 @ X3)) = ((X1 @ X3 @ X2))) | ($true != ((inverse_THFTYPE_IIiioIIiioIoI @ X0 @ X1)))) )),
% 0.22/0.30 inference(cnf_transformation,[],[f18])).
% 0.22/0.30 thf(f23,plain,(
% 0.22/0.30 (((wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)) = $true)),
% 0.22/0.30 inference(cnf_transformation,[],[f12])).
% 0.22/0.30 thf(f24,plain,(
% 0.22/0.30 ($true = ((~ (husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ sK0))))),
% 0.22/0.30 inference(cnf_transformation,[],[f19])).
% 0.22/0.30 thf(f26,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(f27,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF1 @ X0)) = ((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF1])],[function_definition])).
% 0.22/0.30 thf(f28,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i)) = ((sF1 @ X0)))) )),
% 0.22/0.30 inference(reorient_equations,[],[f27])).
% 0.22/0.30 thf(f29,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF2 @ X0)) = (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) = X0)))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF2])],[function_definition])).
% 0.22/0.30 thf(f30,definition,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF3 @ X0)) = ((~ (sF2 @ X0))))) )),
% 0.22/0.30 introduced(definition,[new_symbols(definition,[sF3])],[function_definition])).
% 0.22/0.30 thf(f31,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF3 @ X0)) != $true) | (((sF1 @ X0)) != $true)) )),
% 0.22/0.30 inference(definition_folding,[],[f21,f30,f29,f28])).
% 0.22/0.30 thf(f32,plain,(
% 0.22/0.30 ($false = ((husband_THFTYPE_IiioI @ lChris_THFTYPE_i @ sK0)))),
% 0.22/0.30 inference(not_proxy_clausification,[],[f24])).
% 0.22/0.30 thf(f34,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((X0 @ lChris_THFTYPE_i @ lCorina_THFTYPE_i)) = $false) | (((sF1 @ X0)) = $true)) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f28])).
% 0.22/0.30 thf(f35,plain,(
% 0.22/0.30 ( ! [X2 : $i,X3 : $i,X0 : ($i > $i > $o),X1 : ($i > $i > $o)] : (($true != ((inverse_THFTYPE_IIiioIIiioIoI @ X0 @ X1))) | ($false = ((X1 @ X3 @ X2))) | ($true = ((X0 @ X2 @ X3)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f22])).
% 0.22/0.30 thf(f38,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF2 @ X0)) = $false) | ($true = (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) = X0)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f29])).
% 0.22/0.30 thf(f39,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) = X0) | (((sF2 @ X0)) = $false)) )),
% 0.22/0.30 inference(equality_proxy_clausification,[],[f38])).
% 0.22/0.30 thf(f41,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF3 @ X0)) = $true) | ($false = ((~ (sF2 @ X0))))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f30])).
% 0.22/0.30 thf(f44,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF3 @ X0)) = $true) | (((sF2 @ X0)) = $true)) )),
% 0.22/0.30 inference(not_proxy_clausification,[],[f41])).
% 0.22/0.30 thf(f47,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF1 @ X0)) != $true) | ($true != $true) | (((sF3 @ X0)) = $false)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f31,f26])).
% 0.22/0.30 thf(f49,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF3 @ X0)) = $false) | (((sF1 @ X0)) != $true)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f47])).
% 0.22/0.30 thf(f64,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : (($true = $false) | (((sF2 @ X0)) = $true) | (((sF1 @ X0)) != $true)) )),
% 0.22/0.30 inference(constrained_superposition,[],[f44,f49])).
% 0.22/0.30 thf(f68,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o)] : ((((sF2 @ X0)) = $true) | (((sF1 @ X0)) != $true)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f64])).
% 0.22/0.30 thf(f79,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o),X1 : $i] : ((((X0 @ X1)) = (((^[Y0 : $i]: ((^[Y1 : $i]: ($true)))) @ X1))) | (((sF2 @ X0)) = $false)) )),
% 0.22/0.30 inference(argument_congruence,[],[f39])).
% 0.22/0.30 thf(f81,plain,(
% 0.22/0.30 ( ! [X0 : ($i > $i > $o),X1 : $i] : (((^[Y0 : $i]: ($true)) = ((X0 @ X1))) | (((sF2 @ X0)) = $false)) )),
% 0.22/0.30 inference(beta-eta_normalization,[],[f79])).
% 0.22/0.30 thf(f82,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : ((((sF2 @ X0)) = $false) | ((((^[Y0 : $i]: ($true)) @ X2)) = ((X0 @ X1 @ X2)))) )),
% 0.22/0.30 inference(argument_congruence,[],[f81])).
% 0.22/0.30 thf(f84,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (((((^[Y0 : $i]: ($true)) @ X2)) = $false) | (((sF2 @ X0)) = $false) | ($true = ((X0 @ X1 @ X2)))) )),
% 0.22/0.30 inference(iff_proxy_clausification,[],[f82])).
% 0.22/0.30 thf(f85,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true = ((X0 @ X1 @ X2))) | ($true = $false) | (((sF2 @ X0)) = $false)) )),
% 0.22/0.30 inference(beta-eta_normalization,[],[f84])).
% 0.22/0.30 thf(f86,plain,(
% 0.22/0.30 ( ! [X2 : $i,X0 : ($i > $i > $o),X1 : $i] : (($true = ((X0 @ X1 @ X2))) | (((sF2 @ X0)) = $false)) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f85])).
% 0.22/0.30 thf(f91,plain,(
% 0.22/0.30 (((sF2 @ husband_THFTYPE_IiioI)) = $false) | ($true = $false)),
% 0.22/0.30 inference(constrained_superposition,[],[f32,f86])).
% 0.22/0.30 thf(f93,plain,(
% 0.22/0.30 (((sF2 @ husband_THFTYPE_IiioI)) = $false)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f91])).
% 0.22/0.30 thf(f98,plain,(
% 0.22/0.30 ($true != ((sF1 @ husband_THFTYPE_IiioI))) | ($true = $false)),
% 0.22/0.30 inference(constrained_superposition,[],[f68,f93])).
% 0.22/0.30 thf(f100,plain,(
% 0.22/0.30 ($true != ((sF1 @ husband_THFTYPE_IiioI)))),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f98])).
% 0.22/0.30 thf(f123,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : (($false = ((wife_THFTYPE_IiioI @ X0 @ X1))) | ($true != $true) | ($true = ((husband_THFTYPE_IiioI @ X1 @ X0)))) )),
% 0.22/0.30 inference(constrained_superposition,[],[f35,f20])).
% 0.22/0.30 thf(f125,plain,(
% 0.22/0.30 ( ! [X0 : $i,X1 : $i] : (($true = ((husband_THFTYPE_IiioI @ X1 @ X0))) | ($false = ((wife_THFTYPE_IiioI @ X0 @ X1)))) )),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f123])).
% 0.22/0.30 thf(f127,plain,(
% 0.22/0.30 (((wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)) = $false) | ($true = $false) | ($true = ((sF1 @ husband_THFTYPE_IiioI)))),
% 0.22/0.30 inference(constrained_superposition,[],[f125,f34])).
% 0.22/0.30 thf(f131,plain,(
% 0.22/0.30 ($true = ((sF1 @ husband_THFTYPE_IiioI))) | (((wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)) = $false)),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f127])).
% 0.22/0.30 thf(f135,plain,(
% 0.22/0.30 (((wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i)) = $false)),
% 0.22/0.30 inference(forward_subsumption_resolution,[],[f131,f100])).
% 0.22/0.30 thf(f137,plain,(
% 0.22/0.30 ($true = $false)),
% 0.22/0.30 inference(forward_demodulation,[],[f135,f23])).
% 0.22/0.30 thf(f138,plain,(
% 0.22/0.30 $false),
% 0.22/0.30 inference(trivial_inequality_removal,[],[f137])).
% 0.22/0.30 % SZS output end Proof for theBenchmark
% 0.22/0.30 % (698250)------------------------------
% 0.22/0.30 % (698250)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.30 % (698250)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.30 % (698250)CaDiCaL version: 2.1.3
% 0.22/0.30 % (698250)Termination reason: Refutation
% 0.22/0.30 % (698250)Time elapsed: 0.006 s
% 0.22/0.30 % (698250)Peak memory usage: 12 MB
% 0.22/0.30 % (698250)Instructions burned: 9 (million)
% 0.22/0.30 % (698239)Success in time 0.039 s
% 0.22/0.30 % Vampire exiting
%------------------------------------------------------------------------------