%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : ARI613_1 : TPTP v8.1.0. Released v5.1.0. % Transfm : none % Format : tptp:raw % Command : spasst-tptp-script %s %d % Computer : n023.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 : Thu Jul 14 22:18:19 EDT 2022 % Result : Theorem 0.77s 1.09s % Output : Refutation 0.77s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : ARI613_1 : TPTP v8.1.0. Released v5.1.0. % 0.10/0.12 % Command : spasst-tptp-script %s %d % 0.13/0.33 % Computer : n023.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 Jun 17 11:48:34 EDT 2022 % 0.13/0.33 % CPUTime : % 0.20/0.46 % Using integer theory % 0.77/1.09 % 0.77/1.09 % 0.77/1.09 % SZS status Theorem for /tmp/SPASST_17460_n023.cluster.edu % 0.77/1.09 % 0.77/1.09 SPASS V 2.2.22 in combination with yices. % 0.77/1.09 SPASS beiseite: Proof found by SPASS. % 0.77/1.09 Problem: /tmp/SPASST_17460_n023.cluster.edu % 0.77/1.09 SPASS derived 119 clauses, backtracked 0 clauses and kept 57 clauses. % 0.77/1.09 SPASS backtracked 0 times (0 times due to theory inconsistency). % 0.77/1.09 SPASS allocated 6355 KBytes. % 0.77/1.09 SPASS spent 0:00:00.08 on the problem. % 0.77/1.09 0:00:00.00 for the input. % 0.77/1.09 0:00:00.00 for the FLOTTER CNF translation. % 0.77/1.09 0:00:00.00 for inferences. % 0.77/1.09 0:00:00.00 for the backtracking. % 0.77/1.09 0:00:00.01 for the reduction. % 0.77/1.09 0:00:00.07 for interacting with the SMT procedure. % 0.77/1.09 % 0.77/1.09 % 0.77/1.09 % SZS output start CNFRefutation for /tmp/SPASST_17460_n023.cluster.edu % 0.77/1.09 % 0.77/1.09 % Here is a proof with depth 4, length 20 : % 0.77/1.09 1[0:Inp] || less(3,U)* -> p(U). % 0.77/1.09 2[0:Inp] || less(U,1)* -> q(U). % 0.77/1.09 3[0:Inp] || p(U)* q(V)* equal(plus(U,V),0)**+ -> . % 0.77/1.09 6[0:ThA] || -> equal(plus(uminus(U),plus(U,V)),V)**. % 0.77/1.09 8[0:ThA] || -> equal(plus(plus(U,V),uminus(V)),U)**. % 0.77/1.09 9[0:ThA] || -> equal(plus(U,uminus(U)),0)**. % 0.77/1.09 14[0:ThA] || -> less(U,plus(U,1))*. % 0.77/1.09 16[0:ThA] || -> equal(U,V) less(V,U)* less(U,V)*. % 0.77/1.09 35[0:TOC:2.0] || -> q(U) lesseq(1,U)*. % 0.77/1.09 36[0:TOC:1.0] || -> p(U) lesseq(U,3)*. % 0.77/1.09 38[0:OCE:35.1,16.1] || -> q(U) equal(1,U) less(1,U)*. % 0.77/1.09 41[0:OCE:36.1,16.1] || -> p(U) equal(U,3) less(U,3)*. % 0.77/1.09 51[0:SpL:8.0,3.2] || p(plus(U,V))* q(uminus(V)) equal(U,0) -> . % 0.77/1.09 61[0:OCE:38.2,16.1] || -> q(U) equal(1,U) equal(1,U) less(1,U)*. % 0.77/1.09 73[0:OCE:41.2,14.0] || -> p(plus(3,1))* equal(plus(3,1),3). % 0.77/1.09 111[0:SpL:6.0,51.0] || p(U) q(uminus(plus(V,U)))* equal(uminus(V),0) -> . % 0.77/1.09 116[0:ArS:111.2] || p(U) q(uminus(plus(V,U)))* equal(0,V) -> . % 0.77/1.09 140[0:SpL:8.0,116.1] || p(uminus(U))* q(uminus(V))* equal(plus(V,U),0)**+ -> . % 0.77/1.09 203[0:SpL:9.0,140.2] || p(uminus(uminus(U)))* q(uminus(U)) equal(0,0) -> . % 0.77/1.09 235[0:ThR:203,73,61] || -> . % 0.77/1.09 % 0.77/1.09 % SZS output end CNFRefutation for /tmp/SPASST_17460_n023.cluster.edu % 0.77/1.09 % 0.77/1.09 Formulae used in the proof : fof_interv_3_infty_and_neginfty_1_contain_compl % 0.77/1.09 % 0.77/1.09 SPASS+T ended %------------------------------------------------------------------------------