TSTP Solution File: SEU685^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU685^2 : TPTP v8.2.0. Released v3.7.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 : n007.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 03:50:44 EDT 2024
% Result : Theorem 0.15s 0.37s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU685^2 : TPTP v8.2.0. Released v3.7.0.
% 0.11/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.15/0.35 % Computer : n007.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun May 19 17:02:53 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_EQU_NAR problem
% 0.15/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.15/0.37 % (13542)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.15/0.37 % (13543)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.15/0.37 % (13545)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.15/0.37 % (13538)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.15/0.37 % (13539)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.15/0.37 % (13542)Instruction limit reached!
% 0.15/0.37 % (13542)------------------------------
% 0.15/0.37 % (13542)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (13542)Termination reason: Unknown
% 0.15/0.37 % (13542)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (13542)Memory used [KB]: 1023
% 0.15/0.37 % (13542)Time elapsed: 0.003 s
% 0.15/0.37 % (13542)Instructions burned: 2 (million)
% 0.15/0.37 % (13542)------------------------------
% 0.15/0.37 % (13542)------------------------------
% 0.15/0.37 % (13541)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.37 % (13545)Instruction limit reached!
% 0.15/0.37 % (13545)------------------------------
% 0.15/0.37 % (13545)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (13545)Termination reason: Unknown
% 0.15/0.37 % (13545)Termination phase: Preprocessing 3
% 0.15/0.37
% 0.15/0.37 % (13545)Memory used [KB]: 1023
% 0.15/0.37 % (13545)Time elapsed: 0.003 s
% 0.15/0.37 % (13545)Instructions burned: 3 (million)
% 0.15/0.37 % (13545)------------------------------
% 0.15/0.37 % (13545)------------------------------
% 0.15/0.37 % (13540)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.15/0.37 % (13541)Instruction limit reached!
% 0.15/0.37 % (13541)------------------------------
% 0.15/0.37 % (13541)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (13541)Termination reason: Unknown
% 0.15/0.37 % (13541)Termination phase: shuffling
% 0.15/0.37
% 0.15/0.37 % (13541)Memory used [KB]: 895
% 0.15/0.37 % (13541)Time elapsed: 0.003 s
% 0.15/0.37 % (13541)Instructions burned: 2 (million)
% 0.15/0.37 % (13541)------------------------------
% 0.15/0.37 % (13541)------------------------------
% 0.15/0.37 % (13539)Instruction limit reached!
% 0.15/0.37 % (13539)------------------------------
% 0.15/0.37 % (13539)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (13539)Termination reason: Unknown
% 0.15/0.37 % (13539)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (13539)Memory used [KB]: 1023
% 0.15/0.37 % (13539)Time elapsed: 0.004 s
% 0.15/0.37 % (13539)Instructions burned: 4 (million)
% 0.15/0.37 % (13539)------------------------------
% 0.15/0.37 % (13539)------------------------------
% 0.15/0.37 % (13544)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.15/0.37 % (13543)First to succeed.
% 0.15/0.37 % (13543)Refutation found. Thanks to Tanya!
% 0.15/0.37 % SZS status Theorem for theBenchmark
% 0.15/0.37 % SZS output start Proof for theBenchmark
% 0.15/0.37 thf(func_def_0, type, in: $i > $i > $o).
% 0.15/0.37 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.15/0.37 thf(func_def_3, type, dsetconstr: $i > ($i > $o) > $i).
% 0.15/0.37 thf(func_def_4, type, subset: $i > $i > $o).
% 0.15/0.37 thf(func_def_5, type, kpair: $i > $i > $i).
% 0.15/0.37 thf(func_def_6, type, cartprod: $i > $i > $i).
% 0.15/0.37 thf(func_def_7, type, singleton: $i > $o).
% 0.15/0.37 thf(func_def_9, type, ex1: $i > ($i > $o) > $o).
% 0.15/0.37 thf(func_def_10, type, breln: $i > $i > $i > $o).
% 0.15/0.37 thf(func_def_11, type, func: $i > $i > $i > $o).
% 0.15/0.37 thf(func_def_12, type, funcSet: $i > $i > $i).
% 0.15/0.37 thf(func_def_13, type, ap: $i > $i > $i > $i > $i).
% 0.15/0.37 thf(f68,plain,(
% 0.15/0.37 $false),
% 0.15/0.37 inference(subsumption_resolution,[],[f67,f62])).
% 0.15/0.37 thf(f62,plain,(
% 0.15/0.37 ($true = (func @ sK3 @ sK5 @ sK4))),
% 0.15/0.37 inference(trivial_inequality_removal,[],[f61])).
% 0.15/0.37 thf(f61,plain,(
% 0.15/0.37 ($true != $true) | ($true = (func @ sK3 @ sK5 @ sK4))),
% 0.15/0.37 inference(superposition,[],[f60,f44])).
% 0.15/0.37 thf(f44,plain,(
% 0.15/0.37 ($true = (in @ sK4 @ (funcSet @ sK3 @ sK5)))),
% 0.15/0.37 inference(cnf_transformation,[],[f34])).
% 0.15/0.37 thf(f34,plain,(
% 0.15/0.37 (funcGraphProp1 = $true) & ((($true = (in @ sK6 @ sK3)) & ($true != (in @ (kpair @ sK6 @ (ap @ sK3 @ sK5 @ sK4 @ sK6)) @ sK4))) & ($true = (in @ sK4 @ (funcSet @ sK3 @ sK5)))) & (infuncsetfunc = $true)),
% 0.15/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6])],[f27,f33,f32])).
% 0.15/0.37 thf(f32,plain,(
% 0.15/0.37 ? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X0)) & ($true != (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1))) & ($true = (in @ X1 @ (funcSet @ X0 @ X2)))) => (? [X3] : (($true = (in @ X3 @ sK3)) & ($true != (in @ (kpair @ X3 @ (ap @ sK3 @ sK5 @ sK4 @ X3)) @ sK4))) & ($true = (in @ sK4 @ (funcSet @ sK3 @ sK5))))),
% 0.15/0.37 introduced(choice_axiom,[])).
% 0.15/0.37 thf(f33,plain,(
% 0.15/0.37 ? [X3] : (($true = (in @ X3 @ sK3)) & ($true != (in @ (kpair @ X3 @ (ap @ sK3 @ sK5 @ sK4 @ X3)) @ sK4))) => (($true = (in @ sK6 @ sK3)) & ($true != (in @ (kpair @ sK6 @ (ap @ sK3 @ sK5 @ sK4 @ sK6)) @ sK4)))),
% 0.15/0.37 introduced(choice_axiom,[])).
% 0.15/0.37 thf(f27,plain,(
% 0.15/0.37 (funcGraphProp1 = $true) & ? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X0)) & ($true != (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1))) & ($true = (in @ X1 @ (funcSet @ X0 @ X2)))) & (infuncsetfunc = $true)),
% 0.15/0.37 inference(flattening,[],[f26])).
% 0.15/0.37 thf(f26,plain,(
% 0.15/0.37 (? [X0,X1,X2] : (? [X3] : (($true = (in @ X3 @ X0)) & ($true != (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1))) & ($true = (in @ X1 @ (funcSet @ X0 @ X2)))) & (funcGraphProp1 = $true)) & (infuncsetfunc = $true)),
% 0.15/0.37 inference(ennf_transformation,[],[f17])).
% 0.15/0.37 thf(f17,plain,(
% 0.15/0.37 ~((infuncsetfunc = $true) => ((funcGraphProp1 = $true) => ! [X0,X1,X2] : (($true = (in @ X1 @ (funcSet @ X0 @ X2))) => ! [X3] : (($true = (in @ X3 @ X0)) => ($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1))))))),
% 0.15/0.37 inference(fool_elimination,[],[f16])).
% 0.15/0.37 thf(f16,plain,(
% 0.15/0.37 ~(infuncsetfunc => (funcGraphProp1 => ! [X0,X1,X2] : ((in @ X1 @ (funcSet @ X0 @ X2)) => ! [X3] : ((in @ X3 @ X0) => (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)))))),
% 0.15/0.37 inference(rectify,[],[f8])).
% 0.15/0.37 thf(f8,negated_conjecture,(
% 0.15/0.37 ~(infuncsetfunc => (funcGraphProp1 => ! [X0,X7,X3] : ((in @ X7 @ (funcSet @ X0 @ X3)) => ! [X1] : ((in @ X1 @ X0) => (in @ (kpair @ X1 @ (ap @ X0 @ X3 @ X7 @ X1)) @ X7)))))),
% 0.15/0.37 inference(negated_conjecture,[],[f7])).
% 0.15/0.37 thf(f7,conjecture,(
% 0.15/0.37 infuncsetfunc => (funcGraphProp1 => ! [X0,X7,X3] : ((in @ X7 @ (funcSet @ X0 @ X3)) => ! [X1] : ((in @ X1 @ X0) => (in @ (kpair @ X1 @ (ap @ X0 @ X3 @ X7 @ X1)) @ X7))))),
% 0.15/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',funcGraphProp3)).
% 0.15/0.37 thf(f60,plain,(
% 0.15/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0))) )),
% 0.15/0.37 inference(trivial_inequality_removal,[],[f52])).
% 0.15/0.37 thf(f52,plain,(
% 0.15/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != $true) | ($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0))) )),
% 0.15/0.37 inference(definition_unfolding,[],[f42,f43])).
% 0.15/0.37 thf(f43,plain,(
% 0.15/0.37 (infuncsetfunc = $true)),
% 0.15/0.37 inference(cnf_transformation,[],[f34])).
% 0.15/0.37 thf(f42,plain,(
% 0.15/0.37 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0)) | (infuncsetfunc != $true)) )),
% 0.15/0.37 inference(cnf_transformation,[],[f31])).
% 0.15/0.37 thf(f31,plain,(
% 0.15/0.37 (! [X0,X1,X2] : (($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0))) | (infuncsetfunc != $true)) & ((infuncsetfunc = $true) | (($true = (in @ sK0 @ (funcSet @ sK2 @ sK1))) & ($true != (func @ sK2 @ sK1 @ sK0))))),
% 0.15/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f29,f30])).
% 0.15/0.37 thf(f30,plain,(
% 0.15/0.37 ? [X3,X4,X5] : (($true = (in @ X3 @ (funcSet @ X5 @ X4))) & ($true != (func @ X5 @ X4 @ X3))) => (($true = (in @ sK0 @ (funcSet @ sK2 @ sK1))) & ($true != (func @ sK2 @ sK1 @ sK0)))),
% 0.15/0.37 introduced(choice_axiom,[])).
% 0.15/0.37 thf(f29,plain,(
% 0.15/0.37 (! [X0,X1,X2] : (($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0))) | (infuncsetfunc != $true)) & ((infuncsetfunc = $true) | ? [X3,X4,X5] : (($true = (in @ X3 @ (funcSet @ X5 @ X4))) & ($true != (func @ X5 @ X4 @ X3))))),
% 0.15/0.37 inference(rectify,[],[f28])).
% 0.15/0.37 thf(f28,plain,(
% 0.15/0.37 (! [X0,X1,X2] : (($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0))) | (infuncsetfunc != $true)) & ((infuncsetfunc = $true) | ? [X0,X1,X2] : (($true = (in @ X0 @ (funcSet @ X2 @ X1))) & ($true != (func @ X2 @ X1 @ X0))))),
% 0.15/0.37 inference(nnf_transformation,[],[f24])).
% 0.15/0.37 thf(f24,plain,(
% 0.15/0.37 ! [X0,X1,X2] : (($true != (in @ X0 @ (funcSet @ X2 @ X1))) | ($true = (func @ X2 @ X1 @ X0))) <=> (infuncsetfunc = $true)),
% 0.15/0.37 inference(ennf_transformation,[],[f11])).
% 0.15/0.37 thf(f11,plain,(
% 0.15/0.37 (infuncsetfunc = $true) <=> ! [X0,X1,X2] : (($true = (in @ X0 @ (funcSet @ X2 @ X1))) => ($true = (func @ X2 @ X1 @ X0)))),
% 0.15/0.37 inference(fool_elimination,[],[f10])).
% 0.15/0.37 thf(f10,plain,(
% 0.15/0.37 (infuncsetfunc = ! [X0,X1,X2] : ((in @ X0 @ (funcSet @ X2 @ X1)) => (func @ X2 @ X1 @ X0)))),
% 0.15/0.37 inference(rectify,[],[f5])).
% 0.15/0.37 thf(f5,axiom,(
% 0.15/0.37 (infuncsetfunc = ! [X7,X3,X0] : ((in @ X7 @ (funcSet @ X0 @ X3)) => (func @ X0 @ X3 @ X7)))),
% 0.15/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infuncsetfunc)).
% 0.15/0.37 thf(f67,plain,(
% 0.15/0.37 ($true != (func @ sK3 @ sK5 @ sK4))),
% 0.15/0.37 inference(subsumption_resolution,[],[f65,f46])).
% 0.15/0.37 thf(f46,plain,(
% 0.15/0.37 ($true = (in @ sK6 @ sK3))),
% 0.15/0.37 inference(cnf_transformation,[],[f34])).
% 0.15/0.37 thf(f65,plain,(
% 0.15/0.37 ($true != (in @ sK6 @ sK3)) | ($true != (func @ sK3 @ sK5 @ sK4))),
% 0.15/0.37 inference(trivial_inequality_removal,[],[f63])).
% 0.15/0.37 thf(f63,plain,(
% 0.15/0.37 ($true != $true) | ($true != (in @ sK6 @ sK3)) | ($true != (func @ sK3 @ sK5 @ sK4))),
% 0.15/0.37 inference(superposition,[],[f45,f59])).
% 0.15/0.37 thf(f59,plain,(
% 0.15/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (func @ X0 @ X2 @ X1)) | ($true != (in @ X3 @ X0))) )),
% 0.15/0.37 inference(trivial_inequality_removal,[],[f55])).
% 0.15/0.37 thf(f55,plain,(
% 0.15/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (in @ X3 @ X0)) | ($true != (func @ X0 @ X2 @ X1)) | ($true != $true)) )),
% 0.15/0.37 inference(definition_unfolding,[],[f51,f47])).
% 0.15/0.37 thf(f47,plain,(
% 0.15/0.37 (funcGraphProp1 = $true)),
% 0.15/0.37 inference(cnf_transformation,[],[f34])).
% 0.15/0.37 thf(f51,plain,(
% 0.15/0.37 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $i] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (in @ X3 @ X0)) | ($true != (func @ X0 @ X2 @ X1)) | (funcGraphProp1 != $true)) )),
% 0.15/0.37 inference(cnf_transformation,[],[f39])).
% 0.15/0.37 thf(f39,plain,(
% 0.15/0.37 (! [X0,X1,X2] : (! [X3] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (in @ X3 @ X0))) | ($true != (func @ X0 @ X2 @ X1))) | (funcGraphProp1 != $true)) & ((funcGraphProp1 = $true) | ((($true != (in @ (kpair @ sK10 @ (ap @ sK7 @ sK9 @ sK8 @ sK10)) @ sK8)) & ($true = (in @ sK10 @ sK7))) & ($true = (func @ sK7 @ sK9 @ sK8))))),
% 0.15/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK7,sK8,sK9,sK10])],[f36,f38,f37])).
% 0.15/0.37 thf(f37,plain,(
% 0.15/0.37 ? [X4,X5,X6] : (? [X7] : (($true != (in @ (kpair @ X7 @ (ap @ X4 @ X6 @ X5 @ X7)) @ X5)) & ($true = (in @ X7 @ X4))) & ($true = (func @ X4 @ X6 @ X5))) => (? [X7] : (($true != (in @ (kpair @ X7 @ (ap @ sK7 @ sK9 @ sK8 @ X7)) @ sK8)) & ($true = (in @ X7 @ sK7))) & ($true = (func @ sK7 @ sK9 @ sK8)))),
% 0.15/0.37 introduced(choice_axiom,[])).
% 0.15/0.37 thf(f38,plain,(
% 0.15/0.37 ? [X7] : (($true != (in @ (kpair @ X7 @ (ap @ sK7 @ sK9 @ sK8 @ X7)) @ sK8)) & ($true = (in @ X7 @ sK7))) => (($true != (in @ (kpair @ sK10 @ (ap @ sK7 @ sK9 @ sK8 @ sK10)) @ sK8)) & ($true = (in @ sK10 @ sK7)))),
% 0.15/0.37 introduced(choice_axiom,[])).
% 0.15/0.37 thf(f36,plain,(
% 0.15/0.37 (! [X0,X1,X2] : (! [X3] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (in @ X3 @ X0))) | ($true != (func @ X0 @ X2 @ X1))) | (funcGraphProp1 != $true)) & ((funcGraphProp1 = $true) | ? [X4,X5,X6] : (? [X7] : (($true != (in @ (kpair @ X7 @ (ap @ X4 @ X6 @ X5 @ X7)) @ X5)) & ($true = (in @ X7 @ X4))) & ($true = (func @ X4 @ X6 @ X5))))),
% 0.15/0.37 inference(rectify,[],[f35])).
% 0.15/0.37 thf(f35,plain,(
% 0.15/0.37 (! [X0,X1,X2] : (! [X3] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (in @ X3 @ X0))) | ($true != (func @ X0 @ X2 @ X1))) | (funcGraphProp1 != $true)) & ((funcGraphProp1 = $true) | ? [X0,X1,X2] : (? [X3] : (($true != (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) & ($true = (in @ X3 @ X0))) & ($true = (func @ X0 @ X2 @ X1))))),
% 0.15/0.37 inference(nnf_transformation,[],[f25])).
% 0.15/0.37 thf(f25,plain,(
% 0.15/0.37 ! [X0,X1,X2] : (! [X3] : (($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)) | ($true != (in @ X3 @ X0))) | ($true != (func @ X0 @ X2 @ X1))) <=> (funcGraphProp1 = $true)),
% 0.15/0.37 inference(ennf_transformation,[],[f23])).
% 0.15/0.37 thf(f23,plain,(
% 0.15/0.37 ! [X0,X1,X2] : (($true = (func @ X0 @ X2 @ X1)) => ! [X3] : (($true = (in @ X3 @ X0)) => ($true = (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1)))) <=> (funcGraphProp1 = $true)),
% 0.15/0.37 inference(fool_elimination,[],[f22])).
% 0.15/0.37 thf(f22,plain,(
% 0.15/0.37 (funcGraphProp1 = ! [X0,X1,X2] : ((func @ X0 @ X2 @ X1) => ! [X3] : ((in @ X3 @ X0) => (in @ (kpair @ X3 @ (ap @ X0 @ X2 @ X1 @ X3)) @ X1))))),
% 0.15/0.37 inference(rectify,[],[f6])).
% 0.15/0.37 thf(f6,axiom,(
% 0.15/0.37 (funcGraphProp1 = ! [X0,X7,X3] : ((func @ X0 @ X3 @ X7) => ! [X1] : ((in @ X1 @ X0) => (in @ (kpair @ X1 @ (ap @ X0 @ X3 @ X7 @ X1)) @ X7))))),
% 0.15/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',funcGraphProp1)).
% 0.15/0.37 thf(f45,plain,(
% 0.15/0.37 ($true != (in @ (kpair @ sK6 @ (ap @ sK3 @ sK5 @ sK4 @ sK6)) @ sK4))),
% 0.15/0.37 inference(cnf_transformation,[],[f34])).
% 0.15/0.37 % SZS output end Proof for theBenchmark
% 0.15/0.37 % (13543)------------------------------
% 0.15/0.37 % (13543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (13543)Termination reason: Refutation
% 0.15/0.37
% 0.15/0.37 % (13543)Memory used [KB]: 5500
% 0.15/0.37 % (13543)Time elapsed: 0.007 s
% 0.15/0.37 % (13543)Instructions burned: 5 (million)
% 0.15/0.37 % (13543)------------------------------
% 0.15/0.37 % (13543)------------------------------
% 0.15/0.37 % (13537)Success in time 0.018 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------