%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT043_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n010.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 : Sat Jul 16 01:31:55 EDT 2022 % Result : Theorem 0.73s 1.06s % Output : Refutation 0.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : DAT043_1 : TPTP v8.1.0. Released v5.0.0. % 0.11/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.33 % Computer : n010.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 : Fri Jul 1 18:07:33 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.45 % Using integer theory % 0.73/1.06 % 0.73/1.06 % 0.73/1.06 % SZS status Theorem for /tmp/SPASST_4216_n010.cluster.edu % 0.73/1.06 % 0.73/1.06 SPASS V 2.2.22 in combination with yices. % 0.73/1.06 SPASS beiseite: Proof found by SPASS and SMT. % 0.73/1.06 Problem: /tmp/SPASST_4216_n010.cluster.edu % 0.73/1.06 SPASS derived 395 clauses, backtracked 73 clauses and kept 260 clauses. % 0.73/1.06 SPASS backtracked 3 times (1 times due to theory inconsistency). % 0.73/1.06 SPASS allocated 6552 KBytes. % 0.73/1.06 SPASS spent 0:00:00.04 on the problem. % 0.73/1.06 0:00:00.00 for the input. % 0.73/1.06 0:00:00.01 for the FLOTTER CNF translation. % 0.73/1.06 0:00:00.00 for inferences. % 0.73/1.06 0:00:00.00 for the backtracking. % 0.73/1.06 0:00:00.02 for the reduction. % 0.73/1.06 0:00:00.01 for interacting with the SMT procedure. % 0.73/1.06 % 0.73/1.06 % 0.73/1.06 % SZS output start CNFRefutation for /tmp/SPASST_4216_n010.cluster.edu % 0.73/1.06 % 0.73/1.06 % Here is a proof with depth 0, length 17 : % 0.73/1.06 2[0:Inp] || -> collection(empty)*. % 0.73/1.06 4[0:Inp] || -> collection(skc8)*. % 0.73/1.06 5[0:Inp] || -> in(skc7,skc8)*. % 0.73/1.06 6[0:Inp] || -> in(skc5,skc8)*. % 0.73/1.06 7[0:Inp] || -> in(skc6,skc8)*. % 0.73/1.06 8[0:Inp] || -> greater(skc7,skc5)*. % 0.73/1.06 9[0:Inp] || -> greater(skc5,skc6)*. % 0.73/1.06 11[0:Inp] || greater(count(skc8),2)* -> . % 0.73/1.06 12[0:Inp] || collection(U) -> greatereq(count(U),0)*. % 0.73/1.06 13[0:Inp] || collection(U) -> collection(remove(V,U))*. % 0.73/1.06 16[0:Inp] || collection(U) in(V,remove(V,U))* -> . % 0.73/1.06 17[0:Inp] || collection(U) equal(count(U),0)** -> equal(U,empty). % 0.73/1.06 18[0:Inp] || collection(U) equal(U,empty) -> equal(count(U),0)**. % 0.73/1.06 19[0:Inp] || collection(U) in(V,remove(W,U))* -> in(V,U). % 0.73/1.06 29(e)[0:Inp] || collection(U) in(V,U) -> equal(V,W) in(V,remove(W,U))*. % 0.73/1.06 32[0:Inp] || collection(U) in(V,U) -> equal(count(remove(V,U)),minus(count(U),1))**. % 0.73/1.06 699(e)[0:ThR:32,29,19,18,17,16,13,12,11,9,8,7,6,5,4,2] || -> . % 0.73/1.06 % 0.73/1.06 % SZS output end CNFRefutation for /tmp/SPASST_4216_n010.cluster.edu % 0.73/1.06 % 0.73/1.06 Formulae used in the proof : fof_count_type fof_collection_type fof_co1 fof_ax1 fof_ax2 fof_ax3 fof_ax5 % 0.73/1.06 % 0.73/1.06 SPASS+T ended %------------------------------------------------------------------------------