%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT018_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n007.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:47 EDT 2022 % Result : Theorem 0.73s 1.01s % Output : Refutation 0.73s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT018_1 : TPTP v8.1.0. Released v5.0.0. % 0.12/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.33 % Computer : n007.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:48:39 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.46 % Using integer theory % 0.73/1.01 % 0.73/1.01 % 0.73/1.01 % SZS status Theorem for /tmp/SPASST_14260_n007.cluster.edu % 0.73/1.01 % 0.73/1.01 SPASS V 2.2.22 in combination with yices. % 0.73/1.01 SPASS beiseite: Proof found by SPASS and SMT. % 0.73/1.01 Problem: /tmp/SPASST_14260_n007.cluster.edu % 0.73/1.01 SPASS derived 94 clauses, backtracked 4 clauses and kept 85 clauses. % 0.73/1.01 SPASS backtracked 2 times (1 times due to theory inconsistency). % 0.73/1.01 SPASS allocated 6334 KBytes. % 0.73/1.01 SPASS spent 0:00:00.02 on the problem. % 0.73/1.01 0:00:00.00 for the input. % 0.73/1.01 0:00:00.00 for the FLOTTER CNF translation. % 0.73/1.01 0:00:00.00 for inferences. % 0.73/1.01 0:00:00.00 for the backtracking. % 0.73/1.01 0:00:00.01 for the reduction. % 0.73/1.01 0:00:00.00 for interacting with the SMT procedure. % 0.73/1.01 % 0.73/1.01 % 0.73/1.01 % SZS output start CNFRefutation for /tmp/SPASST_14260_n007.cluster.edu % 0.73/1.01 % 0.73/1.01 % Here is a proof with depth 0, length 8 : % 0.73/1.01 3[0:Inp] || -> array(skc6)*. % 0.73/1.01 4[0:Inp] || -> lesseq(skc4,skc5)*. % 0.73/1.01 5[0:Inp] || -> lesseq(skc5,plus(skc4,3))*. % 0.73/1.01 6[0:Inp] || array(U) -> array(write(U,V,W))*. % 0.73/1.01 7[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**. % 0.73/1.01 9(e)[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**. % 0.73/1.01 10[0:Inp] || lesseq(read(write(write(write(skc6,skc4,3),plus(skc4,2),2),plus(skc4,4),1),U),3)* lesseq(U,plus(skc5,3)) lesseq(skc5,U) -> . % 0.73/1.01 187(e)[0:ThR:10,9,7,6,5,4,3] || -> . % 0.73/1.01 % 0.73/1.01 % SZS output end CNFRefutation for /tmp/SPASST_14260_n007.cluster.edu % 0.73/1.01 % 0.73/1.01 Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax2 % 0.73/1.01 % 0.73/1.01 SPASS+T ended %------------------------------------------------------------------------------