%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : PUZ081^1 : TPTP v9.3.1. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n014.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:21:00 AM UTC 2026
% Result : Theorem 0.07s 0.26s
% Output : Refutation 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : PUZ081^1 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.18 % Computer : n014.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.18 % WCLimit : 300
% 0.07/0.18 % DateTime : Tue Sep 29 13:21:30 UTC 2026
% 0.07/0.18 % CPUTime :
% 0.07/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.07/0.26 % (2636476)Will run a generic schedule for satisfiability detection.
% 0.07/0.26 % (2636485)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4218692476:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.07/0.26 % (2636485)WARNING: Not using 'newcnf' as currently not compatible with higher-order inputs.
% 0.07/0.26 % (2636485) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2636476-2636485"...
% 0.07/0.26 % (2636482)% WARNING: option uhcvi not known.
% 0.07/0.26 % (2636485)...printing done.
% 0.07/0.26 % (2636485)Refutation found. Thanks to Tanya!
% 0.07/0.26 % SZS status Theorem for theBenchmark
% 0.07/0.26 % SZS output start Proof for theBenchmark
% 0.07/0.26 thf(type_def_5, type, sTfun: ($tType * $tType) > $tType).
% 0.07/0.26 thf(func_def_3, type, says: ($i > $o > $o)).
% 0.07/0.26 thf(func_def_6, type, is_a: ($i > $i > $o)).
% 0.07/0.26 thf(func_def_10, type, vNOT: ($o > $o)).
% 0.07/0.26 thf(func_def_11, type, vOR: ($o > $o > $o)).
% 0.07/0.26 thf(f1,axiom,(
% 0.07/0.26 ! [X0 : $i] : ((is_a @ X0 @ islander) => ((is_a @ X0 @ knave) | (is_a @ X0 @ knight)))),
% 0.07/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kk_6_1)).
% 0.07/0.26 thf(f2,axiom,(
% 0.07/0.26 ! [X0 : $i] : ((is_a @ X0 @ knight) => ! [X1 : $o] : ((says @ X0 @ X1) => X1))),
% 0.22/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kk_6_2)).
% 0.22/0.26 thf(f4,axiom,(
% 0.22/0.26 (is_a @ mel @ islander) & (is_a @ zoey @ islander)),
% 0.22/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kk_6_4)).
% 0.22/0.26 thf(f5,axiom,(
% 0.22/0.26 (says @ zoey @ (is_a @ mel @ knave))),
% 0.22/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kk_6_5)).
% 0.22/0.26 thf(f6,axiom,(
% 0.22/0.26 (says @ mel @ ~((is_a @ mel @ knave) | (is_a @ zoey @ knave)))),
% 0.22/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kk_6_6)).
% 0.22/0.26 thf(f7,conjecture,(
% 0.22/0.26 ? [X0 : $i,X1 : $i] : ((is_a @ zoey @ X1) & (is_a @ mel @ X0) & ((X1 = knight) <~> (X1 = knave)) & ((X0 = knight) <~> (X0 = knave)))),
% 0.22/0.26 file('/export/starexec/sandbox/benchmark/theBenchmark.p',query)).
% 0.22/0.26 thf(f8,negated_conjecture,(
% 0.22/0.26 ~ ? [X0 : $i,X1 : $i] : ((is_a @ zoey @ X1) & (is_a @ mel @ X0) & ((X1 = knight) <~> (X1 = knave)) & ((X0 = knight) <~> (X0 = knave)))),
% 0.22/0.26 inference(negated_conjecture,[status(cth)],[f7])).
% 0.22/0.26 thf(f9,plain,(
% 0.22/0.26 ! [X0 : $i] : ((is_a @ X0 @ islander) => ((is_a @ X0 @ knave) | (is_a @ X0 @ knight)))),
% 0.22/0.26 inference(rectify,[],[f1])).
% 0.22/0.26 thf(f10,plain,(
% 0.22/0.26 ! [X0 : $i] : ((((is_a @ X0 @ islander)) = $true) => ((((is_a @ X0 @ knave)) = $true) | (((is_a @ X0 @ knight)) = $true)))),
% 0.22/0.26 inference(fool_elimination,[],[f9])).
% 0.22/0.26 thf(f11,plain,(
% 0.22/0.26 ! [X0 : $i] : ((is_a @ X0 @ knight) => ! [X1 : $o] : ((says @ X0 @ X1) => X1))),
% 0.22/0.26 inference(rectify,[],[f2])).
% 0.22/0.26 thf(f12,plain,(
% 0.22/0.26 ! [X0 : $i] : ((((is_a @ X0 @ knight)) = $true) => ! [X1 : $o] : ((((says @ X0 @ X1)) = $true) => ($true = X1)))),
% 0.22/0.26 inference(fool_elimination,[],[f11])).
% 0.22/0.26 thf(f15,plain,(
% 0.22/0.26 (is_a @ mel @ islander) & (is_a @ zoey @ islander)),
% 0.22/0.26 inference(rectify,[],[f4])).
% 0.22/0.26 thf(f16,plain,(
% 0.22/0.26 (((is_a @ mel @ islander)) = $true) & (((is_a @ zoey @ islander)) = $true)),
% 0.22/0.26 inference(fool_elimination,[],[f15])).
% 0.22/0.26 thf(f17,plain,(
% 0.22/0.26 (says @ zoey @ (is_a @ mel @ knave))),
% 0.22/0.26 inference(rectify,[],[f5])).
% 0.22/0.26 thf(f18,plain,(
% 0.22/0.26 (((says @ zoey @ (is_a @ mel @ knave))) = $true)),
% 0.22/0.26 inference(fool_elimination,[],[f17])).
% 0.22/0.26 thf(f19,plain,(
% 0.22/0.26 (says @ mel @ ~((is_a @ mel @ knave) | (is_a @ zoey @ knave)))),
% 0.22/0.26 inference(rectify,[],[f6])).
% 0.22/0.26 thf(f20,plain,(
% 0.22/0.26 ($true = ((says @ mel @ (~ ((is_a @ zoey @ knave) | (is_a @ mel @ knave))))))),
% 0.22/0.26 inference(fool_elimination,[],[f19])).
% 0.22/0.26 thf(f21,plain,(
% 0.22/0.26 ~ ? [X0 : $i,X1 : $i] : ((is_a @ zoey @ X1) & (is_a @ mel @ X0) & ((X1 = knight) <~> (X1 = knave)) & ((X0 = knight) <~> (X0 = knave)))),
% 0.22/0.26 inference(rectify,[],[f8])).
% 0.22/0.26 thf(f22,plain,(
% 0.22/0.26 ~ ? [X0 : $i,X1 : $i] : ((((is_a @ zoey @ X1)) = $true) & (((is_a @ mel @ X0)) = $true) & ((knight = X1) <~> (knave = X1)) & ((knight = X0) <~> (knave = X0)))),
% 0.22/0.26 inference(fool_elimination,[],[f21])).
% 0.22/0.26 thf(f24,plain,(
% 0.22/0.26 ! [X0 : $i] : (((((is_a @ X0 @ knave)) = $true) | (((is_a @ X0 @ knight)) = $true)) | (((is_a @ X0 @ islander)) != $true))),
% 0.22/0.26 inference(ennf_transformation,[],[f10])).
% 0.22/0.26 thf(f25,plain,(
% 0.22/0.26 ! [X0 : $i] : ((((is_a @ X0 @ knave)) = $true) | (((is_a @ X0 @ knight)) = $true) | (((is_a @ X0 @ islander)) != $true))),
% 0.22/0.26 inference(flattening,[],[f24])).
% 0.22/0.26 thf(f26,plain,(
% 0.22/0.26 ! [X0 : $i] : (! [X1 : $o] : (($true = X1) | (((says @ X0 @ X1)) != $true)) | (((is_a @ X0 @ knight)) != $true))),
% 0.22/0.26 inference(ennf_transformation,[],[f12])).
% 0.22/0.26 thf(f28,plain,(
% 0.22/0.26 ! [X0 : $i,X1 : $i] : ((((is_a @ zoey @ X1)) != $true) | (((is_a @ mel @ X0)) != $true) | ((knight = X1) <=> (knave = X1)) | ((knight = X0) <=> (knave = X0)))),
% 0.22/0.26 inference(ennf_transformation,[],[f22])).
% 0.22/0.26 thf(f29,plain,(
% 0.22/0.26 ! [X0 : $i,X1 : $i] : ((((is_a @ zoey @ X1)) != $true) | (((is_a @ mel @ X0)) != $true) | (((knight = X1) | (knave != X1)) & ((knave = X1) | (knight != X1))) | (((knight = X0) | (knave != X0)) & ((knave = X0) | (knight != X0))))),
% 0.22/0.26 inference(nnf_transformation,[],[f28])).
% 0.22/0.26 thf(f30,plain,(
% 0.22/0.26 ( ! [X0 : $i] : ((((is_a @ X0 @ islander)) != $true) | (((is_a @ X0 @ knight)) = $true) | (((is_a @ X0 @ knave)) = $true)) )),
% 0.22/0.26 inference(cnf_transformation,[],[f25])).
% 0.22/0.26 thf(f31,plain,(
% 0.22/0.26 ( ! [X0 : $i,X1 : $o] : ((((says @ X0 @ X1)) != $true) | ($true = X1) | (((is_a @ X0 @ knight)) != $true)) )),
% 0.22/0.26 inference(cnf_transformation,[],[f26])).
% 0.22/0.26 thf(f33,plain,(
% 0.22/0.26 (((is_a @ zoey @ islander)) = $true)),
% 0.22/0.26 inference(cnf_transformation,[],[f16])).
% 0.22/0.26 thf(f34,plain,(
% 0.22/0.26 (((is_a @ mel @ islander)) = $true)),
% 0.22/0.26 inference(cnf_transformation,[],[f16])).
% 0.22/0.26 thf(f35,plain,(
% 0.22/0.26 (((says @ zoey @ (is_a @ mel @ knave))) = $true)),
% 0.22/0.26 inference(cnf_transformation,[],[f18])).
% 0.22/0.26 thf(f36,plain,(
% 0.22/0.26 ($true = ((says @ mel @ (~ ((is_a @ zoey @ knave) | (is_a @ mel @ knave))))))),
% 0.22/0.26 inference(cnf_transformation,[],[f20])).
% 0.22/0.26 thf(f38,plain,(
% 0.22/0.26 ( ! [X0 : $i,X1 : $i] : ((((is_a @ zoey @ X1)) != $true) | (((is_a @ mel @ X0)) != $true) | (knave = X1) | (knight != X1) | (knight = X0) | (knave != X0)) )),
% 0.22/0.26 inference(cnf_transformation,[],[f29])).
% 0.22/0.26 thf(f39,plain,(
% 0.22/0.26 ( ! [X0 : $i,X1 : $i] : ((((is_a @ zoey @ X1)) != $true) | (((is_a @ mel @ X0)) != $true) | (knight = X1) | (knave != X1) | (knave = X0) | (knight != X0)) )),
% 0.22/0.26 inference(cnf_transformation,[],[f29])).
% 0.22/0.26 thf(f40,plain,(
% 0.22/0.26 ( ! [X0 : $i,X1 : $i] : ((((is_a @ zoey @ X1)) != $true) | (((is_a @ mel @ X0)) != $true) | (knight = X1) | (knave != X1) | (knight = X0) | (knave != X0)) )),
% 0.22/0.26 inference(cnf_transformation,[],[f29])).
% 0.22/0.26 thf(f42,definition,(
% 0.22/0.26 ( ! [X0 : $o] : (($true = X0) | ($false = X0)) )),
% 0.22/0.26 introduced(theory,[fool_exhaustiveness_axiom])).
% 0.22/0.26 thf(f44,plain,(
% 0.22/0.26 ( ! [X0 : $i] : ((((is_a @ zoey @ knave)) != $true) | (((is_a @ mel @ X0)) != $true) | (knight = knave) | (knight = X0) | (knave != X0)) )),
% 0.22/0.26 inference(equality_resolution,[],[f40])).
% 0.22/0.26 thf(f45,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) != $true) | (((is_a @ mel @ knave)) != $true) | (knight = knave) | (knight = knave)),
% 0.22/0.26 inference(equality_resolution,[],[f44])).
% 0.22/0.26 thf(f46,plain,(
% 0.22/0.26 ( ! [X0 : $i] : ((((is_a @ zoey @ knave)) != $true) | (((is_a @ mel @ X0)) != $true) | (knight = knave) | (knave = X0) | (knight != X0)) )),
% 0.22/0.26 inference(equality_resolution,[],[f39])).
% 0.22/0.26 thf(f47,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) != $true) | ($true != ((is_a @ mel @ knight))) | (knight = knave) | (knight = knave)),
% 0.22/0.26 inference(equality_resolution,[],[f46])).
% 0.22/0.26 thf(f48,plain,(
% 0.22/0.26 ( ! [X0 : $i] : (($true != ((is_a @ zoey @ knight))) | (((is_a @ mel @ X0)) != $true) | (knight = knave) | (knight = X0) | (knave != X0)) )),
% 0.22/0.26 inference(equality_resolution,[],[f38])).
% 0.22/0.26 thf(f49,plain,(
% 0.22/0.26 ($true != ((is_a @ zoey @ knight))) | (((is_a @ mel @ knave)) != $true) | (knight = knave) | (knight = knave)),
% 0.22/0.26 inference(equality_resolution,[],[f48])).
% 0.22/0.26 thf(f53,plain,(
% 0.22/0.26 ($true != ((is_a @ zoey @ knight))) | (((is_a @ mel @ knave)) != $true) | (knight = knave)),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f49])).
% 0.22/0.26 thf(f54,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) != $true) | ($true != ((is_a @ mel @ knight))) | (knight = knave)),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f47])).
% 0.22/0.26 thf(f55,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) != $true) | (((is_a @ mel @ knave)) != $true) | (knight = knave)),
% 0.22/0.26 inference(duplicate_literal_removal,[],[f45])).
% 0.22/0.26 thf(f57,definition,(
% 0.22/0.26 spl0_1 <=> (knight = knave)),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition])).
% 0.22/0.26 thf(f59,plain,(
% 0.22/0.26 (knight = knave) | ~spl0_1),
% 0.22/0.26 inference(avatar_component_clause,[],[f57])).
% 0.22/0.26 thf(f61,definition,(
% 0.22/0.26 spl0_2 <=> ($true = ((is_a @ mel @ knight)))),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition])).
% 0.22/0.26 thf(f63,plain,(
% 0.22/0.26 ($true != ((is_a @ mel @ knight))) | spl0_2),
% 0.22/0.26 inference(avatar_component_clause,[],[f61])).
% 0.22/0.26 thf(f65,definition,(
% 0.22/0.26 spl0_3 <=> ($true = ((is_a @ zoey @ knight)))),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition])).
% 0.22/0.26 thf(f67,plain,(
% 0.22/0.26 ($true != ((is_a @ zoey @ knight))) | spl0_3),
% 0.22/0.26 inference(avatar_component_clause,[],[f65])).
% 0.22/0.26 thf(f70,definition,(
% 0.22/0.26 spl0_4 <=> (((is_a @ mel @ knave)) = $true)),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition])).
% 0.22/0.26 thf(f71,plain,(
% 0.22/0.26 (((is_a @ mel @ knave)) = $true) | ~spl0_4),
% 0.22/0.26 inference(avatar_component_clause,[],[f70])).
% 0.22/0.26 thf(f72,plain,(
% 0.22/0.26 (((is_a @ mel @ knave)) != $true) | spl0_4),
% 0.22/0.26 inference(avatar_component_clause,[],[f70])).
% 0.22/0.26 thf(f73,plain,(
% 0.22/0.26 spl0_1 | ~spl0_4 | ~spl0_3),
% 0.22/0.26 inference(avatar_split_clause,[],[f53,f65,f70,f57])).
% 0.22/0.26 thf(f75,definition,(
% 0.22/0.26 spl0_5 <=> (((is_a @ zoey @ knave)) = $true)),
% 0.22/0.26 introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition])).
% 0.22/0.26 thf(f76,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) = $true) | ~spl0_5),
% 0.22/0.26 inference(avatar_component_clause,[],[f75])).
% 0.22/0.26 thf(f78,plain,(
% 0.22/0.26 spl0_1 | ~spl0_2 | ~spl0_5),
% 0.22/0.26 inference(avatar_split_clause,[],[f54,f75,f61,f57])).
% 0.22/0.26 thf(f79,plain,(
% 0.22/0.26 spl0_1 | ~spl0_4 | ~spl0_5),
% 0.22/0.26 inference(avatar_split_clause,[],[f55,f75,f70,f57])).
% 0.22/0.26 thf(f83,plain,(
% 0.22/0.26 ($true != $true) | (((is_a @ mel @ knave)) = $false) | spl0_4),
% 0.22/0.26 inference(constrained_superposition,[],[f72,f42])).
% 0.22/0.26 thf(f85,plain,(
% 0.22/0.26 (((is_a @ mel @ knave)) = $false) | spl0_4),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f83])).
% 0.22/0.26 thf(f98,plain,(
% 0.22/0.26 ($true = ((says @ zoey @ $false))) | spl0_4),
% 0.22/0.26 inference(constrained_superposition,[],[f35,f85])).
% 0.22/0.26 thf(f114,plain,(
% 0.22/0.26 ($true != $true) | ($true = $false) | ($true != ((is_a @ zoey @ knight))) | spl0_4),
% 0.22/0.26 inference(constrained_superposition,[],[f31,f98])).
% 0.22/0.26 thf(f115,plain,(
% 0.22/0.26 ($true != ((is_a @ zoey @ knight))) | spl0_4),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f114])).
% 0.22/0.26 thf(f118,plain,(
% 0.22/0.26 ~spl0_3 | spl0_4),
% 0.22/0.26 inference(avatar_split_clause,[],[f115,f70,f65])).
% 0.22/0.26 thf(f123,plain,(
% 0.22/0.26 ($true != $true) | ($true = ((is_a @ mel @ knight))) | (((is_a @ mel @ knave)) = $true)),
% 0.22/0.26 inference(constrained_superposition,[],[f30,f34])).
% 0.22/0.26 thf(f124,plain,(
% 0.22/0.26 ($true != $true) | ($true = ((is_a @ zoey @ knight))) | (((is_a @ zoey @ knave)) = $true)),
% 0.22/0.26 inference(constrained_superposition,[],[f30,f33])).
% 0.22/0.26 thf(f125,plain,(
% 0.22/0.26 ($true = ((is_a @ zoey @ knight))) | (((is_a @ zoey @ knave)) = $true)),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f124])).
% 0.22/0.26 thf(f126,plain,(
% 0.22/0.26 ($true = ((is_a @ mel @ knight))) | (((is_a @ mel @ knave)) = $true)),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f123])).
% 0.22/0.26 thf(f128,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) = $true) | spl0_3),
% 0.22/0.26 inference(forward_subsumption_resolution,[],[f125,f67])).
% 0.22/0.26 thf(f129,plain,(
% 0.22/0.26 (((is_a @ mel @ knave)) = $true) | spl0_2),
% 0.22/0.26 inference(forward_subsumption_resolution,[],[f126,f63])).
% 0.22/0.26 thf(f130,plain,(
% 0.22/0.26 spl0_5 | spl0_3),
% 0.22/0.26 inference(avatar_split_clause,[],[f128,f65,f75])).
% 0.22/0.26 thf(f131,plain,(
% 0.22/0.26 $false | (spl0_2 | spl0_4)),
% 0.22/0.26 inference(forward_subsumption_resolution,[],[f129,f72])).
% 0.22/0.26 thf(f132,plain,(
% 0.22/0.26 spl0_2 | spl0_4),
% 0.22/0.26 inference(avatar_contradiction_clause,[],[f131])).
% 0.22/0.26 thf(f135,plain,(
% 0.22/0.26 (((is_a @ zoey @ knave)) != $true) | (~spl0_1 | spl0_3)),
% 0.22/0.26 inference(constrained_superposition,[],[f67,f59])).
% 0.22/0.26 thf(f140,plain,(
% 0.22/0.26 $false | (~spl0_1 | spl0_3 | ~spl0_5)),
% 0.22/0.26 inference(forward_subsumption_resolution,[],[f135,f76])).
% 0.22/0.26 thf(f141,plain,(
% 0.22/0.26 ~spl0_1 | spl0_3 | ~spl0_5),
% 0.22/0.26 inference(avatar_contradiction_clause,[],[f140])).
% 0.22/0.26 thf(f151,plain,(
% 0.22/0.26 ($true != $true) | ($true = ((~ ((is_a @ zoey @ knave) | (is_a @ mel @ knave))))) | ($true != ((is_a @ mel @ knight)))),
% 0.22/0.26 inference(constrained_superposition,[],[f31,f36])).
% 0.22/0.26 thf(f152,plain,(
% 0.22/0.26 ($true != $true) | ((((is_a @ zoey @ knave) | (is_a @ mel @ knave))) = $false) | ($true != ((is_a @ mel @ knight)))),
% 0.22/0.26 inference(not_proxy_clausification,[],[f151])).
% 0.22/0.26 thf(f153,plain,(
% 0.22/0.26 ($true != $true) | (((is_a @ mel @ knave)) = $false) | ($true != ((is_a @ mel @ knight)))),
% 0.22/0.26 inference(or_proxy_clausification,[],[f152])).
% 0.22/0.26 thf(f156,plain,(
% 0.22/0.26 (((is_a @ mel @ knave)) = $false) | ($true != ((is_a @ mel @ knight)))),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f153])).
% 0.22/0.26 thf(f173,plain,(
% 0.22/0.26 ($true = $false) | ($true != ((is_a @ mel @ knight))) | ~spl0_4),
% 0.22/0.26 inference(forward_demodulation,[],[f156,f71])).
% 0.22/0.26 thf(f174,plain,(
% 0.22/0.26 ($true != ((is_a @ mel @ knight))) | ~spl0_4),
% 0.22/0.26 inference(trivial_inequality_removal,[],[f173])).
% 0.22/0.26 thf(f180,plain,(
% 0.22/0.26 (((is_a @ mel @ knave)) != $true) | (~spl0_1 | ~spl0_4)),
% 0.22/0.26 inference(forward_demodulation,[],[f174,f59])).
% 0.22/0.26 thf(f183,plain,(
% 0.22/0.26 $false | (~spl0_1 | ~spl0_4)),
% 0.22/0.26 inference(forward_subsumption_resolution,[],[f180,f71])).
% 0.22/0.26 thf(f184,plain,(
% 0.22/0.26 ~spl0_1 | ~spl0_4),
% 0.22/0.26 inference(avatar_contradiction_clause,[],[f183])).
% 0.22/0.26 cnf(s2, plain, spl0_1 | ~spl0_3 | ~spl0_4, inference(sat_conversion,[],[f73])).
% 0.22/0.26 cnf(s3, plain, spl0_1 | ~spl0_2 | ~spl0_5, inference(sat_conversion,[],[f78])).
% 0.22/0.26 cnf(s4, plain, spl0_1 | ~spl0_4 | ~spl0_5, inference(sat_conversion,[],[f79])).
% 0.22/0.26 cnf(s5, plain, ~spl0_3 | spl0_4, inference(sat_conversion,[],[f118])).
% 0.22/0.26 cnf(s7, plain, spl0_3 | spl0_5, inference(sat_conversion,[],[f130])).
% 0.22/0.26 cnf(s8, plain, spl0_2 | spl0_4, inference(sat_conversion,[],[f132])).
% 0.22/0.26 cnf(s10, plain, ~spl0_1 | spl0_3 | ~spl0_5, inference(sat_conversion,[],[f141])).
% 0.22/0.26 cnf(s12, plain, ~spl0_1 | ~spl0_4, inference(sat_conversion,[],[f184])).
% 0.22/0.26 cnf(s13, plain, ~spl0_4 | spl0_1, inference(rat,[],[s7,s2,s4])).
% 0.22/0.26 cnf(s14, plain, spl0_1, inference(rat,[],[s7,s3,s5,s8,s13])).
% 0.22/0.26 cnf(s15, plain, ~spl0_4, inference(rat,[],[s12,s14])).
% 0.22/0.26 cnf(s17, plain, ~spl0_3, inference(rat,[],[s5,s15])).
% 0.22/0.26 cnf(s18, plain, ~spl0_5, inference(rat,[],[s10,s14,s17])).
% 0.22/0.26 cnf(s19, plain, $false, inference(rat,[],[s7,s18,s17])).
% 0.22/0.26 thf(f185,plain,(
% 0.22/0.26 $false),
% 0.22/0.26 inference(avatar_sat_refutation,[],[s19])).
% 0.22/0.26 % SZS output end Proof for theBenchmark
% 0.22/0.26 % (2636485)------------------------------
% 0.22/0.26 % (2636485)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.22/0.26 % (2636485)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.22/0.26 % (2636485)CaDiCaL version: 2.1.3
% 0.22/0.26 % (2636485)Termination reason: Refutation
% 0.22/0.26 % (2636485)Time elapsed: 0.003 s
% 0.22/0.26 % (2636485)Peak memory usage: 12 MB
% 0.22/0.26 % (2636485)Instructions burned: 10 (million)
% 0.22/0.26 % (2636476)Success in time 0.036 s
% 0.22/0.26 % Vampire exiting
%------------------------------------------------------------------------------