TSTP Solution File: HWV033-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV033-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 : n020.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:47 EDT 2022
% Result : Unsatisfiable 12.30s 1.96s
% Output : CNFRefutation 12.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV033-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.12 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 06:38:49 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.37 # No SInE strategy applied
% 0.18/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.18/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.18/0.37 #
% 0.18/0.37 # Presaturation interreduction done
% 0.18/0.37 # Number of axioms: 92 Number of unprocessed: 74
% 0.18/0.37 # Tableaux proof search.
% 0.18/0.37 # APR header successfully linked.
% 0.18/0.37 # Hello from C++
% 0.18/0.37 # The folding up rule is enabled...
% 0.18/0.37 # Local unification is enabled...
% 0.18/0.37 # Any saturation attempts will use folding labels...
% 0.18/0.37 # 74 beginning clauses after preprocessing and clausification
% 0.18/0.37 # Creating start rules for all 3 conjectures.
% 0.18/0.37 # There are 3 start rule candidates:
% 0.18/0.37 # Found 8 unit axioms.
% 0.18/0.37 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.18/0.37 # 3 start rule tableaux created.
% 0.18/0.37 # 66 extension rule candidate clauses
% 0.18/0.37 # 8 unit axiom clauses
% 0.18/0.37
% 0.18/0.37 # Requested 8, 32 cores available to the main process.
% 0.18/0.37 # There are not enough tableaux to fork, creating more from the initial 3
% 0.18/0.37 # Returning from population with 11 new_tableaux and 0 remaining starting tableaux.
% 0.18/0.37 # We now have 11 tableaux to operate on
% 6.82/1.23 # Creating equality axioms
% 6.82/1.23 # Ran out of tableaux, making start rules for all clauses
% 7.54/1.36 # Creating equality axioms
% 7.54/1.36 # Ran out of tableaux, making start rules for all clauses
% 11.62/1.89 # Creating equality axioms
% 11.62/1.89 # Ran out of tableaux, making start rules for all clauses
% 12.30/1.96 # There were 2 total branch saturation attempts.
% 12.30/1.96 # There were 0 of these attempts blocked.
% 12.30/1.96 # There were 0 deferred branch saturation attempts.
% 12.30/1.96 # There were 0 free duplicated saturations.
% 12.30/1.96 # There were 1 total successful branch saturations.
% 12.30/1.96 # There were 0 successful branch saturations in interreduction.
% 12.30/1.96 # There were 0 successful branch saturations on the branch.
% 12.30/1.96 # There were 1 successful branch saturations after the branch.
% 12.30/1.96 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.30/1.96 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.30/1.96 # Begin clausification derivation
% 12.30/1.96
% 12.30/1.96 # End clausification derivation
% 12.30/1.96 # Begin listing active clauses obtained from FOF to CNF conversion
% 12.30/1.96 cnf(i_0_186, negated_conjecture, (gt(fifo_length,n0))).
% 12.30/1.96 cnf(i_0_185, negated_conjecture, (gt(rd_level(plus(t_139,n1)),minus(fifo_length,n1)))).
% 12.30/1.96 cnf(i_0_112, plain, (plus(n0,X1)=X1)).
% 12.30/1.96 cnf(i_0_95, plain, (gt(plus(X1,n1),n0))).
% 12.30/1.96 cnf(i_0_184, negated_conjecture, (~gt(rd_level(t_139),minus(fifo_length,n1)))).
% 12.30/1.96 cnf(i_0_94, plain, (plus(X1,n1)!=n0)).
% 12.30/1.96 cnf(i_0_110, plain, (~gt(X1,X1))).
% 12.30/1.96 cnf(i_0_100, plain, (~def_10(X1,X1))).
% 12.30/1.96 cnf(i_0_118, plain, (level(X1)=n0|~p_Empty(X1))).
% 12.30/1.96 cnf(i_0_99, plain, (~def_10(X1,X2)|~gt(X2,X1))).
% 12.30/1.96 cnf(i_0_108, plain, (X1=n0|gt(X1,n0))).
% 12.30/1.96 cnf(i_0_121, plain, (rd_level(plus(X1,n1))=n0|~p_Reset(X1))).
% 12.30/1.96 cnf(i_0_122, plain, (~p_Wr_error(plus(X1,n1))|~p_Reset(X1))).
% 12.30/1.96 cnf(i_0_123, plain, (~p_Rd_error(plus(X1,n1))|~p_Reset(X1))).
% 12.30/1.96 cnf(i_0_116, plain, (level(X1)=fifo_length|~p_Full(X1))).
% 12.30/1.96 cnf(i_0_115, plain, (p_Full(X1)|level(X1)!=fifo_length)).
% 12.30/1.96 cnf(i_0_117, plain, (p_Empty(X1)|level(X1)!=n0)).
% 12.30/1.96 cnf(i_0_125, plain, (~p_Data_out(X1,plus(X2,n1))|~p_Reset(X2))).
% 12.30/1.96 cnf(i_0_124, plain, (~p_Mem(X1,X2,plus(X3,n1))|~p_Reset(X3))).
% 12.30/1.96 cnf(i_0_144, plain, (~p_Rd(X1)|~p_Wr(X1)|~p_Wr_error(plus(X1,n1)))).
% 12.30/1.96 cnf(i_0_109, plain, (plus(y_27(X1),n1)=X1|X1=n0)).
% 12.30/1.96 cnf(i_0_96, plain, (gt(X1,minus(X1,n1))|~gt(X1,n0))).
% 12.30/1.96 cnf(i_0_111, plain, (X1=X2|plus(X1,n1)!=plus(X2,n1))).
% 12.30/1.96 cnf(i_0_102, plain, (gt(X1,X2)|~gt(plus(X1,n1),plus(X2,n1)))).
% 12.30/1.96 cnf(i_0_119, plain, (level(plus(X1,n1))=n0|~p_Reset(X1))).
% 12.30/1.96 cnf(i_0_105, plain, (X1=X2|gt(X1,X2)|gt(X2,X1))).
% 12.30/1.96 cnf(i_0_120, plain, (wr_level(plus(X1,n1))=n0|~p_Reset(X1))).
% 12.30/1.96 cnf(i_0_106, plain, (gt(X1,X2)|~gt(X3,X2)|~gt(X1,X3))).
% 12.30/1.96 cnf(i_0_103, plain, (X1=X2|gt(X1,X2)|~gt(plus(X1,n1),X2))).
% 12.30/1.96 cnf(i_0_182, plain, (p_Wr(X1)|p_Wr_error(X1)|~p_Wr_error(plus(X1,n1)))).
% 12.30/1.96 cnf(i_0_101, plain, (gt(plus(X1,n1),plus(X2,n1))|~gt(X1,X2))).
% 12.30/1.96 cnf(i_0_107, plain, (plus(X1,n1)=X2|gt(X2,plus(X1,n1))|~gt(X2,X1))).
% 12.30/1.96 cnf(i_0_183, plain, (p_Wr(X1)|p_Wr_error(plus(X1,n1))|p_Reset(X1)|~p_Wr_error(X1))).
% 12.30/1.96 cnf(i_0_162, plain, (wr_level(plus(X1,n1))=wr_level(X1)|p_Wr(X1)|p_Reset(X1))).
% 12.30/1.96 cnf(i_0_174, plain, (rd_level(plus(X1,n1))=rd_level(X1)|p_Rd(X1)|p_Reset(X1))).
% 12.30/1.96 cnf(i_0_127, plain, (~p_Wr(X1)|~p_Wr_error(plus(X1,n1))|~gt(fifo_length,level(X1)))).
% 12.30/1.96 cnf(i_0_163, plain, (~p_Rd(X1)|~p_Rd_error(plus(X1,n1))|~gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_178, plain, (p_Rd(X1)|p_Rd_error(X1)|~p_Rd_error(plus(X1,n1)))).
% 12.30/1.96 cnf(i_0_175, plain, (level(plus(X1,n1))=level(X1)|p_Rd(X1)|p_Wr(X1)|p_Reset(X1))).
% 12.30/1.96 cnf(i_0_179, plain, (p_Rd(X1)|p_Rd_error(plus(X1,n1))|p_Reset(X1)|~p_Rd_error(X1))).
% 12.30/1.96 cnf(i_0_135, plain, (p_Rd(X1)|p_Wr_error(plus(X1,n1))|p_Reset(X1)|gt(fifo_length,level(X1))|~p_Wr(X1))).
% 12.30/1.96 cnf(i_0_180, plain, (p_Wr(X1)|p_Mem(X2,X3,X1)|~p_Mem(X2,X3,plus(X1,n1)))).
% 12.30/1.96 cnf(i_0_156, plain, (p_Data_in(X1,X2)|~p_Rd(X2)|~p_Wr(X2)|~p_Mem(wr_level(X2),X1,plus(X2,n1)))).
% 12.30/1.96 cnf(i_0_176, plain, (p_Rd(X1)|p_Data_out(X2,X1)|~p_Data_out(X2,plus(X1,n1)))).
% 12.30/1.96 cnf(i_0_151, plain, (p_Rd_error(plus(X1,n1))|p_Reset(X1)|gt(level(X1),n0)|~p_Rd(X1))).
% 12.30/1.96 cnf(i_0_146, plain, (level(plus(X1,n1))=level(X1)|p_Reset(X1)|~p_Rd(X1)|~p_Wr(X1)|~gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_168, plain, (rd_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),rd_level(X1))|~p_Rd(X1)|~gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_167, 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))).
% 12.30/1.96 cnf(i_0_97, plain, (plus(minus(X1,X2),X2)=X1|def_10(X2,X1))).
% 12.30/1.96 cnf(i_0_98, plain, (minus(plus(X1,X2),X2)=X1|def_10(X2,plus(X1,X2)))).
% 12.30/1.96 cnf(i_0_181, plain, (p_Wr(X1)|p_Mem(X2,X3,plus(X1,n1))|p_Reset(X1)|~p_Mem(X2,X3,X1))).
% 12.30/1.96 cnf(i_0_170, plain, (rd_level(plus(X1,n1))=rd_level(X1)|p_Reset(X1)|gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_161, plain, (wr_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),wr_level(X1))|~p_Rd(X1)|~p_Wr(X1))).
% 12.30/1.96 cnf(i_0_160, 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)))).
% 12.30/1.96 cnf(i_0_128, plain, (level(plus(X1,n1))=plus(level(X1),n1)|p_Rd(X1)|p_Reset(X1)|~p_Wr(X1)|~gt(fifo_length,level(X1)))).
% 12.30/1.96 cnf(i_0_152, plain, (level(plus(X1,n1))=plus(level(X1),n1)|p_Reset(X1)|gt(level(X1),n0)|~p_Rd(X1)|~p_Wr(X1))).
% 12.30/1.96 cnf(i_0_137, plain, (level(plus(X1,n1))=level(X1)|p_Rd(X1)|p_Reset(X1)|gt(fifo_length,level(X1)))).
% 12.30/1.96 cnf(i_0_136, plain, (wr_level(plus(X1,n1))=wr_level(X1)|p_Rd(X1)|p_Reset(X1)|gt(fifo_length,level(X1)))).
% 12.30/1.96 cnf(i_0_177, plain, (p_Rd(X1)|p_Data_out(X2,plus(X1,n1))|p_Reset(X1)|~p_Data_out(X2,X1))).
% 12.30/1.96 cnf(i_0_129, plain, (p_Data_in(X1,X2)|~p_Wr(X2)|~p_Mem(wr_level(X2),X1,plus(X2,n1))|~gt(fifo_length,level(X2)))).
% 12.30/1.96 cnf(i_0_171, plain, (level(plus(X1,n1))=level(X1)|p_Wr(X1)|p_Reset(X1)|gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_164, plain, (minus(level(X1),n1)=level(plus(X1,n1))|p_Wr(X1)|p_Reset(X1)|~p_Rd(X1)|~gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_134, plain, (wr_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),wr_level(X1))|~p_Wr(X1)|~gt(fifo_length,level(X1)))).
% 12.30/1.96 cnf(i_0_133, 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)))).
% 12.30/1.96 cnf(i_0_166, 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))).
% 12.30/1.96 cnf(i_0_157, plain, (p_Mem(wr_level(X1),X2,plus(X1,n1))|p_Reset(X1)|~p_Data_in(X2,X1)|~p_Rd(X1)|~p_Wr(X1))).
% 12.30/1.96 cnf(i_0_165, plain, (p_Mem(rd_level(X1),X2,X1)|~p_Rd(X1)|~p_Data_out(X2,plus(X1,n1))|~gt(level(X1),n0))).
% 12.30/1.96 cnf(i_0_155, plain, (p_Data_out(X1,plus(X2,n1))|p_Reset(X2)|gt(level(X2),n0)|~p_Data_out(X1,X2))).
% 12.30/1.96 cnf(i_0_172, plain, (p_Data_out(X1,X2)|gt(level(X2),n0)|~p_Data_out(X1,plus(X2,n1)))).
% 12.30/1.96 cnf(i_0_130, 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)))).
% 12.30/1.96 cnf(i_0_138, plain, (p_Rd(X1)|p_Mem(X2,X3,X1)|gt(fifo_length,level(X1))|~p_Mem(X2,X3,plus(X1,n1)))).
% 12.30/1.96 cnf(i_0_139, plain, (p_Rd(X1)|p_Mem(X2,X3,plus(X1,n1))|p_Reset(X1)|gt(fifo_length,level(X1))|~p_Mem(X2,X3,X1))).
% 12.30/1.96 cnf(i_0_132, plain, (X1=wr_level(X2)|p_Mem(X1,X3,plus(X2,n1))|p_Reset(X2)|~p_Mem(X1,X3,X2))).
% 12.30/1.96 cnf(i_0_131, plain, (X1=wr_level(X2)|p_Mem(X1,X3,X2)|~p_Mem(X1,X3,plus(X2,n1)))).
% 12.30/1.96 cnf(i_0_60730, plain, (X4=X4)).
% 12.30/1.96 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 12.30/1.96 # Begin printing tableau
% 12.30/1.96 # Found 5 steps
% 12.30/1.96 cnf(i_0_60730, plain, (plus(X3,n1)=plus(X3,n1)), inference(start_rule)).
% 12.30/1.96 cnf(i_0_60980, plain, (plus(X3,n1)=plus(X3,n1)), inference(extension_rule, [i_0_111])).
% 12.30/1.96 cnf(i_0_61010, plain, (X3=X3), inference(extension_rule, [i_0_60734])).
% 12.30/1.96 cnf(i_0_61239, plain, (plus(n0,X3)!=X3), inference(closure_rule, [i_0_112])).
% 12.30/1.96 cnf(i_0_61237, plain, (plus(X3,plus(n0,X3))=plus(X3,X3)), inference(etableau_closure_rule, [i_0_61237, ...])).
% 12.30/1.96 # End printing tableau
% 12.30/1.96 # SZS output end
% 12.30/1.96 # Branches closed with saturation will be marked with an "s"
% 12.30/1.97 # Child (5159) has found a proof.
% 12.30/1.97
% 12.30/1.97 # Proof search is over...
% 12.30/1.97 # Freeing feature tree
%------------------------------------------------------------------------------