%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT102_1 : TPTP v8.1.0. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n014.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:14 EDT 2022 % Result : Theorem 0.75s 1.03s % Output : Refutation 0.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.12 % Problem : DAT102_1 : TPTP v8.1.0. Released v6.1.0. % 0.11/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n014.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 17:37:40 EDT 2022 % 0.13/0.33 % CPUTime : % 0.18/0.46 % Using integer theory % 0.75/1.03 % 0.75/1.03 % 0.75/1.03 % SZS status Theorem for /tmp/SPASST_9010_n014.cluster.edu % 0.75/1.03 % 0.75/1.03 SPASS V 2.2.22 in combination with yices. % 0.75/1.03 SPASS beiseite: Proof found by SPASS. % 0.75/1.03 Problem: /tmp/SPASST_9010_n014.cluster.edu % 0.75/1.03 SPASS derived 41 clauses, backtracked 0 clauses and kept 68 clauses. % 0.75/1.03 SPASS backtracked 0 times (0 times due to theory inconsistency). % 0.75/1.03 SPASS allocated 6388 KBytes. % 0.75/1.03 SPASS spent 0:00:00.02 on the problem. % 0.75/1.03 0:00:00.00 for the input. % 0.75/1.03 0:00:00.01 for the FLOTTER CNF translation. % 0.75/1.03 0:00:00.00 for inferences. % 0.75/1.03 0:00:00.00 for the backtracking. % 0.75/1.03 0:00:00.00 for the reduction. % 0.75/1.03 0:00:00.00 for interacting with the SMT procedure. % 0.75/1.03 % 0.75/1.03 % 0.75/1.03 % SZS output start CNFRefutation for /tmp/SPASST_9010_n014.cluster.edu % 0.75/1.03 % 0.75/1.03 % Here is a proof with depth 4, length 17 : % 0.75/1.03 2[0:Inp] || -> list(nil)*. % 0.75/1.03 5[0:Inp] || -> lesseq(0,skf3(U,V))*. % 0.75/1.03 7[0:Inp] || list(U) -> list(cons(V,U))*. % 0.75/1.03 8[0:Inp] || list(U) equal(cons(V,U),nil)** -> . % 0.75/1.03 9[0:Inp] || list(U) -> equal(tail(cons(V,U)),U)**. % 0.75/1.03 11[0:Inp] || list(U) equal(U,nil) -> inRange(V,U)*. % 0.75/1.03 12[0:Inp] || list(U) inRange(V,tail(U))* -> inRange(V,U). % 0.75/1.03 15[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) less(skf3(V,U),V)*. % 0.75/1.03 64[0:SpL:9.1,12.1] || list(U) list(cons(V,U)) inRange(W,U) -> inRange(W,cons(V,U))*. % 0.75/1.03 67[0:MRR:64.1,7.1] || list(U) inRange(V,U) -> inRange(V,cons(W,U))*. % 0.75/1.03 86[0:OCE:15.3,5.0] || list(U) inRange(0,U)* -> equal(U,nil). % 0.75/1.03 92[0:Res:67.2,86.1] || list(U) inRange(0,U) list(cons(V,U))* -> equal(cons(V,U),nil). % 0.75/1.03 94[0:MRR:92.2,92.3,7.1,8.1] || list(U) inRange(0,U)* -> . % 0.75/1.03 96[0:Res:11.2,94.1] || list(U)* equal(U,nil) list(U)* -> . % 0.75/1.03 98[0:Obv:96.0] || equal(U,nil) list(U)* -> . % 0.75/1.03 100[0:Res:2.0,98.1] || equal(nil,nil)* -> . % 0.75/1.03 104(e)[0:Obv:100.0] || -> . % 0.75/1.03 % 0.75/1.03 % SZS output end CNFRefutation for /tmp/SPASST_9010_n014.cluster.edu % 0.75/1.03 % 0.75/1.03 Formulae used in the proof : fof_head_type fof_inRange fof_nil_type fof_tail_type fof_cons_type fof_l4 fof_l1 % 0.75/1.05 % 0.75/1.05 SPASS+T ended %------------------------------------------------------------------------------