%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT047_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n006.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:57 EDT 2022 % Result : Theorem 0.76s 1.07s % Output : Refutation 0.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.09/0.12 % Problem : DAT047_1 : TPTP v8.1.0. Released v5.0.0. % 0.09/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n006.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 1 19:53:22 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.45 % Using integer theory % 0.76/1.07 % 0.76/1.07 % 0.76/1.07 % SZS status Theorem for /tmp/SPASST_20780_n006.cluster.edu % 0.76/1.07 % 0.76/1.07 SPASS V 2.2.22 in combination with yices. % 0.76/1.07 SPASS beiseite: Proof found by SPASS and SMT. % 0.76/1.07 Problem: /tmp/SPASST_20780_n006.cluster.edu % 0.76/1.07 SPASS derived 137 clauses, backtracked 6 clauses and kept 115 clauses. % 0.76/1.07 SPASS backtracked 3 times (1 times due to theory inconsistency). % 0.76/1.07 SPASS allocated 6433 KBytes. % 0.76/1.07 SPASS spent 0:00:00.03 on the problem. % 0.76/1.07 0:00:00.00 for the input. % 0.76/1.07 0:00:00.01 for the FLOTTER CNF translation. % 0.76/1.07 0:00:00.00 for inferences. % 0.76/1.07 0:00:00.00 for the backtracking. % 0.76/1.07 0:00:00.01 for the reduction. % 0.76/1.07 0:00:00.00 for interacting with the SMT procedure. % 0.76/1.07 % 0.76/1.07 % 0.76/1.07 % SZS output start CNFRefutation for /tmp/SPASST_20780_n006.cluster.edu % 0.76/1.07 % 0.76/1.07 % Here is a proof with depth 0, length 14 : % 0.76/1.07 2[0:Inp] || -> collection(empty)*. % 0.76/1.07 4[0:Inp] || in(U,empty)* -> . % 0.76/1.07 5[0:Inp] || collection(U) -> greatereq(count(U),0)*. % 0.76/1.07 6[0:Inp] || collection(U) -> collection(remove(V,U))*. % 0.76/1.07 7[0:Inp] || collection(U) -> collection(add(V,U))*. % 0.76/1.07 8[0:Inp] || collection(U) -> in(V,add(V,U))*. % 0.76/1.07 11[0:Inp] || collection(U) equal(U,empty) -> equal(count(U),0)**. % 0.76/1.07 12[0:Inp] || equal(count(add(5,remove(3,add(3,empty)))),1)** -> . % 0.76/1.07 13[0:Inp] || collection(U) in(V,remove(W,U))* -> in(V,U). % 0.76/1.07 20[0:Inp] || collection(U) in(V,U) -> equal(count(add(V,U)),count(U))**. % 0.76/1.07 22[0:Inp] || collection(U) -> in(V,U) equal(count(add(V,U)),plus(count(U),1))**. % 0.76/1.07 24[0:Inp] || collection(U) in(V,add(W,U))* -> equal(V,W) in(V,U). % 0.76/1.07 26[0:Inp] || collection(U) in(V,U) -> equal(count(remove(V,U)),minus(count(U),1))**. % 0.76/1.07 319(e)[0:ThR:26,24,22,20,13,12,11,8,7,6,5,4,2] || -> . % 0.76/1.07 % 0.76/1.07 % SZS output end CNFRefutation for /tmp/SPASST_20780_n006.cluster.edu % 0.76/1.07 % 0.76/1.07 Formulae used in the proof : fof_count_type fof_collection_type fof_ax1 fof_remove_type fof_add_type fof_ax2 fof_co1 fof_ax4 fof_ax6 fof_ax5 % 0.76/1.08 % 0.76/1.08 SPASS+T ended %------------------------------------------------------------------------------