TSTP Solution File: SEV412^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV412^5 : TPTP v8.2.0. Released v4.0.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 : 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 04:13:42 EDT 2024
% Result : Theorem 0.16s 0.35s
% Output : Refutation 0.16s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SEV412^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.11 % 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.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Sun May 19 18:35:37 EDT 2024
% 0.16/0.31 % CPUTime :
% 0.16/0.31 This is a TH0_THM_NEQ_NAR problem
% 0.16/0.31 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.16/0.34 % (4783)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.16/0.34 % (4790)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.16/0.34 % (4790)First to succeed.
% 0.16/0.34 % (4784)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.16/0.35 % (4786)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.16/0.35 % (4790)Refutation found. Thanks to Tanya!
% 0.16/0.35 % SZS status Theorem for theBenchmark
% 0.16/0.35 % SZS output start Proof for theBenchmark
% 0.16/0.35 thf(func_def_1, type, cB: $i > $o).
% 0.16/0.35 thf(func_def_2, type, cA: $i > $o).
% 0.16/0.35 thf(f55,plain,(
% 0.16/0.35 $false),
% 0.16/0.35 inference(avatar_sat_refutation,[],[f34,f39,f40,f45,f46,f50,f54])).
% 0.16/0.35 thf(f54,plain,(
% 0.16/0.35 ~spl2_1 | spl2_4),
% 0.16/0.35 inference(avatar_contradiction_clause,[],[f53])).
% 0.16/0.35 thf(f53,plain,(
% 0.16/0.35 $false | (~spl2_1 | spl2_4)),
% 0.16/0.35 inference(subsumption_resolution,[],[f52,f38])).
% 0.16/0.35 thf(f38,plain,(
% 0.16/0.35 ((cB @ sK0) != $true) | spl2_4),
% 0.16/0.35 inference(avatar_component_clause,[],[f36])).
% 0.16/0.35 thf(f36,plain,(
% 0.16/0.35 spl2_4 <=> ((cB @ sK0) = $true)),
% 0.16/0.35 introduced(avatar_definition,[new_symbols(naming,[spl2_4])])).
% 0.16/0.35 thf(f52,plain,(
% 0.16/0.35 ((cB @ sK0) = $true) | ~spl2_1),
% 0.16/0.35 inference(trivial_inequality_removal,[],[f51])).
% 0.16/0.35 thf(f51,plain,(
% 0.16/0.35 ($true != $true) | ((cB @ sK0) = $true) | ~spl2_1),
% 0.16/0.35 inference(superposition,[],[f12,f25])).
% 0.16/0.35 thf(f25,plain,(
% 0.16/0.35 ((cA @ sK0) = $true) | ~spl2_1),
% 0.16/0.35 inference(avatar_component_clause,[],[f23])).
% 0.16/0.35 thf(f23,plain,(
% 0.16/0.35 spl2_1 <=> ((cA @ sK0) = $true)),
% 0.16/0.35 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.16/0.35 thf(f12,plain,(
% 0.16/0.35 ( ! [X2 : $i] : (($true != (cA @ X2)) | ((cB @ X2) = $true)) )),
% 0.16/0.35 inference(cnf_transformation,[],[f11])).
% 0.16/0.35 thf(f11,plain,(
% 0.16/0.35 ((((cA @ sK0) = $true) & ((cB @ sK0) != $true)) | (($true != (cB @ sK1)) & ((cA @ sK1) = $true)) | (cG = $true) | (cG = $true)) & (cG != $true) & ! [X2] : (((cB @ X2) = $true) | ($true != (cA @ X2)))),
% 0.16/0.35 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f8,f10,f9])).
% 0.16/0.35 thf(f9,plain,(
% 0.16/0.35 ? [X0] : (((cA @ X0) = $true) & ((cB @ X0) != $true)) => (((cA @ sK0) = $true) & ((cB @ sK0) != $true))),
% 0.16/0.35 introduced(choice_axiom,[])).
% 0.16/0.35 thf(f10,plain,(
% 0.16/0.35 ? [X1] : (($true != (cB @ X1)) & ((cA @ X1) = $true)) => (($true != (cB @ sK1)) & ((cA @ sK1) = $true))),
% 0.16/0.35 introduced(choice_axiom,[])).
% 0.16/0.35 thf(f8,plain,(
% 0.16/0.35 (? [X0] : (((cA @ X0) = $true) & ((cB @ X0) != $true)) | ? [X1] : (($true != (cB @ X1)) & ((cA @ X1) = $true)) | (cG = $true) | (cG = $true)) & (cG != $true) & ! [X2] : (((cB @ X2) = $true) | ($true != (cA @ X2)))),
% 0.16/0.35 inference(rectify,[],[f7])).
% 0.16/0.35 thf(f7,plain,(
% 0.16/0.35 (? [X1] : (((cA @ X1) = $true) & ($true != (cB @ X1))) | ? [X0] : (((cB @ X0) != $true) & ((cA @ X0) = $true)) | (cG = $true) | (cG = $true)) & (cG != $true) & ! [X2] : (((cB @ X2) = $true) | ($true != (cA @ X2)))),
% 0.16/0.35 inference(flattening,[],[f6])).
% 0.16/0.35 thf(f6,plain,(
% 0.16/0.35 ((cG != $true) & ! [X2] : (((cB @ X2) = $true) | ($true != (cA @ X2)))) & (((cG = $true) | ? [X0] : (((cB @ X0) != $true) & ((cA @ X0) = $true))) | ((cG = $true) | ? [X1] : (((cA @ X1) = $true) & ($true != (cB @ X1)))))),
% 0.16/0.35 inference(ennf_transformation,[],[f5])).
% 0.16/0.35 thf(f5,plain,(
% 0.16/0.35 ~(((! [X0] : (((cA @ X0) = $true) => ((cB @ X0) = $true)) => (cG = $true)) | (! [X1] : (((cA @ X1) = $true) => ($true = (cB @ X1))) => (cG = $true))) => (! [X2] : (($true = (cA @ X2)) => ((cB @ X2) = $true)) => (cG = $true)))),
% 0.16/0.35 inference(fool_elimination,[],[f4])).
% 0.16/0.35 thf(f4,plain,(
% 0.16/0.35 ~(((! [X0] : ((cA @ X0) => (cB @ X0)) => cG) | (! [X1] : ((cA @ X1) => (cB @ X1)) => cG)) => (! [X2] : ((cA @ X2) => (cB @ X2)) => cG))),
% 0.16/0.35 inference(rectify,[],[f2])).
% 0.16/0.35 thf(f2,negated_conjecture,(
% 0.16/0.35 ~(((! [X0] : ((cA @ X0) => (cB @ X0)) => cG) | (! [X0] : ((cA @ X0) => (cB @ X0)) => cG)) => (! [X0] : ((cA @ X0) => (cB @ X0)) => cG))),
% 0.16/0.35 inference(negated_conjecture,[],[f1])).
% 0.16/0.35 thf(f1,conjecture,(
% 0.16/0.35 ((! [X0] : ((cA @ X0) => (cB @ X0)) => cG) | (! [X0] : ((cA @ X0) => (cB @ X0)) => cG)) => (! [X0] : ((cA @ X0) => (cB @ X0)) => cG)),
% 0.16/0.35 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cDUAL_EG2_pme)).
% 0.16/0.35 thf(f50,plain,(
% 0.16/0.35 spl2_3 | ~spl2_5),
% 0.16/0.35 inference(avatar_contradiction_clause,[],[f49])).
% 0.16/0.35 thf(f49,plain,(
% 0.16/0.35 $false | (spl2_3 | ~spl2_5)),
% 0.16/0.35 inference(subsumption_resolution,[],[f48,f33])).
% 0.16/0.35 thf(f33,plain,(
% 0.16/0.35 ($true != (cB @ sK1)) | spl2_3),
% 0.16/0.35 inference(avatar_component_clause,[],[f31])).
% 0.16/0.35 thf(f31,plain,(
% 0.16/0.35 spl2_3 <=> ($true = (cB @ sK1))),
% 0.16/0.35 introduced(avatar_definition,[new_symbols(naming,[spl2_3])])).
% 0.16/0.35 thf(f48,plain,(
% 0.16/0.35 ($true = (cB @ sK1)) | ~spl2_5),
% 0.16/0.35 inference(trivial_inequality_removal,[],[f47])).
% 0.16/0.35 thf(f47,plain,(
% 0.16/0.35 ($true != $true) | ($true = (cB @ sK1)) | ~spl2_5),
% 0.16/0.35 inference(superposition,[],[f12,f44])).
% 0.16/0.35 thf(f44,plain,(
% 0.16/0.35 ((cA @ sK1) = $true) | ~spl2_5),
% 0.16/0.35 inference(avatar_component_clause,[],[f42])).
% 0.16/0.35 thf(f42,plain,(
% 0.16/0.35 spl2_5 <=> ((cA @ sK1) = $true)),
% 0.16/0.35 introduced(avatar_definition,[new_symbols(naming,[spl2_5])])).
% 0.16/0.35 thf(f46,plain,(
% 0.16/0.35 spl2_5 | ~spl2_4 | spl2_2),
% 0.16/0.35 inference(avatar_split_clause,[],[f18,f27,f36,f42])).
% 0.16/0.35 thf(f27,plain,(
% 0.16/0.35 spl2_2 <=> (cG = $true)),
% 0.16/0.35 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.16/0.35 thf(f18,plain,(
% 0.16/0.35 ((cB @ sK0) != $true) | ((cA @ sK1) = $true) | (cG = $true)),
% 0.16/0.35 inference(duplicate_literal_removal,[],[f14])).
% 0.16/0.35 thf(f14,plain,(
% 0.16/0.35 (cG = $true) | ((cB @ sK0) != $true) | ((cA @ sK1) = $true) | (cG = $true)),
% 0.16/0.35 inference(cnf_transformation,[],[f11])).
% 0.16/0.35 thf(f45,plain,(
% 0.16/0.35 spl2_1 | spl2_5 | spl2_2),
% 0.16/0.35 inference(avatar_split_clause,[],[f19,f27,f42,f23])).
% 0.16/0.35 thf(f19,plain,(
% 0.16/0.35 ((cA @ sK1) = $true) | ((cA @ sK0) = $true) | (cG = $true)),
% 0.16/0.35 inference(duplicate_literal_removal,[],[f16])).
% 0.16/0.35 thf(f16,plain,(
% 0.16/0.35 ((cA @ sK1) = $true) | (cG = $true) | ((cA @ sK0) = $true) | (cG = $true)),
% 0.16/0.35 inference(cnf_transformation,[],[f11])).
% 0.16/0.35 thf(f40,plain,(
% 0.16/0.35 ~spl2_2),
% 0.16/0.35 inference(avatar_split_clause,[],[f13,f27])).
% 0.16/0.35 thf(f13,plain,(
% 0.16/0.35 (cG != $true)),
% 0.16/0.35 inference(cnf_transformation,[],[f11])).
% 0.16/0.35 thf(f39,plain,(
% 0.16/0.35 spl2_2 | ~spl2_3 | ~spl2_4),
% 0.16/0.35 inference(avatar_split_clause,[],[f20,f36,f31,f27])).
% 0.16/0.35 thf(f20,plain,(
% 0.16/0.35 (cG = $true) | ((cB @ sK0) != $true) | ($true != (cB @ sK1))),
% 0.16/0.35 inference(duplicate_literal_removal,[],[f15])).
% 0.16/0.35 thf(f15,plain,(
% 0.16/0.35 (cG = $true) | ($true != (cB @ sK1)) | ((cB @ sK0) != $true) | (cG = $true)),
% 0.16/0.35 inference(cnf_transformation,[],[f11])).
% 0.16/0.35 thf(f34,plain,(
% 0.16/0.35 spl2_1 | spl2_2 | ~spl2_3),
% 0.16/0.35 inference(avatar_split_clause,[],[f21,f31,f27,f23])).
% 0.16/0.35 thf(f21,plain,(
% 0.16/0.35 ((cA @ sK0) = $true) | ($true != (cB @ sK1)) | (cG = $true)),
% 0.16/0.35 inference(duplicate_literal_removal,[],[f17])).
% 0.16/0.35 thf(f17,plain,(
% 0.16/0.35 (cG = $true) | ($true != (cB @ sK1)) | ((cA @ sK0) = $true) | (cG = $true)),
% 0.16/0.35 inference(cnf_transformation,[],[f11])).
% 0.16/0.35 % SZS output end Proof for theBenchmark
% 0.16/0.35 % (4790)------------------------------
% 0.16/0.35 % (4790)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.16/0.35 % (4790)Termination reason: Refutation
% 0.16/0.35
% 0.16/0.35 % (4790)Memory used [KB]: 5500
% 0.16/0.35 % (4790)Time elapsed: 0.004 s
% 0.16/0.35 % (4790)Instructions burned: 2 (million)
% 0.16/0.35 % (4790)------------------------------
% 0.16/0.35 % (4790)------------------------------
% 0.16/0.35 % (4782)Success in time 0.028 s
% 0.16/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------