TSTP Solution File: SWV062+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV062+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n017.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:09 EDT 2022
% Result : Theorem 0.21s 0.51s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV062+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n017.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 : 600
% 0.13/0.35 % DateTime : Wed Jun 15 07:41:54 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.51
% 0.21/0.51 SPASS V 3.9
% 0.21/0.51 SPASS beiseite: Proof found.
% 0.21/0.51 % SZS status Theorem
% 0.21/0.51 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.51 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 134 clauses.
% 0.21/0.51 SPASS allocated 85791 KBytes.
% 0.21/0.51 SPASS spent 0:00:00.14 on the problem.
% 0.21/0.51 0:00:00.04 for the input.
% 0.21/0.51 0:00:00.07 for the FLOTTER CNF translation.
% 0.21/0.51 0:00:00.00 for inferences.
% 0.21/0.51 0:00:00.00 for the backtracking.
% 0.21/0.51 0:00:00.01 for the reduction.
% 0.21/0.51
% 0.21/0.51
% 0.21/0.51 Here is a proof with depth 0, length 13 :
% 0.21/0.51 % SZS output start Refutation
% 0.21/0.51 2[0:Inp] || -> leq(n0,pv10)*r.
% 0.21/0.51 3[0:Inp] || -> leq(n0,pv41)*r.
% 0.21/0.51 4[0:Inp] || -> leq(n0,pv43)*r.
% 0.21/0.51 39[0:Inp] || -> leq(pv10,minus(n135300,n1))*r.
% 0.21/0.51 40[0:Inp] || -> leq(pv41,minus(n5,n1))*r.
% 0.21/0.51 41[0:Inp] || -> leq(pv43,minus(n5,n1))*r.
% 0.21/0.51 66[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 0.21/0.51 128[0:Inp] || leq(n0,pv10) leq(n0,pv41) leq(n0,pv43) leq(pv10,minus(n135300,n1)) leq(pv41,minus(n5,n1)) leq(pv43,minus(n5,n1))*r -> .
% 0.21/0.51 161[0:Rew:66.0,41.0] || -> leq(pv43,pred(n5))*r.
% 0.21/0.51 162[0:Rew:66.0,40.0] || -> leq(pv41,pred(n5))*r.
% 0.21/0.51 163[0:Rew:66.0,39.0] || -> leq(pv10,pred(n135300))*r.
% 0.21/0.51 164[0:Rew:66.0,128.5,66.0,128.4,66.0,128.3] || leq(n0,pv10) leq(n0,pv41) leq(n0,pv43) leq(pv10,pred(n135300)) leq(pv41,pred(n5)) leq(pv43,pred(n5))*r -> .
% 0.21/0.51 165[0:MRR:164.0,164.1,164.2,164.3,164.4,164.5,2.0,3.0,4.0,163.0,162.0,161.0] || -> .
% 0.21/0.51 % SZS output end Refutation
% 0.21/0.51 Formulae used in the proof : cl5_nebula_array_0003 pred_minus_1
% 0.21/0.51
%------------------------------------------------------------------------------