TSTP Solution File: SYO261^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SYO261^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 : 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 09:03:41 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO261^5 : TPTP v8.2.0. Released v4.0.0.
% 0.03/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 : n002.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 10:25:08 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.21/0.37 % (24833)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.37 % (24826)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.37 % (24828)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.21/0.37 % (24831)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.37 % (24833)Instruction limit reached!
% 0.21/0.37 % (24833)------------------------------
% 0.21/0.37 % (24833)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (24833)Termination reason: Unknown
% 0.21/0.37 % (24833)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (24833)Memory used [KB]: 5500
% 0.21/0.37 % (24833)Time elapsed: 0.004 s
% 0.21/0.37 % (24833)Instructions burned: 3 (million)
% 0.21/0.37 % (24833)------------------------------
% 0.21/0.37 % (24833)------------------------------
% 0.21/0.37 % (24828)First to succeed.
% 0.21/0.37 % (24831)Also succeeded, but the first one will report.
% 0.21/0.38 % (24828)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% 0.21/0.38 thf(func_def_1, type, cP: $i > $o).
% 0.21/0.38 thf(func_def_2, type, c1_plus: $i > $i).
% 0.21/0.38 thf(func_def_5, type, vEPSILON: !>[X0: $tType]:((X0 > $o) > X0)).
% 0.21/0.38 thf(func_def_8, type, sK0: ($i > $o) > $i).
% 0.21/0.38 thf(func_def_10, type, ph2: !>[X0: $tType]:(X0)).
% 0.21/0.38 thf(f52,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(avatar_sat_refutation,[],[f28,f43,f46,f50])).
% 0.21/0.38 thf(f50,plain,(
% 0.21/0.38 ~spl1_1),
% 0.21/0.38 inference(avatar_contradiction_clause,[],[f49])).
% 0.21/0.38 thf(f49,plain,(
% 0.21/0.38 $false | ~spl1_1),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f47])).
% 0.21/0.38 thf(f47,plain,(
% 0.21/0.38 ($true != $true) | ~spl1_1),
% 0.21/0.38 inference(superposition,[],[f13,f23])).
% 0.21/0.38 thf(f23,plain,(
% 0.21/0.38 ((cP @ n) = $true) | ~spl1_1),
% 0.21/0.38 inference(avatar_component_clause,[],[f21])).
% 0.21/0.38 thf(f21,plain,(
% 0.21/0.38 spl1_1 <=> ((cP @ n) = $true)),
% 0.21/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_1])])).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 ((cP @ n) != $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f10])).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 ((cP @ cO) = $true) & ! [X0] : (($true != (cP @ X0)) | ($true = (cP @ (c1_plus @ X0)))) & ((cP @ n) != $true) & ! [X1 : $i > $o] : ((($true != (X1 @ (c1_plus @ (sK0 @ X1)))) & ($true = (X1 @ (sK0 @ X1)))) | ($true != (X1 @ cO)) | ($true = (X1 @ n)))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ! [X1 : $i > $o] : (? [X2] : (($true != (X1 @ (c1_plus @ X2))) & ($true = (X1 @ X2))) => (($true != (X1 @ (c1_plus @ (sK0 @ X1)))) & ($true = (X1 @ (sK0 @ X1)))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f8,plain,(
% 0.21/0.38 ((cP @ cO) = $true) & ! [X0] : (($true != (cP @ X0)) | ($true = (cP @ (c1_plus @ X0)))) & ((cP @ n) != $true) & ! [X1 : $i > $o] : (? [X2] : (($true != (X1 @ (c1_plus @ X2))) & ($true = (X1 @ X2))) | ($true != (X1 @ cO)) | ($true = (X1 @ n)))),
% 0.21/0.38 inference(rectify,[],[f7])).
% 0.21/0.38 thf(f7,plain,(
% 0.21/0.38 ((cP @ cO) = $true) & ! [X2] : (($true != (cP @ X2)) | ($true = (cP @ (c1_plus @ X2)))) & ((cP @ n) != $true) & ! [X0 : $i > $o] : (? [X1] : (((X0 @ (c1_plus @ X1)) != $true) & ((X0 @ X1) = $true)) | ((X0 @ cO) != $true) | ((X0 @ n) = $true))),
% 0.21/0.38 inference(flattening,[],[f6])).
% 0.21/0.38 thf(f6,plain,(
% 0.21/0.38 ((cP @ n) != $true) & (((cP @ cO) = $true) & ! [X0 : $i > $o] : (((X0 @ n) = $true) | (((X0 @ cO) != $true) | ? [X1] : (((X0 @ (c1_plus @ X1)) != $true) & ((X0 @ X1) = $true)))) & ! [X2] : (($true != (cP @ X2)) | ($true = (cP @ (c1_plus @ X2)))))),
% 0.21/0.38 inference(ennf_transformation,[],[f5])).
% 0.21/0.38 thf(f5,plain,(
% 0.21/0.38 ~((((cP @ cO) = $true) & ! [X0 : $i > $o] : ((((X0 @ cO) = $true) & ! [X1] : (((X0 @ X1) = $true) => ((X0 @ (c1_plus @ X1)) = $true))) => ((X0 @ n) = $true)) & ! [X2] : (($true = (cP @ X2)) => ($true = (cP @ (c1_plus @ X2))))) => ((cP @ n) = $true))),
% 0.21/0.38 inference(fool_elimination,[],[f4])).
% 0.21/0.38 thf(f4,plain,(
% 0.21/0.38 ~(((cP @ cO) & ! [X0 : $i > $o] : ((! [X1] : ((X0 @ X1) => (X0 @ (c1_plus @ X1))) & (X0 @ cO)) => (X0 @ n)) & ! [X2] : ((cP @ X2) => (cP @ (c1_plus @ X2)))) => (cP @ n))),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,negated_conjecture,(
% 0.21/0.38 ~(((cP @ cO) & ! [X0 : $i > $o] : ((! [X1] : ((X0 @ X1) => (X0 @ (c1_plus @ X1))) & (X0 @ cO)) => (X0 @ n)) & ! [X1] : ((cP @ X1) => (cP @ (c1_plus @ X1)))) => (cP @ n))),
% 0.21/0.38 inference(negated_conjecture,[],[f1])).
% 0.21/0.38 thf(f1,conjecture,(
% 0.21/0.38 ((cP @ cO) & ! [X0 : $i > $o] : ((! [X1] : ((X0 @ X1) => (X0 @ (c1_plus @ X1))) & (X0 @ cO)) => (X0 @ n)) & ! [X1] : ((cP @ X1) => (cP @ (c1_plus @ X1)))) => (cP @ n)),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE_FENG_SV_I1)).
% 0.21/0.38 thf(f46,plain,(
% 0.21/0.38 spl1_3),
% 0.21/0.38 inference(avatar_contradiction_clause,[],[f45])).
% 0.21/0.38 thf(f45,plain,(
% 0.21/0.38 $false | spl1_3),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f44])).
% 0.21/0.38 thf(f44,plain,(
% 0.21/0.38 ($true != $true) | spl1_3),
% 0.21/0.38 inference(superposition,[],[f42,f15])).
% 0.21/0.38 thf(f15,plain,(
% 0.21/0.38 ((cP @ cO) = $true)),
% 0.21/0.38 inference(cnf_transformation,[],[f10])).
% 0.21/0.38 thf(f42,plain,(
% 0.21/0.38 ((cP @ cO) != $true) | spl1_3),
% 0.21/0.38 inference(avatar_component_clause,[],[f40])).
% 0.21/0.38 thf(f40,plain,(
% 0.21/0.38 spl1_3 <=> ((cP @ cO) = $true)),
% 0.21/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_3])])).
% 0.21/0.38 thf(f43,plain,(
% 0.21/0.38 ~spl1_3 | spl1_1 | ~spl1_2),
% 0.21/0.38 inference(avatar_split_clause,[],[f38,f25,f21,f40])).
% 0.21/0.38 thf(f25,plain,(
% 0.21/0.38 spl1_2 <=> ($true = (cP @ (sK0 @ cP)))),
% 0.21/0.38 introduced(avatar_definition,[new_symbols(naming,[spl1_2])])).
% 0.21/0.38 thf(f38,plain,(
% 0.21/0.38 ((cP @ n) = $true) | ((cP @ cO) != $true) | ~spl1_2),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f36])).
% 0.21/0.38 thf(f36,plain,(
% 0.21/0.38 ((cP @ cO) != $true) | ($true != $true) | ((cP @ n) = $true) | ~spl1_2),
% 0.21/0.38 inference(superposition,[],[f12,f32])).
% 0.21/0.38 thf(f32,plain,(
% 0.21/0.38 ($true = (cP @ (c1_plus @ (sK0 @ cP)))) | ~spl1_2),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f31])).
% 0.21/0.38 thf(f31,plain,(
% 0.21/0.38 ($true = (cP @ (c1_plus @ (sK0 @ cP)))) | ($true != $true) | ~spl1_2),
% 0.21/0.38 inference(superposition,[],[f14,f27])).
% 0.21/0.38 thf(f27,plain,(
% 0.21/0.38 ($true = (cP @ (sK0 @ cP))) | ~spl1_2),
% 0.21/0.38 inference(avatar_component_clause,[],[f25])).
% 0.21/0.38 thf(f14,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true != (cP @ X0)) | ($true = (cP @ (c1_plus @ X0)))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f10])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 ( ! [X1 : $i > $o] : (($true != (X1 @ (c1_plus @ (sK0 @ X1)))) | ($true != (X1 @ cO)) | ($true = (X1 @ n))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f10])).
% 0.21/0.38 thf(f28,plain,(
% 0.21/0.38 spl1_1 | spl1_2),
% 0.21/0.38 inference(avatar_split_clause,[],[f19,f25,f21])).
% 0.21/0.38 thf(f19,plain,(
% 0.21/0.38 ((cP @ n) = $true) | ($true = (cP @ (sK0 @ cP)))),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f18])).
% 0.21/0.38 thf(f18,plain,(
% 0.21/0.38 ($true = (cP @ (sK0 @ cP))) | ((cP @ n) = $true) | ($true != $true)),
% 0.21/0.38 inference(superposition,[],[f11,f15])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 ( ! [X1 : $i > $o] : (($true != (X1 @ cO)) | ($true = (X1 @ n)) | ($true = (X1 @ (sK0 @ X1)))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f10])).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (24828)------------------------------
% 0.21/0.38 % (24828)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (24828)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (24828)Memory used [KB]: 5500
% 0.21/0.38 % (24828)Time elapsed: 0.006 s
% 0.21/0.38 % (24828)Instructions burned: 4 (million)
% 0.21/0.38 % (24828)------------------------------
% 0.21/0.38 % (24828)------------------------------
% 0.21/0.38 % (24825)Success in time 0.008 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------