%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT089_1 : TPTP v8.1.0. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n015.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:32:10 EDT 2022 % Result : Theorem 0.83s 1.07s % Output : Refutation 0.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : DAT089_1 : TPTP v8.1.0. Released v6.1.0. % 0.06/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n015.cluster.edu % 0.13/0.33 % Model : x86_64 x86_64 % 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.33 % Memory : 8042.1875MB % 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.33 % CPULimit : 300 % 0.13/0.33 % WCLimit : 600 % 0.13/0.33 % DateTime : Fri Jul 1 19:41:13 EDT 2022 % 0.13/0.33 % CPUTime : % 0.19/0.46 % Using integer theory % 0.83/1.07 % 0.83/1.07 % 0.83/1.07 % SZS status Theorem for /tmp/SPASST_11253_n015.cluster.edu % 0.83/1.07 % 0.83/1.07 SPASS V 2.2.22 in combination with yices. % 0.83/1.07 SPASS beiseite: Proof found by SPASS. % 0.83/1.07 Problem: /tmp/SPASST_11253_n015.cluster.edu % 0.83/1.07 SPASS derived 151 clauses, backtracked 0 clauses and kept 139 clauses. % 0.83/1.07 SPASS backtracked 1 times (0 times due to theory inconsistency). % 0.83/1.07 SPASS allocated 6505 KBytes. % 0.83/1.07 SPASS spent 0:00:00.03 on the problem. % 0.83/1.07 0:00:00.00 for the input. % 0.83/1.07 0:00:00.01 for the FLOTTER CNF translation. % 0.83/1.07 0:00:00.00 for inferences. % 0.83/1.07 0:00:00.00 for the backtracking. % 0.83/1.07 0:00:00.01 for the reduction. % 0.83/1.07 0:00:00.00 for interacting with the SMT procedure. % 0.83/1.07 % 0.83/1.07 % 0.83/1.07 % SZS output start CNFRefutation for /tmp/SPASST_11253_n015.cluster.edu % 0.83/1.07 % 0.83/1.07 % Here is a proof with depth 3, length 19 : % 0.83/1.07 4[0:Inp] || -> list(nil)*. % 0.83/1.07 6[0:Inp] || -> equal(length(nil),0)**. % 0.83/1.07 9[0:Inp] || -> equal(count(U,nil),0)**. % 0.83/1.07 13[0:Inp] || list(U) -> list(cons(V,U))*. % 0.83/1.07 18[0:Inp] || list(U) -> greatereq(count(V,U),length(U))*. % 0.83/1.07 23[0:Inp] || list(U) -> equal(length(cons(V,U)),plus(1,length(U)))**. % 0.83/1.07 27[0:Inp] || list(U) -> equal(V,W) equal(count(V,cons(W,U)),count(V,U))**. % 0.83/1.07 67[0:ArS:18.1] || list(U) -> lesseq(length(U),count(V,U))*. % 0.83/1.07 68[0:ArS:23.1] || list(U) -> equal(length(cons(V,U)),plus(length(U),1))**. % 0.83/1.07 122[0:SpR:68.1,67.1] || list(U) list(cons(V,U)) -> lesseq(plus(length(U),1),count(W,cons(V,U)))*. % 0.83/1.07 124[0:MRR:122.1,13.1] || list(U) -> lesseq(plus(length(U),1),count(V,cons(W,U)))*. % 0.83/1.07 175[0:SpR:6.0,124.1] || list(nil) -> lesseq(plus(0,1),count(U,cons(V,nil)))*. % 0.83/1.07 180[0:ArS:175.1] || list(nil) -> lesseq(1,count(U,cons(V,nil)))*. % 0.83/1.07 181[0:MRR:180.0,4.0] || -> lesseq(1,count(U,cons(V,nil)))*. % 0.83/1.07 298[0:SpR:27.2,181.0] || list(nil) -> equal(U,V)* lesseq(1,count(U,nil))*. % 0.83/1.07 310[0:BLD:298.1] || list(nil) -> lesseq(1,count(U,nil))*. % 0.83/1.07 311[0:Rew:9.0,310.1] || list(nil)* -> lesseq(1,0). % 0.83/1.07 312[0:ArS:311.1] || list(nil)* -> . % 0.83/1.07 313(e)[0:MRR:312.0,4.0] || -> . % 0.83/1.07 % 0.83/1.07 % SZS output end CNFRefutation for /tmp/SPASST_11253_n015.cluster.edu % 0.83/1.07 % 0.83/1.07 Formulae used in the proof : fof_head_type fof_list_type fof_in_conv fof_nil_type fof_tail_type fof_l1 fof_a_8 fof_inRange fof_t_5 fof_l_6 % 0.83/1.10 % 0.83/1.10 SPASS+T ended %------------------------------------------------------------------------------