TSTP Solution File: SYN059^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN059^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/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n022.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 08:20:41 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN059^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.13 % 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.13/0.34 % Computer : n022.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 13:53:37 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34 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.13/0.36 % (19615)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 (3000ds/27Mi)
% 0.13/0.36 % (19614)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.13/0.36 % (19620)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.13/0.36 % (19613)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.13/0.36 % (19616)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.13/0.36 % (19617)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.13/0.36 % (19618)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.13/0.36 % (19619)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.13/0.36 % (19616)Instruction limit reached!
% 0.13/0.36 % (19616)------------------------------
% 0.13/0.36 % (19616)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (19616)Termination reason: Unknown
% 0.13/0.36 % (19616)Termination phase: Saturation
% 0.13/0.36 % (19617)Instruction limit reached!
% 0.13/0.36 % (19617)------------------------------
% 0.13/0.36 % (19617)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (19617)Termination reason: Unknown
% 0.13/0.36 % (19617)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (19617)Memory used [KB]: 895
% 0.13/0.36 % (19617)Time elapsed: 0.003 s
% 0.13/0.36 % (19617)Instructions burned: 2 (million)
% 0.13/0.36 % (19617)------------------------------
% 0.13/0.36 % (19617)------------------------------
% 0.13/0.36
% 0.13/0.36 % (19616)Memory used [KB]: 1023
% 0.13/0.36 % (19616)Time elapsed: 0.003 s
% 0.13/0.36 % (19616)Instructions burned: 2 (million)
% 0.13/0.36 % (19616)------------------------------
% 0.13/0.36 % (19616)------------------------------
% 0.13/0.36 % (19620)Instruction limit reached!
% 0.13/0.36 % (19620)------------------------------
% 0.13/0.36 % (19620)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (19620)Termination reason: Unknown
% 0.13/0.36 % (19620)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (19620)Memory used [KB]: 5500
% 0.13/0.36 % (19620)Time elapsed: 0.005 s
% 0.13/0.36 % (19620)Instructions burned: 3 (million)
% 0.13/0.36 % (19620)------------------------------
% 0.13/0.36 % (19620)------------------------------
% 0.13/0.36 % (19614)Instruction limit reached!
% 0.13/0.36 % (19614)------------------------------
% 0.13/0.36 % (19614)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (19614)Termination reason: Unknown
% 0.13/0.36 % (19614)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (19614)Memory used [KB]: 5500
% 0.13/0.36 % (19614)Time elapsed: 0.005 s
% 0.13/0.36 % (19614)Instructions burned: 4 (million)
% 0.13/0.36 % (19614)------------------------------
% 0.13/0.36 % (19614)------------------------------
% 0.13/0.36 % (19613)First to succeed.
% 0.13/0.37 % (19615)Also succeeded, but the first one will report.
% 0.13/0.37 % (19618)Also succeeded, but the first one will report.
% 0.13/0.37 % (19613)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for theBenchmark
% 0.13/0.37 % SZS output start Proof for theBenchmark
% 0.13/0.37 thf(func_def_0, type, cJ: $i > $o).
% 0.13/0.37 thf(func_def_1, type, cG: $i > $o).
% 0.13/0.37 thf(func_def_2, type, cH: $i > $o).
% 0.13/0.37 thf(func_def_3, type, cF: $i > $o).
% 0.13/0.37 thf(f96,plain,(
% 0.13/0.37 $false),
% 0.13/0.37 inference(avatar_sat_refutation,[],[f37,f42,f47,f56,f60,f65,f69,f78,f82,f85,f91,f95])).
% 0.13/0.37 thf(f95,plain,(
% 0.13/0.37 spl6_5 | ~spl6_7 | ~spl6_11),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f94])).
% 0.13/0.37 thf(f94,plain,(
% 0.13/0.37 $false | (spl6_5 | ~spl6_7 | ~spl6_11)),
% 0.13/0.37 inference(subsumption_resolution,[],[f93,f77])).
% 0.13/0.37 thf(f77,plain,(
% 0.13/0.37 ((cF @ sK1) = $true) | ~spl6_11),
% 0.13/0.37 inference(avatar_component_clause,[],[f75])).
% 0.13/0.37 thf(f75,plain,(
% 0.13/0.37 spl6_11 <=> ((cF @ sK1) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_11])])).
% 0.13/0.37 thf(f93,plain,(
% 0.13/0.37 ((cF @ sK1) != $true) | (spl6_5 | ~spl6_7)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f92])).
% 0.13/0.37 thf(f92,plain,(
% 0.13/0.37 ($true != $true) | ((cF @ sK1) != $true) | (spl6_5 | ~spl6_7)),
% 0.13/0.37 inference(superposition,[],[f51,f59])).
% 0.13/0.37 thf(f59,plain,(
% 0.13/0.37 ( ! [X0 : $i] : (((cH @ X0) = $true) | ((cF @ X0) != $true)) ) | ~spl6_7),
% 0.13/0.37 inference(avatar_component_clause,[],[f58])).
% 0.13/0.37 thf(f58,plain,(
% 0.13/0.37 spl6_7 <=> ! [X0] : (((cF @ X0) != $true) | ((cH @ X0) = $true))),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_7])])).
% 0.13/0.37 thf(f51,plain,(
% 0.13/0.37 ((cH @ sK1) != $true) | spl6_5),
% 0.13/0.37 inference(avatar_component_clause,[],[f49])).
% 0.13/0.37 thf(f49,plain,(
% 0.13/0.37 spl6_5 <=> ((cH @ sK1) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_5])])).
% 0.13/0.37 thf(f91,plain,(
% 0.13/0.37 ~spl6_2 | ~spl6_4 | spl6_6),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f90])).
% 0.13/0.37 thf(f90,plain,(
% 0.13/0.37 $false | (~spl6_2 | ~spl6_4 | spl6_6)),
% 0.13/0.37 inference(subsumption_resolution,[],[f89,f46])).
% 0.13/0.37 thf(f46,plain,(
% 0.13/0.37 ((cG @ sK2) = $true) | ~spl6_4),
% 0.13/0.37 inference(avatar_component_clause,[],[f44])).
% 0.13/0.37 thf(f44,plain,(
% 0.13/0.37 spl6_4 <=> ((cG @ sK2) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_4])])).
% 0.13/0.37 thf(f89,plain,(
% 0.13/0.37 ((cG @ sK2) != $true) | (~spl6_2 | spl6_6)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f87])).
% 0.13/0.37 thf(f87,plain,(
% 0.13/0.37 ($true != $true) | ((cG @ sK2) != $true) | (~spl6_2 | spl6_6)),
% 0.13/0.37 inference(superposition,[],[f55,f36])).
% 0.13/0.37 thf(f36,plain,(
% 0.13/0.37 ( ! [X3 : $i] : (((cJ @ X3) = $true) | ((cG @ X3) != $true)) ) | ~spl6_2),
% 0.13/0.37 inference(avatar_component_clause,[],[f35])).
% 0.13/0.37 thf(f35,plain,(
% 0.13/0.37 spl6_2 <=> ! [X3] : (((cG @ X3) != $true) | ((cJ @ X3) = $true))),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_2])])).
% 0.13/0.37 thf(f55,plain,(
% 0.13/0.37 ((cJ @ sK2) != $true) | spl6_6),
% 0.13/0.37 inference(avatar_component_clause,[],[f53])).
% 0.13/0.37 thf(f53,plain,(
% 0.13/0.37 spl6_6 <=> ((cJ @ sK2) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_6])])).
% 0.13/0.37 thf(f85,plain,(
% 0.13/0.37 ~spl6_9),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f84])).
% 0.13/0.37 thf(f84,plain,(
% 0.13/0.37 $false | ~spl6_9),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f83])).
% 0.13/0.37 thf(f83,plain,(
% 0.13/0.37 ($true != $true) | ~spl6_9),
% 0.13/0.37 inference(superposition,[],[f68,f29])).
% 0.13/0.37 thf(f29,plain,(
% 0.13/0.37 ((cF @ sK3) = $true)),
% 0.13/0.37 inference(cnf_transformation,[],[f18])).
% 0.13/0.37 thf(f18,plain,(
% 0.13/0.37 ((cF @ sK3) = $true) & ((cG @ sK4) = $true) & (($true = sP0) | ((((cG @ sK5) = $true) & ((cJ @ sK5) != $true)) & ! [X3,X4] : (((cF @ X4) != $true) | (((cJ @ X3) = $true) & ((cH @ X4) = $true)) | ((cG @ X3) != $true))))),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4,sK5])],[f14,f17,f16,f15])).
% 0.13/0.37 thf(f15,plain,(
% 0.13/0.37 ? [X0] : ((cF @ X0) = $true) => ((cF @ sK3) = $true)),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f16,plain,(
% 0.13/0.37 ? [X1] : ((cG @ X1) = $true) => ((cG @ sK4) = $true)),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f17,plain,(
% 0.13/0.37 ? [X2] : (((cG @ X2) = $true) & ((cJ @ X2) != $true)) => (((cG @ sK5) = $true) & ((cJ @ sK5) != $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f14,plain,(
% 0.13/0.37 ? [X0] : ((cF @ X0) = $true) & ? [X1] : ((cG @ X1) = $true) & (($true = sP0) | (? [X2] : (((cG @ X2) = $true) & ((cJ @ X2) != $true)) & ! [X3,X4] : (((cF @ X4) != $true) | (((cJ @ X3) = $true) & ((cH @ X4) = $true)) | ((cG @ X3) != $true))))),
% 0.13/0.37 inference(rectify,[],[f9])).
% 0.13/0.37 thf(f9,plain,(
% 0.13/0.37 ? [X1] : ($true = (cF @ X1)) & ? [X0] : ((cG @ X0) = $true) & (($true = sP0) | (? [X8] : (((cG @ X8) = $true) & ((cJ @ X8) != $true)) & ! [X7,X6] : (((cF @ X6) != $true) | (((cJ @ X7) = $true) & ((cH @ X6) = $true)) | ((cG @ X7) != $true))))),
% 0.13/0.37 inference(definition_folding,[],[f7,f8])).
% 0.13/0.37 thf(f8,plain,(
% 0.13/0.37 (! [X2] : (((cF @ X2) != $true) | ((cH @ X2) = $true)) & ? [X5,X4] : (((cF @ X5) = $true) & (((cH @ X5) != $true) | ((cJ @ X4) != $true)) & ((cG @ X4) = $true)) & ! [X3] : (((cJ @ X3) = $true) | ((cG @ X3) != $true))) | ~($true = sP0)),
% 0.13/0.37 introduced(predicate_definition_introduction,[new_symbols(naming,[=])])).
% 0.13/0.37 thf(f7,plain,(
% 0.13/0.37 ? [X1] : ($true = (cF @ X1)) & ? [X0] : ((cG @ X0) = $true) & ((! [X2] : (((cF @ X2) != $true) | ((cH @ X2) = $true)) & ? [X5,X4] : (((cF @ X5) = $true) & (((cH @ X5) != $true) | ((cJ @ X4) != $true)) & ((cG @ X4) = $true)) & ! [X3] : (((cJ @ X3) = $true) | ((cG @ X3) != $true))) | (? [X8] : (((cG @ X8) = $true) & ((cJ @ X8) != $true)) & ! [X7,X6] : (((cF @ X6) != $true) | (((cJ @ X7) = $true) & ((cH @ X6) = $true)) | ((cG @ X7) != $true))))),
% 0.13/0.37 inference(flattening,[],[f6])).
% 0.13/0.37 thf(f6,plain,(
% 0.13/0.37 ((? [X8] : (((cG @ X8) = $true) & ((cJ @ X8) != $true)) & ! [X6,X7] : ((((cJ @ X7) = $true) & ((cH @ X6) = $true)) | (((cG @ X7) != $true) | ((cF @ X6) != $true)))) | (? [X5,X4] : ((((cH @ X5) != $true) | ((cJ @ X4) != $true)) & (((cF @ X5) = $true) & ((cG @ X4) = $true))) & (! [X3] : (((cJ @ X3) = $true) | ((cG @ X3) != $true)) & ! [X2] : (((cF @ X2) != $true) | ((cH @ X2) = $true))))) & (? [X1] : ($true = (cF @ X1)) & ? [X0] : ((cG @ X0) = $true))),
% 0.13/0.37 inference(ennf_transformation,[],[f5])).
% 0.13/0.37 thf(f5,plain,(
% 0.13/0.37 ~((? [X1] : ($true = (cF @ X1)) & ? [X0] : ((cG @ X0) = $true)) => ((! [X6,X7] : ((((cG @ X7) = $true) & ((cF @ X6) = $true)) => (((cJ @ X7) = $true) & ((cH @ X6) = $true))) => ! [X8] : (((cG @ X8) = $true) => ((cJ @ X8) = $true))) & ((! [X3] : (((cG @ X3) = $true) => ((cJ @ X3) = $true)) & ! [X2] : (((cF @ X2) = $true) => ((cH @ X2) = $true))) => ! [X5,X4] : ((((cF @ X5) = $true) & ((cG @ X4) = $true)) => (((cJ @ X4) = $true) & ((cH @ X5) = $true))))))),
% 0.13/0.37 inference(fool_elimination,[],[f4])).
% 0.13/0.37 thf(f4,plain,(
% 0.13/0.37 ~((? [X0] : (cG @ X0) & ? [X1] : (cF @ X1)) => (((! [X2] : ((cF @ X2) => (cH @ X2)) & ! [X3] : ((cG @ X3) => (cJ @ X3))) => ! [X4,X5] : (((cF @ X5) & (cG @ X4)) => ((cJ @ X4) & (cH @ X5)))) & (! [X6,X7] : (((cG @ X7) & (cF @ X6)) => ((cJ @ X7) & (cH @ X6))) => ! [X8] : ((cG @ X8) => (cJ @ X8)))))),
% 0.13/0.37 inference(rectify,[],[f2])).
% 0.13/0.37 thf(f2,negated_conjecture,(
% 0.13/0.37 ~((? [X0] : (cG @ X0) & ? [X0] : (cF @ X0)) => (((! [X0] : ((cF @ X0) => (cH @ X0)) & ! [X0] : ((cG @ X0) => (cJ @ X0))) => ! [X1,X0] : (((cF @ X0) & (cG @ X1)) => ((cJ @ X1) & (cH @ X0)))) & (! [X0,X1] : (((cG @ X1) & (cF @ X0)) => ((cJ @ X1) & (cH @ X0))) => ! [X0] : ((cG @ X0) => (cJ @ X0)))))),
% 0.13/0.37 inference(negated_conjecture,[],[f1])).
% 0.13/0.37 thf(f1,conjecture,(
% 0.13/0.37 (? [X0] : (cG @ X0) & ? [X0] : (cF @ X0)) => (((! [X0] : ((cF @ X0) => (cH @ X0)) & ! [X0] : ((cG @ X0) => (cJ @ X0))) => ! [X1,X0] : (((cF @ X0) & (cG @ X1)) => ((cJ @ X1) & (cH @ X0)))) & (! [X0,X1] : (((cG @ X1) & (cF @ X0)) => ((cJ @ X1) & (cH @ X0))) => ! [X0] : ((cG @ X0) => (cJ @ X0))))),
% 0.13/0.37 file('/export/starexec/sandbox/benchmark/theBenchmark.p',cPELL29)).
% 0.13/0.37 thf(f68,plain,(
% 0.13/0.37 ( ! [X4 : $i] : (((cF @ X4) != $true)) ) | ~spl6_9),
% 0.13/0.37 inference(avatar_component_clause,[],[f67])).
% 0.13/0.37 thf(f67,plain,(
% 0.13/0.37 spl6_9 <=> ! [X4] : ((cF @ X4) != $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_9])])).
% 0.13/0.37 thf(f82,plain,(
% 0.13/0.37 ~spl6_2 | ~spl6_3 | spl6_8),
% 0.13/0.37 inference(avatar_contradiction_clause,[],[f81])).
% 0.13/0.37 thf(f81,plain,(
% 0.13/0.37 $false | (~spl6_2 | ~spl6_3 | spl6_8)),
% 0.13/0.37 inference(subsumption_resolution,[],[f80,f41])).
% 0.13/0.37 thf(f41,plain,(
% 0.13/0.37 ((cG @ sK5) = $true) | ~spl6_3),
% 0.13/0.37 inference(avatar_component_clause,[],[f39])).
% 0.13/0.37 thf(f39,plain,(
% 0.13/0.37 spl6_3 <=> ((cG @ sK5) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_3])])).
% 0.13/0.37 thf(f80,plain,(
% 0.13/0.37 ((cG @ sK5) != $true) | (~spl6_2 | spl6_8)),
% 0.13/0.37 inference(trivial_inequality_removal,[],[f79])).
% 0.13/0.37 thf(f79,plain,(
% 0.13/0.37 ((cG @ sK5) != $true) | ($true != $true) | (~spl6_2 | spl6_8)),
% 0.13/0.37 inference(superposition,[],[f64,f36])).
% 0.13/0.37 thf(f64,plain,(
% 0.13/0.37 ((cJ @ sK5) != $true) | spl6_8),
% 0.13/0.37 inference(avatar_component_clause,[],[f62])).
% 0.13/0.37 thf(f62,plain,(
% 0.13/0.37 spl6_8 <=> ((cJ @ sK5) = $true)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_8])])).
% 0.13/0.37 thf(f78,plain,(
% 0.13/0.37 ~spl6_1 | spl6_11),
% 0.13/0.37 inference(avatar_split_clause,[],[f22,f75,f31])).
% 0.13/0.37 thf(f31,plain,(
% 0.13/0.37 spl6_1 <=> ($true = sP0)),
% 0.13/0.37 introduced(avatar_definition,[new_symbols(naming,[spl6_1])])).
% 0.13/0.37 thf(f22,plain,(
% 0.13/0.37 ((cF @ sK1) = $true) | ($true != sP0)),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f13,plain,(
% 0.13/0.37 (! [X0] : (((cF @ X0) != $true) | ((cH @ X0) = $true)) & (((cF @ sK1) = $true) & (((cH @ sK1) != $true) | ((cJ @ sK2) != $true)) & ((cG @ sK2) = $true)) & ! [X3] : (((cJ @ X3) = $true) | ((cG @ X3) != $true))) | ($true != sP0)),
% 0.13/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK1,sK2])],[f11,f12])).
% 0.13/0.37 thf(f12,plain,(
% 0.13/0.37 ? [X1,X2] : (($true = (cF @ X1)) & (((cH @ X1) != $true) | ((cJ @ X2) != $true)) & ((cG @ X2) = $true)) => (((cF @ sK1) = $true) & (((cH @ sK1) != $true) | ((cJ @ sK2) != $true)) & ((cG @ sK2) = $true))),
% 0.13/0.37 introduced(choice_axiom,[])).
% 0.13/0.37 thf(f11,plain,(
% 0.13/0.37 (! [X0] : (((cF @ X0) != $true) | ((cH @ X0) = $true)) & ? [X1,X2] : (($true = (cF @ X1)) & (((cH @ X1) != $true) | ((cJ @ X2) != $true)) & ((cG @ X2) = $true)) & ! [X3] : (((cJ @ X3) = $true) | ((cG @ X3) != $true))) | ($true != sP0)),
% 0.13/0.37 inference(rectify,[],[f10])).
% 0.13/0.37 thf(f10,plain,(
% 0.13/0.37 (! [X2] : (((cF @ X2) != $true) | ((cH @ X2) = $true)) & ? [X5,X4] : (((cF @ X5) = $true) & (((cH @ X5) != $true) | ((cJ @ X4) != $true)) & ((cG @ X4) = $true)) & ! [X3] : (((cJ @ X3) = $true) | ((cG @ X3) != $true))) | ($true != sP0)),
% 0.13/0.37 inference(nnf_transformation,[],[f8])).
% 0.13/0.37 thf(f69,plain,(
% 0.13/0.37 spl6_2 | spl6_1 | spl6_9),
% 0.13/0.37 inference(avatar_split_clause,[],[f25,f67,f31,f35])).
% 0.13/0.37 thf(f25,plain,(
% 0.13/0.37 ( ! [X3 : $i,X4 : $i] : (((cF @ X4) != $true) | ((cJ @ X3) = $true) | ((cG @ X3) != $true) | ($true = sP0)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f18])).
% 0.13/0.37 thf(f65,plain,(
% 0.13/0.37 ~spl6_8 | spl6_1),
% 0.13/0.37 inference(avatar_split_clause,[],[f26,f31,f62])).
% 0.13/0.37 thf(f26,plain,(
% 0.13/0.37 ((cJ @ sK5) != $true) | ($true = sP0)),
% 0.13/0.37 inference(cnf_transformation,[],[f18])).
% 0.13/0.37 thf(f60,plain,(
% 0.13/0.37 spl6_7 | ~spl6_1),
% 0.13/0.37 inference(avatar_split_clause,[],[f23,f31,f58])).
% 0.13/0.37 thf(f23,plain,(
% 0.13/0.37 ( ! [X0 : $i] : (($true != sP0) | ((cF @ X0) != $true) | ((cH @ X0) = $true)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f56,plain,(
% 0.13/0.37 ~spl6_5 | ~spl6_6 | ~spl6_1),
% 0.13/0.37 inference(avatar_split_clause,[],[f21,f31,f53,f49])).
% 0.13/0.37 thf(f21,plain,(
% 0.13/0.37 ((cH @ sK1) != $true) | ((cJ @ sK2) != $true) | ($true != sP0)),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f47,plain,(
% 0.13/0.37 ~spl6_1 | spl6_4),
% 0.13/0.37 inference(avatar_split_clause,[],[f20,f44,f31])).
% 0.13/0.37 thf(f20,plain,(
% 0.13/0.37 ((cG @ sK2) = $true) | ($true != sP0)),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 thf(f42,plain,(
% 0.13/0.37 spl6_1 | spl6_3),
% 0.13/0.37 inference(avatar_split_clause,[],[f27,f39,f31])).
% 0.13/0.37 thf(f27,plain,(
% 0.13/0.37 ((cG @ sK5) = $true) | ($true = sP0)),
% 0.13/0.37 inference(cnf_transformation,[],[f18])).
% 0.13/0.37 thf(f37,plain,(
% 0.13/0.37 ~spl6_1 | spl6_2),
% 0.13/0.37 inference(avatar_split_clause,[],[f19,f35,f31])).
% 0.13/0.37 thf(f19,plain,(
% 0.13/0.37 ( ! [X3 : $i] : (((cG @ X3) != $true) | ((cJ @ X3) = $true) | ($true != sP0)) )),
% 0.13/0.37 inference(cnf_transformation,[],[f13])).
% 0.13/0.37 % SZS output end Proof for theBenchmark
% 0.13/0.37 % (19613)------------------------------
% 0.13/0.37 % (19613)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (19613)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (19613)Memory used [KB]: 5500
% 0.13/0.37 % (19613)Time elapsed: 0.007 s
% 0.13/0.37 % (19613)Instructions burned: 4 (million)
% 0.13/0.37 % (19613)------------------------------
% 0.13/0.37 % (19613)------------------------------
% 0.13/0.37 % (19612)Success in time 0.01 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------