%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : KRS118+1 : TPTP v8.1.0. Released v3.1.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n027.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:37 EDT 2022 % Result : Unsatisfiable 0.20s 0.46s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.13 % Problem : KRS118+1 : TPTP v8.1.0. Released v3.1.0. % 0.11/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n027.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Tue Jun 7 06:53:40 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.46 % 0.20/0.46 SPASS V 3.9 % 0.20/0.46 SPASS beiseite: Proof found. % 0.20/0.46 % SZS status Theorem % 0.20/0.46 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.46 SPASS derived 59 clauses, backtracked 0 clauses, performed 0 splits and kept 58 clauses. % 0.20/0.46 SPASS allocated 97901 KBytes. % 0.20/0.46 SPASS spent 0:00:00.10 on the problem. % 0.20/0.46 0:00:00.04 for the input. % 0.20/0.46 0:00:00.04 for the FLOTTER CNF translation. % 0.20/0.46 0:00:00.00 for inferences. % 0.20/0.46 0:00:00.00 for the backtracking. % 0.20/0.46 0:00:00.00 for the reduction. % 0.20/0.46 % 0.20/0.46 % 0.20/0.46 Here is a proof with depth 5, length 28 : % 0.20/0.46 % SZS output start Refutation % 0.20/0.46 2[0:Inp] || -> cUnsatisfiable(i2003_11_14_17_21_4056)*. % 0.20/0.46 4[0:Inp] || -> cd(skf6(u))*. % 0.20/0.46 5[0:Inp] || -> ccxcomp(skf10(u))*. % 0.20/0.46 6[0:Inp] || -> cd(skf11(u))*. % 0.20/0.46 9[0:Inp] cd(u) || -> cc(u)*. % 0.20/0.46 13[0:Inp] cUnsatisfiable(u) || -> rinvF(u,skf6(u))*. % 0.20/0.46 14[0:Inp] cc(u) || ra_Px1(u,v)* -> . % 0.20/0.46 15[0:Inp] ccxcomp(u) || -> ra_Px1(u,skf9(u))*. % 0.20/0.46 16[0:Inp] cd(u) || -> rf(u,skf10(u))*. % 0.20/0.46 17[0:Inp] ca_Vx3(u) || -> rinvF(u,skf11(u))*. % 0.20/0.46 18[0:Inp] || rinvF(u,v)* -> rf(v,u). % 0.20/0.46 21[0:Inp] || rr(u,v) -> rinvR(v,u)*. % 0.20/0.46 22[0:Inp] || rf(u,v)* -> rr(u,v). % 0.20/0.46 23[0:Inp] cUnsatisfiable(u) || rinvR(u,v)* -> ca_Vx3(v). % 0.20/0.46 25[0:Inp] || rf(u,v)*+ rf(u,w)* -> equal(w,v)*. % 0.20/0.46 33[0:Res:15.1,14.1] ccxcomp(u) cc(u) || -> . % 0.20/0.46 37[0:Res:17.1,18.0] ca_Vx3(u) || -> rf(skf11(u),u)*. % 0.20/0.46 38[0:Res:13.1,18.0] cUnsatisfiable(u) || -> rf(skf6(u),u)*. % 0.20/0.46 48[0:Res:16.1,25.0] cd(u) || rf(u,v)* -> equal(v,skf10(u)). % 0.20/0.46 52[0:Res:37.1,48.1] ca_Vx3(u) cd(skf11(u)) || -> equal(skf10(skf11(u)),u)**. % 0.20/0.46 54[0:SSi:52.1,6.0] ca_Vx3(u) || -> equal(skf10(skf11(u)),u)**. % 0.20/0.46 56[0:SpR:54.1,5.0] ca_Vx3(u) || -> ccxcomp(u)*. % 0.20/0.46 60[0:EmS:33.0,33.1,56.1,9.1] ca_Vx3(u) cd(u) || -> . % 0.20/0.46 69[0:Res:38.1,22.0] cUnsatisfiable(u) || -> rr(skf6(u),u)*l. % 0.20/0.46 77[0:Res:21.1,23.1] cUnsatisfiable(u) || rr(v,u)*+ -> ca_Vx3(v)*. % 0.20/0.46 81[0:EmS:60.0,60.1,77.2,4.0] cUnsatisfiable(u) || rr(skf6(v),u)* -> . % 0.20/0.46 95[0:MRR:69.1,81.1] cUnsatisfiable(u) || -> . % 0.20/0.46 96[0:UnC:95.0,2.0] || -> . % 0.20/0.46 % SZS output end Refutation % 0.20/0.46 Formulae used in the proof : axiom_11 axiom_2 axiom_5 axiom_8 axiom_4 axiom_6 axiom_3 axiom_9 axiom_12 axiom_7 % 0.20/0.46 %------------------------------------------------------------------------------