%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT050_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n008.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:58 EDT 2022 % Result : Theorem 0.43s 1.08s % Output : Refutation 0.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : DAT050_1 : TPTP v8.1.0. Released v5.0.0. % 0.11/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.34 % Computer : n008.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Fri Jul 1 20:53:38 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.47 % Using integer theory % 0.43/1.08 % 0.43/1.08 % 0.43/1.08 % SZS status Theorem for /tmp/SPASST_13340_n008.cluster.edu % 0.43/1.08 % 0.43/1.08 SPASS V 2.2.22 in combination with yices. % 0.43/1.08 SPASS beiseite: Proof found by SPASS and SMT. % 0.43/1.08 Problem: /tmp/SPASST_13340_n008.cluster.edu % 0.43/1.08 SPASS derived 175 clauses, backtracked 31 clauses and kept 168 clauses. % 0.43/1.08 SPASS backtracked 2 times (1 times due to theory inconsistency). % 0.43/1.08 SPASS allocated 6472 KBytes. % 0.43/1.08 SPASS spent 0:00:00.04 on the problem. % 0.43/1.08 0:00:00.00 for the input. % 0.43/1.08 0:00:00.01 for the FLOTTER CNF translation. % 0.43/1.08 0:00:00.00 for inferences. % 0.43/1.08 0:00:00.00 for the backtracking. % 0.43/1.08 0:00:00.02 for the reduction. % 0.43/1.08 0:00:00.00 for interacting with the SMT procedure. % 0.43/1.08 % 0.43/1.08 % 0.43/1.08 % SZS output start CNFRefutation for /tmp/SPASST_13340_n008.cluster.edu % 0.43/1.08 % 0.43/1.08 % Here is a proof with depth 0, length 15 : % 0.43/1.08 4[0:Inp] || -> collection(skc3)*. % 0.43/1.08 7[0:Inp] || collection(U) -> collection(remove(V,U))*. % 0.43/1.08 8[0:Inp] || collection(U) -> collection(add(V,U))*. % 0.43/1.08 9[0:Inp] || collection(U) -> in(V,add(V,U))*. % 0.43/1.08 13[0:Inp] || collection(U) in(V,remove(W,U))* -> in(V,U). % 0.43/1.08 14[0:Inp] || collection(U) in(V,U) -> in(V,add(W,U))*. % 0.43/1.08 16[0:Inp] || collection(U) -> in(V,U) equal(count(remove(V,U)),count(U))**. % 0.43/1.08 17[0:Inp] || collection(U) equal(V,W) in(V,remove(W,U))* -> . % 0.43/1.08 20[0:Inp] || collection(U) in(V,U) -> equal(count(add(V,U)),count(U))**. % 0.43/1.08 22[0:Inp] || collection(U) -> in(V,U) equal(count(add(V,U)),plus(count(U),1))**. % 0.43/1.08 23(e)[0:Inp] || collection(U) in(V,U) -> equal(V,W) in(V,remove(W,U))*. % 0.43/1.08 24(e)[0:Inp] || collection(U) in(V,add(W,U))* -> equal(V,W) in(V,U). % 0.43/1.08 26[0:Inp] || collection(U) in(V,U) -> equal(count(remove(V,U)),minus(count(U),1))**. % 0.43/1.08 27(e)[0:Inp] || equal(count(add(0,remove(skc4,add(skc4,skc3)))),count(add(0,remove(skc4,skc3))))** -> . % 0.43/1.08 358(e)[0:ThR:27,26,24,23,22,20,17,16,14,13,9,8,7,4] || -> . % 0.43/1.08 % 0.43/1.08 % SZS output end CNFRefutation for /tmp/SPASST_13340_n008.cluster.edu % 0.43/1.08 % 0.43/1.08 Formulae used in the proof : fof_collection_type fof_ax1 fof_remove_type fof_add_type fof_ax2 fof_ax5 fof_ax4 fof_ax6 fof_ax3 % 0.43/1.08 % 0.43/1.08 SPASS+T ended %------------------------------------------------------------------------------