%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT044_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:56 EDT 2022 % Result : Theorem 0.75s 1.04s % Output : Refutation 0.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : DAT044_1 : TPTP v8.1.0. Released v5.0.0. % 0.11/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 19:09:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.45 % Using integer theory % 0.75/1.04 % 0.75/1.04 % 0.75/1.04 % SZS status Theorem for /tmp/SPASST_21217_n027.cluster.edu % 0.75/1.04 % 0.75/1.04 SPASS V 2.2.22 in combination with yices. % 0.75/1.04 SPASS beiseite: Proof found by SPASS. % 0.75/1.04 Problem: /tmp/SPASST_21217_n027.cluster.edu % 0.75/1.04 SPASS derived 151 clauses, backtracked 43 clauses and kept 167 clauses. % 0.75/1.04 SPASS backtracked 4 times (0 times due to theory inconsistency). % 0.75/1.04 SPASS allocated 6396 KBytes. % 0.75/1.04 SPASS spent 0:00:00.03 on the problem. % 0.75/1.04 0:00:00.00 for the input. % 0.75/1.04 0:00:00.01 for the FLOTTER CNF translation. % 0.75/1.04 0:00:00.00 for inferences. % 0.75/1.04 0:00:00.00 for the backtracking. % 0.75/1.04 0:00:00.01 for the reduction. % 0.75/1.04 0:00:00.00 for interacting with the SMT procedure. % 0.75/1.04 % 0.75/1.04 % 0.75/1.04 % SZS output start CNFRefutation for /tmp/SPASST_21217_n027.cluster.edu % 0.75/1.04 % 0.75/1.04 % Here is a proof with depth 3, length 14 : % 0.75/1.04 4[0:Inp] || -> collection(skc3)*. % 0.75/1.04 9[0:Inp] || in(U,skc3)* -> greater(skc4,U). % 0.75/1.04 11[0:Inp] || greater(count(add(skc4,skc3)),count(skc3))* -> . % 0.75/1.04 24(e)[0:Inp] || collection(U) -> in(V,U) equal(count(add(V,U)),plus(count(U),1))**. % 0.75/1.04 39[0:ThA] || -> lesseq(U,U)*. % 0.75/1.04 40[0:ThA] || -> less(U,plus(U,1))*. % 0.75/1.04 61[0:ArS:9.1] || in(U,skc3) -> less(U,skc4)*. % 0.75/1.04 63[0:ArS:11.0] || less(count(skc3),count(add(skc4,skc3)))* -> . % 0.75/1.04 64[0:TOC:63.0] || -> lesseq(count(add(skc4,skc3)),count(skc3))*. % 0.75/1.04 76(e)[0:Res:4.0,24.0] || -> in(U,skc3) equal(count(add(U,skc3)),plus(count(skc3),1))**. % 0.75/1.04 153[0:OCE:61.1,39.0] || in(skc4,skc3)* -> . % 0.75/1.04 207[0:SpR:76.1,64.0] || -> in(skc4,skc3) lesseq(plus(count(skc3),1),count(skc3))*. % 0.75/1.04 216[0:MRR:207.0,153.0] || -> lesseq(plus(count(skc3),1),count(skc3))*. % 0.75/1.04 295(e)[0:OCE:216.0,40.0] || -> . % 0.75/1.04 % 0.75/1.04 % SZS output end CNFRefutation for /tmp/SPASST_21217_n027.cluster.edu % 0.75/1.04 % 0.75/1.04 Formulae used in the proof : fof_collection_type fof_add_type fof_ax2 fof_ax6 % 0.75/1.04 % 0.75/1.04 SPASS+T ended %------------------------------------------------------------------------------