%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT012_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n026.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:45 EDT 2022 % Result : Theorem 0.45s 1.05s % Output : Refutation 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : DAT012_1 : TPTP v8.1.0. Released v5.0.0. % 0.11/0.13 % Command : spasst-tptp-script %s %d % 0.12/0.34 % Computer : n026.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:10:50 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.47 % Using integer theory % 0.45/1.05 % 0.45/1.05 % 0.45/1.05 % SZS status Theorem for /tmp/SPASST_26823_n026.cluster.edu % 0.45/1.05 % 0.45/1.05 SPASS V 2.2.22 in combination with yices. % 0.45/1.05 SPASS beiseite: Proof found by SPASS and SMT. % 0.45/1.05 Problem: /tmp/SPASST_26823_n026.cluster.edu % 0.45/1.05 SPASS derived 158 clauses, backtracked 25 clauses and kept 137 clauses. % 0.45/1.05 SPASS backtracked 6 times (1 times due to theory inconsistency). % 0.45/1.05 SPASS allocated 6356 KBytes. % 0.45/1.05 SPASS spent 0:00:00.02 on the problem. % 0.45/1.05 0:00:00.00 for the input. % 0.45/1.05 0:00:00.00 for the FLOTTER CNF translation. % 0.45/1.05 0:00:00.00 for inferences. % 0.45/1.05 0:00:00.00 for the backtracking. % 0.45/1.05 0:00:00.01 for the reduction. % 0.45/1.05 0:00:00.00 for interacting with the SMT procedure. % 0.45/1.05 % 0.45/1.05 % 0.45/1.05 % SZS output start CNFRefutation for /tmp/SPASST_26823_n026.cluster.edu % 0.45/1.05 % 0.45/1.05 % Here is a proof with depth 0, length 8 : % 0.45/1.05 3[0:Inp] || -> array(skc5)*. % 0.45/1.05 4[0:Inp] || -> lesseq(skc6,skc8)*. % 0.45/1.05 5[0:Inp] || -> lesseq(skc8,skc7)*. % 0.45/1.05 7[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**. % 0.45/1.05 8[0:Inp] || lesseq(U,skc7) lesseq(skc6,U) -> greater(read(skc5,U),0)*. % 0.45/1.05 10[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**. % 0.45/1.05 11[0:Inp] || greater(read(write(skc5,plus(skc6,2),plus(read(skc5,plus(skc6,1)),1)),skc8),0)* -> . % 0.45/1.05 258(e)[0:ThR:11,10,8,7,5,4,3] || -> . % 0.45/1.05 % 0.45/1.05 % SZS output end CNFRefutation for /tmp/SPASST_26823_n026.cluster.edu % 0.45/1.05 % 0.45/1.05 Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax1 fof_ax2 % 0.45/1.05 % 0.45/1.05 SPASS+T ended %------------------------------------------------------------------------------