%------------------------------------------------------------------------------ % File : Etableau---0.67 % Problem : HWV024-1 : TPTP v8.1.0. Released v2.5.0. % Transfm : none % Format : tptp:raw % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % Computer : n008.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 14:10:41 EDT 2022 % Result : Unsatisfiable 0.21s 0.41s % Output : CNFRefutation 0.21s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : HWV024-1 : TPTP v8.1.0. Released v2.5.0. % 0.07/0.14 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s % 0.13/0.35 % Computer : n008.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 02:12:07 EDT 2022 % 0.13/0.35 % CPUTime : % 0.21/0.39 # No SInE strategy applied % 0.21/0.39 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN % 0.21/0.39 # and selection function SelectComplexExceptUniqMaxHorn. % 0.21/0.39 # % 0.21/0.39 # Presaturation interreduction done % 0.21/0.39 # Number of axioms: 93 Number of unprocessed: 75 % 0.21/0.39 # Tableaux proof search. % 0.21/0.39 # APR header successfully linked. % 0.21/0.39 # Hello from C++ % 0.21/0.40 # The folding up rule is enabled... % 0.21/0.40 # Local unification is enabled... % 0.21/0.40 # Any saturation attempts will use folding labels... % 0.21/0.40 # 75 beginning clauses after preprocessing and clausification % 0.21/0.40 # Creating start rules for all 4 conjectures. % 0.21/0.40 # There are 4 start rule candidates: % 0.21/0.40 # Found 7 unit axioms. % 0.21/0.40 # Unsuccessfully attempted saturation on 1 start tableaux, moving on. % 0.21/0.40 # 4 start rule tableaux created. % 0.21/0.40 # 68 extension rule candidate clauses % 0.21/0.40 # 7 unit axiom clauses % 0.21/0.40 % 0.21/0.40 # Requested 8, 32 cores available to the main process. % 0.21/0.40 # There are not enough tableaux to fork, creating more from the initial 4 % 0.21/0.40 # Returning from population with 20 new_tableaux and 0 remaining starting tableaux. % 0.21/0.40 # We now have 20 tableaux to operate on % 0.21/0.41 # Creating equality axioms % 0.21/0.41 # Ran out of tableaux, making start rules for all clauses % 0.21/0.41 # There were 1 total branch saturation attempts. % 0.21/0.41 # There were 0 of these attempts blocked. % 0.21/0.41 # There were 0 deferred branch saturation attempts. % 0.21/0.41 # There were 0 free duplicated saturations. % 0.21/0.41 # There were 1 total successful branch saturations. % 0.21/0.41 # There were 0 successful branch saturations in interreduction. % 0.21/0.41 # There were 0 successful branch saturations on the branch. % 0.21/0.41 # There were 1 successful branch saturations after the branch. % 0.21/0.41 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.21/0.41 # Begin clausification derivation % 0.21/0.41 % 0.21/0.41 # End clausification derivation % 0.21/0.41 # Begin listing active clauses obtained from FOF to CNF conversion % 0.21/0.41 cnf(i_0_113, plain, (plus(n0,X1)=X1)). % 0.21/0.41 cnf(i_0_96, plain, (gt(plus(X1,n1),n0))). % 0.21/0.41 cnf(i_0_186, negated_conjecture, (~p_Reset(x_140))). % 0.21/0.41 cnf(i_0_185, negated_conjecture, (~p_Rd(x_140))). % 0.21/0.41 cnf(i_0_95, plain, (plus(X1,n1)!=n0)). % 0.21/0.41 cnf(i_0_111, plain, (~gt(X1,X1))). % 0.21/0.41 cnf(i_0_101, plain, (~def_10(X1,X1))). % 0.21/0.41 cnf(i_0_187, negated_conjecture, (~p_Data_out(x_139,plus(x_140,n1))|~p_Data_out(x_139,x_140))). % 0.21/0.41 cnf(i_0_188, negated_conjecture, (p_Data_out(x_139,plus(x_140,n1))|p_Data_out(x_139,x_140))). % 0.21/0.41 cnf(i_0_100, plain, (~def_10(X1,X2)|~gt(X2,X1))). % 0.21/0.41 cnf(i_0_119, plain, (level(X1)=n0|~p_Empty(X1))). % 0.21/0.41 cnf(i_0_123, plain, (~p_Wr_error(plus(X1,n1))|~p_Reset(X1))). % 0.21/0.41 cnf(i_0_124, plain, (~p_Rd_error(plus(X1,n1))|~p_Reset(X1))). % 0.21/0.41 cnf(i_0_126, plain, (~p_Data_out(X1,plus(X2,n1))|~p_Reset(X2))). % 0.21/0.41 cnf(i_0_112, plain, (X1=X2|plus(X1,n1)!=plus(X2,n1))). % 0.21/0.41 cnf(i_0_117, plain, (level(X1)=fifo_length|~p_Full(X1))). % 0.21/0.41 cnf(i_0_116, plain, (p_Full(X1)|level(X1)!=fifo_length)). % 0.21/0.41 cnf(i_0_118, plain, (p_Empty(X1)|level(X1)!=n0)). % 0.21/0.41 cnf(i_0_125, plain, (~p_Mem(X1,X2,plus(X3,n1))|~p_Reset(X3))). % 0.21/0.41 cnf(i_0_145, plain, (~p_Rd(X1)|~p_Wr(X1)|~p_Wr_error(plus(X1,n1)))). % 0.21/0.41 cnf(i_0_109, plain, (X1=n0|gt(X1,n0))). % 0.21/0.41 cnf(i_0_120, plain, (level(plus(X1,n1))=n0|~p_Reset(X1))). % 0.21/0.41 cnf(i_0_121, plain, (wr_level(plus(X1,n1))=n0|~p_Reset(X1))). % 0.21/0.41 cnf(i_0_122, plain, (rd_level(plus(X1,n1))=n0|~p_Reset(X1))). % 0.21/0.41 cnf(i_0_110, plain, (plus(y_27(X1),n1)=X1|X1=n0)). % 0.21/0.41 cnf(i_0_106, plain, (X1=X2|gt(X1,X2)|gt(X2,X1))). % 0.21/0.41 cnf(i_0_97, plain, (gt(X1,minus(X1,n1))|~gt(X1,n0))). % 0.21/0.41 cnf(i_0_107, plain, (gt(X1,X2)|~gt(X3,X2)|~gt(X1,X3))). % 0.21/0.41 cnf(i_0_103, plain, (gt(X1,X2)|~gt(plus(X1,n1),plus(X2,n1)))). % 0.21/0.41 cnf(i_0_104, plain, (X1=X2|gt(X1,X2)|~gt(plus(X1,n1),X2))). % 0.21/0.41 cnf(i_0_163, plain, (wr_level(plus(X1,n1))=wr_level(X1)|p_Wr(X1)|p_Reset(X1))). % 0.21/0.41 cnf(i_0_102, plain, (gt(plus(X1,n1),plus(X2,n1))|~gt(X1,X2))). % 0.21/0.41 cnf(i_0_183, plain, (p_Wr(X1)|p_Wr_error(X1)|~p_Wr_error(plus(X1,n1)))). % 0.21/0.41 cnf(i_0_184, plain, (p_Wr(X1)|p_Wr_error(plus(X1,n1))|p_Reset(X1)|~p_Wr_error(X1))). % 0.21/0.41 cnf(i_0_176, plain, (level(plus(X1,n1))=level(X1)|p_Rd(X1)|p_Wr(X1)|p_Reset(X1))). % 0.21/0.41 cnf(i_0_128, plain, (~p_Wr(X1)|~p_Wr_error(plus(X1,n1))|~gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_164, plain, (~p_Rd(X1)|~p_Rd_error(plus(X1,n1))|~gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_179, plain, (p_Rd(X1)|p_Rd_error(X1)|~p_Rd_error(plus(X1,n1)))). % 0.21/0.41 cnf(i_0_127, plain, (rd_level(plus(X1,n1))=rd_level(X1)|p_Rd(X1)|p_Reset(X1))). % 0.21/0.41 cnf(i_0_177, plain, (p_Rd(X1)|p_Data_out(X2,X1)|~p_Data_out(X2,plus(X1,n1)))). % 0.21/0.41 cnf(i_0_180, plain, (p_Rd(X1)|p_Rd_error(plus(X1,n1))|p_Reset(X1)|~p_Rd_error(X1))). % 0.21/0.41 cnf(i_0_108, plain, (plus(X1,n1)=X2|gt(X2,plus(X1,n1))|~gt(X2,X1))). % 0.21/0.41 cnf(i_0_181, plain, (p_Wr(X1)|p_Mem(X2,X3,X1)|~p_Mem(X2,X3,plus(X1,n1)))). % 0.21/0.41 cnf(i_0_157, plain, (p_Data_in(X1,X2)|~p_Rd(X2)|~p_Wr(X2)|~p_Mem(wr_level(X2),X1,plus(X2,n1)))). % 0.21/0.41 cnf(i_0_147, plain, (level(plus(X1,n1))=level(X1)|p_Reset(X1)|~p_Rd(X1)|~p_Wr(X1)|~gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_98, plain, (plus(minus(X1,X2),X2)=X1|def_10(X2,X1))). % 0.21/0.41 cnf(i_0_178, plain, (p_Rd(X1)|p_Data_out(X2,plus(X1,n1))|p_Reset(X1)|~p_Data_out(X2,X1))). % 0.21/0.41 cnf(i_0_129, plain, (level(plus(X1,n1))=plus(level(X1),n1)|p_Rd(X1)|p_Reset(X1)|~p_Wr(X1)|~gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_136, plain, (p_Rd(X1)|p_Wr_error(plus(X1,n1))|p_Reset(X1)|gt(fifo_length,level(X1))|~p_Wr(X1))). % 0.21/0.41 cnf(i_0_99, plain, (minus(plus(X1,X2),X2)=X1|def_10(X2,plus(X1,X2)))). % 0.21/0.41 cnf(i_0_182, plain, (p_Wr(X1)|p_Mem(X2,X3,plus(X1,n1))|p_Reset(X1)|~p_Mem(X2,X3,X1))). % 0.21/0.41 cnf(i_0_130, plain, (p_Data_in(X1,X2)|~p_Wr(X2)|~p_Mem(wr_level(X2),X1,plus(X2,n1))|~gt(fifo_length,level(X2)))). % 0.21/0.41 cnf(i_0_170, plain, (p_Rd_error(plus(X1,n1))|p_Reset(X1)|gt(level(X1),n0)|~p_Rd(X1))). % 0.21/0.41 cnf(i_0_138, plain, (level(plus(X1,n1))=level(X1)|p_Rd(X1)|p_Reset(X1)|gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_161, plain, (wr_level(plus(X1,n1))=plus(wr_level(X1),n1)|p_Reset(X1)|~p_Rd(X1)|~p_Wr(X1)|~gt(minus(fifo_length,n1),wr_level(X1)))). % 0.21/0.41 cnf(i_0_153, plain, (level(plus(X1,n1))=plus(level(X1),n1)|p_Reset(X1)|gt(level(X1),n0)|~p_Rd(X1)|~p_Wr(X1))). % 0.21/0.41 cnf(i_0_158, plain, (p_Mem(wr_level(X1),X2,plus(X1,n1))|p_Reset(X1)|~p_Data_in(X2,X1)|~p_Rd(X1)|~p_Wr(X1))). % 0.21/0.41 cnf(i_0_137, plain, (wr_level(plus(X1,n1))=wr_level(X1)|p_Rd(X1)|p_Reset(X1)|gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_172, plain, (level(plus(X1,n1))=level(X1)|p_Wr(X1)|p_Reset(X1)|gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_167, plain, (p_Data_out(X1,plus(X2,n1))|p_Reset(X2)|~p_Rd(X2)|~p_Mem(rd_level(X2),X1,X2)|~gt(level(X2),n0))). % 0.21/0.41 cnf(i_0_171, plain, (rd_level(plus(X1,n1))=rd_level(X1)|p_Reset(X1)|gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_165, plain, (minus(level(X1),n1)=level(plus(X1,n1))|p_Wr(X1)|p_Reset(X1)|~p_Rd(X1)|~gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_162, plain, (wr_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),wr_level(X1))|~p_Rd(X1)|~p_Wr(X1))). % 0.21/0.41 cnf(i_0_173, plain, (p_Data_out(X1,X2)|gt(level(X2),n0)|~p_Data_out(X1,plus(X2,n1)))). % 0.21/0.41 cnf(i_0_174, plain, (p_Data_out(X1,plus(X2,n1))|p_Reset(X2)|gt(level(X2),n0)|~p_Data_out(X1,X2))). % 0.21/0.41 cnf(i_0_166, plain, (p_Mem(rd_level(X1),X2,X1)|~p_Rd(X1)|~p_Data_out(X2,plus(X1,n1))|~gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_131, plain, (p_Mem(wr_level(X1),X2,plus(X1,n1))|p_Reset(X1)|~p_Data_in(X2,X1)|~p_Wr(X1)|~gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_134, plain, (wr_level(plus(X1,n1))=plus(wr_level(X1),n1)|p_Reset(X1)|~p_Wr(X1)|~gt(minus(fifo_length,n1),wr_level(X1))|~gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_135, plain, (wr_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),wr_level(X1))|~p_Wr(X1)|~gt(fifo_length,level(X1)))). % 0.21/0.41 cnf(i_0_168, plain, (rd_level(plus(X1,n1))=plus(rd_level(X1),n1)|p_Reset(X1)|~p_Rd(X1)|~gt(minus(fifo_length,n1),rd_level(X1))|~gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_169, plain, (rd_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),rd_level(X1))|~p_Rd(X1)|~gt(level(X1),n0))). % 0.21/0.41 cnf(i_0_139, plain, (p_Rd(X1)|p_Mem(X2,X3,X1)|gt(fifo_length,level(X1))|~p_Mem(X2,X3,plus(X1,n1)))). % 0.21/0.41 cnf(i_0_140, plain, (p_Rd(X1)|p_Mem(X2,X3,plus(X1,n1))|p_Reset(X1)|gt(fifo_length,level(X1))|~p_Mem(X2,X3,X1))). % 0.21/0.41 cnf(i_0_133, plain, (X1=wr_level(X2)|p_Mem(X1,X3,plus(X2,n1))|p_Reset(X2)|~p_Mem(X1,X3,X2))). % 0.21/0.41 cnf(i_0_132, plain, (X1=wr_level(X2)|p_Mem(X1,X3,X2)|~p_Mem(X1,X3,plus(X2,n1)))). % 0.21/0.41 cnf(i_0_1766, plain, (X4=X4)). % 0.21/0.41 # End listing active clauses. There is an equivalent clause to each of these in the clausification! % 0.21/0.41 # Begin printing tableau % 0.21/0.41 # Found 5 steps % 0.21/0.41 cnf(i_0_1766, plain, (plus(X2,n1)=plus(X2,n1)), inference(start_rule)). % 0.21/0.41 cnf(i_0_2019, plain, (plus(X2,n1)=plus(X2,n1)), inference(extension_rule, [i_0_112])). % 0.21/0.41 cnf(i_0_2030, plain, (X2=X2), inference(extension_rule, [i_0_1770])). % 0.21/0.41 cnf(i_0_2263, plain, (plus(n0,X8)!=X8), inference(closure_rule, [i_0_113])). % 0.21/0.41 cnf(i_0_2261, plain, (plus(X2,plus(n0,X8))=plus(X2,X8)), inference(etableau_closure_rule, [i_0_2261, ...])). % 0.21/0.41 # End printing tableau % 0.21/0.41 # SZS output end % 0.21/0.41 # Branches closed with saturation will be marked with an "s" % 0.21/0.42 # Child (13244) has found a proof. % 0.21/0.42 % 0.21/0.42 # Proof search is over... % 0.21/0.42 # Freeing feature tree %------------------------------------------------------------------------------