TSTP Solution File: SYN057^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYN057^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 : n027.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:39 EDT 2024
% Result : Theorem 0.15s 0.38s
% Output : Refutation 0.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN057^5 : TPTP v8.2.0. Released v4.0.0.
% 0.11/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 : n027.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 : Mon May 20 15:37:23 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.15/0.35 This is a TH0_THM_NEQ_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 % (25728)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 % (25727)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.15/0.37 % (25729)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.15/0.37 % (25727)First to succeed.
% 0.15/0.37 % (25728)Instruction limit reached!
% 0.15/0.37 % (25728)------------------------------
% 0.15/0.37 % (25728)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.37 % (25728)Termination reason: Unknown
% 0.15/0.37 % (25728)Termination phase: Saturation
% 0.15/0.37
% 0.15/0.37 % (25728)Memory used [KB]: 5500
% 0.15/0.37 % (25728)Time elapsed: 0.006 s
% 0.15/0.37 % (25728)Instructions burned: 5 (million)
% 0.15/0.37 % (25728)------------------------------
% 0.15/0.37 % (25728)------------------------------
% 0.15/0.38 % (25729)Also succeeded, but the first one will report.
% 0.15/0.38 % (25727)Refutation found. Thanks to Tanya!
% 0.15/0.38 % SZS status Theorem for theBenchmark
% 0.15/0.38 % SZS output start Proof for theBenchmark
% 0.15/0.38 thf(func_def_0, type, cI: $i > $o).
% 0.15/0.38 thf(func_def_1, type, cJ: $i > $o).
% 0.15/0.38 thf(func_def_2, type, cH: $i > $o).
% 0.15/0.38 thf(func_def_3, type, cG: $i > $o).
% 0.15/0.38 thf(func_def_4, type, cF: $i > $o).
% 0.15/0.38 thf(f42,plain,(
% 0.15/0.38 $false),
% 0.15/0.38 inference(avatar_sat_refutation,[],[f26,f35,f41])).
% 0.15/0.38 thf(f41,plain,(
% 0.15/0.38 ~spl2_1),
% 0.15/0.38 inference(avatar_contradiction_clause,[],[f40])).
% 0.15/0.38 thf(f40,plain,(
% 0.15/0.38 $false | ~spl2_1),
% 0.15/0.38 inference(subsumption_resolution,[],[f39,f16])).
% 0.15/0.38 thf(f16,plain,(
% 0.15/0.38 ($true = (cF @ sK1))),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 thf(f12,plain,(
% 0.15/0.38 (($true = (cJ @ sK0)) & ($true = (cI @ sK0))) & ! [X1] : (($true != (cF @ X1)) | ($true = (cH @ X1))) & (($true = (cF @ sK1)) & ((cG @ sK1) != $true)) & (! [X3] : (((cH @ X3) != $true) | ($true != (cI @ X3))) | ! [X4] : (($true != (cH @ X4)) | ($true = (cG @ X4)))) & ! [X5] : (($true = (cF @ X5)) | ($true != (cJ @ X5)) | ($true != (cI @ X5)))),
% 0.15/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f9,f11,f10])).
% 0.15/0.38 thf(f10,plain,(
% 0.15/0.38 ? [X0] : (((cJ @ X0) = $true) & ((cI @ X0) = $true)) => (($true = (cJ @ sK0)) & ($true = (cI @ sK0)))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f11,plain,(
% 0.15/0.38 ? [X2] : (((cF @ X2) = $true) & ($true != (cG @ X2))) => (($true = (cF @ sK1)) & ((cG @ sK1) != $true))),
% 0.15/0.38 introduced(choice_axiom,[])).
% 0.15/0.38 thf(f9,plain,(
% 0.15/0.38 ? [X0] : (((cJ @ X0) = $true) & ((cI @ X0) = $true)) & ! [X1] : (($true != (cF @ X1)) | ($true = (cH @ X1))) & ? [X2] : (((cF @ X2) = $true) & ($true != (cG @ X2))) & (! [X3] : (((cH @ X3) != $true) | ($true != (cI @ X3))) | ! [X4] : (($true != (cH @ X4)) | ($true = (cG @ X4)))) & ! [X5] : (($true = (cF @ X5)) | ($true != (cJ @ X5)) | ($true != (cI @ X5)))),
% 0.15/0.38 inference(rectify,[],[f8])).
% 0.15/0.38 thf(f8,plain,(
% 0.15/0.38 ? [X5] : (($true = (cJ @ X5)) & ($true = (cI @ X5))) & ! [X4] : (($true != (cF @ X4)) | ($true = (cH @ X4))) & ? [X3] : (($true = (cF @ X3)) & ((cG @ X3) != $true)) & (! [X1] : (($true != (cH @ X1)) | ($true != (cI @ X1))) | ! [X0] : (((cH @ X0) != $true) | ((cG @ X0) = $true))) & ! [X2] : (((cF @ X2) = $true) | ($true != (cJ @ X2)) | ($true != (cI @ X2)))),
% 0.15/0.38 inference(flattening,[],[f7])).
% 0.15/0.38 thf(f7,plain,(
% 0.15/0.38 ? [X5] : (($true = (cJ @ X5)) & ($true = (cI @ X5))) & ((! [X1] : (($true != (cH @ X1)) | ($true != (cI @ X1))) | ! [X0] : (((cH @ X0) != $true) | ((cG @ X0) = $true))) & ? [X3] : (($true = (cF @ X3)) & ((cG @ X3) != $true)) & ! [X4] : (($true != (cF @ X4)) | ($true = (cH @ X4))) & ! [X2] : (((cF @ X2) = $true) | (($true != (cI @ X2)) | ($true != (cJ @ X2)))))),
% 0.15/0.38 inference(ennf_transformation,[],[f6])).
% 0.15/0.38 thf(f6,plain,(
% 0.15/0.38 ~(((? [X0] : (((cG @ X0) != $true) & ((cH @ X0) = $true)) => ! [X1] : (($true = (cI @ X1)) => ($true != (cH @ X1)))) & ? [X3] : (($true = (cF @ X3)) & ((cG @ X3) != $true)) & ! [X4] : (($true = (cF @ X4)) => ($true = (cH @ X4))) & ! [X2] : ((($true = (cI @ X2)) & ($true = (cJ @ X2))) => ((cF @ X2) = $true))) => ! [X5] : (($true = (cJ @ X5)) => ($true != (cI @ X5))))),
% 0.15/0.38 inference(flattening,[],[f5])).
% 0.15/0.38 thf(f5,plain,(
% 0.15/0.38 ~(((? [X0] : (((cH @ X0) = $true) & ~((cG @ X0) = $true)) => ! [X1] : (($true = (cI @ X1)) => ~($true = (cH @ X1)))) & ! [X2] : ((($true = (cI @ X2)) & ($true = (cJ @ X2))) => ((cF @ X2) = $true)) & ? [X3] : (~((cG @ X3) = $true) & ($true = (cF @ X3))) & ! [X4] : (($true = (cF @ X4)) => ($true = (cH @ X4)))) => ! [X5] : (($true = (cJ @ X5)) => ~($true = (cI @ X5))))),
% 0.15/0.38 inference(fool_elimination,[],[f4])).
% 0.15/0.38 thf(f4,plain,(
% 0.15/0.38 ~(((? [X0] : ((cH @ X0) & ~(cG @ X0)) => ! [X1] : ((cI @ X1) => ~(cH @ X1))) & ! [X2] : (((cI @ X2) & (cJ @ X2)) => (cF @ X2)) & ? [X3] : (~(cG @ X3) & (cF @ X3)) & ! [X4] : ((cF @ X4) => (cH @ X4))) => ! [X5] : ((cJ @ X5) => ~(cI @ X5)))),
% 0.15/0.38 inference(rectify,[],[f2])).
% 0.15/0.38 thf(f2,negated_conjecture,(
% 0.15/0.38 ~(((? [X0] : ((cH @ X0) & ~(cG @ X0)) => ! [X0] : ((cI @ X0) => ~(cH @ X0))) & ! [X0] : (((cI @ X0) & (cJ @ X0)) => (cF @ X0)) & ? [X0] : (~(cG @ X0) & (cF @ X0)) & ! [X0] : ((cF @ X0) => (cH @ X0))) => ! [X0] : ((cJ @ X0) => ~(cI @ X0)))),
% 0.15/0.38 inference(negated_conjecture,[],[f1])).
% 0.15/0.38 thf(f1,conjecture,(
% 0.15/0.38 ((? [X0] : ((cH @ X0) & ~(cG @ X0)) => ! [X0] : ((cI @ X0) => ~(cH @ X0))) & ! [X0] : (((cI @ X0) & (cJ @ X0)) => (cF @ X0)) & ? [X0] : (~(cG @ X0) & (cF @ X0)) & ! [X0] : ((cF @ X0) => (cH @ X0))) => ! [X0] : ((cJ @ X0) => ~(cI @ X0))),
% 0.15/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cPELL27)).
% 0.15/0.38 thf(f39,plain,(
% 0.15/0.38 ($true != (cF @ sK1)) | ~spl2_1),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f38])).
% 0.15/0.38 thf(f38,plain,(
% 0.15/0.38 ($true != $true) | ($true != (cF @ sK1)) | ~spl2_1),
% 0.15/0.38 inference(superposition,[],[f37,f17])).
% 0.15/0.38 thf(f17,plain,(
% 0.15/0.38 ( ! [X1 : $i] : (($true = (cH @ X1)) | ($true != (cF @ X1))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 thf(f37,plain,(
% 0.15/0.38 ($true != (cH @ sK1)) | ~spl2_1),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f36])).
% 0.15/0.38 thf(f36,plain,(
% 0.15/0.38 ($true != (cH @ sK1)) | ($true != $true) | ~spl2_1),
% 0.15/0.38 inference(superposition,[],[f15,f22])).
% 0.15/0.38 thf(f22,plain,(
% 0.15/0.38 ( ! [X4 : $i] : (($true = (cG @ X4)) | ($true != (cH @ X4))) ) | ~spl2_1),
% 0.15/0.38 inference(avatar_component_clause,[],[f21])).
% 0.15/0.38 thf(f21,plain,(
% 0.15/0.38 spl2_1 <=> ! [X4] : (($true != (cH @ X4)) | ($true = (cG @ X4)))),
% 0.15/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_1])])).
% 0.15/0.38 thf(f15,plain,(
% 0.15/0.38 ((cG @ sK1) != $true)),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 thf(f35,plain,(
% 0.15/0.38 ~spl2_2),
% 0.15/0.38 inference(avatar_contradiction_clause,[],[f34])).
% 0.15/0.38 thf(f34,plain,(
% 0.15/0.38 $false | ~spl2_2),
% 0.15/0.38 inference(subsumption_resolution,[],[f33,f18])).
% 0.15/0.38 thf(f18,plain,(
% 0.15/0.38 ($true = (cI @ sK0))),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 thf(f33,plain,(
% 0.15/0.38 ($true != (cI @ sK0)) | ~spl2_2),
% 0.15/0.38 inference(subsumption_resolution,[],[f32,f19])).
% 0.15/0.38 thf(f19,plain,(
% 0.15/0.38 ($true = (cJ @ sK0))),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 thf(f32,plain,(
% 0.15/0.38 ($true != (cJ @ sK0)) | ($true != (cI @ sK0)) | ~spl2_2),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f31])).
% 0.15/0.38 thf(f31,plain,(
% 0.15/0.38 ($true != (cI @ sK0)) | ($true != $true) | ($true != (cJ @ sK0)) | ~spl2_2),
% 0.15/0.38 inference(superposition,[],[f30,f13])).
% 0.15/0.38 thf(f13,plain,(
% 0.15/0.38 ( ! [X5 : $i] : (($true = (cF @ X5)) | ($true != (cI @ X5)) | ($true != (cJ @ X5))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 thf(f30,plain,(
% 0.15/0.38 ((cF @ sK0) != $true) | ~spl2_2),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f29])).
% 0.15/0.38 thf(f29,plain,(
% 0.15/0.38 ($true != $true) | ((cF @ sK0) != $true) | ~spl2_2),
% 0.15/0.38 inference(superposition,[],[f28,f17])).
% 0.15/0.38 thf(f28,plain,(
% 0.15/0.38 ((cH @ sK0) != $true) | ~spl2_2),
% 0.15/0.38 inference(trivial_inequality_removal,[],[f27])).
% 0.15/0.38 thf(f27,plain,(
% 0.15/0.38 ($true != $true) | ((cH @ sK0) != $true) | ~spl2_2),
% 0.15/0.38 inference(superposition,[],[f25,f18])).
% 0.15/0.38 thf(f25,plain,(
% 0.15/0.38 ( ! [X3 : $i] : (($true != (cI @ X3)) | ((cH @ X3) != $true)) ) | ~spl2_2),
% 0.15/0.38 inference(avatar_component_clause,[],[f24])).
% 0.15/0.38 thf(f24,plain,(
% 0.15/0.38 spl2_2 <=> ! [X3] : (((cH @ X3) != $true) | ($true != (cI @ X3)))),
% 0.15/0.38 introduced(avatar_definition,[new_symbols(naming,[spl2_2])])).
% 0.15/0.38 thf(f26,plain,(
% 0.15/0.38 spl2_1 | spl2_2),
% 0.15/0.38 inference(avatar_split_clause,[],[f14,f24,f21])).
% 0.15/0.38 thf(f14,plain,(
% 0.15/0.38 ( ! [X3 : $i,X4 : $i] : (($true != (cH @ X4)) | ($true = (cG @ X4)) | ((cH @ X3) != $true) | ($true != (cI @ X3))) )),
% 0.15/0.38 inference(cnf_transformation,[],[f12])).
% 0.15/0.38 % SZS output end Proof for theBenchmark
% 0.15/0.38 % (25727)------------------------------
% 0.15/0.38 % (25727)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.15/0.38 % (25727)Termination reason: Refutation
% 0.15/0.38
% 0.15/0.38 % (25727)Memory used [KB]: 5500
% 0.15/0.38 % (25727)Time elapsed: 0.006 s
% 0.15/0.38 % (25727)Instructions burned: 3 (million)
% 0.15/0.38 % (25727)------------------------------
% 0.15/0.38 % (25727)------------------------------
% 0.15/0.38 % (25726)Success in time 0.019 s
% 0.15/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------