TSTP Solution File: SWV067+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV067+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n013.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:10 EDT 2022
% Result : Theorem 0.64s 0.86s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV067+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.11/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n013.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 : Tue Jun 14 21:23:14 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.64/0.86
% 0.64/0.86 SPASS V 3.9
% 0.64/0.86 SPASS beiseite: Proof found.
% 0.64/0.86 % SZS status Theorem
% 0.64/0.86 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.64/0.86 SPASS derived 2091 clauses, backtracked 155 clauses, performed 3 splits and kept 959 clauses.
% 0.64/0.86 SPASS allocated 87407 KBytes.
% 0.64/0.86 SPASS spent 0:00:00.50 on the problem.
% 0.64/0.86 0:00:00.04 for the input.
% 0.64/0.86 0:00:00.08 for the FLOTTER CNF translation.
% 0.64/0.86 0:00:00.02 for inferences.
% 0.64/0.86 0:00:00.01 for the backtracking.
% 0.64/0.86 0:00:00.28 for the reduction.
% 0.64/0.86
% 0.64/0.86
% 0.64/0.86 Here is a proof with depth 1, length 19 :
% 0.64/0.86 % SZS output start Refutation
% 0.64/0.86 2[0:Inp] || -> leq(n0,pv10)*r.
% 0.64/0.86 3[0:Inp] || -> leq(n1,pv63)*r.
% 0.64/0.86 17[0:Inp] || -> gt(n1,n0)*l.
% 0.64/0.86 38[0:Inp] || -> leq(pv10,minus(n135300,n1))*r.
% 0.64/0.86 39[0:Inp] || -> leq(pv63,minus(n5,n1))*r.
% 0.64/0.86 64[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 0.64/0.86 71[0:Inp] || gt(u,v)* -> leq(v,u).
% 0.64/0.86 105[0:Inp] || leq(n0,pv10) leq(pv10,minus(n135300,n1))*r -> SkC0.
% 0.64/0.86 108[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 0.64/0.86 121[0:Inp] || leq(n0,pv10) leq(pv10,minus(n135300,n1)) leq(n0,pv63) leq(pv63,minus(n5,n1))*r SkC0 -> .
% 0.64/0.86 161[0:Rew:64.0,39.0] || -> leq(pv63,pred(n5))*r.
% 0.64/0.86 162[0:Rew:64.0,38.0] || -> leq(pv10,pred(n135300))*r.
% 0.64/0.86 163[0:Rew:64.0,105.1] || leq(n0,pv10) leq(pv10,pred(n135300))*r -> SkC0.
% 0.64/0.86 164[0:MRR:163.0,163.1,2.0,162.0] || -> SkC0*.
% 0.64/0.86 165[0:Rew:64.0,121.3,64.0,121.1] || leq(n0,pv10) leq(pv10,pred(n135300)) leq(n0,pv63) leq(pv63,pred(n5))*r SkC0 -> .
% 0.64/0.86 166[0:MRR:165.0,165.1,165.3,165.4,2.0,162.0,161.0,164.0] || leq(n0,pv63)*r -> .
% 0.64/0.86 956[0:NCh:108.2,108.1,166.0,3.0] || leq(n0,n1)*r -> .
% 0.64/0.86 3012[0:Res:17.0,71.0] || -> leq(n0,n1)*r.
% 0.64/0.86 3158[0:MRR:3012.0,956.0] || -> .
% 0.64/0.86 % SZS output end Refutation
% 0.64/0.86 Formulae used in the proof : cl5_nebula_array_0008 gt_1_0 pred_minus_1 leq_gt1 transitivity_leq
% 0.64/0.86
%------------------------------------------------------------------------------