%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : KRS087+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:30:31 EDT 2022 % Result : Unsatisfiable 0.20s 0.45s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : KRS087+1 : TPTP v8.1.0. Released v3.1.0. % 0.03/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 : Tue Jun 7 05:30:04 EDT 2022 % 0.12/0.34 % CPUTime : % 0.20/0.45 % 0.20/0.45 SPASS V 3.9 % 0.20/0.45 SPASS beiseite: Proof found. % 0.20/0.45 % SZS status Theorem % 0.20/0.45 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 0.20/0.45 SPASS derived 19 clauses, backtracked 0 clauses, performed 0 splits and kept 29 clauses. % 0.20/0.45 SPASS allocated 97889 KBytes. % 0.20/0.45 SPASS spent 0:00:00.10 on the problem. % 0.20/0.45 0:00:00.04 for the input. % 0.20/0.45 0:00:00.04 for the FLOTTER CNF translation. % 0.20/0.45 0:00:00.00 for inferences. % 0.20/0.45 0:00:00.00 for the backtracking. % 0.20/0.45 0:00:00.00 for the reduction. % 0.20/0.45 % 0.20/0.45 % 0.20/0.45 Here is a proof with depth 4, length 14 : % 0.20/0.45 % SZS output start Refutation % 0.20/0.45 2[0:Inp] || -> cUnsatisfiable(i2003_11_14_17_19_46763)*. % 0.20/0.45 7[0:Inp] cUnsatisfiable(u) || -> cp1(u)*. % 0.20/0.45 9[0:Inp] cUnsatisfiable(u) || -> rr(u,skf4(u))*r. % 0.20/0.45 13[0:Inp] || rr(u,v) -> rinvR(v,u)*. % 0.20/0.45 14[0:Inp] cUnsatisfiable(u) || -> rr(skf4(v),skf6(v))*r. % 0.20/0.45 15[0:Inp] cUnsatisfiable(u) cp1(v) || rinvR(skf6(w),v)* -> . % 0.20/0.45 17[0:Inp] || rr(u,v)* rr(v,w)* -> rr(u,w)*. % 0.20/0.45 20[0:EmS:15.0,2.0] cp1(u) || rinvR(skf6(v),u)* -> . % 0.20/0.45 21[0:Res:13.1,20.1] cp1(u) || rr(u,skf6(v))* -> . % 0.20/0.45 23[0:EmS:14.0,2.0] || -> rr(skf4(u),skf6(u))*r. % 0.20/0.45 25[0:NCh:17.2,17.1,21.1,23.0] cp1(u) || rr(u,skf4(v))* -> . % 0.20/0.45 35[0:Res:9.1,25.1] cUnsatisfiable(u) cp1(u) || -> . % 0.20/0.45 38[0:SSi:35.1,7.1] cUnsatisfiable(u) || -> . % 0.20/0.45 39[0:UnC:38.0,2.0] || -> . % 0.20/0.45 % SZS output end Refutation % 0.20/0.45 Formulae used in the proof : axiom_7 axiom_2 axiom_5 axiom_6 % 0.20/0.45 %------------------------------------------------------------------------------