%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT073_1 : TPTP v8.1.0. Released v6.1.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n029.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:05 EDT 2022 % Result : Theorem 0.45s 1.07s % Output : Refutation 0.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : DAT073_1 : TPTP v8.1.0. Released v6.1.0. % 0.07/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n029.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 16:56:54 EDT 2022 % 0.13/0.33 % CPUTime : % 0.20/0.46 % Using integer theory % 0.45/1.07 % 0.45/1.07 % 0.45/1.07 % SZS status Theorem for /tmp/SPASST_3160_n029.cluster.edu % 0.45/1.07 % 0.45/1.07 SPASS V 2.2.22 in combination with yices. % 0.45/1.07 SPASS beiseite: Proof found by SPASS. % 0.45/1.07 Problem: /tmp/SPASST_3160_n029.cluster.edu % 0.45/1.07 SPASS derived 81 clauses, backtracked 0 clauses and kept 96 clauses. % 0.45/1.07 SPASS backtracked 0 times (0 times due to theory inconsistency). % 0.45/1.07 SPASS allocated 6419 KBytes. % 0.45/1.07 SPASS spent 0:00:00.03 on the problem. % 0.45/1.07 0:00:00.00 for the input. % 0.45/1.07 0:00:00.01 for the FLOTTER CNF translation. % 0.45/1.07 0:00:00.00 for inferences. % 0.45/1.07 0:00:00.00 for the backtracking. % 0.45/1.07 0:00:00.01 for the reduction. % 0.45/1.07 0:00:00.00 for interacting with the SMT procedure. % 0.45/1.07 % 0.45/1.07 % 0.45/1.07 % SZS output start CNFRefutation for /tmp/SPASST_3160_n029.cluster.edu % 0.45/1.07 % 0.45/1.07 % Here is a proof with depth 3, length 16 : % 0.45/1.07 4[0:Inp] || -> array(init(U))*. % 0.45/1.07 11[0:Inp] || -> equal(read(init(U),V),U)**. % 0.45/1.07 20[0:Inp] || greatereq(U,0) array(V) -> inRange(V,max(V,U),U)*. % 0.45/1.07 27[0:Inp] || array(U) greatereq(V,0) greater(W,V)* inRange(U,X,W)* -> greatereq(read(U,V),0)*. % 0.45/1.07 47[0:ThA] || -> less(plus(U,-1),U)*. % 0.45/1.07 73[0:ArS:20.0] || lesseq(0,U) array(V) -> inRange(V,max(V,U),U)*. % 0.45/1.07 74[0:TOC:73.0] || array(U) -> less(V,0) inRange(U,max(U,V),V)*. % 0.45/1.07 79[0:ArS:27.4] || array(U) lesseq(0,V) less(V,W)* inRange(U,X,W)* -> lesseq(0,read(U,V))*. % 0.45/1.07 80[0:TOC:79.2] || array(U) inRange(U,V,W)*+ -> lesseq(W,X)* less(X,0) lesseq(0,read(U,X))*. % 0.45/1.07 172[0:Res:74.2,80.1] || array(U) array(U) -> less(V,0) lesseq(V,W)* less(W,0) lesseq(0,read(U,W))*. % 0.45/1.07 179[0:BLD:172.2] || array(U) array(U) -> less(V,0) lesseq(0,read(U,V))*. % 0.45/1.07 180[0:Obv:179.0] || array(U) -> less(V,0) lesseq(0,read(U,V))*. % 0.45/1.07 185[0:SpR:11.0,180.2] || array(init(U))* -> less(V,0)* lesseq(0,U). % 0.45/1.07 191[0:BLD:185.1] || array(init(U))* -> lesseq(0,U). % 0.45/1.07 192[0:MRR:191.0,4.0] || -> lesseq(0,U)*. % 0.45/1.07 194(e)[0:OCE:192.0,47.0] || -> . % 0.45/1.07 % 0.45/1.07 % SZS output end CNFRefutation for /tmp/SPASST_3160_n029.cluster.edu % 0.45/1.07 % 0.45/1.07 Formulae used in the proof : fof_array_type fof_a fof_sorted1 fof_inRange % 0.80/1.09 % 0.80/1.09 SPASS+T ended %------------------------------------------------------------------------------