%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT048_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n013.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.84s 1.10s % Output : Refutation 0.84s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT048_1 : TPTP v8.1.0. Released v5.0.0. % 0.00/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.33 % Computer : n013.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 19:56:29 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.46 % Using integer theory % 0.84/1.10 % 0.84/1.10 % 0.84/1.10 % SZS status Theorem for /tmp/SPASST_25741_n013.cluster.edu % 0.84/1.10 % 0.84/1.10 SPASS V 2.2.22 in combination with yices. % 0.84/1.10 SPASS beiseite: Proof found by SPASS and SMT. % 0.84/1.10 Problem: /tmp/SPASST_25741_n013.cluster.edu % 0.84/1.10 SPASS derived 403 clauses, backtracked 16 clauses and kept 148 clauses. % 0.84/1.10 SPASS backtracked 5 times (1 times due to theory inconsistency). % 0.84/1.10 SPASS allocated 6727 KBytes. % 0.84/1.10 SPASS spent 0:00:00.06 on the problem. % 0.84/1.10 0:00:00.00 for the input. % 0.84/1.10 0:00:00.01 for the FLOTTER CNF translation. % 0.84/1.10 0:00:00.01 for inferences. % 0.84/1.10 0:00:00.00 for the backtracking. % 0.84/1.10 0:00:00.03 for the reduction. % 0.84/1.10 0:00:00.01 for interacting with the SMT procedure. % 0.84/1.10 % 0.84/1.10 % 0.84/1.10 % SZS output start CNFRefutation for /tmp/SPASST_25741_n013.cluster.edu % 0.84/1.10 % 0.84/1.10 % Here is a proof with depth 0, length 16 : % 0.84/1.10 2[0:Inp] || -> collection(empty)*. % 0.84/1.10 4[0:Inp] || in(U,empty)* -> . % 0.84/1.10 6[0:Inp] || collection(U) -> collection(remove(V,U))*. % 0.84/1.10 7[0:Inp] || collection(U) -> collection(add(V,U))*. % 0.84/1.10 8[0:Inp] || collection(U) -> in(V,add(V,U))*. % 0.84/1.10 9[0:Inp] || collection(U) in(V,remove(V,U))* -> . % 0.84/1.10 10[0:Inp] || collection(U) equal(count(U),0)** -> equal(U,empty). % 0.84/1.10 11[0:Inp] || collection(U) equal(U,empty) -> equal(count(U),0)**. % 0.84/1.10 12[0:Inp] || collection(U) in(V,remove(W,U))* -> in(V,U). % 0.84/1.10 15[0:Inp] || collection(U) -> in(V,U) equal(count(remove(V,U)),count(U))**. % 0.84/1.10 17[0:Inp] || equal(count(add(1,add(5,remove(3,add(2,empty))))),3)** -> . % 0.84/1.10 22[0:Inp] || collection(U) -> in(V,U) equal(count(add(V,U)),plus(count(U),1))**. % 0.84/1.10 23[0:Inp] || collection(U) in(V,U) -> equal(V,W) in(V,remove(W,U))*. % 0.84/1.10 24[0:Inp] || collection(U) in(V,add(W,U))* -> equal(V,W) in(V,U). % 0.84/1.10 26[0:Inp] || collection(U) in(V,U) -> equal(count(remove(V,U)),minus(count(U),1))**. % 0.84/1.10 730(e)[0:ThR:26,24,23,22,17,15,12,11,10,9,8,7,6,4,2] || -> . % 0.84/1.10 % 0.84/1.10 % SZS output end CNFRefutation for /tmp/SPASST_25741_n013.cluster.edu % 0.84/1.10 % 0.84/1.10 Formulae used in the proof : fof_count_type fof_collection_type fof_ax1 fof_remove_type fof_add_type fof_ax2 fof_ax3 fof_ax4 fof_ax5 fof_ax6 % 0.84/1.10 % 0.84/1.10 SPASS+T ended %------------------------------------------------------------------------------