TSTP Solution File: SWV038+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV038+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n005.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:04 EDT 2022

% Result   : Theorem 0.19s 0.51s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SWV038+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n005.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 15 21:02:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.51  
% 0.19/0.51  SPASS V 3.9 
% 0.19/0.51  SPASS beiseite: Proof found.
% 0.19/0.51  % SZS status Theorem
% 0.19/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.19/0.51  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 167 clauses.
% 0.19/0.51  SPASS allocated 85834 KBytes.
% 0.19/0.51  SPASS spent	0:00:00.17 on the problem.
% 0.19/0.51  		0:00:00.04 for the input.
% 0.19/0.51  		0:00:00.09 for the FLOTTER CNF translation.
% 0.19/0.51  		0:00:00.00 for inferences.
% 0.19/0.51  		0:00:00.00 for the backtracking.
% 0.19/0.51  		0:00:00.02 for the reduction.
% 0.19/0.51  
% 0.19/0.51  
% 0.19/0.51  Here is a proof with depth 0, length 40 :
% 0.19/0.51  % SZS output start Refutation
% 0.19/0.51  1[0:Inp] ||  -> SkC1*.
% 0.19/0.51  2[0:Inp] ||  -> SkC2*.
% 0.19/0.51  3[0:Inp] ||  -> SkC3*.
% 0.19/0.51  4[0:Inp] ||  -> SkC4*.
% 0.19/0.51  5[0:Inp] ||  -> true__dfg*.
% 0.19/0.51  11[0:Inp] ||  -> equal(init,s_best7_init)**.
% 0.19/0.51  12[0:Inp] ||  -> equal(init,s_sworst7_init)**.
% 0.19/0.51  13[0:Inp] ||  -> equal(init,s_worst7_init)**.
% 0.19/0.51  14[0:Inp] ||  -> leq(n0,s_best7)*l.
% 0.19/0.51  15[0:Inp] ||  -> leq(n0,s_sworst7)*l.
% 0.19/0.51  16[0:Inp] ||  -> leq(n0,s_worst7)*l.
% 0.19/0.51  17[0:Inp] ||  -> leq(s_best7,n3)*r.
% 0.19/0.51  18[0:Inp] ||  -> leq(s_sworst7,n3)*r.
% 0.19/0.51  19[0:Inp] ||  -> leq(s_worst7,n3)*r.
% 0.19/0.51  74[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1400_init)**.
% 0.19/0.51  75[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1401_init)**.
% 0.19/0.51  76[0:Inp] || gt(loopcounter,n1) -> equal(init,pvar1402_init)**.
% 0.19/0.51  87[0:Inp] || true__dfg equal(init,init) SkC0* -> .
% 0.19/0.51  159[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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> gt(loopcounter,n1) SkC0*.
% 0.19/0.51  163[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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> SkC0*.
% 0.19/0.51  164[0:Rew:13.0,12.0] ||  -> equal(s_worst7_init,s_sworst7_init)**.
% 0.19/0.51  165[0:Rew:164.0,13.0] ||  -> equal(init,s_sworst7_init)**.
% 0.19/0.51  166[0:Rew:11.0,165.0] ||  -> equal(s_sworst7_init,s_best7_init)**.
% 0.19/0.51  167[0:Rew:166.0,164.0] ||  -> equal(s_worst7_init,s_best7_init)**.
% 0.19/0.51  177[0:Obv:87.1] || true__dfg SkC0* -> .
% 0.19/0.51  178[0:MRR:177.0,5.0] || SkC0* -> .
% 0.19/0.51  185[0:Rew:11.0,76.1] || gt(loopcounter,n1) -> equal(pvar1402_init,s_best7_init)**.
% 0.19/0.51  186[0:Rew:11.0,75.1] || gt(loopcounter,n1) -> equal(pvar1401_init,s_best7_init)**.
% 0.19/0.51  187[0:Rew:11.0,74.1] || gt(loopcounter,n1) -> equal(pvar1400_init,s_best7_init)**.
% 0.19/0.51  196[0:Obv:159.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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> gt(loopcounter,n1) SkC0*.
% 0.19/0.51  197[0:Rew:11.0,196.2,167.0,196.2,11.0,196.1,166.0,196.1,11.0,196.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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> gt(loopcounter,n1) SkC0*.
% 0.19/0.51  198[0:Obv:197.2] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> gt(loopcounter,n1) SkC0*.
% 0.19/0.51  199[0:MRR:198.0,198.1,198.2,198.3,198.4,198.5,198.6,198.7,198.8,198.9,198.11,14.0,15.0,16.0,17.0,18.0,19.0,1.0,2.0,3.0,4.0,178.0] ||  -> gt(loopcounter,n1)*l.
% 0.19/0.51  200[0:MRR:185.0,199.0] ||  -> equal(pvar1402_init,s_best7_init)**.
% 0.19/0.51  201[0:MRR:186.0,199.0] ||  -> equal(pvar1401_init,s_best7_init)**.
% 0.19/0.51  202[0:MRR:187.0,199.0] ||  -> equal(pvar1400_init,s_best7_init)**.
% 0.19/0.51  203[0:Obv:163.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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> SkC0*.
% 0.19/0.51  204[0:Rew:11.0,203.5,167.0,203.5,11.0,203.4,166.0,203.4,11.0,203.3,11.0,203.2,200.0,203.2,11.0,203.1,201.0,203.1,11.0,203.0,202.0,203.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(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> SkC0*.
% 0.19/0.51  205[0:Obv:204.5] || leq(n0,s_best7) leq(n0,s_sworst7) leq(n0,s_worst7) leq(s_best7,n3) leq(s_sworst7,n3) leq(s_worst7,n3) SkC1 SkC2 SkC3 SkC4 -> SkC0*.
% 0.19/0.51  206[0:MRR:205.0,205.1,205.2,205.3,205.4,205.5,205.6,205.7,205.8,205.9,205.10,14.0,15.0,16.0,17.0,18.0,19.0,1.0,2.0,3.0,4.0,178.0] ||  -> .
% 0.19/0.51  % SZS output end Refutation
% 0.19/0.51  Formulae used in the proof : gauss_init_0065 reflexivity_leq leq_succ_succ ttrue
% 0.19/0.51  
%------------------------------------------------------------------------------