TSTP Solution File: SWV151+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:27 EDT 2022
% Result : Theorem 0.21s 0.53s
% Output : Refutation 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV151+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.12/0.14 % Command : run_spass %d %s
% 0.13/0.35 % Computer : n016.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 11:13:17 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.21/0.53
% 0.21/0.53 SPASS V 3.9
% 0.21/0.53 SPASS beiseite: Proof found.
% 0.21/0.53 % SZS status Theorem
% 0.21/0.53 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.53 SPASS derived 186 clauses, backtracked 0 clauses, performed 0 splits and kept 152 clauses.
% 0.21/0.53 SPASS allocated 85786 KBytes.
% 0.21/0.53 SPASS spent 0:00:00.17 on the problem.
% 0.21/0.53 0:00:00.04 for the input.
% 0.21/0.53 0:00:00.07 for the FLOTTER CNF translation.
% 0.21/0.53 0:00:00.00 for inferences.
% 0.21/0.53 0:00:00.00 for the backtracking.
% 0.21/0.53 0:00:00.01 for the reduction.
% 0.21/0.53
% 0.21/0.53
% 0.21/0.53 Here is a proof with depth 1, length 15 :
% 0.21/0.53 % SZS output start Refutation
% 0.21/0.53 2[0:Inp] || -> leq(n0,skc1)*r.
% 0.21/0.53 3[0:Inp] || -> leq(skc1,tptp_minus_1)*l.
% 0.21/0.53 27[0:Inp] || gt(u,u)* -> .
% 0.21/0.53 29[0:Inp] || -> equal(succ(tptp_minus_1),n0)**.
% 0.21/0.53 70[0:Inp] || leq(u,v)* -> leq(u,succ(v))*.
% 0.21/0.53 71[0:Inp] || leq(u,v)* -> gt(succ(v),u)*.
% 0.21/0.53 96[0:Inp] || leq(u,n0)* leq(n0,u)* -> equal(u,n0).
% 0.21/0.53 168[0:Res:3.0,70.0] || -> leq(skc1,succ(tptp_minus_1))*r.
% 0.21/0.53 169[0:Res:3.0,71.0] || -> gt(succ(tptp_minus_1),skc1)*l.
% 0.21/0.53 227[0:Res:2.0,96.0] || leq(skc1,n0)*l -> equal(skc1,n0).
% 0.21/0.53 321[0:Rew:29.0,168.0] || -> leq(skc1,n0)*l.
% 0.21/0.53 322[0:Rew:29.0,169.0] || -> gt(n0,skc1)*r.
% 0.21/0.53 325[0:MRR:227.0,321.0] || -> equal(skc1,n0)**.
% 0.21/0.53 332[0:Rew:325.0,322.0] || -> gt(n0,n0)*.
% 0.21/0.53 340[0:MRR:332.0,27.0] || -> .
% 0.21/0.53 % SZS output end Refutation
% 0.21/0.53 Formulae used in the proof : cl5_nebula_norm_0001 irreflexivity_gt succ_tptp_minus_1 leq_succ leq_succ_gt_equiv finite_domain_0
% 0.21/0.53
%------------------------------------------------------------------------------