TSTP Solution File: PUZ081^1 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : PUZ081^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n028.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:28:28 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : PUZ081^1 : TPTP v8.2.0. Released v3.6.0.
% 0.08/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.35 % Computer : n028.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 11:23:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.37 % (21098)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.13/0.37 % (21096)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (21091)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.13/0.37 % (21097)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.13/0.37 % (21094)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.13/0.37 % (21093)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.13/0.37 % (21095)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.13/0.37 % (21096)Instruction limit reached!
% 0.13/0.37 % (21096)------------------------------
% 0.13/0.37 % (21096)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21096)Termination reason: Unknown
% 0.13/0.37 % (21096)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21096)Memory used [KB]: 1023
% 0.13/0.37 % (21096)Time elapsed: 0.003 s
% 0.13/0.37 % (21096)Instructions burned: 3 (million)
% 0.13/0.37 % (21096)------------------------------
% 0.13/0.37 % (21096)------------------------------
% 0.13/0.37 % (21099)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.13/0.37 % (21095)Instruction limit reached!
% 0.13/0.37 % (21095)------------------------------
% 0.13/0.37 % (21095)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21095)Termination reason: Unknown
% 0.13/0.37 % (21095)Termination phase: Property scanning
% 0.13/0.37
% 0.13/0.37 % (21095)Memory used [KB]: 895
% 0.13/0.37 % (21095)Time elapsed: 0.003 s
% 0.13/0.37 % (21095)Instructions burned: 2 (million)
% 0.13/0.37 % (21095)------------------------------
% 0.13/0.37 % (21095)------------------------------
% 0.13/0.37 % (21097)Refutation not found, incomplete strategy
% 0.13/0.37 % (21097)------------------------------
% 0.13/0.37 % (21097)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21097)Termination reason: Refutation not found, incomplete strategy
% 0.13/0.37
% 0.13/0.37
% 0.13/0.37 % (21097)Memory used [KB]: 5500
% 0.13/0.37 % (21097)Time elapsed: 0.003 s
% 0.13/0.37 % (21097)Instructions burned: 3 (million)
% 0.13/0.37 % (21097)------------------------------
% 0.13/0.37 % (21097)------------------------------
% 0.13/0.37 % (21093)Instruction limit reached!
% 0.13/0.37 % (21093)------------------------------
% 0.13/0.37 % (21093)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21093)Termination reason: Unknown
% 0.13/0.37 % (21093)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21093)Memory used [KB]: 5500
% 0.13/0.37 % (21093)Time elapsed: 0.004 s
% 0.13/0.37 % (21093)Instructions burned: 4 (million)
% 0.13/0.37 % (21093)------------------------------
% 0.13/0.37 % (21093)------------------------------
% 0.13/0.37 % (21099)Instruction limit reached!
% 0.13/0.37 % (21099)------------------------------
% 0.13/0.37 % (21099)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (21099)Termination reason: Unknown
% 0.13/0.37 % (21099)Termination phase: Saturation
% 0.13/0.37
% 0.13/0.37 % (21099)Memory used [KB]: 5500
% 0.13/0.37 % (21099)Time elapsed: 0.003 s
% 0.13/0.37 % (21099)Instructions burned: 3 (million)
% 0.13/0.37 % (21099)------------------------------
% 0.13/0.37 % (21099)------------------------------
% 0.13/0.37 % (21098)First to succeed.
% 0.13/0.37 % (21091)Also succeeded, but the first one will report.
% 0.13/0.37 % (21094)Also succeeded, but the first one will report.
% 0.13/0.37 % (21098)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37 thf(func_def_3, type, says: $i > $o > $o).
% 0.13/0.37 thf(func_def_6, type, is_a: $i > $i > $o).
% 0.13/0.37 thf(func_def_13, type, ph1: !>[X0: $tType]:(X0)).
% 0.13/0.37 thf(f117,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(avatar_sat_refutation,[],[f72,f77,f78,f88,f93,f102,f110,f116])).
% 0.13/0.37 thf(f116,plain,(
% 0.13/0.37 ~spl0_1 | spl0_3 | ~spl0_4),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f115])).
% 0.13/0.37 thf(f115,plain,(
% 0.13/0.37 $false | (~spl0_1 | spl0_3 | ~spl0_4)),
% 0.13/0.37 inference(subsumption_resolution,[],[f114,f66])).
% 0.13/0.37 thf(f66,plain,(
% 0.13/0.37 ((is_a @ zoey @ knave) != $true) | spl0_3),
% 0.13/0.37 inference(avatar_component_clause,[],[f64])).
% 0.13/0.37 thf(f64,plain,(
% 0.13/0.37 spl0_3 <=> ((is_a @ zoey @ knave) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_3])])).
% 0.13/0.37 thf(f114,plain,(
% 0.13/0.37 ((is_a @ zoey @ knave) = $true) | (~spl0_1 | ~spl0_4)),
% 0.13/0.37 inference(forward_demodulation,[],[f70,f58])).
% 0.13/0.37 thf(f58,plain,(
% 0.13/0.37 (knight = knave) | ~spl0_1),
% 0.13/0.37 inference(avatar_component_clause,[],[f56])).
% 0.13/0.37 thf(f56,plain,(
% 0.13/0.37 spl0_1 <=> (knight = knave)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_1])])).
% 0.13/0.37 thf(f70,plain,(
% 0.13/0.37 ((is_a @ zoey @ knight) = $true) | ~spl0_4),
% 0.13/0.37 inference(avatar_component_clause,[],[f69])).
% 0.13/0.37 thf(f69,plain,(
% 0.13/0.37 spl0_4 <=> ((is_a @ zoey @ knight) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_4])])).
% 0.13/0.37 thf(f110,plain,(
% 0.13/0.37 ~spl0_2 | ~spl0_3),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f109])).
% 0.13/0.37 thf(f109,plain,(
% 0.13/0.37 $false | (~spl0_2 | ~spl0_3)),
% 0.13/0.37 inference(subsumption_resolution,[],[f108,f65])).
% 0.13/0.37 thf(f65,plain,(
% 0.13/0.37 ((is_a @ zoey @ knave) = $true) | ~spl0_3),
% 0.13/0.37 inference(avatar_component_clause,[],[f64])).
% 0.13/0.37 thf(f108,plain,(
% 0.13/0.37 ((is_a @ zoey @ knave) != $true) | ~spl0_2),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f107])).
% 0.13/0.37 thf(f107,plain,(
% 0.13/0.37 ((is_a @ zoey @ knave) != $true) | ($true != $true) | ~spl0_2),
% 0.13/0.37 inference(superposition,[],[f50,f103])).
% 0.13/0.37 thf(f103,plain,(
% 0.13/0.37 ((says @ zoey @ $true) = $true) | ~spl0_2),
% 0.13/0.37 inference(backward_demodulation,[],[f38,f61])).
% 0.13/0.37 thf(f61,plain,(
% 0.13/0.37 ((is_a @ mel @ knave) = $true) | ~spl0_2),
% 0.13/0.37 inference(avatar_component_clause,[],[f60])).
% 0.13/0.37 thf(f60,plain,(
% 0.13/0.37 spl0_2 <=> ((is_a @ mel @ knave) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl0_2])])).
% 0.13/0.37 thf(f38,plain,(
% 0.13/0.37 ((says @ zoey @ (is_a @ mel @ knave)) = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f19])).
% 0.13/0.37 thf(f19,plain,(
% 0.13/0.37 ((says @ zoey @ (is_a @ mel @ knave)) = $true)),
% 0.13/0.37 inference(fool_elimination,[],[f18])).
% 0.13/0.37 thf(f18,plain,(
% 0.13/0.37 (says @ zoey @ (is_a @ mel @ knave))),
% 0.13/0.37 inference(rectify,[],[f5])).
% 0.13/0.37 thf(f5,axiom,(
% 0.13/0.37 (says @ zoey @ (is_a @ mel @ knave))),
% 0.13/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kk_6_5)).
% 0.13/0.37 thf(f50,plain,(
% 0.13/0.37 ( ! [X0 : $i] : (((says @ X0 @ $true) != $true) | ((is_a @ X0 @ knave) != $true)) )),
% 0.13/0.37 inference(equality_resolution,[],[f36])).
% 0.13/0.37 thf(f36,plain,(
% 0.13/0.37 ( ! [X0 : $i,X1 : $o] : (($true != X1) | ((says @ X0 @ X1) != $true) | ((is_a @ X0 @ knave) != $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f28])).
% 0.13/0.37 thf(f28,plain,(
% 0.13/0.37 ! [X0] : (! [X1 : $o] : (($true != X1) | ((says @ X0 @ X1) != $true)) | ((is_a @ X0 @ knave) != $true))),
% 0.13/0.38 inference(ennf_transformation,[],[f24])).
% 0.13/0.38 thf(f24,plain,(
% 0.13/0.38 ! [X0] : (((is_a @ X0 @ knave) = $true) => ! [X1 : $o] : (((says @ X0 @ X1) = $true) => ($true != X1)))),
% 0.13/0.38 inference(flattening,[],[f23])).
% 0.13/0.38 thf(f23,plain,(
% 0.13/0.38 ! [X0] : (((is_a @ X0 @ knave) = $true) => ! [X1 : $o] : (((says @ X0 @ X1) = $true) => ~($true = X1)))),
% 0.13/0.38 inference(fool_elimination,[],[f22])).
% 0.13/0.38 thf(f22,plain,(
% 0.13/0.38 ! [X0] : ((is_a @ X0 @ knave) => ! [X1 : $o] : ((says @ X0 @ X1) => ~X1))),
% 0.13/0.38 inference(rectify,[],[f3])).
% 0.13/0.38 thf(f3,axiom,(
% 0.13/0.38 ! [X0] : ((is_a @ X0 @ knave) => ! [X1 : $o] : ((says @ X0 @ X1) => ~X1))),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kk_6_3)).
% 0.13/0.38 thf(f102,plain,(
% 0.13/0.38 spl0_2 | ~spl0_1),
% 0.13/0.38 inference(avatar_split_clause,[],[f101,f56,f60])).
% 0.13/0.38 thf(f101,plain,(
% 0.13/0.38 ((is_a @ mel @ knave) = $true) | ~spl0_1),
% 0.13/0.38 inference(duplicate_literal_removal,[],[f100])).
% 0.13/0.38 thf(f100,plain,(
% 0.13/0.38 ((is_a @ mel @ knave) = $true) | ((is_a @ mel @ knave) = $true) | ~spl0_1),
% 0.13/0.38 inference(forward_demodulation,[],[f84,f58])).
% 0.13/0.38 thf(f84,plain,(
% 0.13/0.38 ((is_a @ mel @ knave) = $true) | ((is_a @ mel @ knight) = $true)),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f81])).
% 0.13/0.38 thf(f81,plain,(
% 0.13/0.38 ($true != $true) | ((is_a @ mel @ knave) = $true) | ((is_a @ mel @ knight) = $true)),
% 0.13/0.38 inference(superposition,[],[f35,f40])).
% 0.13/0.38 thf(f40,plain,(
% 0.13/0.38 ((is_a @ mel @ islander) = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f21])).
% 0.13/0.38 thf(f21,plain,(
% 0.13/0.38 ((is_a @ zoey @ islander) = $true) & ((is_a @ mel @ islander) = $true)),
% 0.13/0.38 inference(fool_elimination,[],[f20])).
% 0.13/0.38 thf(f20,plain,(
% 0.13/0.38 (is_a @ zoey @ islander) & (is_a @ mel @ islander)),
% 0.13/0.38 inference(rectify,[],[f4])).
% 0.13/0.38 thf(f4,axiom,(
% 0.13/0.38 (is_a @ zoey @ islander) & (is_a @ mel @ islander)),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kk_6_4)).
% 0.13/0.38 thf(f35,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (((is_a @ X0 @ islander) != $true) | ((is_a @ X0 @ knave) = $true) | ((is_a @ X0 @ knight) = $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f26])).
% 0.13/0.38 thf(f26,plain,(
% 0.13/0.38 ! [X0] : (((is_a @ X0 @ knave) = $true) | ((is_a @ X0 @ islander) != $true) | ((is_a @ X0 @ knight) = $true))),
% 0.13/0.38 inference(flattening,[],[f25])).
% 0.13/0.38 thf(f25,plain,(
% 0.13/0.38 ! [X0] : ((((is_a @ X0 @ knight) = $true) | ((is_a @ X0 @ knave) = $true)) | ((is_a @ X0 @ islander) != $true))),
% 0.13/0.38 inference(ennf_transformation,[],[f15])).
% 0.13/0.38 thf(f15,plain,(
% 0.13/0.38 ! [X0] : (((is_a @ X0 @ islander) = $true) => (((is_a @ X0 @ knight) = $true) | ((is_a @ X0 @ knave) = $true)))),
% 0.13/0.38 inference(fool_elimination,[],[f14])).
% 0.13/0.38 thf(f14,plain,(
% 0.13/0.38 ! [X0] : ((is_a @ X0 @ islander) => ((is_a @ X0 @ knight) | (is_a @ X0 @ knave)))),
% 0.13/0.38 inference(rectify,[],[f1])).
% 0.13/0.38 thf(f1,axiom,(
% 0.13/0.38 ! [X0] : ((is_a @ X0 @ islander) => ((is_a @ X0 @ knight) | (is_a @ X0 @ knave)))),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kk_6_1)).
% 0.13/0.38 thf(f93,plain,(
% 0.13/0.38 spl0_5 | spl0_2),
% 0.13/0.38 inference(avatar_split_clause,[],[f92,f60,f74])).
% 0.13/0.38 thf(f74,plain,(
% 0.13/0.38 spl0_5 <=> ((is_a @ mel @ knight) = $true)),
% 0.13/0.38 introduced(avatar_definition,[new_symbols(naming,[spl0_5])])).
% 0.13/0.38 thf(f92,plain,(
% 0.13/0.38 ((is_a @ mel @ knight) = $true) | spl0_2),
% 0.13/0.38 inference(subsumption_resolution,[],[f84,f62])).
% 0.13/0.38 thf(f62,plain,(
% 0.13/0.38 ((is_a @ mel @ knave) != $true) | spl0_2),
% 0.13/0.38 inference(avatar_component_clause,[],[f60])).
% 0.13/0.38 thf(f88,plain,(
% 0.13/0.38 spl0_3 | spl0_4),
% 0.13/0.38 inference(avatar_split_clause,[],[f83,f69,f64])).
% 0.13/0.38 thf(f83,plain,(
% 0.13/0.38 ((is_a @ zoey @ knave) = $true) | ((is_a @ zoey @ knight) = $true)),
% 0.13/0.38 inference(trivial_inequality_removal,[],[f82])).
% 0.13/0.38 thf(f82,plain,(
% 0.13/0.38 ($true != $true) | ((is_a @ zoey @ knave) = $true) | ((is_a @ zoey @ knight) = $true)),
% 0.13/0.38 inference(superposition,[],[f35,f41])).
% 0.13/0.38 thf(f41,plain,(
% 0.13/0.38 ((is_a @ zoey @ islander) = $true)),
% 0.13/0.38 inference(cnf_transformation,[],[f21])).
% 0.13/0.38 thf(f78,plain,(
% 0.13/0.38 ~spl0_4 | spl0_1 | ~spl0_5),
% 0.13/0.38 inference(avatar_split_clause,[],[f51,f74,f56,f69])).
% 0.13/0.38 thf(f51,plain,(
% 0.13/0.38 ((is_a @ zoey @ knight) != $true) | ((is_a @ mel @ knight) != $true) | (knight = knave)),
% 0.13/0.38 inference(duplicate_literal_removal,[],[f49])).
% 0.13/0.38 thf(f49,plain,(
% 0.13/0.38 (knight = knave) | (knight = knave) | ((is_a @ mel @ knight) != $true) | ((is_a @ zoey @ knight) != $true)),
% 0.13/0.38 inference(equality_resolution,[],[f48])).
% 0.13/0.38 thf(f48,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (((is_a @ mel @ X0) != $true) | (knight = knave) | (knave = X0) | (knight != X0) | ((is_a @ zoey @ knight) != $true)) )),
% 0.13/0.38 inference(equality_resolution,[],[f31])).
% 0.13/0.38 thf(f31,plain,(
% 0.13/0.38 ( ! [X0 : $i,X1 : $i] : (((is_a @ mel @ X0) != $true) | (knave = X1) | (knight != X1) | (knave = X0) | (knight != X0) | ((is_a @ zoey @ X1) != $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f30])).
% 0.13/0.38 thf(f30,plain,(
% 0.13/0.38 ! [X0,X1] : (((is_a @ mel @ X0) != $true) | (((knight = X1) | (knave != X1)) & ((knave = X1) | (knight != X1))) | (((knight = X0) | (knave != X0)) & ((knave = X0) | (knight != X0))) | ((is_a @ zoey @ X1) != $true))),
% 0.13/0.38 inference(nnf_transformation,[],[f29])).
% 0.13/0.38 thf(f29,plain,(
% 0.13/0.38 ! [X0,X1] : (((is_a @ mel @ X0) != $true) | ((knight = X1) <=> (knave = X1)) | ((knight = X0) <=> (knave = X0)) | ((is_a @ zoey @ X1) != $true))),
% 0.13/0.38 inference(ennf_transformation,[],[f11])).
% 0.13/0.38 thf(f11,plain,(
% 0.13/0.38 ~? [X1,X0] : (((knight = X1) <~> (knave = X1)) & ((knight = X0) <~> (knave = X0)) & ((is_a @ zoey @ X1) = $true) & ((is_a @ mel @ X0) = $true))),
% 0.13/0.38 inference(fool_elimination,[],[f10])).
% 0.13/0.38 thf(f10,plain,(
% 0.13/0.38 ~? [X0,X1] : (((knight = X0) <~> (knave = X0)) & ((knave = X1) <~> (knight = X1)) & (is_a @ zoey @ X1) & (is_a @ mel @ X0))),
% 0.13/0.38 inference(rectify,[],[f8])).
% 0.13/0.38 thf(f8,negated_conjecture,(
% 0.13/0.38 ~? [X2,X3] : (((knight = X2) <~> (knave = X2)) & ((knave = X3) <~> (knight = X3)) & (is_a @ zoey @ X3) & (is_a @ mel @ X2))),
% 0.13/0.38 inference(negated_conjecture,[],[f7])).
% 0.13/0.38 thf(f7,conjecture,(
% 0.13/0.38 ? [X2,X3] : (((knight = X2) <~> (knave = X2)) & ((knave = X3) <~> (knight = X3)) & (is_a @ zoey @ X3) & (is_a @ mel @ X2))),
% 0.13/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',query)).
% 0.13/0.38 thf(f77,plain,(
% 0.13/0.38 ~spl0_3 | ~spl0_5 | spl0_1),
% 0.13/0.38 inference(avatar_split_clause,[],[f52,f56,f74,f64])).
% 0.13/0.38 thf(f52,plain,(
% 0.13/0.38 ((is_a @ mel @ knight) != $true) | ((is_a @ zoey @ knave) != $true) | (knight = knave)),
% 0.13/0.38 inference(duplicate_literal_removal,[],[f45])).
% 0.13/0.38 thf(f45,plain,(
% 0.13/0.38 (knight = knave) | ((is_a @ zoey @ knave) != $true) | (knight = knave) | ((is_a @ mel @ knight) != $true)),
% 0.13/0.38 inference(equality_resolution,[],[f44])).
% 0.13/0.38 thf(f44,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (((is_a @ mel @ X0) != $true) | (knight = knave) | (knave = X0) | (knight != X0) | ((is_a @ zoey @ knave) != $true)) )),
% 0.13/0.38 inference(equality_resolution,[],[f33])).
% 0.13/0.38 thf(f33,plain,(
% 0.13/0.38 ( ! [X0 : $i,X1 : $i] : (((is_a @ mel @ X0) != $true) | (knight = X1) | (knave != X1) | (knave = X0) | (knight != X0) | ((is_a @ zoey @ X1) != $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f30])).
% 0.13/0.38 thf(f72,plain,(
% 0.13/0.38 ~spl0_4 | spl0_1 | ~spl0_2),
% 0.13/0.38 inference(avatar_split_clause,[],[f53,f60,f56,f69])).
% 0.13/0.38 thf(f53,plain,(
% 0.13/0.38 (knight = knave) | ((is_a @ mel @ knave) != $true) | ((is_a @ zoey @ knight) != $true)),
% 0.13/0.38 inference(duplicate_literal_removal,[],[f47])).
% 0.13/0.38 thf(f47,plain,(
% 0.13/0.38 ((is_a @ mel @ knave) != $true) | (knight = knave) | ((is_a @ zoey @ knight) != $true) | (knight = knave)),
% 0.13/0.38 inference(equality_resolution,[],[f46])).
% 0.13/0.38 thf(f46,plain,(
% 0.13/0.38 ( ! [X0 : $i] : (((is_a @ mel @ X0) != $true) | (knight = knave) | (knight = X0) | (knave != X0) | ((is_a @ zoey @ knight) != $true)) )),
% 0.13/0.38 inference(equality_resolution,[],[f32])).
% 0.13/0.38 thf(f32,plain,(
% 0.13/0.38 ( ! [X0 : $i,X1 : $i] : (((is_a @ mel @ X0) != $true) | (knave = X1) | (knight != X1) | (knight = X0) | (knave != X0) | ((is_a @ zoey @ X1) != $true)) )),
% 0.13/0.38 inference(cnf_transformation,[],[f30])).
% 0.13/0.38 % SZS output end Proof for theBenchmark
% 0.13/0.38 % (21098)------------------------------
% 0.13/0.38 % (21098)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.38 % (21098)Termination reason: Refutation
% 0.13/0.38
% 0.13/0.38 % (21098)Memory used [KB]: 5500
% 0.13/0.38 % (21098)Time elapsed: 0.009 s
% 0.13/0.38 % (21098)Instructions burned: 7 (million)
% 0.13/0.38 % (21098)------------------------------
% 0.13/0.38 % (21098)------------------------------
% 0.13/0.38 % (21090)Success in time 0.008 s
% 0.13/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------