TSTP Solution File: SWV055+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV055+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:07 EDT 2022
% Result : Theorem 1.15s 1.32s
% Output : Refutation 1.15s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV055+1 : TPTP v8.1.0. Bugfixed v3.3.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jun 15 10:22:11 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.15/1.32
% 1.15/1.32 SPASS V 3.9
% 1.15/1.32 SPASS beiseite: Proof found.
% 1.15/1.32 % SZS status Theorem
% 1.15/1.32 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.15/1.32 SPASS derived 4506 clauses, backtracked 130 clauses, performed 4 splits and kept 2262 clauses.
% 1.15/1.32 SPASS allocated 89105 KBytes.
% 1.15/1.32 SPASS spent 0:00:00.94 on the problem.
% 1.15/1.32 0:00:00.04 for the input.
% 1.15/1.32 0:00:00.10 for the FLOTTER CNF translation.
% 1.15/1.32 0:00:00.03 for inferences.
% 1.15/1.32 0:00:00.01 for the backtracking.
% 1.15/1.32 0:00:00.67 for the reduction.
% 1.15/1.32
% 1.15/1.32
% 1.15/1.32 Here is a proof with depth 3, length 74 :
% 1.15/1.32 % SZS output start Refutation
% 1.15/1.32 2[0:Inp] || -> leq(n0,pv10)*r.
% 1.15/1.32 32[0:Inp] || -> SkC0* leq(n0,skc6).
% 1.15/1.32 33[0:Inp] || -> equal(succ(n0),n1)**.
% 1.15/1.32 34[0:Inp] || gt(u,u)* -> .
% 1.15/1.32 36[0:Inp] || -> equal(succ(tptp_minus_1),n0)**.
% 1.15/1.32 38[0:Inp] || -> leq(skc6,minus(n0,n1))*r.
% 1.15/1.32 39[0:Inp] || -> leq(skc4,minus(pv10,n1))*r.
% 1.15/1.32 40[0:Inp] || -> leq(pv10,minus(n135300,n1))*r.
% 1.15/1.32 41[0:Inp] || -> equal(succ(succ(n0)),n2)**.
% 1.15/1.32 58[0:Inp] || -> equal(pred(succ(u)),u)**.
% 1.15/1.32 60[0:Inp] || -> equal(succ(succ(succ(n0))),n3)**.
% 1.15/1.32 65[0:Inp] || -> equal(minus(u,n1),pred(u))**.
% 1.15/1.32 67[0:Inp] || -> equal(succ(succ(succ(succ(n0)))),n4)**.
% 1.15/1.32 77[0:Inp] || -> equal(succ(succ(succ(succ(succ(n0))))),n5)**.
% 1.15/1.32 80[0:Inp] || leq(u,v)*+ -> leq(u,succ(v))*.
% 1.15/1.32 81[0:Inp] || leq(u,v)*+ -> gt(succ(v),u)*.
% 1.15/1.32 105[0:Inp] || leq(u,n0)*+ leq(n0,u)* -> equal(u,n0).
% 1.15/1.32 106[0:Inp] || gt(u,v)* gt(v,w)* -> gt(u,w)*.
% 1.15/1.32 107[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 1.15/1.32 111[0:Inp] || leq(u,n1)* leq(n0,u) -> equal(u,n1) equal(u,n0).
% 1.15/1.32 112[0:Inp] || leq(n0,pv10) leq(pv10,minus(n135300,n1))*r SkC0 -> leq(n0,skc4).
% 1.15/1.32 120[0:Inp] || leq(u,minus(pv10,n1)) leq(n0,u) -> equal(sum__dfg(n0,minus(n5,n1),a_select3(q,u,v)),n1)**.
% 1.15/1.32 123[0:Inp] || equal(sum__dfg(n0,minus(n5,n1),a_select3(q,skc4,skc5)),n1)** leq(n0,pv10) leq(pv10,minus(n135300,n1)) SkC0 -> .
% 1.15/1.32 150[0:Rew:33.0,41.0] || -> equal(succ(n1),n2)**.
% 1.15/1.32 153[0:Rew:150.0,60.0,33.0,60.0] || -> equal(succ(n2),n3)**.
% 1.15/1.32 155[0:Rew:153.0,67.0,150.0,67.0,33.0,67.0] || -> equal(succ(n3),n4)**.
% 1.15/1.32 158[0:Rew:155.0,77.0,153.0,77.0,150.0,77.0,33.0,77.0] || -> equal(succ(n4),n5)**.
% 1.15/1.32 163[0:Rew:65.0,40.0] || -> leq(pv10,pred(n135300))*r.
% 1.15/1.32 164[0:Rew:65.0,39.0] || -> leq(skc4,pred(pv10))*r.
% 1.15/1.32 165[0:Rew:65.0,38.0] || -> leq(skc6,pred(n0))*r.
% 1.15/1.32 166[0:Rew:65.0,112.1] || leq(n0,pv10) leq(pv10,pred(n135300))*r SkC0 -> leq(n0,skc4).
% 1.15/1.32 167[0:MRR:166.0,166.1,2.0,163.0] || SkC0* -> leq(n0,skc4).
% 1.15/1.32 168[0:Rew:65.0,120.2,65.0,120.0] || leq(u,pred(pv10)) leq(n0,u) -> equal(sum__dfg(n0,pred(n5),a_select3(q,u,v)),n1)**.
% 1.15/1.32 169[0:Rew:65.0,123.2,65.0,123.0] || equal(sum__dfg(n0,pred(n5),a_select3(q,skc4,skc5)),n1)** leq(n0,pv10) leq(pv10,pred(n135300)) SkC0 -> .
% 1.15/1.32 170[0:MRR:169.1,169.2,2.0,163.0] || SkC0 equal(sum__dfg(n0,pred(n5),a_select3(q,skc4,skc5)),n1)** -> .
% 1.15/1.32 191[0:Res:2.0,111.0] || leq(pv10,n1)*r -> equal(n1,pv10) equal(pv10,n0).
% 1.15/1.32 392[1:Spt:191.2] || -> equal(pv10,n0)**.
% 1.15/1.32 393[1:Rew:392.0,164.0] || -> leq(skc4,pred(n0))*r.
% 1.15/1.32 554[2:Spt:32.0] || -> SkC0*.
% 1.15/1.32 555[2:MRR:167.0,554.0] || -> leq(n0,skc4)*r.
% 1.15/1.32 567[0:SpR:36.0,58.0] || -> equal(pred(n0),tptp_minus_1)**.
% 1.15/1.32 572[0:SpR:158.0,58.0] || -> equal(pred(n5),n4)**.
% 1.15/1.32 574[0:Rew:567.0,165.0] || -> leq(skc6,tptp_minus_1)*l.
% 1.15/1.32 575[1:Rew:567.0,393.0] || -> leq(skc4,tptp_minus_1)*l.
% 1.15/1.32 723[2:OCh:107.1,107.0,575.0,555.0] || -> leq(n0,tptp_minus_1)*r.
% 1.15/1.32 3190[0:Res:574.0,81.0] || -> gt(succ(tptp_minus_1),skc6)*l.
% 1.15/1.32 3192[2:Res:723.0,81.0] || -> gt(succ(tptp_minus_1),n0)*l.
% 1.15/1.32 3274[0:Rew:36.0,3190.0] || -> gt(n0,skc6)*r.
% 1.15/1.32 3276[2:Rew:36.0,3192.0] || -> gt(n0,n0)*.
% 1.15/1.32 3277[2:MRR:3276.0,34.0] || -> .
% 1.15/1.32 3286[2:Spt:3277.0,32.0,554.0] || SkC0* -> .
% 1.15/1.32 3287[2:Spt:3277.0,32.1] || -> leq(n0,skc6)*r.
% 1.15/1.32 3291[2:OCh:107.1,107.0,3287.0,574.0] || -> leq(n0,tptp_minus_1)*r.
% 1.15/1.32 3604[0:Res:574.0,80.0] || -> leq(skc6,succ(tptp_minus_1))*r.
% 1.15/1.32 3703[0:Rew:36.0,3604.0] || -> leq(skc6,n0)*l.
% 1.15/1.32 4093[0:NCh:106.2,106.1,3274.0,34.0] || equal(skc6,n0)** -> .
% 1.15/1.32 4166[2:Res:3291.0,81.0] || -> gt(succ(tptp_minus_1),n0)*l.
% 1.15/1.32 4177[2:Rew:36.0,4166.0] || -> gt(n0,n0)*.
% 1.15/1.32 4178[2:MRR:4177.0,34.0] || -> .
% 1.15/1.32 4183[1:Spt:4178.0,191.2,392.0] || equal(pv10,n0)** -> .
% 1.15/1.32 4184[1:Spt:4178.0,191.0,191.1] || leq(pv10,n1)*r -> equal(n1,pv10).
% 1.15/1.32 4187[0:Rew:572.0,170.1] || SkC0 equal(sum__dfg(n0,n4,a_select3(q,skc4,skc5)),n1)** -> .
% 1.15/1.32 4193[0:Rew:572.0,168.2] || leq(u,pred(pv10)) leq(n0,u) -> equal(sum__dfg(n0,n4,a_select3(q,u,v)),n1)**.
% 1.15/1.32 4264[2:Spt:32.0] || -> SkC0*.
% 1.15/1.32 4265[2:MRR:167.0,4264.0] || -> leq(n0,skc4)*r.
% 1.15/1.32 4266[2:MRR:4187.0,4264.0] || equal(sum__dfg(n0,n4,a_select3(q,skc4,skc5)),n1)** -> .
% 1.15/1.32 5369[0:Res:3703.0,105.0] || leq(n0,skc6)*r -> equal(skc6,n0).
% 1.15/1.32 5469[0:MRR:5369.1,4093.0] || leq(n0,skc6)*r -> .
% 1.15/1.32 6035[2:SpL:4193.2,4266.0] || leq(skc4,pred(pv10))*r leq(n0,skc4) equal(n1,n1) -> .
% 1.15/1.32 6036[2:Obv:6035.2] || leq(skc4,pred(pv10))*r leq(n0,skc4) -> .
% 1.15/1.32 6037[2:MRR:6036.0,6036.1,164.0,4265.0] || -> .
% 1.15/1.32 6038[2:Spt:6037.0,32.0,4264.0] || SkC0* -> .
% 1.15/1.32 6039[2:Spt:6037.0,32.1] || -> leq(n0,skc6)*r.
% 1.15/1.32 6040[2:MRR:6039.0,5469.0] || -> .
% 1.15/1.32 % SZS output end Refutation
% 1.15/1.32 Formulae used in the proof : cl5_nebula_norm_0037 gt_succ leq_succ_gt_equiv successor_1 irreflexivity_gt succ_tptp_minus_1 successor_2 pred_succ successor_3 pred_minus_1 successor_4 successor_5 leq_succ finite_domain_0 transitivity_gt transitivity_leq finite_domain_1
% 1.15/1.32
%------------------------------------------------------------------------------