%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT005_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n027.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:43 EDT 2022 % Result : Theorem 0.42s 1.00s % Output : Refutation 0.42s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : DAT005_1 : TPTP v8.1.0. Released v5.0.0. % 0.03/0.12 % Command : spasst-tptp-script %s %d % 0.12/0.33 % Computer : n027.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 17:17:07 EDT 2022 % 0.12/0.33 % CPUTime : % 0.19/0.45 % Using integer theory % 0.42/1.00 % 0.42/1.00 % 0.42/1.00 % SZS status Theorem for /tmp/SPASST_14008_n027.cluster.edu % 0.42/1.00 % 0.42/1.00 SPASS V 2.2.22 in combination with yices. % 0.42/1.00 SPASS beiseite: Proof found by SPASS and SMT. % 0.42/1.00 Problem: /tmp/SPASST_14008_n027.cluster.edu % 0.42/1.00 SPASS derived 85 clauses, backtracked 21 clauses and kept 86 clauses. % 0.42/1.00 SPASS backtracked 4 times (1 times due to theory inconsistency). % 0.42/1.00 SPASS allocated 6325 KBytes. % 0.42/1.00 SPASS spent 0:00:00.02 on the problem. % 0.42/1.00 0:00:00.00 for the input. % 0.42/1.00 0:00:00.00 for the FLOTTER CNF translation. % 0.42/1.00 0:00:00.00 for inferences. % 0.42/1.00 0:00:00.00 for the backtracking. % 0.42/1.00 0:00:00.01 for the reduction. % 0.42/1.00 0:00:00.00 for interacting with the SMT procedure. % 0.42/1.00 % 0.42/1.00 % 0.42/1.00 % SZS output start CNFRefutation for /tmp/SPASST_14008_n027.cluster.edu % 0.42/1.00 % 0.42/1.00 % Here is a proof with depth 0, length 8 : % 0.42/1.00 3[0:Inp] || -> array(skc4)*. % 0.42/1.00 4[0:Inp] || -> lesseq(skc3,4)*. % 0.42/1.00 5[0:Inp] || -> lesseq(3,skc3)*. % 0.42/1.00 6[0:Inp] || array(U) -> array(write(U,V,W))*. % 0.42/1.00 7[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**. % 0.42/1.00 9[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**. % 0.42/1.00 10[0:Inp] || lesseq(read(write(write(write(write(skc4,3,33),4,444),5,55),4,44),skc3),44)* lesseq(33,read(write(write(write(write(skc4,3,33),4,444),5,55),4,44),skc3)) -> . % 0.42/1.00 176(e)[0:ThR:10,9,7,6,5,4,3] || -> . % 0.42/1.00 % 0.42/1.00 % SZS output end CNFRefutation for /tmp/SPASST_14008_n027.cluster.edu % 0.42/1.00 % 0.42/1.00 Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax2 % 0.42/1.00 % 0.42/1.00 SPASS+T ended %------------------------------------------------------------------------------