TSTP Solution File: SEU746^2 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU746^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 : n002.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:51:13 EDT 2024
% Result : Theorem 0.14s 0.38s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU746^2 : TPTP v8.2.0. Released v3.7.0.
% 0.12/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.14/0.35 % Computer : n002.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun May 19 16:30:23 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.35 This is a TH0_THM_EQU_NAR problem
% 0.14/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.14/0.37 % (3131)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.14/0.37 % (3130)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.14/0.37 % (3133)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.14/0.37 % (3129)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.14/0.37 % (3135)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.14/0.37 % (3131)Instruction limit reached!
% 0.14/0.37 % (3131)------------------------------
% 0.14/0.37 % (3131)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (3131)Termination reason: Unknown
% 0.14/0.37 % (3131)Termination phase: Preprocessing 3
% 0.14/0.37
% 0.14/0.37 % (3131)Memory used [KB]: 895
% 0.14/0.37 % (3131)Time elapsed: 0.003 s
% 0.14/0.37 % (3131)Instructions burned: 2 (million)
% 0.14/0.37 % (3131)------------------------------
% 0.14/0.37 % (3131)------------------------------
% 0.14/0.37 % (3134)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.14/0.37 % (3135)Instruction limit reached!
% 0.14/0.37 % (3135)------------------------------
% 0.14/0.37 % (3135)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (3135)Termination reason: Unknown
% 0.14/0.37 % (3135)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (3135)Memory used [KB]: 5500
% 0.14/0.37 % (3135)Time elapsed: 0.004 s
% 0.14/0.37 % (3135)Instructions burned: 3 (million)
% 0.14/0.37 % (3135)------------------------------
% 0.14/0.37 % (3135)------------------------------
% 0.14/0.37 % (3129)Instruction limit reached!
% 0.14/0.37 % (3129)------------------------------
% 0.14/0.37 % (3129)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.37 % (3129)Termination reason: Unknown
% 0.14/0.37 % (3129)Termination phase: Saturation
% 0.14/0.37
% 0.14/0.37 % (3129)Memory used [KB]: 5500
% 0.14/0.37 % (3129)Time elapsed: 0.005 s
% 0.14/0.37 % (3129)Instructions burned: 4 (million)
% 0.14/0.37 % (3129)------------------------------
% 0.14/0.37 % (3129)------------------------------
% 0.14/0.37 % (3133)First to succeed.
% 0.14/0.37 % (3130)Also succeeded, but the first one will report.
% 0.14/0.38 % (3134)Also succeeded, but the first one will report.
% 0.14/0.38 % (3133)Refutation found. Thanks to Tanya!
% 0.14/0.38 % SZS status Theorem for theBenchmark
% 0.14/0.38 % SZS output start Proof for theBenchmark
% 0.14/0.38 thf(func_def_0, type, in: $i > $i > $o).
% 0.14/0.38 thf(func_def_1, type, powerset: $i > $i).
% 0.14/0.38 thf(func_def_2, type, binunion: $i > $i > $i).
% 0.14/0.38 thf(f59,plain,(
% 0.14/0.38 $false),
% 0.14/0.38 inference(avatar_sat_refutation,[],[f47,f52,f53,f58])).
% 0.14/0.38 thf(f58,plain,(
% 0.14/0.38 spl8_1 | spl8_3),
% 0.14/0.38 inference(avatar_contradiction_clause,[],[f57])).
% 0.14/0.38 thf(f57,plain,(
% 0.14/0.38 $false | (spl8_1 | spl8_3)),
% 0.14/0.38 inference(subsumption_resolution,[],[f56,f42])).
% 0.14/0.38 thf(f42,plain,(
% 0.14/0.38 ((in @ sK7 @ sK5) != $true) | spl8_1),
% 0.14/0.38 inference(avatar_component_clause,[],[f40])).
% 0.14/0.38 thf(f40,plain,(
% 0.14/0.38 spl8_1 <=> ((in @ sK7 @ sK5) = $true)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl8_1])])).
% 0.14/0.38 thf(f56,plain,(
% 0.14/0.38 ((in @ sK7 @ sK5) = $true) | spl8_3),
% 0.14/0.38 inference(subsumption_resolution,[],[f55,f51])).
% 0.14/0.38 thf(f51,plain,(
% 0.14/0.38 ((in @ sK7 @ sK4) != $true) | spl8_3),
% 0.14/0.38 inference(avatar_component_clause,[],[f49])).
% 0.14/0.38 thf(f49,plain,(
% 0.14/0.38 spl8_3 <=> ((in @ sK7 @ sK4) = $true)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl8_3])])).
% 0.14/0.38 thf(f55,plain,(
% 0.14/0.38 ((in @ sK7 @ sK4) = $true) | ((in @ sK7 @ sK5) = $true)),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f54])).
% 0.14/0.38 thf(f54,plain,(
% 0.14/0.38 ((in @ sK7 @ sK4) = $true) | ($true != $true) | ((in @ sK7 @ sK5) = $true)),
% 0.14/0.38 inference(superposition,[],[f38,f28])).
% 0.14/0.38 thf(f28,plain,(
% 0.14/0.38 ((in @ sK7 @ (binunion @ sK4 @ sK5)) = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f21])).
% 0.14/0.38 thf(f21,plain,(
% 0.14/0.38 (binunionE = $true) & ((((((in @ sK7 @ sK5) != $true) | (sK6 = $true)) & ((in @ sK7 @ sK3) = $true) & (sK6 != $true) & (((in @ sK7 @ sK4) != $true) | (sK6 = $true)) & ((in @ sK7 @ (binunion @ sK4 @ sK5)) = $true)) & ((in @ sK5 @ (powerset @ sK3)) = $true)) & ((in @ sK4 @ (powerset @ sK3)) = $true))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6,sK7])],[f17,f20,f19,f18])).
% 0.14/0.38 thf(f18,plain,(
% 0.14/0.38 ? [X0,X1] : (? [X2] : (? [X3 : $o,X4] : ((((in @ X4 @ X2) != $true) | ($true = X3)) & ((in @ X4 @ X0) = $true) & ($true != X3) & (((in @ X4 @ X1) != $true) | ($true = X3)) & ((in @ X4 @ (binunion @ X1 @ X2)) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) => (? [X2] : (? [X4,X3 : $o] : ((((in @ X4 @ X2) != $true) | ($true = X3)) & ((in @ X4 @ sK3) = $true) & ($true != X3) & (((in @ X4 @ sK4) != $true) | ($true = X3)) & ((in @ X4 @ (binunion @ sK4 @ X2)) = $true)) & ((in @ X2 @ (powerset @ sK3)) = $true)) & ((in @ sK4 @ (powerset @ sK3)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f19,plain,(
% 0.14/0.38 ? [X2] : (? [X4,X3 : $o] : ((((in @ X4 @ X2) != $true) | ($true = X3)) & ((in @ X4 @ sK3) = $true) & ($true != X3) & (((in @ X4 @ sK4) != $true) | ($true = X3)) & ((in @ X4 @ (binunion @ sK4 @ X2)) = $true)) & ((in @ X2 @ (powerset @ sK3)) = $true)) => (? [X4,X3 : $o] : ((((in @ X4 @ sK5) != $true) | ($true = X3)) & ((in @ X4 @ sK3) = $true) & ($true != X3) & (((in @ X4 @ sK4) != $true) | ($true = X3)) & ((in @ X4 @ (binunion @ sK4 @ sK5)) = $true)) & ((in @ sK5 @ (powerset @ sK3)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f20,plain,(
% 0.14/0.38 ? [X4,X3 : $o] : ((((in @ X4 @ sK5) != $true) | ($true = X3)) & ((in @ X4 @ sK3) = $true) & ($true != X3) & (((in @ X4 @ sK4) != $true) | ($true = X3)) & ((in @ X4 @ (binunion @ sK4 @ sK5)) = $true)) => ((((in @ sK7 @ sK5) != $true) | (sK6 = $true)) & ((in @ sK7 @ sK3) = $true) & (sK6 != $true) & (((in @ sK7 @ sK4) != $true) | (sK6 = $true)) & ((in @ sK7 @ (binunion @ sK4 @ sK5)) = $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f17,plain,(
% 0.14/0.38 (binunionE = $true) & ? [X0,X1] : (? [X2] : (? [X3 : $o,X4] : ((((in @ X4 @ X2) != $true) | ($true = X3)) & ((in @ X4 @ X0) = $true) & ($true != X3) & (((in @ X4 @ X1) != $true) | ($true = X3)) & ((in @ X4 @ (binunion @ X1 @ X2)) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true))),
% 0.14/0.38 inference(rectify,[],[f12])).
% 0.14/0.38 thf(f12,plain,(
% 0.14/0.38 (binunionE = $true) & ? [X0,X1] : (? [X2] : (? [X4 : $o,X3] : ((((in @ X3 @ X2) != $true) | ($true = X4)) & ((in @ X3 @ X0) = $true) & ($true != X4) & (((in @ X3 @ X1) != $true) | ($true = X4)) & ((in @ X3 @ (binunion @ X1 @ X2)) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true))),
% 0.14/0.38 inference(flattening,[],[f11])).
% 0.14/0.38 thf(f11,plain,(
% 0.14/0.38 ? [X1,X0] : (? [X2] : (? [X3,X4 : $o] : ((((($true != X4) & (((in @ X3 @ X2) != $true) | ($true = X4))) & (((in @ X3 @ X1) != $true) | ($true = X4))) & ((in @ X3 @ (binunion @ X1 @ X2)) = $true)) & ((in @ X3 @ X0) = $true)) & ((in @ X2 @ (powerset @ X0)) = $true)) & ((in @ X1 @ (powerset @ X0)) = $true)) & (binunionE = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f8])).
% 0.14/0.38 thf(f8,plain,(
% 0.14/0.38 ~((binunionE = $true) => ! [X1,X0] : (((in @ X1 @ (powerset @ X0)) = $true) => ! [X2] : (((in @ X2 @ (powerset @ X0)) = $true) => ! [X3,X4 : $o] : (((in @ X3 @ X0) = $true) => (((in @ X3 @ (binunion @ X1 @ X2)) = $true) => ((((in @ X3 @ X1) = $true) => ($true = X4)) => ((((in @ X3 @ X2) = $true) => ($true = X4)) => ($true = X4))))))))),
% 0.14/0.38 inference(fool_elimination,[],[f7])).
% 0.14/0.38 thf(f7,plain,(
% 0.14/0.38 ~(binunionE => ! [X0,X1] : ((in @ X1 @ (powerset @ X0)) => ! [X2] : ((in @ X2 @ (powerset @ X0)) => ! [X3,X4 : $o] : ((in @ X3 @ X0) => ((in @ X3 @ (binunion @ X1 @ X2)) => (((in @ X3 @ X1) => X4) => (((in @ X3 @ X2) => X4) => X4)))))))),
% 0.14/0.38 inference(rectify,[],[f3])).
% 0.14/0.38 thf(f3,negated_conjecture,(
% 0.14/0.38 ~(binunionE => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2,X5 : $o] : ((in @ X2 @ X0) => ((in @ X2 @ (binunion @ X3 @ X4)) => (((in @ X2 @ X3) => X5) => (((in @ X2 @ X4) => X5) => X5)))))))),
% 0.14/0.38 inference(negated_conjecture,[],[f2])).
% 0.14/0.38 thf(f2,conjecture,(
% 0.14/0.38 binunionE => ! [X0,X3] : ((in @ X3 @ (powerset @ X0)) => ! [X4] : ((in @ X4 @ (powerset @ X0)) => ! [X2,X5 : $o] : ((in @ X2 @ X0) => ((in @ X2 @ (binunion @ X3 @ X4)) => (((in @ X2 @ X3) => X5) => (((in @ X2 @ X4) => X5) => X5))))))),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionTE)).
% 0.14/0.38 thf(f38,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binunion @ X5 @ X4)) != $true) | ((in @ X3 @ X4) = $true) | ((in @ X3 @ X5) = $true)) )),
% 0.14/0.38 inference(trivial_inequality_removal,[],[f37])).
% 0.14/0.38 thf(f37,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binunion @ X5 @ X4)) != $true) | ((in @ X3 @ X4) = $true) | ($true != $true) | ((in @ X3 @ X5) = $true)) )),
% 0.14/0.38 inference(definition_unfolding,[],[f22,f33])).
% 0.14/0.38 thf(f33,plain,(
% 0.14/0.38 (binunionE = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f21])).
% 0.14/0.38 thf(f22,plain,(
% 0.14/0.38 ( ! [X3 : $i,X4 : $i,X5 : $i] : (((in @ X3 @ (binunion @ X5 @ X4)) != $true) | ((in @ X3 @ X4) = $true) | ((in @ X3 @ X5) = $true) | (binunionE != $true)) )),
% 0.14/0.38 inference(cnf_transformation,[],[f16])).
% 0.14/0.38 thf(f16,plain,(
% 0.14/0.38 ((binunionE = $true) | (((in @ sK0 @ (binunion @ sK2 @ sK1)) = $true) & ((in @ sK0 @ sK1) != $true) & ((in @ sK0 @ sK2) != $true))) & (! [X3,X4,X5] : (((in @ X3 @ (binunion @ X5 @ X4)) != $true) | ((in @ X3 @ X4) = $true) | ((in @ X3 @ X5) = $true)) | (binunionE != $true))),
% 0.14/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f14,f15])).
% 0.14/0.38 thf(f15,plain,(
% 0.14/0.38 ? [X0,X1,X2] : (((in @ X0 @ (binunion @ X2 @ X1)) = $true) & ((in @ X0 @ X1) != $true) & ((in @ X0 @ X2) != $true)) => (((in @ sK0 @ (binunion @ sK2 @ sK1)) = $true) & ((in @ sK0 @ sK1) != $true) & ((in @ sK0 @ sK2) != $true))),
% 0.14/0.38 introduced(choice_axiom,[])).
% 0.14/0.38 thf(f14,plain,(
% 0.14/0.38 ((binunionE = $true) | ? [X0,X1,X2] : (((in @ X0 @ (binunion @ X2 @ X1)) = $true) & ((in @ X0 @ X1) != $true) & ((in @ X0 @ X2) != $true))) & (! [X3,X4,X5] : (((in @ X3 @ (binunion @ X5 @ X4)) != $true) | ((in @ X3 @ X4) = $true) | ((in @ X3 @ X5) = $true)) | (binunionE != $true))),
% 0.14/0.38 inference(rectify,[],[f13])).
% 0.14/0.38 thf(f13,plain,(
% 0.14/0.38 ((binunionE = $true) | ? [X2,X0,X1] : (((in @ X2 @ (binunion @ X1 @ X0)) = $true) & ((in @ X2 @ X0) != $true) & ((in @ X2 @ X1) != $true))) & (! [X2,X0,X1] : (((in @ X2 @ (binunion @ X1 @ X0)) != $true) | ((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) = $true)) | (binunionE != $true))),
% 0.14/0.38 inference(nnf_transformation,[],[f10])).
% 0.14/0.38 thf(f10,plain,(
% 0.14/0.38 (binunionE = $true) <=> ! [X2,X0,X1] : (((in @ X2 @ (binunion @ X1 @ X0)) != $true) | ((in @ X2 @ X0) = $true) | ((in @ X2 @ X1) = $true))),
% 0.14/0.38 inference(flattening,[],[f9])).
% 0.14/0.38 thf(f9,plain,(
% 0.14/0.38 ! [X1,X2,X0] : ((((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) = $true)) | ((in @ X2 @ (binunion @ X1 @ X0)) != $true)) <=> (binunionE = $true)),
% 0.14/0.38 inference(ennf_transformation,[],[f6])).
% 0.14/0.38 thf(f6,plain,(
% 0.14/0.38 ! [X1,X2,X0] : (((in @ X2 @ (binunion @ X1 @ X0)) = $true) => (((in @ X2 @ X1) = $true) | ((in @ X2 @ X0) = $true))) <=> (binunionE = $true)),
% 0.14/0.38 inference(fool_elimination,[],[f5])).
% 0.14/0.38 thf(f5,plain,(
% 0.14/0.38 (! [X0,X1,X2] : ((in @ X2 @ (binunion @ X1 @ X0)) => ((in @ X2 @ X0) | (in @ X2 @ X1))) = binunionE)),
% 0.14/0.38 inference(rectify,[],[f1])).
% 0.14/0.38 thf(f1,axiom,(
% 0.14/0.38 (! [X1,X0,X2] : ((in @ X2 @ (binunion @ X0 @ X1)) => ((in @ X2 @ X1) | (in @ X2 @ X0))) = binunionE)),
% 0.14/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',binunionE)).
% 0.14/0.38 thf(f53,plain,(
% 0.14/0.38 ~spl8_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f30,f44])).
% 0.14/0.38 thf(f44,plain,(
% 0.14/0.38 spl8_2 <=> (sK6 = $true)),
% 0.14/0.38 introduced(avatar_definition,[new_symbols(naming,[spl8_2])])).
% 0.14/0.38 thf(f30,plain,(
% 0.14/0.38 (sK6 != $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f21])).
% 0.14/0.38 thf(f52,plain,(
% 0.14/0.38 spl8_2 | ~spl8_3),
% 0.14/0.38 inference(avatar_split_clause,[],[f29,f49,f44])).
% 0.14/0.38 thf(f29,plain,(
% 0.14/0.38 ((in @ sK7 @ sK4) != $true) | (sK6 = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f21])).
% 0.14/0.38 thf(f47,plain,(
% 0.14/0.38 ~spl8_1 | spl8_2),
% 0.14/0.38 inference(avatar_split_clause,[],[f32,f44,f40])).
% 0.14/0.38 thf(f32,plain,(
% 0.14/0.38 ((in @ sK7 @ sK5) != $true) | (sK6 = $true)),
% 0.14/0.38 inference(cnf_transformation,[],[f21])).
% 0.14/0.38 % SZS output end Proof for theBenchmark
% 0.14/0.38 % (3133)------------------------------
% 0.14/0.38 % (3133)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.38 % (3133)Termination reason: Refutation
% 0.14/0.38
% 0.14/0.38 % (3133)Memory used [KB]: 5500
% 0.14/0.38 % (3133)Time elapsed: 0.006 s
% 0.14/0.38 % (3133)Instructions burned: 3 (million)
% 0.14/0.38 % (3133)------------------------------
% 0.14/0.38 % (3133)------------------------------
% 0.14/0.38 % (3127)Success in time 0.019 s
% 0.14/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------