%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT053_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n005.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:59 EDT 2022 % Result : Theorem 0.79s 1.08s % Output : Refutation 0.79s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : DAT053_1 : TPTP v8.1.0. Released v5.0.0. % 0.11/0.13 % Command : spasst-tptp-script %s %d % 0.13/0.34 % Computer : n005.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 17:47:22 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.47 % Using integer theory % 0.79/1.08 % 0.79/1.08 % 0.79/1.08 % SZS status Theorem for /tmp/SPASST_21646_n005.cluster.edu % 0.79/1.08 % 0.79/1.08 SPASS V 2.2.22 in combination with yices. % 0.79/1.08 SPASS beiseite: Proof found by SPASS and SMT. % 0.79/1.08 Problem: /tmp/SPASST_21646_n005.cluster.edu % 0.79/1.08 SPASS derived 221 clauses, backtracked 9 clauses and kept 146 clauses. % 0.79/1.08 SPASS backtracked 2 times (1 times due to theory inconsistency). % 0.79/1.08 SPASS allocated 6486 KBytes. % 0.79/1.08 SPASS spent 0:00:00.03 on the problem. % 0.79/1.08 0:00:00.00 for the input. % 0.79/1.08 0:00:00.00 for the FLOTTER CNF translation. % 0.79/1.08 0:00:00.00 for inferences. % 0.79/1.08 0:00:00.00 for the backtracking. % 0.79/1.08 0:00:00.01 for the reduction. % 0.79/1.08 0:00:00.00 for interacting with the SMT procedure. % 0.79/1.08 % 0.79/1.08 % 0.79/1.08 % SZS output start CNFRefutation for /tmp/SPASST_21646_n005.cluster.edu % 0.79/1.08 % 0.79/1.08 % Here is a proof with depth 0, length 15 : % 0.79/1.08 3[0:Inp] || -> record(b)*. % 0.79/1.08 4[0:Inp] || -> record(a)*. % 0.79/1.08 6[0:Inp] || -> isrecord(b)*. % 0.79/1.08 7[0:Inp] || -> isrecord(next(b))*. % 0.79/1.08 8[0:Inp] || -> equal(next(next(b)),a)**. % 0.79/1.08 10[0:Inp] || record(U) -> record(split1(U))*. % 0.79/1.08 11[0:Inp] || record(U) -> record(next(U))*. % 0.79/1.08 13[0:Inp] || record(U) isrecord(U) -> isrecord(split1(U))*. % 0.79/1.08 15[0:Inp] || record(U) -> isrecord(U) equal(length(U),0)**. % 0.79/1.08 16[0:Inp] || equal(times(2,length(split1(b))),length(b))** -> . % 0.79/1.08 19[0:Inp] || equal(times(2,length(split1(b))),plus(length(b),1))** -> . % 0.79/1.08 23[0:Inp] || record(U) isrecord(U) -> equal(plus(length(next(U)),1),length(U))**. % 0.79/1.08 26(e)[0:Inp] || record(U) isrecord(U) isrecord(next(U)) -> equal(split1(next(next(U))),next(split1(U)))**. % 0.79/1.08 27(e)[0:Inp] || -> equal(times(2,length(split1(a))),length(a)) equal(times(2,length(split1(a))),plus(length(a),1))**. % 0.79/1.08 436(e)[0:ThR:27,26,23,19,16,15,13,11,10,8,7,6,4,3] || -> . % 0.79/1.08 % 0.79/1.08 % SZS output end CNFRefutation for /tmp/SPASST_21646_n005.cluster.edu % 0.79/1.08 % 0.79/1.08 Formulae used in the proof : fof_length_type fof_b_type fof_record_type fof_co1 fof_split2_type fof_split1_type fof_ax9 fof_ax4 fof_ax1 fof_ax2 fof_ax7 fof_ax13 fof_ax8 % 0.79/1.08 % 0.79/1.08 SPASS+T ended %------------------------------------------------------------------------------