%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT015_1 : TPTP v8.1.0. Released v5.0.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n004.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:31:46 EDT 2022 % Result : Theorem 0.46s 1.04s % Output : Refutation 0.78s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : DAT015_1 : TPTP v8.1.0. Released v5.0.0. % 0.07/0.13 % Command : spasst-tptp-script %s %d % 0.13/0.34 % Computer : n004.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Fri Jul 1 17:50:53 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.47 % Using integer theory % 0.46/1.04 % 0.46/1.04 % 0.46/1.04 % SZS status Theorem for /tmp/SPASST_21430_n004.cluster.edu % 0.46/1.04 % 0.46/1.04 SPASS V 2.2.22 in combination with yices. % 0.46/1.04 SPASS beiseite: Proof found by SPASS. % 0.46/1.04 Problem: /tmp/SPASST_21430_n004.cluster.edu % 0.46/1.04 SPASS derived 54 clauses, backtracked 0 clauses and kept 51 clauses. % 0.46/1.04 SPASS backtracked 0 times (0 times due to theory inconsistency). % 0.46/1.04 SPASS allocated 6297 KBytes. % 0.46/1.04 SPASS spent 0:00:00.02 on the problem. % 0.46/1.04 0:00:00.00 for the input. % 0.46/1.04 0:00:00.00 for the FLOTTER CNF translation. % 0.46/1.04 0:00:00.00 for inferences. % 0.46/1.04 0:00:00.00 for the backtracking. % 0.46/1.04 0:00:00.00 for the reduction. % 0.46/1.04 0:00:00.00 for interacting with the SMT procedure. % 0.46/1.04 % 0.46/1.04 % 0.46/1.04 % SZS output start CNFRefutation for /tmp/SPASST_21430_n004.cluster.edu % 0.46/1.04 % 0.46/1.04 % Here is a proof with depth 5, length 16 : % 0.46/1.04 3[0:Inp] || -> array(skc2)*. % 0.46/1.04 4[0:Inp] || equal(read(skc2,U),50)** -> . % 0.46/1.04 6[0:Inp] || array(U) -> equal(read(write(U,V,W),V),W)**. % 0.46/1.04 7[0:Inp] || lesseq(U,30) lesseq(20,U) -> equal(read(skc2,U),plus(U,25))**. % 0.46/1.04 8[0:Inp] || array(U) -> equal(V,W) equal(read(write(U,V,X),W),read(U,W))**. % 0.46/1.04 12[0:ThA] || -> equal(plus(plus(U,uminus(V)),V),U)**. % 0.46/1.04 40[0:TOC:7.1] || -> less(U,20) less(30,U) equal(read(skc2,U),plus(U,25))**. % 0.46/1.04 42[0:Res:3.0,6.0] || -> equal(read(write(skc2,U,V),U),V)**. % 0.46/1.04 45[0:Res:8.1,4.0] || array(U) -> equal(read(write(U,50,V),read(skc2,W)),read(U,read(skc2,W)))**. % 0.46/1.04 46[0:Res:3.0,45.0] || -> equal(read(write(skc2,50,U),read(skc2,V)),read(skc2,read(skc2,V)))**. % 0.46/1.04 80[0:SpR:40.2,46.0] || -> less(U,20) less(30,U) equal(read(write(skc2,50,V),plus(U,25)),read(skc2,plus(U,25)))**. % 0.46/1.04 103[0:SpR:12.0,80.2] || -> less(plus(U,uminus(25)),20) less(30,plus(U,uminus(25))) equal(read(write(skc2,50,V),U),read(skc2,U))**. % 0.46/1.04 106[0:ArS:103.1] || -> less(U,45) less(55,U) equal(read(write(skc2,50,V),U),read(skc2,U))**. % 0.46/1.04 109[0:SpR:106.2,42.0] || -> less(50,45) less(55,50) equal(read(skc2,50),U)*. % 0.78/1.04 118[0:BLD:109.2] || -> less(50,45) less(55,50)*. % 0.78/1.04 119(e)[0:ArS:118.1] || -> . % 0.78/1.04 % 0.78/1.04 % SZS output end CNFRefutation for /tmp/SPASST_21430_n004.cluster.edu % 0.78/1.04 % 0.78/1.04 Formulae used in the proof : fof_array_type fof_co1 fof_write_type fof_ax1 % 0.78/1.06 % 0.78/1.06 SPASS+T ended %------------------------------------------------------------------------------