%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n013.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:40:53 EDT 2022 % Result : Unsatisfiable 0.20s 0.41s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV001-1 : TPTP v8.1.0. Released v1.0.0. % 0.07/0.12 % Command : run_spass %d %s % 0.12/0.34 % Computer : n013.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 : Tue Jun 14 23:15:44 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.41 % 0.20/0.41 SPASS V 3.9 % 0.20/0.41 SPASS beiseite: Proof found. % 0.20/0.41 % SZS status Theorem % 0.20/0.41 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.41 SPASS derived 31 clauses, backtracked 4 clauses, performed 1 splits and kept 31 clauses. % 0.20/0.41 SPASS allocated 63116 KBytes. % 0.20/0.41 SPASS spent 0:00:00.06 on the problem. % 0.20/0.41 0:00:00.03 for the input. % 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation. % 0.20/0.41 0:00:00.00 for inferences. % 0.20/0.41 0:00:00.00 for the backtracking. % 0.20/0.41 0:00:00.00 for the reduction. % 0.20/0.41 % 0.20/0.41 % 0.20/0.41 Here is a proof with depth 3, length 26 : % 0.20/0.41 % SZS output start Refutation % 0.20/0.41 3[0:Inp] || less_or_equalish(u,v) q1(u,v,w) -> q2(u,v,w)*. % 0.20/0.41 4[0:Inp] || q1(u,v,w) -> less_or_equalish(u,v) q3(u,v,w)*. % 0.20/0.41 5[0:Inp] || q2(u,v,w)*+ -> q4(u,v,v)*. % 0.20/0.41 6[0:Inp] || q3(u,v,w)*+ -> q4(u,v,u)*. % 0.20/0.41 7[0:Inp] || -> less_or_equalish(u,u)*. % 0.20/0.41 10[0:Inp] || -> less_or_equalish(u,v)* less_or_equalish(v,u)*. % 0.20/0.41 12[0:Inp] || -> q1(a,b,c)*. % 0.20/0.41 13[0:Inp] || less_or_equalish(u,a) less_or_equalish(b,u) less_or_equalish(a,u) q4(a,b,u)* -> . % 0.20/0.41 14[0:Inp] || less_or_equalish(u,b) less_or_equalish(b,u) less_or_equalish(a,u) q4(a,b,u)* -> . % 0.20/0.41 15[0:Res:12.0,3.0] || less_or_equalish(a,b) -> q2(a,b,c)*. % 0.20/0.41 16[0:Res:12.0,4.0] || -> less_or_equalish(a,b) q3(a,b,c)*. % 0.20/0.41 19[0:Res:7.0,14.3] || q4(a,b,b)* less_or_equalish(a,b) less_or_equalish(b,b) -> . % 0.20/0.41 22[0:Res:7.0,13.3] || q4(a,b,a)* less_or_equalish(a,a) less_or_equalish(b,a) -> . % 0.20/0.41 23[0:MRR:22.1,7.0] || less_or_equalish(b,a) q4(a,b,a)* -> . % 0.20/0.41 24[0:MRR:19.2,7.0] || less_or_equalish(a,b) q4(a,b,b)* -> . % 0.20/0.41 25[1:Spt:16.0] || -> less_or_equalish(a,b)*l. % 0.20/0.41 26[1:MRR:15.0,25.0] || -> q2(a,b,c)*. % 0.20/0.41 27[1:MRR:24.0,25.0] || q4(a,b,b)* -> . % 0.20/0.41 28[1:Res:26.0,5.0] || -> q4(a,b,b)*. % 0.20/0.41 29[1:MRR:28.0,27.0] || -> . % 0.20/0.41 30[1:Spt:29.0,16.0,25.0] || less_or_equalish(a,b)*l+ -> . % 0.20/0.41 31[1:Spt:29.0,16.1] || -> q3(a,b,c)*. % 0.20/0.41 32[1:Res:31.0,6.0] || -> q4(a,b,a)*. % 0.20/0.41 33[1:MRR:23.1,32.0] || less_or_equalish(b,a)*r -> . % 0.20/0.41 36[1:Res:10.1,30.0] || -> less_or_equalish(b,a)*r. % 0.20/0.41 52[1:MRR:36.0,33.0] || -> . % 0.20/0.41 % SZS output end Refutation % 0.20/0.41 Formulae used in the proof : clause_1 clause_2 clause_3 clause_4 less_or_equal_reflexivity all_less_or_equal clause_5 clause_6 clause_7 % 0.20/0.41 %------------------------------------------------------------------------------