TSTP Solution File: SWV114+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV114+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n010.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:20 EDT 2022
% Result : Theorem 1.14s 1.37s
% Output : Refutation 1.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV114+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n010.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 18:02:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.14/1.37
% 1.14/1.37 SPASS V 3.9
% 1.14/1.37 SPASS beiseite: Proof found.
% 1.14/1.37 % SZS status Theorem
% 1.14/1.37 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.14/1.37 SPASS derived 2976 clauses, backtracked 397 clauses, performed 5 splits and kept 1657 clauses.
% 1.14/1.37 SPASS allocated 88556 KBytes.
% 1.14/1.37 SPASS spent 0:00:01.00 on the problem.
% 1.14/1.37 0:00:00.04 for the input.
% 1.14/1.37 0:00:00.08 for the FLOTTER CNF translation.
% 1.14/1.37 0:00:00.02 for inferences.
% 1.14/1.37 0:00:00.01 for the backtracking.
% 1.14/1.37 0:00:00.69 for the reduction.
% 1.14/1.37
% 1.14/1.37
% 1.14/1.37 Here is a proof with depth 4, length 48 :
% 1.14/1.37 % SZS output start Refutation
% 1.14/1.37 1[0:Inp] || -> SkC0*.
% 1.14/1.37 2[0:Inp] || -> SkC1*.
% 1.14/1.37 3[0:Inp] || -> SkC2*.
% 1.14/1.37 9[0:Inp] || -> leq(n0,skc8)*r.
% 1.14/1.37 10[0:Inp] || -> leq(n0,pv5)*r.
% 1.14/1.37 48[0:Inp] || -> equal(succ(n0),n1)**.
% 1.14/1.37 49[0:Inp] || gt(u,u)* -> .
% 1.14/1.37 50[0:Inp] || -> gt(succ(u),u)*l.
% 1.14/1.37 51[0:Inp] || -> equal(succ(tptp_minus_1),n0)**.
% 1.14/1.37 56[0:Inp] || -> leq(pv5,minus(n999,n1))*r.
% 1.14/1.37 74[0:Inp] || -> equal(pred(succ(u)),u)**.
% 1.14/1.37 75[0:Inp] || -> equal(succ(pred(u)),u)**.
% 1.14/1.37 81[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 1.14/1.37 97[0:Inp] || leq(u,v)*+ -> gt(succ(v),u)*.
% 1.14/1.37 118[0:Inp] || leq(u,v)* -> gt(v,u) equal(u,v).
% 1.14/1.37 123[0:Inp] || gt(u,v)* gt(v,w)* -> gt(u,w)*.
% 1.14/1.37 128[0:Inp] || leq(u,n1)* leq(n0,u) -> equal(u,n1) equal(u,n0).
% 1.14/1.37 137[0:Inp] || leq(n0,pv5) leq(pv5,minus(n999,n1))*r SkC0 SkC1 SkC2 -> leq(skc8,minus(n0,n1)).
% 1.14/1.37 184[0:Rew:81.0,56.0] || -> leq(pv5,pred(n999))*r.
% 1.14/1.37 190[0:Rew:81.0,137.5,81.0,137.1] || leq(n0,pv5) leq(pv5,pred(n999))*r SkC0 SkC1 SkC2 -> leq(skc8,pred(n0)).
% 1.14/1.37 191[0:MRR:190.0,190.1,190.2,190.3,190.4,10.0,184.0,1.0,2.0,3.0] || -> leq(skc8,pred(n0))*r.
% 1.14/1.37 342[0:Res:9.0,128.0] || leq(skc8,n1)*l -> equal(skc8,n1) equal(skc8,n0).
% 1.14/1.37 375[0:Res:9.0,118.0] || -> gt(skc8,n0)*l equal(skc8,n0).
% 1.14/1.37 500[1:Spt:342.1] || -> equal(skc8,n1)**.
% 1.14/1.37 567[1:Rew:500.0,191.0] || -> leq(n1,pred(n0))*r.
% 1.14/1.37 822[0:SpR:51.0,74.0] || -> equal(pred(n0),tptp_minus_1)**.
% 1.14/1.37 1151[0:SpR:75.0,50.0] || -> gt(u,pred(u))*r.
% 1.14/1.37 1760[0:NCh:123.2,123.1,1151.0,49.0] || gt(pred(u),u)*l -> .
% 1.14/1.37 2367[0:SpL:74.0,1760.0] || gt(u,succ(u))*r -> .
% 1.14/1.37 3472[1:Rew:822.0,567.0] || -> leq(n1,tptp_minus_1)*r.
% 1.14/1.37 3677[0:SpL:48.0,2367.0] || gt(n0,n1)*r -> .
% 1.14/1.37 4218[1:Res:3472.0,97.0] || -> gt(succ(tptp_minus_1),n1)*l.
% 1.14/1.37 4228[1:Rew:51.0,4218.0] || -> gt(n0,n1)*r.
% 1.14/1.37 4229[1:MRR:4228.0,3677.0] || -> .
% 1.14/1.37 4232[1:Spt:4229.0,342.1,500.0] || equal(skc8,n1)** -> .
% 1.14/1.37 4233[1:Spt:4229.0,342.0,342.2] || leq(skc8,n1)*l -> equal(skc8,n0).
% 1.14/1.37 4234[0:Rew:822.0,191.0] || -> leq(skc8,tptp_minus_1)*l.
% 1.14/1.37 4399[2:Spt:375.1] || -> equal(skc8,n0)**.
% 1.14/1.37 4403[2:Rew:4399.0,4234.0] || -> leq(n0,tptp_minus_1)*r.
% 1.14/1.37 4540[2:Res:4403.0,97.0] || -> gt(succ(tptp_minus_1),n0)*l.
% 1.14/1.37 4549[2:Rew:51.0,4540.0] || -> gt(n0,n0)*.
% 1.14/1.37 4550[2:MRR:4549.0,49.0] || -> .
% 1.14/1.37 4553[2:Spt:4550.0,375.1,4399.0] || equal(skc8,n0)** -> .
% 1.14/1.37 4554[2:Spt:4550.0,375.0] || -> gt(skc8,n0)*l.
% 1.14/1.37 4571[0:Res:4234.0,97.0] || -> gt(succ(tptp_minus_1),skc8)*l.
% 1.14/1.37 4574[0:Rew:51.0,4571.0] || -> gt(n0,skc8)*r.
% 1.14/1.37 4662[0:NCh:123.2,123.1,4574.0,49.0] || gt(skc8,n0)*l -> .
% 1.14/1.37 4668[2:MRR:4662.0,4554.0] || -> .
% 1.14/1.37 % SZS output end Refutation
% 1.14/1.37 Formulae used in the proof : quaternion_ds1_symm_0007 gt_succ leq_succ_gt_equiv successor_1 irreflexivity_gt succ_tptp_minus_1 pred_succ succ_pred pred_minus_1 leq_gt2 transitivity_gt finite_domain_1
% 1.14/1.37
%------------------------------------------------------------------------------