%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n024.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.60s 0.78s % Output : Refutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV069+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.07/0.13 % Command : run_spass %d %s % 0.12/0.33 % Computer : n024.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 19:45:48 EDT 2022 % 0.12/0.34 % CPUTime : % 0.60/0.78 % 0.60/0.78 SPASS V 3.9 % 0.60/0.78 SPASS beiseite: Proof found. % 0.60/0.78 % SZS status Theorem % 0.60/0.78 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.60/0.78 SPASS derived 2022 clauses, backtracked 0 clauses, performed 1 splits and kept 754 clauses. % 0.60/0.78 SPASS allocated 87375 KBytes. % 0.60/0.78 SPASS spent 0:00:00.42 on the problem. % 0.60/0.78 0:00:00.04 for the input. % 0.60/0.78 0:00:00.07 for the FLOTTER CNF translation. % 0.60/0.78 0:00:00.02 for inferences. % 0.60/0.78 0:00:00.00 for the backtracking. % 0.60/0.78 0:00:00.20 for the reduction. % 0.60/0.78 % 0.60/0.78 % 0.60/0.78 Here is a proof with depth 1, length 24 : % 0.60/0.78 % SZS output start Refutation % 0.60/0.78 2[0:Inp] || -> leq(n0,pv10)*r. % 0.60/0.78 13[0:Inp] || -> gt(n4,n0)*l. % 0.60/0.78 31[0:Inp] || -> leq(u,u)*. % 0.60/0.78 32[0:Inp] || -> equal(succ(n0),n1)**. % 0.60/0.78 37[0:Inp] || -> leq(pv10,minus(n135300,n1))*r. % 0.60/0.78 38[0:Inp] || -> equal(succ(succ(n0)),n2)**. % 0.60/0.78 55[0:Inp] || -> equal(pred(succ(u)),u)**. % 0.60/0.78 57[0:Inp] || -> equal(succ(succ(succ(n0))),n3)**. % 0.60/0.78 62[0:Inp] || -> equal(minus(u,n1),pred(u))**. % 0.60/0.78 64[0:Inp] || -> equal(succ(succ(succ(succ(n0)))),n4)**. % 0.60/0.78 69[0:Inp] || gt(u,v)* -> leq(v,u). % 0.60/0.78 74[0:Inp] || -> equal(succ(succ(succ(succ(succ(n0))))),n5)**. % 0.60/0.78 113[0:Inp] || leq(n0,n0) leq(n0,pv10) leq(n0,minus(n5,n1))*r leq(pv10,minus(n135300,n1)) -> . % 0.60/0.78 144[0:Rew:32.0,38.0] || -> equal(succ(n1),n2)**. % 0.60/0.78 147[0:Rew:144.0,57.0,32.0,57.0] || -> equal(succ(n2),n3)**. % 0.60/0.78 149[0:Rew:147.0,64.0,144.0,64.0,32.0,64.0] || -> equal(succ(n3),n4)**. % 0.60/0.78 152[0:Rew:149.0,74.0,147.0,74.0,144.0,74.0,32.0,74.0] || -> equal(succ(n4),n5)**. % 0.60/0.78 157[0:Rew:62.0,37.0] || -> leq(pv10,pred(n135300))*r. % 0.60/0.78 158[0:Rew:62.0,113.3,62.0,113.2] || leq(n0,n0) leq(n0,pv10) leq(n0,pred(n5))*r leq(pv10,pred(n135300)) -> . % 0.60/0.78 159[0:MRR:158.0,158.1,158.3,31.0,2.0,157.0] || leq(n0,pred(n5))*r -> . % 0.60/0.78 551[0:SpR:152.0,55.0] || -> equal(pred(n5),n4)**. % 0.60/0.78 553[0:Rew:551.0,159.0] || leq(n0,n4)*r -> . % 0.60/0.78 2950[0:Res:13.0,69.0] || -> leq(n0,n4)*r. % 0.60/0.78 3087[0:MRR:2950.0,553.0] || -> . % 0.60/0.78 % SZS output end Refutation % 0.60/0.78 Formulae used in the proof : cl5_nebula_array_0010 gt_4_0 reflexivity_leq successor_1 successor_2 pred_succ successor_3 pred_minus_1 successor_4 leq_gt1 successor_5 % 0.60/0.78 %------------------------------------------------------------------------------