TSTP Solution File: SWV064+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV064+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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.20s 0.50s
% Output : Refutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SWV064+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.08/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n009.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 : 600
% 0.13/0.34 % DateTime : Wed Jun 15 21:31:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.20/0.50
% 0.20/0.50 SPASS V 3.9
% 0.20/0.50 SPASS beiseite: Proof found.
% 0.20/0.50 % SZS status Theorem
% 0.20/0.50 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50 SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 141 clauses.
% 0.20/0.50 SPASS allocated 85792 KBytes.
% 0.20/0.50 SPASS spent 0:00:00.15 on the problem.
% 0.20/0.50 0:00:00.04 for the input.
% 0.20/0.50 0:00:00.07 for the FLOTTER CNF translation.
% 0.20/0.50 0:00:00.00 for inferences.
% 0.20/0.50 0:00:00.00 for the backtracking.
% 0.20/0.50 0:00:00.01 for the reduction.
% 0.20/0.50
% 0.20/0.50
% 0.20/0.50 Here is a proof with depth 0, length 14 :
% 0.20/0.50 % SZS output start Refutation
% 0.20/0.50 2[0:Inp] || -> leq(n0,pv10)*r.
% 0.20/0.50 3[0:Inp] || -> leq(n0,pv53)*r.
% 0.20/0.50 4[0:Inp] || -> leq(n0,pv54)*r.
% 0.20/0.50 33[0:Inp] || -> leq(u,u)*.
% 0.20/0.50 39[0:Inp] || -> leq(pv10,minus(n135300,n1))*r.
% 0.20/0.50 40[0:Inp] || -> leq(pv53,minus(n5,n1))*r.
% 0.20/0.50 41[0:Inp] || -> leq(pv54,minus(n5,n1))*r.
% 0.20/0.50 66[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 0.20/0.50 135[0:Inp] || leq(n0,n0) leq(n0,pv10) leq(n0,pv53) leq(n0,pv54) leq(pv10,minus(n135300,n1)) leq(pv53,minus(n5,n1)) leq(pv54,minus(n5,n1))*r -> .
% 0.20/0.50 161[0:Rew:66.0,41.0] || -> leq(pv54,pred(n5))*r.
% 0.20/0.50 162[0:Rew:66.0,40.0] || -> leq(pv53,pred(n5))*r.
% 0.20/0.50 163[0:Rew:66.0,39.0] || -> leq(pv10,pred(n135300))*r.
% 0.20/0.50 164[0:Rew:66.0,135.6,66.0,135.5,66.0,135.4] || leq(n0,n0) leq(n0,pv10) leq(n0,pv53) leq(n0,pv54) leq(pv10,pred(n135300)) leq(pv53,pred(n5)) leq(pv54,pred(n5))*r -> .
% 0.20/0.50 165[0:MRR:164.0,164.1,164.2,164.3,164.4,164.5,164.6,33.0,2.0,3.0,4.0,163.0,162.0,161.0] || -> .
% 0.20/0.50 % SZS output end Refutation
% 0.20/0.50 Formulae used in the proof : cl5_nebula_array_0005 reflexivity_leq pred_minus_1
% 0.20/0.50
%------------------------------------------------------------------------------