%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n008.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:04 EDT 2022 % Result : Theorem 0.62s 0.81s % Output : Refutation 0.62s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : SWV041+1 : TPTP v8.1.0. Bugfixed v3.3.0. % 0.11/0.12 % Command : run_spass %d %s % 0.12/0.33 % Computer : n008.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:42:37 EDT 2022 % 0.12/0.33 % CPUTime : % 0.62/0.81 % 0.62/0.81 SPASS V 3.9 % 0.62/0.81 SPASS beiseite: Proof found. % 0.62/0.81 % SZS status Theorem % 0.62/0.81 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.62/0.81 SPASS derived 2127 clauses, backtracked 0 clauses, performed 1 splits and kept 889 clauses. % 0.62/0.81 SPASS allocated 87551 KBytes. % 0.62/0.81 SPASS spent 0:00:00.45 on the problem. % 0.62/0.81 0:00:00.04 for the input. % 0.62/0.81 0:00:00.07 for the FLOTTER CNF translation. % 0.62/0.81 0:00:00.02 for inferences. % 0.62/0.81 0:00:00.01 for the backtracking. % 0.62/0.81 0:00:00.22 for the reduction. % 0.62/0.81 % 0.62/0.81 % 0.62/0.81 Here is a proof with depth 2, length 15 : % 0.62/0.81 % SZS output start Refutation % 0.62/0.81 2[0:Inp] || -> leq(n0,skc3)*r. % 0.62/0.81 43[0:Inp] || gt(u,u)* -> . % 0.62/0.81 45[0:Inp] || -> equal(succ(tptp_minus_1),n0)**. % 0.62/0.81 49[0:Inp] || -> leq(skc3,minus(n0,n1))*r. % 0.62/0.81 67[0:Inp] || -> equal(pred(succ(u)),u)**. % 0.62/0.81 74[0:Inp] || -> equal(minus(u,n1),pred(u))**. % 0.62/0.81 90[0:Inp] || leq(u,v)*+ -> gt(succ(v),u)*. % 0.62/0.81 116[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*. % 0.62/0.81 171[0:Rew:74.0,49.0] || -> leq(skc3,pred(n0))*r. % 0.62/0.81 605[0:SpR:45.0,67.0] || -> equal(pred(n0),tptp_minus_1)**. % 0.62/0.81 612[0:Rew:605.0,171.0] || -> leq(skc3,tptp_minus_1)*l. % 0.62/0.81 755[0:OCh:116.1,116.0,612.0,2.0] || -> leq(n0,tptp_minus_1)*r. % 0.62/0.81 3035[0:Res:755.0,90.0] || -> gt(succ(tptp_minus_1),n0)*l. % 0.62/0.81 3155[0:Rew:45.0,3035.0] || -> gt(n0,n0)*. % 0.62/0.81 3156[0:MRR:3155.0,43.0] || -> . % 0.62/0.81 % SZS output end Refutation % 0.62/0.81 Formulae used in the proof : gauss_init_0077 irreflexivity_gt succ_tptp_minus_1 pred_succ pred_minus_1 leq_succ_gt_equiv transitivity_leq % 0.62/0.81 %------------------------------------------------------------------------------