%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : HWV013-1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % 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 19:14:46 EDT 2022 % Result : Unsatisfiable 0.20s 0.44s % Output : Refutation 0.20s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : HWV013-1 : TPTP v8.1.0. Released v2.5.0. % 0.12/0.13 % Command : run_spass %d %s % 0.13/0.35 % Computer : n029.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Fri Jun 17 09:19:58 EDT 2022 % 0.13/0.35 % CPUTime : % 0.20/0.44 % 0.20/0.44 SPASS V 3.9 % 0.20/0.44 SPASS beiseite: Proof found. % 0.20/0.44 % SZS status Theorem % 0.20/0.44 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.20/0.44 SPASS derived 64 clauses, backtracked 0 clauses, performed 0 splits and kept 108 clauses. % 0.20/0.44 SPASS allocated 75821 KBytes. % 0.20/0.44 SPASS spent 0:00:00.07 on the problem. % 0.20/0.44 0:00:00.04 for the input. % 0.20/0.44 0:00:00.00 for the FLOTTER CNF translation. % 0.20/0.44 0:00:00.00 for inferences. % 0.20/0.44 0:00:00.00 for the backtracking. % 0.20/0.44 0:00:00.01 for the reduction. % 0.20/0.44 % 0.20/0.44 % 0.20/0.44 Here is a proof with depth 1, length 10 : % 0.20/0.44 % SZS output start Refutation % 0.20/0.44 1[0:Inp] || p_Reset(x_139)* -> . % 0.20/0.44 2[0:Inp] || -> gt(fifo_length,level(x_139))*r. % 0.20/0.44 3[0:Inp] || p_Rd(x_139)* -> . % 0.20/0.44 4[0:Inp] || -> p_Wr(x_139)*. % 0.20/0.44 5[0:Inp] || equal(plus(level(x_139),n1),level(plus(x_139,n1)))** -> . % 0.20/0.44 26[0:Inp] || -> equal(int_level(u),level(u))**. % 0.20/0.44 40[0:Inp] p_Wr(u) || gt(fifo_length,int_level(u)) -> p_Reset(u) p_Rd(u) equal(int_level(plus(u,n1)),plus(int_level(u),n1))**. % 0.20/0.44 141[0:Rew:26.0,40.4,26.0,40.4,26.0,40.1] p_Wr(u) || gt(fifo_length,level(u)) -> p_Rd(u) p_Reset(u) equal(plus(level(u),n1),level(plus(u,n1)))**. % 0.20/0.44 235[0:Res:2.0,141.1] p_Wr(x_139) || -> p_Reset(x_139) p_Rd(x_139) equal(plus(level(x_139),n1),level(plus(x_139,n1)))**. % 0.20/0.44 256[0:MRR:235.0,235.1,235.2,235.3,4.0,1.0,3.0,5.0] || -> . % 0.20/0.44 % SZS output end Refutation % 0.20/0.44 Formulae used in the proof : quest_1 quest_2 quest_3 quest_4 quest_5 axiom_21 axiom_35 % 0.20/0.44 %------------------------------------------------------------------------------