%------------------------------------------------------------------------------ % File : SPASS+T---2.2.22 % Problem : DAT071_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:04 EDT 2022 % Result : Theorem 0.83s 1.10s % Output : Refutation 0.83s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : DAT071_1 : TPTP v8.1.0. Released v6.1.0. % 0.07/0.13 % Command : spasst-tptp-script %s %d % 0.12/0.34 % Computer : n029.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 20:52:54 EDT 2022 % 0.12/0.34 % CPUTime : % 0.19/0.47 % Using integer theory % 0.83/1.10 % 0.83/1.10 % 0.83/1.10 % SZS status Theorem for /tmp/SPASST_30707_n029.cluster.edu % 0.83/1.10 % 0.83/1.10 SPASS V 2.2.22 in combination with yices. % 0.83/1.10 SPASS beiseite: Proof found by SPASS and SMT. % 0.83/1.10 Problem: /tmp/SPASST_30707_n029.cluster.edu % 0.83/1.10 SPASS derived 117 clauses, backtracked 27 clauses and kept 165 clauses. % 0.83/1.10 SPASS backtracked 6 times (1 times due to theory inconsistency). % 0.83/1.10 SPASS allocated 6475 KBytes. % 0.83/1.10 SPASS spent 0:00:00.04 on the problem. % 0.83/1.10 0:00:00.00 for the input. % 0.83/1.10 0:00:00.01 for the FLOTTER CNF translation. % 0.83/1.10 0:00:00.00 for inferences. % 0.83/1.10 0:00:00.00 for the backtracking. % 0.83/1.10 0:00:00.01 for the reduction. % 0.83/1.10 0:00:00.00 for interacting with the SMT procedure. % 0.83/1.10 % 0.83/1.10 % 0.83/1.10 % SZS output start CNFRefutation for /tmp/SPASST_30707_n029.cluster.edu % 0.83/1.10 % 0.83/1.10 % Here is a proof with depth 0, length 10 : % 0.83/1.10 6[0:Inp] || -> greater(skc10,skc12)*. % 0.83/1.10 7[0:Inp] || -> greater(skc10,skc11)*. % 0.83/1.10 8[0:Inp] || -> greatereq(skc11,0)*. % 0.83/1.10 9[0:Inp] || -> greatereq(skc12,0)*. % 0.83/1.10 10[0:Inp] || equal(skc8,skc7)** -> . % 0.83/1.10 15[0:Inp] || -> equal(read(skc9,skc11),skc7)**. % 0.83/1.10 16(e)[0:Inp] || -> equal(read(skc9,skc12),skc8)**. % 0.83/1.10 28[0:Inp] || greatereq(U,0) greater(skc10,U) -> lesseq(read(skc9,U),skc7)*. % 0.83/1.10 29[0:Inp] || greatereq(U,0) greater(skc10,U) -> lesseq(read(skc9,U),skc8)*. % 0.83/1.10 268(e)[0:ThR:29,28,16,15,10,9,8,7,6] || -> . % 0.83/1.10 % 0.83/1.10 % SZS output end CNFRefutation for /tmp/SPASST_30707_n029.cluster.edu % 0.83/1.10 % 0.83/1.10 Formulae used in the proof : fof_init_type fof_c fof_sorted1 % 0.83/1.10 % 0.83/1.10 SPASS+T ended %------------------------------------------------------------------------------