%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : SWW024_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n018.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 : Thu Jul 21 01:29:29 EDT 2022 % Result : Theorem 15.25s 14.34s % Output : Refutation 15.25s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : SWW024_1 : TPTP v8.1.0. Released v5.0.0. % 0.04/0.13 % Command : spasst-tptp-script %s %d % 0.14/0.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 600 % 0.14/0.34 % DateTime : Sat Jun 4 18:09:47 EDT 2022 % 0.14/0.34 % CPUTime : % 0.21/0.51 % Using integer theory % 15.25/14.34 % 15.25/14.34 % 15.25/14.34 % SZS status Theorem for /tmp/SPASST_22123_n018.cluster.edu % 15.25/14.34 % 15.25/14.34 SPASS V 2.2.22 in combination with yices. % 15.25/14.34 SPASS beiseite: Proof found by SPASS and SMT. % 15.25/14.34 Problem: /tmp/SPASST_22123_n018.cluster.edu % 15.25/14.34 SPASS derived 1137 clauses, backtracked 225 clauses and kept 807 clauses. % 15.25/14.34 SPASS backtracked 20 times (1 times due to theory inconsistency). % 15.25/14.34 SPASS allocated 11176 KBytes. % 15.25/14.34 SPASS spent 0:00:01.76 on the problem. % 15.25/14.34 0:00:00.13 for the input. % 15.25/14.34 0:00:00.72 for the FLOTTER CNF translation. % 15.25/14.34 0:00:00.04 for inferences. % 15.25/14.34 0:00:00.00 for the backtracking. % 15.25/14.34 0:00:00.71 for the reduction. % 15.25/14.34 0:00:00.03 for interacting with the SMT procedure. % 15.25/14.34 % 15.25/14.34 % 15.25/14.34 % SZS output start CNFRefutation for /tmp/SPASST_22123_n018.cluster.edu % 15.25/14.34 % 15.25/14.34 % Here is a proof with depth 0, length 21 : % 15.25/14.34 9[0:Inp] || -> less(z2,z1)*. % 15.25/14.34 14[0:Inp] || equal(z2,z1)** -> . % 15.25/14.34 15[0:Inp] || equal(z3,z1)** -> . % 15.25/14.34 16[0:Inp] || equal(z4,z1)** -> . % 15.25/14.34 17[0:Inp] || equal(z5,z1)** -> . % 15.25/14.34 19[0:Inp] || equal(z3,z2)** -> . % 15.25/14.34 20[0:Inp] || equal(z4,z2)** -> . % 15.25/14.34 21[0:Inp] || equal(z5,z2)** -> . % 15.25/14.34 23[0:Inp] || equal(z4,z3)** -> . % 15.25/14.34 24[0:Inp] || equal(z5,z3)** -> . % 15.25/14.34 26[0:Inp] || equal(z5,z4)** -> . % 15.25/14.34 29[0:Inp] || -> equal(a(z1),3)**. % 15.25/14.34 30[0:Inp] || -> equal(a(z2),10)**. % 15.25/14.34 31[0:Inp] || -> equal(a(z3),7)**. % 15.25/14.34 32[0:Inp] || -> equal(a(z4),2)**. % 15.25/14.34 34[0:Inp] || -> less(b(z1),4)*. % 15.25/14.34 35[0:Inp] || -> less(b(z2),3)*. % 15.25/14.34 36[0:Inp] || -> less(b(z3),4)*. % 15.25/14.34 38[0:Inp] || -> equal(b(z5),5)**. % 15.25/14.34 403[0:Inp] || equal(b(U),5)** equal(a(V),2)** less(b(W),4)* equal(a(W),7) equal(a(X),10) less(b(X),3)* less(X,Y)* less(b(Y),4)* equal(a(Y),3) -> equal(V,U)* equal(W,U)* equal(W,V)* equal(X,W)* equal(X,V)* equal(X,U)* equal(Y,U)* equal(Y,V)* equal(Y,W)* equal(Y,X). % 15.25/14.34 3275(e)[0:ThR:403,38,36,35,34,32,31,30,29,26,24,23,21,20,19,17,16,15,14,9] || -> . % 15.25/14.34 % 15.25/14.34 % SZS output end CNFRefutation for /tmp/SPASST_22123_n018.cluster.edu % 15.25/14.34 % 15.25/14.34 Formulae used in the proof : fof_z1_type fof_0 % 15.35/14.44 % 15.35/14.44 SPASS+T ended %------------------------------------------------------------------------------