%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT088_1 : TPTP v8.1.0. Released v6.1.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:32:10 EDT 2022 % Result : Theorem 0.43s 1.07s % Output : Refutation 0.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT088_1 : TPTP v8.1.0. Released v6.1.0. % 0.00/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 20:46:08 EDT 2022 % 0.12/0.33 % CPUTime : % 0.18/0.46 % Using integer theory % 0.43/1.07 % 0.43/1.07 % 0.43/1.07 % SZS status Theorem for /tmp/SPASST_1801_n027.cluster.edu % 0.43/1.07 % 0.43/1.07 SPASS V 2.2.22 in combination with yices. % 0.43/1.07 SPASS beiseite: Proof found by SPASS. % 0.43/1.07 Problem: /tmp/SPASST_1801_n027.cluster.edu % 0.43/1.07 SPASS derived 70 clauses, backtracked 0 clauses and kept 98 clauses. % 0.43/1.07 SPASS backtracked 1 times (0 times due to theory inconsistency). % 0.43/1.07 SPASS allocated 6496 KBytes. % 0.43/1.07 SPASS spent 0:00:00.03 on the problem. % 0.43/1.07 0:00:00.00 for the input. % 0.43/1.07 0:00:00.01 for the FLOTTER CNF translation. % 0.43/1.07 0:00:00.00 for inferences. % 0.43/1.07 0:00:00.00 for the backtracking. % 0.43/1.07 0:00:00.01 for the reduction. % 0.43/1.07 0:00:00.00 for interacting with the SMT procedure. % 0.43/1.07 % 0.43/1.07 % 0.43/1.07 % SZS output start CNFRefutation for /tmp/SPASST_1801_n027.cluster.edu % 0.43/1.07 % 0.43/1.07 % Here is a proof with depth 1, length 13 : % 0.43/1.07 4[0:Inp] || -> list(nil)*. % 0.43/1.07 9[0:Inp] || -> equal(count(U,nil),0)**. % 0.43/1.07 13[0:Inp] || list(U) -> list(cons(V,U))*. % 0.43/1.07 15[0:Inp] || list(U) equal(cons(V,U),nil)** -> . % 0.43/1.07 16[0:Inp] || list(U) -> equal(tail(cons(V,U)),U)**. % 0.43/1.07 24[0:Inp] || list(U) -> equal(count(V,cons(V,U)),plus(count(V,U),1))**. % 0.43/1.07 26[0:Inp] || list(U) -> equal(U,nil) equal(count(V,tail(U)),count(V,U))**. % 0.43/1.07 160[0:SpR:16.1,26.2] || list(U) list(cons(V,U)) -> equal(cons(V,U),nil) equal(count(W,cons(V,U)),count(W,U))**. % 0.43/1.07 163(e)[0:MRR:160.1,160.2,13.1,15.1] || list(U) -> equal(count(V,cons(W,U)),count(V,U))**. % 0.43/1.07 164[0:Rew:163.1,24.1] || list(U) -> equal(plus(count(V,U),1),count(V,U))**. % 0.43/1.07 174[0:SpR:9.0,164.1] || list(nil)* -> equal(plus(0,1),0). % 0.43/1.07 176[0:ArS:174.1] || list(nil)* -> . % 0.43/1.07 177(e)[0:MRR:176.0,4.0] || -> . % 0.43/1.07 % 0.43/1.07 % SZS output end CNFRefutation for /tmp/SPASST_1801_n027.cluster.edu % 0.43/1.07 % 0.43/1.07 Formulae used in the proof : fof_head_type fof_in_conv fof_nil_type fof_tail_type fof_l_6 fof_l4 fof_l3 fof_inRange fof_t_5 % 0.83/1.09 % 0.83/1.09 SPASS+T ended %------------------------------------------------------------------------------