%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT055_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:59 EDT 2022 % Result : Theorem 0.77s 1.03s % Output : Refutation 0.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : DAT055_1 : TPTP v8.1.0. Released v5.0.0. % 0.04/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 19:08:23 EDT 2022 % 0.13/0.34 % CPUTime : % 0.19/0.47 % Using integer theory % 0.77/1.03 % 0.77/1.03 % 0.77/1.03 % SZS status Theorem for /tmp/SPASST_27495_n004.cluster.edu % 0.77/1.03 % 0.77/1.03 SPASS V 2.2.22 in combination with yices. % 0.77/1.03 SPASS beiseite: Proof found by SPASS. % 0.77/1.03 Problem: /tmp/SPASST_27495_n004.cluster.edu % 0.77/1.03 SPASS derived 73 clauses, backtracked 17 clauses and kept 85 clauses. % 0.77/1.03 SPASS backtracked 6 times (0 times due to theory inconsistency). % 0.77/1.03 SPASS allocated 6258 KBytes. % 0.77/1.03 SPASS spent 0:00:00.01 on the problem. % 0.77/1.03 0:00:00.00 for the input. % 0.77/1.03 0:00:00.00 for the FLOTTER CNF translation. % 0.77/1.03 0:00:00.00 for inferences. % 0.77/1.03 0:00:00.00 for the backtracking. % 0.77/1.03 0:00:00.00 for the reduction. % 0.77/1.03 0:00:00.00 for interacting with the SMT procedure. % 0.77/1.03 % 0.77/1.03 % 0.77/1.03 % SZS output start CNFRefutation for /tmp/SPASST_27495_n004.cluster.edu % 0.77/1.03 % 0.77/1.03 % Here is a proof with depth 4, length 41 : % 0.77/1.03 5[0:Inp] || -> list(a)*. % 0.77/1.03 7[0:Inp] || -> less(0,k)*. % 0.77/1.03 8[0:Inp] || -> lesseq(l,min(a))*. % 0.77/1.03 9[0:Inp] || less(l,plus(max(a),k))* -> . % 0.77/1.03 10[0:Inp] || list(U) -> lesseq(min(U),max(U))*. % 0.77/1.03 18[0:ThA] || -> equal(plus(U,0),U)**. % 0.77/1.03 23[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*. % 0.77/1.03 25[0:ThA] || -> lesseq(U,V) less(plus(W,V),plus(W,U))*. % 0.77/1.03 42[0:TOC:9.0] || -> lesseq(plus(max(a),k),l)*. % 0.77/1.03 44[0:Res:5.0,10.0] || -> lesseq(min(a),max(a))*. % 0.77/1.03 47(e)[0:OCE:8.0,23.1] || -> equal(min(a),l) less(l,min(a))*. % 0.77/1.03 49[1:Spt:47.0] || -> equal(min(a),l)**. % 0.77/1.03 51[1:Rew:49.0,44.0] || -> lesseq(l,max(a))*. % 0.77/1.03 53(e)[1:OCE:51.0,23.1] || -> equal(max(a),l) less(l,max(a))*. % 0.77/1.03 55[2:Spt:53.0] || -> equal(max(a),l)**. % 0.77/1.03 57[2:Rew:55.0,42.0] || -> lesseq(plus(l,k),l)*. % 0.77/1.03 59[2:OCh:57.0,25.1] || -> lesseq(k,U) less(plus(l,U),l)*. % 0.77/1.03 61(e)[2:SpR:18.0,59.1] || -> lesseq(k,0) less(l,l)*. % 0.77/1.03 74[3:Spt:61.0] || -> lesseq(k,0)*. % 0.77/1.03 75(e)[3:OCE:74.0,7.0] || -> . % 0.77/1.03 78[3:Spt:75.0,61.0,74.0] || lesseq(k,0)* -> . % 0.77/1.03 79[3:Spt:75.0,61.1] || -> less(l,l)*. % 0.77/1.03 83(e)[3:OCE:79.0,79.0] || -> . % 0.77/1.03 85[2:Spt:83.0,53.0,55.0] || equal(max(a),l)** -> . % 0.77/1.03 86[2:Spt:83.0,53.1] || -> less(l,max(a))*. % 0.77/1.03 91[0:OCh:42.0,25.1] || -> lesseq(k,U) less(plus(max(a),U),l)*. % 0.77/1.03 93(e)[0:SpR:18.0,91.1] || -> lesseq(k,0) less(max(a),l)*. % 0.77/1.03 99[3:Spt:93.0] || -> lesseq(k,0)*. % 0.77/1.03 100(e)[3:OCE:99.0,7.0] || -> . % 0.77/1.03 103[3:Spt:100.0,93.0,99.0] || lesseq(k,0)* -> . % 0.77/1.03 104[3:Spt:100.0,93.1] || -> less(max(a),l)*. % 0.77/1.03 106(e)[3:OCE:104.0,86.0] || -> . % 0.77/1.03 110[1:Spt:106.0,47.0,49.0] || equal(min(a),l)** -> . % 0.77/1.03 111[1:Spt:106.0,47.1] || -> less(l,min(a))*. % 0.77/1.03 114[1:OCh:111.0,10.1] || list(a) -> less(l,max(a))*. % 0.77/1.03 115[1:MRR:114.0,5.0] || -> less(l,max(a))*. % 0.77/1.03 126[2:Spt:93.0] || -> lesseq(k,0)*. % 0.77/1.03 127(e)[2:OCE:126.0,7.0] || -> . % 0.77/1.03 130[2:Spt:127.0,93.0,126.0] || lesseq(k,0)* -> . % 0.77/1.03 131[2:Spt:127.0,93.1] || -> less(max(a),l)*. % 0.77/1.03 133(e)[2:OCE:131.0,115.0] || -> . % 0.77/1.03 % 0.77/1.03 % SZS output end CNFRefutation for /tmp/SPASST_27495_n004.cluster.edu % 0.77/1.03 % 0.77/1.03 Formulae used in the proof : fof_l_type fof_list_type fof_boyer_moore_max_min % 0.77/1.05 % 0.77/1.05 SPASS+T ended %------------------------------------------------------------------------------