%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT104_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.76s 1.07s % Output : Refutation 0.76s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : DAT104_1 : TPTP v8.1.0. Released v6.1.0. % 0.12/0.13 % Command : spasst-tptp-script %s %d % 0.12/0.34 % Computer : n014.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 600 % 0.12/0.34 % DateTime : Fri Jul 1 19:49:10 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.46 % Using integer theory % 0.76/1.07 % 0.76/1.07 % 0.76/1.07 % SZS status Theorem for /tmp/SPASST_21843_n014.cluster.edu % 0.76/1.07 % 0.76/1.07 SPASS V 2.2.22 in combination with yices. % 0.76/1.07 SPASS beiseite: Proof found by SPASS. % 0.76/1.07 Problem: /tmp/SPASST_21843_n014.cluster.edu % 0.76/1.07 SPASS derived 315 clauses, backtracked 0 clauses and kept 189 clauses. % 0.76/1.07 SPASS backtracked 1 times (0 times due to theory inconsistency). % 0.76/1.07 SPASS allocated 6680 KBytes. % 0.76/1.07 SPASS spent 0:00:00.06 on the problem. % 0.76/1.07 0:00:00.00 for the input. % 0.76/1.07 0:00:00.01 for the FLOTTER CNF translation. % 0.76/1.07 0:00:00.01 for inferences. % 0.76/1.07 0:00:00.00 for the backtracking. % 0.76/1.07 0:00:00.03 for the reduction. % 0.76/1.07 0:00:00.01 for interacting with the SMT procedure. % 0.76/1.07 % 0.76/1.07 % 0.76/1.07 % SZS output start CNFRefutation for /tmp/SPASST_21843_n014.cluster.edu % 0.76/1.07 % 0.76/1.07 % Here is a proof with depth 6, length 40 : % 0.76/1.07 2[0:Inp] || -> list(nil)*. % 0.76/1.07 7[0:Inp] || list(U) -> list(cons(V,U))*. % 0.76/1.07 8[0:Inp] || list(U) equal(cons(V,U),nil)** -> . % 0.76/1.07 10[0:Inp] || list(U) -> equal(head(cons(V,U)),V)**. % 0.76/1.07 11[0:Inp] || list(U) equal(U,nil) -> inRange(V,U)*. % 0.76/1.07 12[0:Inp] || equal(U,minus(V,1))* list(W) inRange(V,W)* -> inRange(U,W)*. % 0.76/1.07 14[0:Inp] || list(U) inRange(V,U) -> list(skf2(V,U))* equal(U,nil). % 0.76/1.07 15[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) less(skf3(V,U),V)*. % 0.76/1.07 16[0:Inp] || list(U) inRange(V,U) -> equal(U,nil) equal(cons(skf3(V,U),skf2(V,U)),U)**. % 0.76/1.07 17[0:Inp] || list(U) list(V) inRange(W,V)* less(X,W)* lesseq(0,X) equal(U,cons(X,V))* -> inRange(W,U)*. % 0.76/1.07 21[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**. % 0.76/1.07 24[0:ThA] || -> equal(plus(uminus(U),U),0)**. % 0.76/1.07 27[0:ThA] || -> lesseq(U,U)*. % 0.76/1.07 49[0:ArS:12.0] || list(U) inRange(V,U)* equal(W,plus(V,-1))*+ -> inRange(W,U)*. % 0.76/1.07 50[0:TOC:17.4] || list(U) list(V) inRange(W,U)* equal(V,cons(X,U))*+ -> inRange(W,V)* lesseq(W,X)* less(X,0). % 0.76/1.07 52[0:Res:2.0,49.1] || inRange(U,nil)* equal(plus(U,-1),V)*+ -> inRange(V,nil)*. % 0.76/1.07 92[0:EqR:52.1] || inRange(U,nil) -> inRange(plus(U,-1),nil)*. % 0.76/1.07 100[0:SpR:21.0,92.1] || inRange(plus(U,uminus(-1)),nil)* -> inRange(U,nil). % 0.76/1.07 102[0:ArS:100.0] || inRange(plus(U,1),nil)* -> inRange(U,nil). % 0.76/1.07 112[0:EqR:49.2] || list(U) inRange(V,U) -> inRange(plus(V,-1),U)*. % 0.76/1.07 122[0:Res:11.2,102.0] || list(nil) equal(nil,nil) -> inRange(U,nil)*. % 0.76/1.07 126[0:Obv:122.1] || list(nil) -> inRange(U,nil)*. % 0.76/1.07 127[0:MRR:126.0,2.0] || -> inRange(U,nil)*. % 0.76/1.07 134[0:SpR:16.3,10.1] || list(U) inRange(V,U) list(skf2(V,U))* -> equal(U,nil) equal(skf3(V,U),head(U)). % 0.76/1.07 137[0:MRR:134.2,14.2] || list(U) inRange(V,U) -> equal(U,nil) equal(skf3(V,U),head(U))**. % 0.76/1.07 138[0:Rew:137.3,15.3] || list(U) inRange(V,U) -> equal(U,nil) less(head(U),V)*. % 0.76/1.07 160[0:OCE:138.3,27.0] || list(U) inRange(head(U),U)* -> equal(U,nil). % 0.76/1.07 162[0:SpL:10.1,160.1] || list(U) list(cons(V,U)) inRange(V,cons(V,U))* -> equal(cons(V,U),nil). % 0.76/1.07 165[0:MRR:162.1,162.3,7.1,8.1] || list(U) inRange(V,cons(V,U))* -> . % 0.76/1.07 168[0:Res:112.2,165.1] || list(cons(plus(U,-1),V)) inRange(U,cons(plus(U,-1),V))* list(V) -> . % 0.76/1.07 171[0:MRR:168.0,7.1] || inRange(U,cons(plus(U,-1),V))* list(V) -> . % 0.76/1.07 173[0:EqR:50.3] || list(U) list(cons(V,U)) inRange(W,U) -> inRange(W,cons(V,U))* lesseq(W,V) less(V,0). % 0.76/1.07 175[0:MRR:173.1,7.1] || list(U) inRange(V,U) -> inRange(V,cons(W,U))* lesseq(V,W) less(W,0). % 0.76/1.07 178[0:SpL:24.0,171.0] || inRange(uminus(-1),cons(0,U))* list(U) -> . % 0.76/1.07 183[0:ArS:178.0] || inRange(1,cons(0,U))* list(U) -> . % 0.76/1.07 491[0:Res:175.2,183.0] || list(U) inRange(1,U)* list(U) -> lesseq(1,0) less(0,0). % 0.76/1.07 518[0:ArS:491.4] || list(U) inRange(1,U)* list(U) -> . % 0.76/1.07 519[0:Obv:518.0] || inRange(1,U)* list(U) -> . % 0.76/1.07 574[0:Res:127.0,519.0] || list(nil)* -> . % 0.76/1.07 578(e)[0:MRR:574.0,2.0] || -> . % 0.76/1.07 % 0.76/1.07 % SZS output end CNFRefutation for /tmp/SPASST_21843_n014.cluster.edu % 0.76/1.07 % 0.76/1.07 Formulae used in the proof : fof_head_type fof_tail_type fof_cons_type fof_l2 fof_l1 fof_inRange fof_nil_type fof_l3 % 0.85/1.09 % 0.85/1.09 SPASS+T ended %------------------------------------------------------------------------------