TSTP Solution File: SEV408^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV408^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 : n003.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:41 EDT 2024
% Result : Theorem 0.14s 0.39s
% Output : Refutation 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SEV408^5 : TPTP v8.2.0. Released v4.0.0.
% 0.08/0.15 % 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.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sun May 19 19:16:38 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.14/0.36 This is a TH0_THM_NEQ_NAR problem
% 0.14/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.14/0.38 % (10863)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 (2999ds/4Mi)
% 0.14/0.38 % (10863)First to succeed.
% 0.14/0.39 % (10863)Refutation found. Thanks to Tanya!
% 0.14/0.39 % SZS status Theorem for theBenchmark
% 0.14/0.39 % SZS output start Proof for theBenchmark
% 0.14/0.39 thf(func_def_0, type, cF: ($i > $o) > $o).
% 0.14/0.39 thf(func_def_4, type, sK0: (($i > $o) > $o) > $i > $o).
% 0.14/0.39 thf(func_def_5, type, sK1: ($i > $o) > (($i > $o) > $o) > $i).
% 0.14/0.39 thf(func_def_8, type, ph3: !>[X0: $tType]:(X0)).
% 0.14/0.39 thf(f18,plain,(
% 0.14/0.39 $false),
% 0.14/0.39 inference(trivial_inequality_removal,[],[f17])).
% 0.14/0.39 thf(f17,plain,(
% 0.14/0.39 ($true = $false)),
% 0.14/0.39 inference(beta_eta_normalization,[],[f15])).
% 0.14/0.39 thf(f15,plain,(
% 0.14/0.39 ($true = ((^[Y0 : $i > $o]: ($false)) @ (sK0 @ (^[Y0 : $i > $o]: ($false)))))),
% 0.14/0.39 inference(primitive_instantiation,[],[f12])).
% 0.14/0.39 thf(f12,plain,(
% 0.14/0.39 ( ! [X0 : ($i > $o) > $o] : (($true = (X0 @ (sK0 @ X0)))) )),
% 0.14/0.39 inference(cnf_transformation,[],[f9])).
% 0.14/0.39 thf(f9,plain,(
% 0.14/0.39 ! [X0 : ($i > $o) > $o] : (($true = (X0 @ (sK0 @ X0))) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | (((sK0 @ X0 @ (sK1 @ X2 @ X0)) = $true) & ($true != (X2 @ (sK1 @ X2 @ X0))))))),
% 0.14/0.39 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f6,f8,f7])).
% 0.14/0.39 thf(f7,plain,(
% 0.14/0.39 ! [X0 : ($i > $o) > $o] : (? [X1 : $i > $o] : (((X0 @ X1) = $true) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | ? [X3] : (((X1 @ X3) = $true) & ((X2 @ X3) != $true)))) => (($true = (X0 @ (sK0 @ X0))) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | ? [X3] : (($true = (sK0 @ X0 @ X3)) & ((X2 @ X3) != $true)))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f8,plain,(
% 0.14/0.39 ! [X0 : ($i > $o) > $o,X2 : $i > $o] : (? [X3] : (($true = (sK0 @ X0 @ X3)) & ((X2 @ X3) != $true)) => (((sK0 @ X0 @ (sK1 @ X2 @ X0)) = $true) & ($true != (X2 @ (sK1 @ X2 @ X0)))))),
% 0.14/0.39 introduced(choice_axiom,[])).
% 0.14/0.39 thf(f6,plain,(
% 0.14/0.39 ! [X0 : ($i > $o) > $o] : ? [X1 : $i > $o] : (((X0 @ X1) = $true) & ! [X2 : $i > $o] : (((cF @ X2) != $true) | ? [X3] : (((X1 @ X3) = $true) & ((X2 @ X3) != $true))))),
% 0.14/0.39 inference(ennf_transformation,[],[f5])).
% 0.14/0.39 thf(f5,plain,(
% 0.14/0.39 ~? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : (((X0 @ X1) = $true) => ? [X2 : $i > $o] : (! [X3] : (((X1 @ X3) = $true) => ((X2 @ X3) = $true)) & ((cF @ X2) = $true)))),
% 0.14/0.39 inference(fool_elimination,[],[f4])).
% 0.14/0.39 thf(f4,plain,(
% 0.14/0.39 ~? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : ((X0 @ X1) => ? [X2 : $i > $o] : ((cF @ X2) & ! [X3] : ((X1 @ X3) => (X2 @ X3))))),
% 0.14/0.39 inference(rectify,[],[f2])).
% 0.14/0.39 thf(f2,negated_conjecture,(
% 0.14/0.39 ~? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : ((X0 @ X1) => ? [X2 : $i > $o] : ((cF @ X2) & ! [X3] : ((X1 @ X3) => (X2 @ X3))))),
% 0.14/0.39 inference(negated_conjecture,[],[f1])).
% 0.14/0.39 thf(f1,conjecture,(
% 0.14/0.39 ? [X0 : ($i > $o) > $o] : ! [X1 : $i > $o] : ((X0 @ X1) => ? [X2 : $i > $o] : ((cF @ X2) & ! [X3] : ((X1 @ X3) => (X2 @ X3))))),
% 0.14/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE2_pme)).
% 0.14/0.39 % SZS output end Proof for theBenchmark
% 0.14/0.39 % (10863)------------------------------
% 0.14/0.39 % (10863)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.14/0.39 % (10863)Termination reason: Refutation
% 0.14/0.39
% 0.14/0.39 % (10863)Memory used [KB]: 5500
% 0.14/0.39 % (10863)Time elapsed: 0.003 s
% 0.14/0.39 % (10863)Instructions burned: 2 (million)
% 0.14/0.39 % (10863)------------------------------
% 0.14/0.39 % (10863)------------------------------
% 0.14/0.39 % (10861)Success in time 0.014 s
% 0.14/0.39 % Vampire---4.8 exiting
%------------------------------------------------------------------------------