TSTP Solution File: SEV391^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV391^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 : n013.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:39 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 : SEV391^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.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 19:07:08 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.13/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.36 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.38 % (19351)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.38 % (19350)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.21/0.38 % (19352)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (3000ds/2Mi)
% 0.21/0.38 % (19353)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.21/0.38 % (19349)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.38 % (19355)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (3000ds/18Mi)
% 0.21/0.38 % (19353)Instruction limit reached!
% 0.21/0.38 % (19353)------------------------------
% 0.21/0.38 % (19353)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19353)Termination reason: Unknown
% 0.21/0.38 % (19353)Termination phase: Saturation
% 0.21/0.38
% 0.21/0.38 % (19353)Memory used [KB]: 895
% 0.21/0.38 % (19353)Time elapsed: 0.003 s
% 0.21/0.38 % (19353)Instructions burned: 2 (million)
% 0.21/0.38 % (19353)------------------------------
% 0.21/0.38 % (19353)------------------------------
% 0.21/0.38 % (19352)First to succeed.
% 0.21/0.38 % (19351)Also succeeded, but the first one will report.
% 0.21/0.38 % (19354)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.38 % (19349)Also succeeded, but the first one will report.
% 0.21/0.38 % (19352)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_0, type, cP: $i > $i > $i > $o).
% 0.21/0.38 thf(func_def_1, type, k: $i > $i).
% 0.21/0.38 thf(func_def_2, type, h: $i > $i).
% 0.21/0.38 thf(func_def_7, type, sK0: $i > $i).
% 0.21/0.38 thf(f13,plain,(
% 0.21/0.38 $false),
% 0.21/0.38 inference(trivial_inequality_removal,[],[f12])).
% 0.21/0.38 thf(f12,plain,(
% 0.21/0.38 ($true != $true)),
% 0.21/0.38 inference(superposition,[],[f10,f11])).
% 0.21/0.38 thf(f11,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true = (cP @ a @ (h @ (sK0 @ X0)) @ (sK0 @ X0)))) )),
% 0.21/0.38 inference(subsumption_resolution,[],[f9,f10])).
% 0.21/0.38 thf(f9,plain,(
% 0.21/0.38 ( ! [X0 : $i] : (($true = (cP @ X0 @ (k @ (sK0 @ X0)) @ (sK0 @ X0))) | ($true = (cP @ a @ (h @ (sK0 @ X0)) @ (sK0 @ X0)))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f8])).
% 0.21/0.38 thf(f8,plain,(
% 0.21/0.38 ! [X0] : ! [X2] : (($true != (cP @ X0 @ X2 @ (sK0 @ X0))) & (($true = (cP @ a @ (h @ (sK0 @ X0)) @ (sK0 @ X0))) | ($true = (cP @ X0 @ (k @ (sK0 @ X0)) @ (sK0 @ X0)))))),
% 0.21/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f6,f7])).
% 0.21/0.38 thf(f7,plain,(
% 0.21/0.38 ! [X0] : (? [X1] : ! [X2] : (((cP @ X0 @ X2 @ X1) != $true) & (((cP @ a @ (h @ X1) @ X1) = $true) | ((cP @ X0 @ (k @ X1) @ X1) = $true))) => ! [X2] : (($true != (cP @ X0 @ X2 @ (sK0 @ X0))) & (($true = (cP @ a @ (h @ (sK0 @ X0)) @ (sK0 @ X0))) | ($true = (cP @ X0 @ (k @ (sK0 @ X0)) @ (sK0 @ X0))))))),
% 0.21/0.38 introduced(choice_axiom,[])).
% 0.21/0.38 thf(f6,plain,(
% 0.21/0.38 ! [X0] : ? [X1] : ! [X2] : (((cP @ X0 @ X2 @ X1) != $true) & (((cP @ a @ (h @ X1) @ X1) = $true) | ((cP @ X0 @ (k @ X1) @ X1) = $true)))),
% 0.21/0.38 inference(ennf_transformation,[],[f5])).
% 0.21/0.38 thf(f5,plain,(
% 0.21/0.38 ~? [X0] : ! [X1] : ? [X2] : ((((cP @ a @ (h @ X1) @ X1) = $true) | ((cP @ X0 @ (k @ X1) @ X1) = $true)) => ((cP @ X0 @ X2 @ X1) = $true))),
% 0.21/0.38 inference(fool_elimination,[],[f4])).
% 0.21/0.38 thf(f4,plain,(
% 0.21/0.38 ~? [X0] : ! [X1] : ? [X2] : (((cP @ a @ (h @ X1) @ X1) | (cP @ X0 @ (k @ X1) @ X1)) => (cP @ X0 @ X2 @ X1))),
% 0.21/0.38 inference(rectify,[],[f2])).
% 0.21/0.38 thf(f2,negated_conjecture,(
% 0.21/0.38 ~? [X0] : ! [X1] : ? [X2] : (((cP @ a @ (h @ X1) @ X1) | (cP @ X0 @ (k @ X1) @ X1)) => (cP @ X0 @ X2 @ X1))),
% 0.21/0.38 inference(negated_conjecture,[],[f1])).
% 0.21/0.38 thf(f1,conjecture,(
% 0.21/0.38 ? [X0] : ! [X1] : ? [X2] : (((cP @ a @ (h @ X1) @ X1) | (cP @ X0 @ (k @ X1) @ X1)) => (cP @ X0 @ X2 @ X1))),
% 0.21/0.38 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM87_pme)).
% 0.21/0.38 thf(f10,plain,(
% 0.21/0.38 ( ! [X2 : $i,X0 : $i] : (($true != (cP @ X0 @ X2 @ (sK0 @ X0)))) )),
% 0.21/0.38 inference(cnf_transformation,[],[f8])).
% 0.21/0.38 % SZS output end Proof for theBenchmark
% 0.21/0.38 % (19352)------------------------------
% 0.21/0.38 % (19352)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (19352)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (19352)Memory used [KB]: 5500
% 0.21/0.38 % (19352)Time elapsed: 0.004 s
% 0.21/0.38 % (19352)Instructions burned: 1 (million)
% 0.21/0.38 % (19352)------------------------------
% 0.21/0.38 % (19352)------------------------------
% 0.21/0.38 % (19348)Success in time 0.006 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------