TSTP Solution File: SEU614^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU614^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 : n018.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:49:59 EDT 2024
% Result : Theorem 0.21s 0.39s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU614^2 : TPTP v8.2.0. Released v3.7.0.
% 0.07/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 : n018.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 18:19:23 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 % (6711)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 (3000ds/4Mi)
% 0.15/0.37 % (6713)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.15/0.37 % (6714)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 (3000ds/2Mi)
% 0.15/0.37 % (6713)Instruction limit reached!
% 0.15/0.37 % (6713)------------------------------
% 0.15/0.37 % (6713)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (6713)Termination reason: Unknown
% 0.15/0.37 % (6713)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (6713)Memory used [KB]: 895
% 0.15/0.37 % (6713)Time elapsed: 0.003 s
% 0.15/0.37 % (6713)Instructions burned: 2 (million)
% 0.15/0.37 % (6713)------------------------------
% 0.15/0.37 % (6713)------------------------------
% 0.15/0.37 % (6714)Instruction limit reached!
% 0.15/0.37 % (6714)------------------------------
% 0.15/0.37 % (6714)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (6714)Termination reason: Unknown
% 0.15/0.37 % (6714)Termination phase: Property scanning
% 0.15/0.37
% 0.15/0.37 % (6714)Memory used [KB]: 895
% 0.15/0.37 % (6714)Time elapsed: 0.003 s
% 0.15/0.37 % (6714)Instructions burned: 2 (million)
% 0.15/0.37 % (6714)------------------------------
% 0.15/0.37 % (6714)------------------------------
% 0.15/0.37 % (6711)Instruction limit reached!
% 0.15/0.37 % (6711)------------------------------
% 0.15/0.37 % (6711)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (6711)Termination reason: Unknown
% 0.15/0.37 % (6711)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (6711)Memory used [KB]: 5500
% 0.15/0.37 % (6711)Time elapsed: 0.005 s
% 0.15/0.37 % (6711)Instructions burned: 5 (million)
% 0.15/0.37 % (6711)------------------------------
% 0.15/0.37 % (6711)------------------------------
% 0.15/0.38 % (6716)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.38 % (6715)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 (3000ds/275Mi)
% 0.21/0.38 % (6710)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (3000ds/183Mi)
% 0.21/0.38 % (6717)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (3000ds/3Mi)
% 0.21/0.39 % (6715)First to succeed.
% 0.21/0.39 % (6718)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.39 % (6717)Instruction limit reached!
% 0.21/0.39 % (6717)------------------------------
% 0.21/0.39 % (6717)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (6717)Termination reason: Unknown
% 0.21/0.39 % (6717)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (6717)Memory used [KB]: 5500
% 0.21/0.39 % (6717)Time elapsed: 0.029 s
% 0.21/0.39 % (6717)Instructions burned: 3 (million)
% 0.21/0.39 % (6717)------------------------------
% 0.21/0.39 % (6717)------------------------------
% 0.21/0.39 % (6720)dis+21_1:1_cbe=off:cnfonf=off:fs=off:fsr=off:hud=1:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.39 % (6716)Instruction limit reached!
% 0.21/0.39 % (6716)------------------------------
% 0.21/0.39 % (6716)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (6716)Termination reason: Unknown
% 0.21/0.39 % (6716)Termination phase: Saturation
% 0.21/0.39
% 0.21/0.39 % (6716)Memory used [KB]: 5628
% 0.21/0.39 % (6716)Time elapsed: 0.012 s
% 0.21/0.39 % (6716)Instructions burned: 19 (million)
% 0.21/0.39 % (6716)------------------------------
% 0.21/0.39 % (6716)------------------------------
% 0.21/0.39 % (6715)Refutation found. Thanks to Tanya!
% 0.21/0.39 % SZS status Theorem for theBenchmark
% 0.21/0.39 % SZS output start Proof for theBenchmark
% 0.21/0.39 thf(func_def_0, type, in: $i > $i > $o).
% 0.21/0.39 thf(func_def_1, type, symdiff: $i > $i > $i).
% 0.21/0.39 thf(func_def_6, type, sP0: $i > $o > $i > $i > $o).
% 0.21/0.39 thf(func_def_15, type, ph9: !>[X0: $tType]:(X0)).
% 0.21/0.39 thf(f89,plain,(
% 0.21/0.39 $false),
% 0.21/0.39 inference(avatar_sat_refutation,[],[f64,f69,f88])).
% 0.21/0.39 thf(f88,plain,(
% 0.21/0.39 ~spl8_1),
% 0.21/0.39 inference(avatar_contradiction_clause,[],[f87])).
% 0.21/0.39 thf(f87,plain,(
% 0.21/0.39 $false | ~spl8_1),
% 0.21/0.39 inference(subsumption_resolution,[],[f85,f60])).
% 0.21/0.39 thf(f60,plain,(
% 0.21/0.39 ( ! [X1 : $o] : (($true = X1)) ) | ~spl8_1),
% 0.21/0.39 inference(avatar_component_clause,[],[f59])).
% 0.21/0.39 thf(f59,plain,(
% 0.21/0.39 spl8_1 <=> ! [X1 : $o] : ($true = X1)),
% 0.21/0.39 introduced(avatar_definition,[new_symbols(naming,[spl8_1])])).
% 0.21/0.39 thf(f85,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $i] : (((in @ X2 @ X3) != $true)) ) | ~spl8_1),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f76])).
% 0.21/0.39 thf(f76,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $i] : (((in @ X2 @ X3) != $true) | ($true != $true)) ) | ~spl8_1),
% 0.21/0.39 inference(superposition,[],[f30,f60])).
% 0.21/0.39 thf(f30,plain,(
% 0.21/0.39 ( ! [X2 : $o,X3 : $i,X0 : $i,X1 : $i] : (((sP0 @ X3 @ X2 @ X1 @ X0) != $true) | ((in @ X1 @ X0) != $true)) )),
% 0.21/0.39 inference(cnf_transformation,[],[f19])).
% 0.21/0.39 thf(f19,plain,(
% 0.21/0.39 ! [X0,X1,X2 : $o,X3] : ((((sP0 @ X3 @ X2 @ X1 @ X0) = $true) | ((in @ X1 @ X0) = $true) | ($true = X2) | ((in @ X1 @ X3) != $true)) & ((((in @ X1 @ X0) != $true) & ($true != X2) & ((in @ X1 @ X3) = $true)) | ((sP0 @ X3 @ X2 @ X1 @ X0) != $true)))),
% 0.21/0.39 inference(rectify,[],[f18])).
% 0.21/0.39 thf(f18,plain,(
% 0.21/0.39 ! [X2,X1,X3 : $o,X0] : ((($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true = (in @ X1 @ X2)) | ($true = X3) | ((in @ X1 @ X0) != $true)) & ((($true != (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) = $true)) | ($true != (sP0 @ X0 @ X3 @ X1 @ X2))))),
% 0.21/0.39 inference(flattening,[],[f17])).
% 0.21/0.39 thf(f17,plain,(
% 0.21/0.39 ! [X2,X1,X3 : $o,X0] : ((($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | (($true = (in @ X1 @ X2)) | ($true = X3) | ((in @ X1 @ X0) != $true))) & ((($true != (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) = $true)) | ($true != (sP0 @ X0 @ X3 @ X1 @ X2))))),
% 0.21/0.39 inference(nnf_transformation,[],[f15])).
% 0.21/0.39 thf(f15,plain,(
% 0.21/0.39 ! [X2,X1,X3 : $o,X0] : (($true = (sP0 @ X0 @ X3 @ X1 @ X2)) <=> (($true != (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) = $true)))),
% 0.21/0.39 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.21/0.39 thf(f69,plain,(
% 0.21/0.39 ~spl8_2),
% 0.21/0.39 inference(avatar_contradiction_clause,[],[f68])).
% 0.21/0.39 thf(f68,plain,(
% 0.21/0.39 $false | ~spl8_2),
% 0.21/0.39 inference(subsumption_resolution,[],[f67,f41])).
% 0.21/0.39 thf(f41,plain,(
% 0.21/0.39 ((in @ sK6 @ sK7) = $true)),
% 0.21/0.39 inference(cnf_transformation,[],[f27])).
% 0.21/0.39 thf(f27,plain,(
% 0.21/0.39 (((in @ sK6 @ sK5) = $true) & ((in @ sK6 @ sK7) = $true) & ((in @ sK6 @ (symdiff @ sK7 @ sK5)) = $true)) & (symdiffE = $true)),
% 0.21/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6,sK7])],[f25,f26])).
% 0.21/0.39 thf(f26,plain,(
% 0.21/0.39 ? [X0,X1,X2] : (((in @ X1 @ X0) = $true) & ($true = (in @ X1 @ X2)) & ((in @ X1 @ (symdiff @ X2 @ X0)) = $true)) => (((in @ sK6 @ sK5) = $true) & ((in @ sK6 @ sK7) = $true) & ((in @ sK6 @ (symdiff @ sK7 @ sK5)) = $true))),
% 0.21/0.39 introduced(choice_axiom,[])).
% 0.21/0.39 thf(f25,plain,(
% 0.21/0.39 ? [X0,X1,X2] : (((in @ X1 @ X0) = $true) & ($true = (in @ X1 @ X2)) & ((in @ X1 @ (symdiff @ X2 @ X0)) = $true)) & (symdiffE = $true)),
% 0.21/0.39 inference(rectify,[],[f12])).
% 0.21/0.39 thf(f12,plain,(
% 0.21/0.39 ? [X1,X0,X2] : (((in @ X0 @ X1) = $true) & ((in @ X0 @ X2) = $true) & ((in @ X0 @ (symdiff @ X2 @ X1)) = $true)) & (symdiffE = $true)),
% 0.21/0.39 inference(flattening,[],[f11])).
% 0.21/0.39 thf(f11,plain,(
% 0.21/0.39 ? [X2,X1,X0] : ((((in @ X0 @ (symdiff @ X2 @ X1)) = $true) & ((in @ X0 @ X1) = $true)) & ((in @ X0 @ X2) = $true)) & (symdiffE = $true)),
% 0.21/0.39 inference(ennf_transformation,[],[f9])).
% 0.21/0.39 thf(f9,plain,(
% 0.21/0.39 ~((symdiffE = $true) => ! [X2,X1,X0] : (((in @ X0 @ X2) = $true) => (((in @ X0 @ X1) = $true) => ((in @ X0 @ (symdiff @ X2 @ X1)) != $true))))),
% 0.21/0.39 inference(flattening,[],[f6])).
% 0.21/0.39 thf(f6,plain,(
% 0.21/0.39 ~((symdiffE = $true) => ! [X0,X1,X2] : (((in @ X0 @ X2) = $true) => (((in @ X0 @ X1) = $true) => ~((in @ X0 @ (symdiff @ X2 @ X1)) = $true))))),
% 0.21/0.39 inference(fool_elimination,[],[f5])).
% 0.21/0.39 thf(f5,plain,(
% 0.21/0.39 ~(symdiffE => ! [X0,X1,X2] : ((in @ X0 @ X2) => ((in @ X0 @ X1) => ~(in @ X0 @ (symdiff @ X2 @ X1)))))),
% 0.21/0.39 inference(rectify,[],[f3])).
% 0.21/0.39 thf(f3,negated_conjecture,(
% 0.21/0.39 ~(symdiffE => ! [X2,X1,X0] : ((in @ X2 @ X0) => ((in @ X2 @ X1) => ~(in @ X2 @ (symdiff @ X0 @ X1)))))),
% 0.21/0.39 inference(negated_conjecture,[],[f2])).
% 0.21/0.39 thf(f2,conjecture,(
% 0.21/0.39 symdiffE => ! [X2,X1,X0] : ((in @ X2 @ X0) => ((in @ X2 @ X1) => ~(in @ X2 @ (symdiff @ X0 @ X1))))),
% 0.21/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiffIneg1)).
% 0.21/0.39 thf(f67,plain,(
% 0.21/0.39 ((in @ sK6 @ sK7) != $true) | ~spl8_2),
% 0.21/0.39 inference(subsumption_resolution,[],[f66,f42])).
% 0.21/0.39 thf(f42,plain,(
% 0.21/0.39 ((in @ sK6 @ sK5) = $true)),
% 0.21/0.39 inference(cnf_transformation,[],[f27])).
% 0.21/0.39 thf(f66,plain,(
% 0.21/0.39 ((in @ sK6 @ sK5) != $true) | ((in @ sK6 @ sK7) != $true) | ~spl8_2),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f65])).
% 0.21/0.39 thf(f65,plain,(
% 0.21/0.39 ($true != $true) | ((in @ sK6 @ sK7) != $true) | ((in @ sK6 @ sK5) != $true) | ~spl8_2),
% 0.21/0.39 inference(superposition,[],[f63,f40])).
% 0.21/0.39 thf(f40,plain,(
% 0.21/0.39 ((in @ sK6 @ (symdiff @ sK7 @ sK5)) = $true)),
% 0.21/0.39 inference(cnf_transformation,[],[f27])).
% 0.21/0.39 thf(f63,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $i,X0 : $i] : (((in @ X2 @ (symdiff @ X3 @ X0)) != $true) | ((in @ X2 @ X3) != $true) | ((in @ X2 @ X0) != $true)) ) | ~spl8_2),
% 0.21/0.39 inference(avatar_component_clause,[],[f62])).
% 0.21/0.39 thf(f62,plain,(
% 0.21/0.39 spl8_2 <=> ! [X2,X0,X3] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ X3) != $true) | ((in @ X2 @ (symdiff @ X3 @ X0)) != $true))),
% 0.21/0.39 introduced(avatar_definition,[new_symbols(naming,[spl8_2])])).
% 0.21/0.39 thf(f64,plain,(
% 0.21/0.39 spl8_1 | spl8_2),
% 0.21/0.39 inference(avatar_split_clause,[],[f57,f62,f59])).
% 0.21/0.39 thf(f57,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (((in @ X2 @ X0) != $true) | ((in @ X2 @ (symdiff @ X3 @ X0)) != $true) | ($true = X1) | ((in @ X2 @ X3) != $true)) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f54])).
% 0.21/0.39 thf(f54,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $i,X0 : $i,X1 : $o] : (($true = X1) | ((in @ X2 @ X0) != $true) | ($true != $true) | ((in @ X2 @ X3) != $true) | ((in @ X2 @ (symdiff @ X3 @ X0)) != $true)) )),
% 0.21/0.39 inference(superposition,[],[f30,f52])).
% 0.21/0.39 thf(f52,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true) | ((in @ X1 @ X0) != $true) | ($true = X3)) )),
% 0.21/0.39 inference(trivial_inequality_removal,[],[f45])).
% 0.21/0.39 thf(f45,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (((in @ X1 @ X0) != $true) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true) | ($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true != $true) | ($true = X3)) )),
% 0.21/0.39 inference(definition_unfolding,[],[f36,f39])).
% 0.21/0.39 thf(f39,plain,(
% 0.21/0.39 (symdiffE = $true)),
% 0.21/0.39 inference(cnf_transformation,[],[f27])).
% 0.21/0.39 thf(f36,plain,(
% 0.21/0.39 ( ! [X2 : $i,X3 : $o,X0 : $i,X1 : $i] : (((in @ X1 @ X0) != $true) | ($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true = X3) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true) | (symdiffE != $true)) )),
% 0.21/0.39 inference(cnf_transformation,[],[f24])).
% 0.21/0.39 thf(f24,plain,(
% 0.21/0.39 (! [X0,X1,X2] : (! [X3 : $o] : ((($true = (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) != $true)) | ($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true = X3)) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true)) | (symdiffE != $true)) & ((symdiffE = $true) | (((((in @ sK2 @ sK3) != $true) | ($true = sK4) | ((in @ sK2 @ sK1) = $true)) & ((sP0 @ sK1 @ sK4 @ sK2 @ sK3) != $true) & ($true != sK4)) & ($true = (in @ sK2 @ (symdiff @ sK3 @ sK1)))))),
% 0.21/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4])],[f21,f23,f22])).
% 0.21/0.39 thf(f22,plain,(
% 0.21/0.39 ? [X4,X5,X6] : (? [X7 : $o] : ((((in @ X5 @ X6) != $true) | ($true = X7) | ((in @ X5 @ X4) = $true)) & ((sP0 @ X4 @ X7 @ X5 @ X6) != $true) & ($true != X7)) & ((in @ X5 @ (symdiff @ X6 @ X4)) = $true)) => (? [X7 : $o] : ((((in @ sK2 @ sK3) != $true) | ($true = X7) | ((in @ sK2 @ sK1) = $true)) & ((sP0 @ sK1 @ X7 @ sK2 @ sK3) != $true) & ($true != X7)) & ($true = (in @ sK2 @ (symdiff @ sK3 @ sK1))))),
% 0.21/0.39 introduced(choice_axiom,[])).
% 0.21/0.39 thf(f23,plain,(
% 0.21/0.39 ? [X7 : $o] : ((((in @ sK2 @ sK3) != $true) | ($true = X7) | ((in @ sK2 @ sK1) = $true)) & ((sP0 @ sK1 @ X7 @ sK2 @ sK3) != $true) & ($true != X7)) => ((((in @ sK2 @ sK3) != $true) | ($true = sK4) | ((in @ sK2 @ sK1) = $true)) & ((sP0 @ sK1 @ sK4 @ sK2 @ sK3) != $true) & ($true != sK4))),
% 0.21/0.39 introduced(choice_axiom,[])).
% 0.21/0.39 thf(f21,plain,(
% 0.21/0.39 (! [X0,X1,X2] : (! [X3 : $o] : ((($true = (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) != $true)) | ($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true = X3)) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true)) | (symdiffE != $true)) & ((symdiffE = $true) | ? [X4,X5,X6] : (? [X7 : $o] : ((((in @ X5 @ X6) != $true) | ($true = X7) | ((in @ X5 @ X4) = $true)) & ((sP0 @ X4 @ X7 @ X5 @ X6) != $true) & ($true != X7)) & ((in @ X5 @ (symdiff @ X6 @ X4)) = $true)))),
% 0.21/0.39 inference(rectify,[],[f20])).
% 0.21/0.39 thf(f20,plain,(
% 0.21/0.39 (! [X0,X1,X2] : (! [X3 : $o] : ((($true = (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) != $true)) | ($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true = X3)) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true)) | (symdiffE != $true)) & ((symdiffE = $true) | ? [X0,X1,X2] : (? [X3 : $o] : ((($true != (in @ X1 @ X2)) | ($true = X3) | ((in @ X1 @ X0) = $true)) & ($true != (sP0 @ X0 @ X3 @ X1 @ X2)) & ($true != X3)) & ((in @ X1 @ (symdiff @ X2 @ X0)) = $true)))),
% 0.21/0.39 inference(nnf_transformation,[],[f16])).
% 0.21/0.39 thf(f16,plain,(
% 0.21/0.39 ! [X0,X1,X2] : (! [X3 : $o] : ((($true = (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) != $true)) | ($true = (sP0 @ X0 @ X3 @ X1 @ X2)) | ($true = X3)) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true)) <=> (symdiffE = $true)),
% 0.21/0.39 inference(definition_folding,[],[f14,f15])).
% 0.21/0.39 thf(f14,plain,(
% 0.21/0.39 ! [X0,X1,X2] : (! [X3 : $o] : ((($true = (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) != $true)) | (($true != (in @ X1 @ X2)) & ($true != X3) & ((in @ X1 @ X0) = $true)) | ($true = X3)) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true)) <=> (symdiffE = $true)),
% 0.21/0.39 inference(flattening,[],[f13])).
% 0.21/0.39 thf(f13,plain,(
% 0.21/0.39 ! [X1,X0,X2] : (! [X3 : $o] : ((($true = X3) | ((($true != X3) & ((in @ X1 @ X0) = $true)) & ($true != (in @ X1 @ X2)))) | ((($true != X3) & ((in @ X1 @ X0) != $true)) & ($true = (in @ X1 @ X2)))) | ((in @ X1 @ (symdiff @ X2 @ X0)) != $true)) <=> (symdiffE = $true)),
% 0.21/0.39 inference(ennf_transformation,[],[f10])).
% 0.21/0.39 thf(f10,plain,(
% 0.21/0.39 ! [X1,X0,X2] : (((in @ X1 @ (symdiff @ X2 @ X0)) = $true) => ! [X3 : $o] : ((($true = (in @ X1 @ X2)) => (((in @ X1 @ X0) != $true) => ($true = X3))) => ((($true != (in @ X1 @ X2)) => (((in @ X1 @ X0) = $true) => ($true = X3))) => ($true = X3)))) <=> (symdiffE = $true)),
% 0.21/0.39 inference(flattening,[],[f8])).
% 0.21/0.39 thf(f8,plain,(
% 0.21/0.39 ! [X0,X1,X2] : (((in @ X1 @ (symdiff @ X2 @ X0)) = $true) => ! [X3 : $o] : ((($true = (in @ X1 @ X2)) => (~((in @ X1 @ X0) = $true) => ($true = X3))) => ((~($true = (in @ X1 @ X2)) => (((in @ X1 @ X0) = $true) => ($true = X3))) => ($true = X3)))) <=> (symdiffE = $true)),
% 0.21/0.39 inference(fool_elimination,[],[f7])).
% 0.21/0.39 thf(f7,plain,(
% 0.21/0.39 (! [X0,X1,X2] : ((in @ X1 @ (symdiff @ X2 @ X0)) => ! [X3 : $o] : (((in @ X1 @ X2) => (~(in @ X1 @ X0) => X3)) => ((~(in @ X1 @ X2) => ((in @ X1 @ X0) => X3)) => X3))) = symdiffE)),
% 0.21/0.39 inference(rectify,[],[f1])).
% 0.21/0.39 thf(f1,axiom,(
% 0.21/0.39 (! [X1,X2,X0] : ((in @ X2 @ (symdiff @ X0 @ X1)) => ! [X3 : $o] : (((in @ X2 @ X0) => (~(in @ X2 @ X1) => X3)) => ((~(in @ X2 @ X0) => ((in @ X2 @ X1) => X3)) => X3))) = symdiffE)),
% 0.21/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',symdiffE)).
% 0.21/0.39 % SZS output end Proof for theBenchmark
% 0.21/0.39 % (6715)------------------------------
% 0.21/0.39 % (6715)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.39 % (6715)Termination reason: Refutation
% 0.21/0.39
% 0.21/0.39 % (6715)Memory used [KB]: 5500
% 0.21/0.39 % (6715)Time elapsed: 0.009 s
% 0.21/0.39 % (6715)Instructions burned: 6 (million)
% 0.21/0.39 % (6715)------------------------------
% 0.21/0.39 % (6715)------------------------------
% 0.21/0.39 % (6709)Success in time 0.029 s
% 0.21/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------