TSTP Solution File: SWV027+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV027+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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 : 600s
% DateTime : Wed Jul 20 21:41:01 EDT 2022
% Result : Theorem 0.20s 0.52s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SWV027+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.10/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 15 05:26:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.52
% 0.20/0.52 SPASS V 3.9
% 0.20/0.52 SPASS beiseite: Proof found.
% 0.20/0.52 % SZS status Theorem
% 0.20/0.52 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 SPASS derived 6 clauses, backtracked 0 clauses, performed 0 splits and kept 185 clauses.
% 0.20/0.52 SPASS allocated 85907 KBytes.
% 0.20/0.52 SPASS spent 0:00:00.17 on the problem.
% 0.20/0.52 0:00:00.04 for the input.
% 0.20/0.52 0:00:00.08 for the FLOTTER CNF translation.
% 0.20/0.52 0:00:00.00 for inferences.
% 0.20/0.52 0:00:00.00 for the backtracking.
% 0.20/0.52 0:00:00.02 for the reduction.
% 0.20/0.52
% 0.20/0.52
% 0.20/0.52 Here is a proof with depth 0, length 45 :
% 0.20/0.52 % SZS output start Refutation
% 0.20/0.52 1[0:Inp] || -> SkC0*.
% 0.20/0.52 2[0:Inp] || -> SkC1*.
% 0.20/0.52 3[0:Inp] || -> SkC2*.
% 0.20/0.52 4[0:Inp] || -> SkC3*.
% 0.20/0.52 12[0:Inp] || -> equal(init,s_best7_init)**.
% 0.20/0.52 13[0:Inp] || -> equal(init,s_sworst7_init)**.
% 0.20/0.52 14[0:Inp] || -> equal(init,s_worst7_init)**.
% 0.20/0.52 15[0:Inp] || -> leq(n0,s_best7)*r.
% 0.20/0.52 16[0:Inp] || -> leq(n0,s_sworst7)*r.
% 0.20/0.52 17[0:Inp] || -> leq(n0,s_worst7)*r.
% 0.20/0.52 18[0:Inp] || -> leq(n0,pv19)*r.
% 0.20/0.52 19[0:Inp] || -> leq(n0,pv20)*r.
% 0.20/0.52 20[0:Inp] || -> leq(n0,pv1376)*r.
% 0.20/0.52 21[0:Inp] || -> leq(s_best7,n3)*r.
% 0.20/0.52 22[0:Inp] || -> leq(s_sworst7,n3)*r.
% 0.20/0.52 23[0:Inp] || -> leq(s_worst7,n3)*r.
% 0.20/0.52 24[0:Inp] || -> leq(pv1376,n3)*r.
% 0.20/0.52 67[0:Inp] || -> leq(pv19,minus(n410,n1))*r.
% 0.20/0.52 68[0:Inp] || -> leq(pv20,minus(n330,n1))*r.
% 0.20/0.52 93[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 0.20/0.52 95[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1400_init)**.
% 0.20/0.52 96[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1401_init)**.
% 0.20/0.52 97[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1402_init)**.
% 0.20/0.52 181[0:Inp] || equal(init,init) equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.20/0.52 182[0:Inp] || equal(init,pvar1400_init) equal(init,pvar1401_init) equal(init,pvar1402_init) equal(init,init) equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> .
% 0.20/0.52 183[0:Rew:14.0,13.0] || -> equal(s_worst7_init,s_sworst7_init)**.
% 0.20/0.52 184[0:Rew:183.0,14.0] || -> equal(init,s_sworst7_init)**.
% 0.20/0.52 185[0:Rew:12.0,184.0] || -> equal(s_sworst7_init,s_best7_init)**.
% 0.20/0.52 186[0:Rew:185.0,183.0] || -> equal(s_worst7_init,s_best7_init)**.
% 0.20/0.52 200[0:Rew:93.0,68.0] || -> leq(pv20,pred(n330))*r.
% 0.20/0.52 201[0:Rew:93.0,67.0] || -> leq(pv19,pred(n410))*r.
% 0.20/0.52 202[0:Rew:12.0,97.1] || gt(loopcounter,n1) -> equal(pvar1402_init,s_best7_init)**.
% 0.20/0.52 203[0:Rew:12.0,96.1] || gt(loopcounter,n1) -> equal(pvar1401_init,s_best7_init)**.
% 0.20/0.52 204[0:Rew:12.0,95.1] || gt(loopcounter,n1) -> equal(pvar1400_init,s_best7_init)**.
% 0.20/0.52 213[0:Obv:181.0] || equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.20/0.52 214[0:Rew:93.0,213.13,93.0,213.12,12.0,213.2,186.0,213.2,12.0,213.1,185.0,213.1,12.0,213.0] || equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.20/0.52 215[0:Obv:214.2] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> gt(loopcounter,n1).
% 0.20/0.52 216[0:MRR:215.0,215.1,215.2,215.3,215.4,215.5,215.6,215.7,215.8,215.9,215.10,215.11,215.12,215.13,215.14,215.15,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,23.0,201.0,200.0,24.0,1.0,2.0,3.0,4.0] || -> gt(loopcounter,n1)*l.
% 0.20/0.52 217[0:MRR:202.0,216.0] || -> equal(pvar1402_init,s_best7_init)**.
% 0.20/0.52 218[0:MRR:203.0,216.0] || -> equal(pvar1401_init,s_best7_init)**.
% 0.20/0.52 219[0:MRR:204.0,216.0] || -> equal(pvar1400_init,s_best7_init)**.
% 0.20/0.52 220[0:Obv:182.3] || equal(init,pvar1400_init) equal(init,pvar1401_init) equal(init,pvar1402_init) equal(init,s_best7_init) equal(init,s_sworst7_init) equal(init,s_worst7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,minus(n410,n1)) leq(pv20,minus(n330,n1))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> .
% 0.20/0.52 221[0:Rew:93.0,220.16,93.0,220.15,12.0,220.5,186.0,220.5,12.0,220.4,185.0,220.4,12.0,220.3,12.0,220.2,217.0,220.2,12.0,220.1,218.0,220.1,12.0,220.0,219.0,220.0] || equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) equal(s_best7_init,s_best7_init) leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> .
% 0.20/0.52 222[0:Obv:221.5] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(n0,pv19) leq(n0,pv20) leq(n0,pv1376) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) leq(pv19,pred(n410)) leq(pv20,pred(n330))*r leq(pv1376,n3) SkC0 SkC1 SkC2 SkC3 -> .
% 0.20/0.52 223[0:MRR:222.0,222.1,222.2,222.3,222.4,222.5,222.6,222.7,222.8,222.9,222.10,222.11,222.12,222.13,222.14,222.15,15.0,16.0,17.0,18.0,19.0,20.0,21.0,22.0,23.0,201.0,200.0,24.0,1.0,2.0,3.0,4.0] || -> .
% 0.20/0.52 % SZS output end Refutation
% 0.20/0.52 Formulae used in the proof : gauss_init_0021 reflexivity_leq pred_minus_1
% 0.20/0.52
%------------------------------------------------------------------------------