TSTP Solution File: SEU894^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEU894^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 : n006.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 03:52:06 EDT 2024
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU894^5 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.13 % 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.34 % Computer : n006.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 : Sun May 19 17:50:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/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.20/0.37 % (23130)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.20/0.37 % (23130)First to succeed.
% 0.20/0.37 % (23130)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% 0.20/0.37 thf(func_def_5, type, sK0: $i > $i).
% 0.20/0.37 thf(func_def_6, type, sK1: (($i > $i) > $o) > $i > $i).
% 0.20/0.37 thf(func_def_7, type, sK2: ($i > $i) > $i).
% 0.20/0.37 thf(func_def_10, type, ph4: !>[X0: $tType]:(X0)).
% 0.20/0.37 thf(f22,plain,(
% 0.20/0.37 $false),
% 0.20/0.37 inference(trivial_inequality_removal,[],[f21])).
% 0.20/0.37 thf(f21,plain,(
% 0.20/0.37 ((sK2 @ sK0) != (sK2 @ sK0))),
% 0.20/0.37 inference(superposition,[],[f16,f14])).
% 0.20/0.37 thf(f14,plain,(
% 0.20/0.37 ( ! [X1 : $i > $i] : (((X1 @ (sK2 @ X1)) = (sK2 @ X1))) )),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 thf(f13,plain,(
% 0.20/0.37 ! [X1 : $i > $i] : (! [X2 : ($i > $i) > $o] : ((($true = (X2 @ (sK1 @ X2))) & ($true != (X2 @ (^[Y0 : $i]: (sK0 @ (sK1 @ X2 @ Y0)))))) | ($true != (X2 @ sK0)) | ((X2 @ X1) = $true)) & ! [X4] : ((sK0 @ X4) != X4) & (! [X6] : (((X1 @ X6) != X6) | ((sK2 @ X1) = X6)) & ((X1 @ (sK2 @ X1)) = (sK2 @ X1))))),
% 0.20/0.37 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f9,f12,f11,f10])).
% 0.20/0.37 thf(f10,plain,(
% 0.20/0.37 ? [X0 : $i > $i] : ! [X1 : $i > $i] : (! [X2 : ($i > $i) > $o] : (? [X3 : $i > $i] : (((X2 @ X3) = $true) & ((X2 @ (^[Y0 : $i]: (X0 @ (X3 @ Y0)))) != $true)) | ((X2 @ X0) != $true) | ((X2 @ X1) = $true)) & ! [X4] : ((X0 @ X4) != X4) & ? [X5] : (! [X6] : (((X1 @ X6) != X6) | (X5 = X6)) & ((X1 @ X5) = X5))) => ! [X1 : $i > $i] : (! [X2 : ($i > $i) > $o] : (? [X3 : $i > $i] : (((X2 @ X3) = $true) & ($true != (X2 @ (^[Y0 : $i]: (sK0 @ (X3 @ Y0)))))) | ($true != (X2 @ sK0)) | ((X2 @ X1) = $true)) & ! [X4] : ((sK0 @ X4) != X4) & ? [X5] : (! [X6] : (((X1 @ X6) != X6) | (X5 = X6)) & ((X1 @ X5) = X5)))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f11,plain,(
% 0.20/0.37 ! [X2 : ($i > $i) > $o] : (? [X3 : $i > $i] : (((X2 @ X3) = $true) & ($true != (X2 @ (^[Y0 : $i]: (sK0 @ (X3 @ Y0)))))) => (($true = (X2 @ (sK1 @ X2))) & ($true != (X2 @ (^[Y0 : $i]: (sK0 @ (sK1 @ X2 @ Y0)))))))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f12,plain,(
% 0.20/0.37 ! [X1 : $i > $i] : (? [X5] : (! [X6] : (((X1 @ X6) != X6) | (X5 = X6)) & ((X1 @ X5) = X5)) => (! [X6] : (((X1 @ X6) != X6) | ((sK2 @ X1) = X6)) & ((X1 @ (sK2 @ X1)) = (sK2 @ X1))))),
% 0.20/0.37 introduced(choice_axiom,[])).
% 0.20/0.37 thf(f9,plain,(
% 0.20/0.37 ? [X0 : $i > $i] : ! [X1 : $i > $i] : (! [X2 : ($i > $i) > $o] : (? [X3 : $i > $i] : (((X2 @ X3) = $true) & ((X2 @ (^[Y0 : $i]: (X0 @ (X3 @ Y0)))) != $true)) | ((X2 @ X0) != $true) | ((X2 @ X1) = $true)) & ! [X4] : ((X0 @ X4) != X4) & ? [X5] : (! [X6] : (((X1 @ X6) != X6) | (X5 = X6)) & ((X1 @ X5) = X5)))),
% 0.20/0.37 inference(rectify,[],[f8])).
% 0.20/0.37 thf(f8,plain,(
% 0.20/0.37 ? [X0 : $i > $i] : ! [X1 : $i > $i] : (! [X2 : ($i > $i) > $o] : (? [X3 : $i > $i] : (((X2 @ X3) = $true) & ((X2 @ (^[Y0 : $i]: (X0 @ (X3 @ Y0)))) != $true)) | ((X2 @ X0) != $true) | ((X2 @ X1) = $true)) & ! [X6] : ((X0 @ X6) != X6) & ? [X4] : (! [X5] : (((X1 @ X5) != X5) | (X4 = X5)) & ((X1 @ X4) = X4)))),
% 0.20/0.37 inference(flattening,[],[f7])).
% 0.20/0.37 thf(f7,plain,(
% 0.20/0.37 ? [X0 : $i > $i] : ! [X1 : $i > $i] : (! [X6] : ((X0 @ X6) != X6) & (! [X2 : ($i > $i) > $o] : (((X2 @ X1) = $true) | (? [X3 : $i > $i] : (((X2 @ X3) = $true) & ((X2 @ (^[Y0 : $i]: (X0 @ (X3 @ Y0)))) != $true)) | ((X2 @ X0) != $true))) & ? [X4] : (! [X5] : (((X1 @ X5) != X5) | (X4 = X5)) & ((X1 @ X4) = X4))))),
% 0.20/0.37 inference(ennf_transformation,[],[f6])).
% 0.20/0.37 thf(f6,plain,(
% 0.20/0.37 ~! [X0 : $i > $i] : ? [X1 : $i > $i] : ((! [X2 : ($i > $i) > $o] : ((! [X3 : $i > $i] : (((X2 @ X3) = $true) => ((X2 @ (^[Y0 : $i]: (X0 @ (X3 @ Y0)))) = $true)) & ((X2 @ X0) = $true)) => ((X2 @ X1) = $true)) & ? [X4] : (! [X5] : (((X1 @ X5) = X5) => (X4 = X5)) & ((X1 @ X4) = X4))) => ? [X6] : ((X0 @ X6) = X6))),
% 0.20/0.37 inference(rectify,[],[f5])).
% 0.20/0.37 thf(f5,plain,(
% 0.20/0.37 ~! [X0 : $i > $i] : ? [X1 : $i > $i] : ((! [X2 : ($i > $i) > $o] : ((! [X3 : $i > $i] : (((X2 @ X3) = $true) => ((X2 @ (^[Y0 : $i]: (X0 @ (X3 @ Y0)))) = $true)) & ((X2 @ X0) = $true)) => ((X2 @ X1) = $true)) & ? [X5] : (((X1 @ X5) = X5) & ! [X6] : (((X1 @ X6) = X6) => (X5 = X6)))) => ? [X7] : ((X0 @ X7) = X7))),
% 0.20/0.37 inference(fool_elimination,[],[f4])).
% 0.20/0.37 thf(f4,plain,(
% 0.20/0.37 ~! [X0 : $i > $i] : ? [X1 : $i > $i] : ((! [X2 : ($i > $i) > $o] : (((X2 @ X0) & ! [X3 : $i > $i] : ((X2 @ X3) => (X2 @ (^[X4 : $i] : (X0 @ (X3 @ X4)))))) => (X2 @ X1)) & ? [X5] : (((X1 @ X5) = X5) & ! [X6] : (((X1 @ X6) = X6) => (X5 = X6)))) => ? [X7] : ((X0 @ X7) = X7))),
% 0.20/0.37 inference(rectify,[],[f2])).
% 0.20/0.37 thf(f2,negated_conjecture,(
% 0.20/0.37 ~! [X0 : $i > $i] : ? [X1 : $i > $i] : ((! [X2 : ($i > $i) > $o] : (((X2 @ X0) & ! [X3 : $i > $i] : ((X2 @ X3) => (X2 @ (^[X4 : $i] : (X0 @ (X3 @ X4)))))) => (X2 @ X1)) & ? [X5] : (((X1 @ X5) = X5) & ! [X6] : (((X1 @ X6) = X6) => (X5 = X6)))) => ? [X6] : ((X0 @ X6) = X6))),
% 0.20/0.37 inference(negated_conjecture,[],[f1])).
% 0.20/0.37 thf(f1,conjecture,(
% 0.20/0.37 ! [X0 : $i > $i] : ? [X1 : $i > $i] : ((! [X2 : ($i > $i) > $o] : (((X2 @ X0) & ! [X3 : $i > $i] : ((X2 @ X3) => (X2 @ (^[X4 : $i] : (X0 @ (X3 @ X4)))))) => (X2 @ X1)) & ? [X5] : (((X1 @ X5) = X5) & ! [X6] : (((X1 @ X6) = X6) => (X5 = X6)))) => ? [X6] : ((X0 @ X6) = X6))),
% 0.20/0.37 file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM15_0_pme)).
% 0.20/0.37 thf(f16,plain,(
% 0.20/0.37 ( ! [X4 : $i] : (((sK0 @ X4) != X4)) )),
% 0.20/0.37 inference(cnf_transformation,[],[f13])).
% 0.20/0.37 % SZS output end Proof for theBenchmark
% 0.20/0.37 % (23130)------------------------------
% 0.20/0.37 % (23130)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.20/0.37 % (23130)Termination reason: Refutation
% 0.20/0.37
% 0.20/0.37 % (23130)Memory used [KB]: 5500
% 0.20/0.37 % (23130)Time elapsed: 0.004 s
% 0.20/0.37 % (23130)Instructions burned: 2 (million)
% 0.20/0.37 % (23130)------------------------------
% 0.20/0.37 % (23130)------------------------------
% 0.20/0.37 % (23124)Success in time 0.022 s
% 0.20/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------