TSTP Solution File: SEU646^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU646^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n006.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:18 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU646^2 : TPTP v8.2.0. Released v3.7.0.
% 0.04/0.14 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.15/0.34 % Computer : n006.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % 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:08:38 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/sandbox/benchmark/theBenchmark.p
% 0.15/0.36 % (17661)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.15/0.36 % (17661)Instruction limit reached!
% 0.15/0.36 % (17661)------------------------------
% 0.15/0.36 % (17661)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.36 % (17661)Termination reason: Unknown
% 0.15/0.36 % (17661)Termination phase: Saturation
% 0.15/0.36
% 0.15/0.36 % (17661)Memory used [KB]: 5500
% 0.15/0.36 % (17661)Time elapsed: 0.003 s
% 0.15/0.36 % (17661)Instructions burned: 4 (million)
% 0.15/0.36 % (17661)------------------------------
% 0.15/0.36 % (17661)------------------------------
% 0.15/0.37 % (17660)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 % (17658)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 % (17659)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 % (17662)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 % (17663)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 % (17664)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 % (17665)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 % (17662)Instruction limit reached!
% 0.15/0.37 % (17662)------------------------------
% 0.15/0.37 % (17662)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (17662)Termination reason: Unknown
% 0.15/0.37 % (17662)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (17662)Memory used [KB]: 895
% 0.15/0.37 % (17662)Time elapsed: 0.003 s
% 0.15/0.37 % (17662)Instructions burned: 2 (million)
% 0.15/0.37 % (17662)------------------------------
% 0.15/0.37 % (17662)------------------------------
% 0.21/0.37 % (17665)Instruction limit reached!
% 0.21/0.37 % (17665)------------------------------
% 0.21/0.37 % (17665)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (17665)Termination reason: Unknown
% 0.21/0.37 % (17665)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (17665)Memory used [KB]: 5500
% 0.21/0.37 % (17665)Time elapsed: 0.004 s
% 0.21/0.37 % (17665)Instructions burned: 3 (million)
% 0.21/0.37 % (17665)------------------------------
% 0.21/0.37 % (17665)------------------------------
% 0.21/0.37 % (17659)Instruction limit reached!
% 0.21/0.37 % (17659)------------------------------
% 0.21/0.37 % (17659)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (17659)Termination reason: Unknown
% 0.21/0.37 % (17659)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (17659)Memory used [KB]: 5500
% 0.21/0.37 % (17659)Time elapsed: 0.005 s
% 0.21/0.37 % (17659)Instructions burned: 4 (million)
% 0.21/0.37 % (17659)------------------------------
% 0.21/0.37 % (17659)------------------------------
% 0.21/0.37 % (17663)First to succeed.
% 0.21/0.37 % (17666)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.37 % (17664)Also succeeded, but the first one will report.
% 0.21/0.38 % (17663)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.38 thf(func_def_2, type, setadjoin: $i > $i > $i).
% 0.21/0.38 thf(func_def_3, type, kpair: $i > $i > $i).
% 0.21/0.38 thf(func_def_5, type, cartprod: $i > $i > $i).
% 0.21/0.38 thf(func_def_7, type, kfst: $i > $i).
% 0.21/0.38 thf(func_def_22, type, sK8: $i > $i > $i > $i).
% 0.21/0.38 thf(func_def_23, type, sK9: $i > $i > $i > $i).
% 0.21/0.38 thf(f61,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(subsumption_resolution,[],[f60,f33])).
% 0.21/0.38 thf(f33,plain,(
% 0.21/0.38 ((in @ (kfst @ sK4) @ sK3) != $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f21])).
% 0.21/0.38 thf(f21,plain,(
% 0.21/0.38 (((in @ (kfst @ sK4) @ sK3) != $true) & ((in @ sK4 @ (cartprod @ sK3 @ sK2)) = $true)) & (kfstpairEq = $true) & (cartprodmempair1 = $true)),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3,sK4])],[f15,f20])).
% 0.21/0.38 thf(f20,plain,(
% 0.21/0.38 ? [X0,X1,X2] : (((in @ (kfst @ X2) @ X1) != $true) & ($true = (in @ X2 @ (cartprod @ X1 @ X0)))) => (((in @ (kfst @ sK4) @ sK3) != $true) & ((in @ sK4 @ (cartprod @ sK3 @ sK2)) = $true))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f15,plain,(
% 0.21/0.38 ? [X0,X1,X2] : (((in @ (kfst @ X2) @ X1) != $true) & ($true = (in @ X2 @ (cartprod @ X1 @ X0)))) & (kfstpairEq = $true) & (cartprodmempair1 = $true)),
% 0.21/0.38 inference(flattening,[],[f14])).
% 0.21/0.38 thf(f14,plain,(
% 0.21/0.38 (? [X0,X1,X2] : (((in @ (kfst @ X2) @ X1) != $true) & ($true = (in @ X2 @ (cartprod @ X1 @ X0)))) & (kfstpairEq = $true)) & (cartprodmempair1 = $true)),
% 0.21/0.38 inference(ennf_transformation,[],[f12])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 ~((cartprodmempair1 = $true) => ((kfstpairEq = $true) => ! [X0,X1,X2] : (($true = (in @ X2 @ (cartprod @ X1 @ X0))) => ((in @ (kfst @ X2) @ X1) = $true))))),
% 0.21/0.38 inference(fool_elimination,[],[f11])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 ~(cartprodmempair1 => (kfstpairEq => ! [X0,X1,X2] : ((in @ X2 @ (cartprod @ X1 @ X0)) => (in @ (kfst @ X2) @ X1))))),
% 0.21/0.38 inference(rectify,[],[f5])).
% 0.21/0.38 thf(f5,negated_conjecture,(
% 0.21/0.38 ~(cartprodmempair1 => (kfstpairEq => ! [X3,X2,X4] : ((in @ X4 @ (cartprod @ X2 @ X3)) => (in @ (kfst @ X4) @ X2))))),
% 0.21/0.38 inference(negated_conjecture,[],[f4])).
% 0.21/0.38 thf(f4,conjecture,(
% 0.21/0.38 cartprodmempair1 => (kfstpairEq => ! [X3,X2,X4] : ((in @ X4 @ (cartprod @ X2 @ X3)) => (in @ (kfst @ X4) @ X2)))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodfstin)).
% 0.21/0.38 thf(f60,plain,(
% 0.21/0.38 ((in @ (kfst @ sK4) @ sK3) = $true)),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f55])).
% 0.21/0.38 thf(f55,plain,(
% 0.21/0.38 ((in @ (kfst @ sK4) @ sK3) = $true) | ($true != $true)),
% 0.21/0.38 inference(superposition,[],[f53,f32])).
% 0.21/0.38 thf(f32,plain,(
% 0.21/0.38 ((in @ sK4 @ (cartprod @ sK3 @ sK2)) = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f21])).
% 0.21/0.38 thf(f53,plain,(
% 0.21/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((in @ X2 @ (cartprod @ X0 @ X1)) != $true) | ($true = (in @ (kfst @ X2) @ X0))) )),
% 0.21/0.38 inference(duplicate_literal_removal,[],[f52])).
% 0.21/0.38 thf(f52,plain,(
% 0.21/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (($true = (in @ (kfst @ X2) @ X0)) | ((in @ X2 @ (cartprod @ X0 @ X1)) != $true) | ((in @ X2 @ (cartprod @ X0 @ X1)) != $true)) )),
% 0.21/0.38 inference(superposition,[],[f47,f50])).
% 0.21/0.38 thf(f50,plain,(
% 0.21/0.38 ( ! [X2 : $i,X0 : $i,X1 : $i] : (((kfst @ X2) = (sK8 @ X0 @ X1 @ X2)) | ((in @ X2 @ (cartprod @ X0 @ X1)) != $true)) )),
% 0.21/0.38 inference(superposition,[],[f49,f48])).
% 0.21/0.38 thf(f48,plain,(
% 0.21/0.38 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((kpair @ (sK8 @ X7 @ X6 @ X5) @ (sK9 @ X7 @ X6 @ X5)) = X5) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f43])).
% 0.21/0.38 thf(f43,plain,(
% 0.21/0.38 ( ! [X6 : $i,X7 : $i,X5 : $i] : (($true != $true) | ((kpair @ (sK8 @ X7 @ X6 @ X5) @ (sK9 @ X7 @ X6 @ X5)) = X5) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true)) )),
% 0.21/0.38 inference(definition_unfolding,[],[f36,f30])).
% 0.21/0.38 thf(f30,plain,(
% 0.21/0.38 (cartprodmempair1 = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f21])).
% 0.21/0.38 thf(f36,plain,(
% 0.21/0.38 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((kpair @ (sK8 @ X7 @ X6 @ X5) @ (sK9 @ X7 @ X6 @ X5)) = X5) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true) | (cartprodmempair1 != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f27])).
% 0.21/0.38 thf(f27,plain,(
% 0.21/0.38 ((cartprodmempair1 = $true) | (! [X3] : (! [X4] : (((kpair @ X3 @ X4) != sK5) | ($true != (in @ X4 @ sK6))) | ((in @ X3 @ sK7) != $true)) & ((in @ sK5 @ (cartprod @ sK7 @ sK6)) = $true))) & (! [X5,X6,X7] : (((((kpair @ (sK8 @ X7 @ X6 @ X5) @ (sK9 @ X7 @ X6 @ X5)) = X5) & ($true = (in @ (sK9 @ X7 @ X6 @ X5) @ X6))) & ((in @ (sK8 @ X7 @ X6 @ X5) @ X7) = $true)) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true)) | (cartprodmempair1 != $true))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7,sK8,sK9])],[f23,f26,f25,f24])).
% 0.21/0.38 thf(f24,plain,(
% 0.21/0.38 ? [X0,X1,X2] : (! [X3] : (! [X4] : (((kpair @ X3 @ X4) != X0) | ((in @ X4 @ X1) != $true)) | ((in @ X3 @ X2) != $true)) & ((in @ X0 @ (cartprod @ X2 @ X1)) = $true)) => (! [X3] : (! [X4] : (((kpair @ X3 @ X4) != sK5) | ($true != (in @ X4 @ sK6))) | ((in @ X3 @ sK7) != $true)) & ((in @ sK5 @ (cartprod @ sK7 @ sK6)) = $true))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f25,plain,(
% 0.21/0.38 ! [X5,X6,X7] : (? [X8] : (? [X9] : (((kpair @ X8 @ X9) = X5) & ((in @ X9 @ X6) = $true)) & ((in @ X8 @ X7) = $true)) => (? [X9] : (((kpair @ (sK8 @ X7 @ X6 @ X5) @ X9) = X5) & ((in @ X9 @ X6) = $true)) & ((in @ (sK8 @ X7 @ X6 @ X5) @ X7) = $true)))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f26,plain,(
% 0.21/0.38 ! [X5,X6,X7] : (? [X9] : (((kpair @ (sK8 @ X7 @ X6 @ X5) @ X9) = X5) & ((in @ X9 @ X6) = $true)) => (((kpair @ (sK8 @ X7 @ X6 @ X5) @ (sK9 @ X7 @ X6 @ X5)) = X5) & ($true = (in @ (sK9 @ X7 @ X6 @ X5) @ X6))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f23,plain,(
% 0.21/0.38 ((cartprodmempair1 = $true) | ? [X0,X1,X2] : (! [X3] : (! [X4] : (((kpair @ X3 @ X4) != X0) | ((in @ X4 @ X1) != $true)) | ((in @ X3 @ X2) != $true)) & ((in @ X0 @ (cartprod @ X2 @ X1)) = $true))) & (! [X5,X6,X7] : (? [X8] : (? [X9] : (((kpair @ X8 @ X9) = X5) & ((in @ X9 @ X6) = $true)) & ((in @ X8 @ X7) = $true)) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true)) | (cartprodmempair1 != $true))),
% 0.21/0.38 inference(rectify,[],[f22])).
% 0.21/0.38 thf(f22,plain,(
% 0.21/0.38 ((cartprodmempair1 = $true) | ? [X0,X1,X2] : (! [X3] : (! [X4] : (((kpair @ X3 @ X4) != X0) | ((in @ X4 @ X1) != $true)) | ((in @ X3 @ X2) != $true)) & ((in @ X0 @ (cartprod @ X2 @ X1)) = $true))) & (! [X0,X1,X2] : (? [X3] : (? [X4] : (((kpair @ X3 @ X4) = X0) & ((in @ X4 @ X1) = $true)) & ((in @ X3 @ X2) = $true)) | ((in @ X0 @ (cartprod @ X2 @ X1)) != $true)) | (cartprodmempair1 != $true))),
% 0.21/0.38 inference(nnf_transformation,[],[f13])).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 (cartprodmempair1 = $true) <=> ! [X0,X1,X2] : (? [X3] : (? [X4] : (((kpair @ X3 @ X4) = X0) & ((in @ X4 @ X1) = $true)) & ((in @ X3 @ X2) = $true)) | ((in @ X0 @ (cartprod @ X2 @ X1)) != $true))),
% 0.21/0.38 inference(ennf_transformation,[],[f9])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ! [X0,X1,X2] : (((in @ X0 @ (cartprod @ X2 @ X1)) = $true) => ? [X3] : (? [X4] : (((kpair @ X3 @ X4) = X0) & ((in @ X4 @ X1) = $true)) & ((in @ X3 @ X2) = $true))) <=> (cartprodmempair1 = $true)),
% 0.21/0.38 inference(fool_elimination,[],[f8])).
% 0.21/0.38 thf(f8,plain,(
% 0.21/0.38 (! [X0,X1,X2] : ((in @ X0 @ (cartprod @ X2 @ X1)) => ? [X3] : (? [X4] : (((kpair @ X3 @ X4) = X0) & (in @ X4 @ X1)) & (in @ X3 @ X2))) = cartprodmempair1)),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,axiom,(
% 0.21/0.38 (! [X4,X3,X2] : ((in @ X4 @ (cartprod @ X2 @ X3)) => ? [X0] : (? [X1] : (((kpair @ X0 @ X1) = X4) & (in @ X1 @ X3)) & (in @ X0 @ X2))) = cartprodmempair1)),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cartprodmempair1)).
% 0.21/0.38 thf(f49,plain,(
% 0.21/0.38 ( ! [X0 : $i,X1 : $i] : (((kfst @ (kpair @ X0 @ X1)) = X0)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f39])).
% 0.21/0.38 thf(f39,plain,(
% 0.21/0.38 ( ! [X0 : $i,X1 : $i] : (($true != $true) | ((kfst @ (kpair @ X0 @ X1)) = X0)) )),
% 0.21/0.38 inference(definition_unfolding,[],[f29,f31])).
% 0.21/0.38 thf(f31,plain,(
% 0.21/0.38 (kfstpairEq = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f21])).
% 0.21/0.38 thf(f29,plain,(
% 0.21/0.38 ( ! [X0 : $i,X1 : $i] : (((kfst @ (kpair @ X0 @ X1)) = X0) | (kfstpairEq != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f19])).
% 0.21/0.38 thf(f19,plain,(
% 0.21/0.38 (! [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) = X0) | (kfstpairEq != $true)) & ((kfstpairEq = $true) | (sK0 != (kfst @ (kpair @ sK0 @ sK1))))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f17,f18])).
% 0.21/0.38 thf(f18,plain,(
% 0.21/0.38 ? [X2,X3] : ((kfst @ (kpair @ X2 @ X3)) != X2) => (sK0 != (kfst @ (kpair @ sK0 @ sK1)))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f17,plain,(
% 0.21/0.38 (! [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) = X0) | (kfstpairEq != $true)) & ((kfstpairEq = $true) | ? [X2,X3] : ((kfst @ (kpair @ X2 @ X3)) != X2))),
% 0.21/0.38 inference(rectify,[],[f16])).
% 0.21/0.38 thf(f16,plain,(
% 0.21/0.38 (! [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) = X0) | (kfstpairEq != $true)) & ((kfstpairEq = $true) | ? [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) != X0))),
% 0.21/0.38 inference(nnf_transformation,[],[f10])).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 ! [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) = X0) <=> (kfstpairEq = $true)),
% 0.21/0.38 inference(fool_elimination,[],[f3])).
% 0.21/0.38 thf(f3,axiom,(
% 0.21/0.38 (kfstpairEq = ! [X0,X1] : ((kfst @ (kpair @ X0 @ X1)) = X0))),
% 0.21/0.38 file('/export/starexec/sandbox/benchmark/theBenchmark.p',kfstpairEq)).
% 0.21/0.38 thf(f47,plain,(
% 0.21/0.38 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ (sK8 @ X7 @ X6 @ X5) @ X7) = $true) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true)) )),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f45])).
% 0.21/0.38 thf(f45,plain,(
% 0.21/0.38 ( ! [X6 : $i,X7 : $i,X5 : $i] : (($true != $true) | ((in @ (sK8 @ X7 @ X6 @ X5) @ X7) = $true) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true)) )),
% 0.21/0.38 inference(definition_unfolding,[],[f34,f30])).
% 0.21/0.38 thf(f34,plain,(
% 0.21/0.38 ( ! [X6 : $i,X7 : $i,X5 : $i] : (((in @ (sK8 @ X7 @ X6 @ X5) @ X7) = $true) | ((in @ X5 @ (cartprod @ X7 @ X6)) != $true) | (cartprodmempair1 != $true)) )),
% 0.21/0.38 inference(cnf_transformation,[],[f27])).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (17663)------------------------------
% 0.21/0.38 % (17663)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (17663)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (17663)Memory used [KB]: 5500
% 0.21/0.38 % (17663)Time elapsed: 0.008 s
% 0.21/0.38 % (17663)Instructions burned: 5 (million)
% 0.21/0.38 % (17663)------------------------------
% 0.21/0.38 % (17663)------------------------------
% 0.21/0.38 % (17657)Success in time 0.012 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------