%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : HWV012-1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n012.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 19:14:46 EDT 2022 % Result : Unsatisfiable 0.20s 0.42s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : HWV012-1 : TPTP v8.1.0. Released v2.5.0. % 0.06/0.13 % Command : run_spass %d %s % 0.13/0.33 % Computer : n012.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 02:36:39 EDT 2022 % 0.13/0.34 % CPUTime : % 0.20/0.42 % 0.20/0.42 SPASS V 3.9 % 0.20/0.42 SPASS beiseite: Proof found. % 0.20/0.42 % SZS status Theorem % 0.20/0.42 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.42 SPASS derived 25 clauses, backtracked 0 clauses, performed 0 splits and kept 95 clauses. % 0.20/0.42 SPASS allocated 75767 KBytes. % 0.20/0.42 SPASS spent 0:00:00.07 on the problem. % 0.20/0.42 0:00:00.04 for the input. % 0.20/0.42 0:00:00.00 for the FLOTTER CNF translation. % 0.20/0.42 0:00:00.00 for inferences. % 0.20/0.42 0:00:00.00 for the backtracking. % 0.20/0.42 0:00:00.01 for the reduction. % 0.20/0.42 % 0.20/0.42 % 0.20/0.42 Here is a proof with depth 1, length 12 : % 0.20/0.42 % SZS output start Refutation % 0.20/0.42 1[0:Inp] || -> gt(fifo_length,level(t_139))*r. % 0.20/0.42 2[0:Inp] || -> p_Wr(t_139)*. % 0.20/0.42 3[0:Inp] || -> p_Wr_error(plus(t_139,n1))*. % 0.20/0.42 24[0:Inp] || -> equal(int_level(u),level(u))**. % 0.20/0.42 32[0:Inp] p_Reset(u) || p_Wr_error(plus(u,n1))* -> . % 0.20/0.42 37[0:Inp] p_Wr(u) || gt(fifo_length,int_level(u)) p_Wr_error(plus(u,n1))* -> p_Reset(u) p_Rd(u). % 0.20/0.42 54[0:Inp] p_Wr(u) p_Rd(u) || p_Wr_error(plus(u,n1))* -> p_Reset(u). % 0.20/0.42 102[0:MRR:54.3,32.0] p_Rd(u) p_Wr(u) || p_Wr_error(plus(u,n1))* -> . % 0.20/0.42 115[0:Rew:24.0,37.1] p_Wr(u) || gt(fifo_length,level(u)) p_Wr_error(plus(u,n1))* -> p_Reset(u) p_Rd(u). % 0.20/0.42 116[0:MRR:115.3,115.4,32.0,102.1] p_Wr(u) || p_Wr_error(plus(u,n1))* gt(fifo_length,level(u)) -> . % 0.20/0.42 201[0:Res:1.0,116.1] p_Wr(t_139) || p_Wr_error(plus(t_139,n1))* -> . % 0.20/0.42 205[0:MRR:201.0,201.1,2.0,3.0] || -> . % 0.20/0.42 % SZS output end Refutation % 0.20/0.42 Formulae used in the proof : quest_1 quest_2 quest_3 axiom_21 axiom_29 axiom_34 axiom_51 % 0.20/0.42 %------------------------------------------------------------------------------