TSTP Solution File: HWV010-1 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : HWV010-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 : n021.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:31 EDT 2022
% Result : Unsatisfiable 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV010-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/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 : n021.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 07:40:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.37 # No SInE strategy applied
% 0.12/0.37 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.37 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.37 #
% 0.12/0.37 # Presaturation interreduction done
% 0.12/0.37 # Number of axioms: 91 Number of unprocessed: 73
% 0.12/0.37 # Tableaux proof search.
% 0.12/0.37 # APR header successfully linked.
% 0.12/0.37 # Hello from C++
% 0.12/0.38 # The folding up rule is enabled...
% 0.12/0.38 # Local unification is enabled...
% 0.12/0.38 # Any saturation attempts will use folding labels...
% 0.12/0.38 # 73 beginning clauses after preprocessing and clausification
% 0.12/0.38 # Creating start rules for all 2 conjectures.
% 0.12/0.38 # There are 2 start rule candidates:
% 0.12/0.38 # Found 5 unit axioms.
% 0.12/0.38 # Unsuccessfully attempted saturation on 1 start tableaux, moving on.
% 0.12/0.38 # 2 start rule tableaux created.
% 0.12/0.38 # 68 extension rule candidate clauses
% 0.12/0.38 # 5 unit axiom clauses
% 0.12/0.38
% 0.12/0.38 # Requested 8, 32 cores available to the main process.
% 0.12/0.38 # There are not enough tableaux to fork, creating more from the initial 2
% 0.12/0.39 # There were 2 total branch saturation attempts.
% 0.12/0.39 # There were 0 of these attempts blocked.
% 0.12/0.39 # There were 0 deferred branch saturation attempts.
% 0.12/0.39 # There were 0 free duplicated saturations.
% 0.12/0.39 # There were 2 total successful branch saturations.
% 0.12/0.39 # There were 0 successful branch saturations in interreduction.
% 0.12/0.39 # There were 0 successful branch saturations on the branch.
% 0.12/0.39 # There were 2 successful branch saturations after the branch.
% 0.12/0.39 # SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.39 # SZS output start for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.39 # Begin clausification derivation
% 0.12/0.39
% 0.12/0.39 # End clausification derivation
% 0.12/0.39 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.12/0.39 cnf(i_0_111, plain, (plus(n0,X1)=X1)).
% 0.12/0.39 cnf(i_0_94, plain, (gt(plus(X1,n1),n0))).
% 0.12/0.39 cnf(i_0_93, plain, (plus(X1,n1)!=n0)).
% 0.12/0.39 cnf(i_0_109, plain, (~gt(X1,X1))).
% 0.12/0.39 cnf(i_0_99, plain, (~def_10(X1,X1))).
% 0.12/0.39 cnf(i_0_184, negated_conjecture, (level(t_139)=n0|p_Empty(t_139))).
% 0.12/0.39 cnf(i_0_183, negated_conjecture, (level(t_139)!=n0|~p_Empty(t_139))).
% 0.12/0.39 cnf(i_0_116, plain, (p_Empty(X1)|level(X1)!=n0)).
% 0.12/0.39 cnf(i_0_117, plain, (level(X1)=n0|~p_Empty(X1))).
% 0.12/0.39 cnf(i_0_98, plain, (~def_10(X1,X2)|~gt(X2,X1))).
% 0.12/0.39 cnf(i_0_115, plain, (level(X1)=fifo_length|~p_Full(X1))).
% 0.12/0.39 cnf(i_0_114, plain, (p_Full(X1)|level(X1)!=fifo_length)).
% 0.12/0.39 cnf(i_0_107, plain, (X1=n0|gt(X1,n0))).
% 0.12/0.39 cnf(i_0_121, plain, (~p_Wr_error(plus(X1,n1))|~p_Reset(X1))).
% 0.12/0.39 cnf(i_0_122, plain, (~p_Rd_error(plus(X1,n1))|~p_Reset(X1))).
% 0.12/0.39 cnf(i_0_108, plain, (plus(y_27(X1),n1)=X1|X1=n0)).
% 0.12/0.39 cnf(i_0_124, plain, (~p_Data_out(X1,plus(X2,n1))|~p_Reset(X2))).
% 0.12/0.39 cnf(i_0_123, plain, (~p_Mem(X1,X2,plus(X3,n1))|~p_Reset(X3))).
% 0.12/0.39 cnf(i_0_143, plain, (~p_Rd(X1)|~p_Wr(X1)|~p_Wr_error(plus(X1,n1)))).
% 0.12/0.39 cnf(i_0_110, plain, (X1=X2|plus(X1,n1)!=plus(X2,n1))).
% 0.12/0.39 cnf(i_0_118, plain, (level(plus(X1,n1))=n0|~p_Reset(X1))).
% 0.12/0.39 cnf(i_0_119, plain, (wr_level(plus(X1,n1))=n0|~p_Reset(X1))).
% 0.12/0.39 cnf(i_0_120, plain, (rd_level(plus(X1,n1))=n0|~p_Reset(X1))).
% 0.12/0.39 cnf(i_0_95, plain, (gt(X1,minus(X1,n1))|~gt(X1,n0))).
% 0.12/0.39 cnf(i_0_104, plain, (X1=X2|gt(X1,X2)|gt(X2,X1))).
% 0.12/0.39 cnf(i_0_161, plain, (wr_level(plus(X1,n1))=wr_level(X1)|p_Wr(X1)|p_Reset(X1))).
% 0.12/0.39 cnf(i_0_105, plain, (gt(X1,X2)|~gt(X3,X2)|~gt(X1,X3))).
% 0.12/0.39 cnf(i_0_101, plain, (gt(X1,X2)|~gt(plus(X1,n1),plus(X2,n1)))).
% 0.12/0.39 cnf(i_0_102, plain, (X1=X2|gt(X1,X2)|~gt(plus(X1,n1),X2))).
% 0.12/0.39 cnf(i_0_182, plain, (p_Wr(X1)|p_Wr_error(plus(X1,n1))|p_Reset(X1)|~p_Wr_error(X1))).
% 0.12/0.39 cnf(i_0_181, plain, (p_Wr(X1)|p_Wr_error(X1)|~p_Wr_error(plus(X1,n1)))).
% 0.12/0.39 cnf(i_0_162, plain, (~p_Rd(X1)|~p_Rd_error(plus(X1,n1))|~gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_145, plain, (level(plus(X1,n1))=level(X1)|p_Reset(X1)|~p_Rd(X1)|~p_Wr(X1)|~gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_126, plain, (~p_Wr(X1)|~p_Wr_error(plus(X1,n1))|~gt(fifo_length,level(X1)))).
% 0.12/0.39 cnf(i_0_174, plain, (level(plus(X1,n1))=level(X1)|p_Rd(X1)|p_Wr(X1)|p_Reset(X1))).
% 0.12/0.39 cnf(i_0_100, plain, (gt(plus(X1,n1),plus(X2,n1))|~gt(X1,X2))).
% 0.12/0.39 cnf(i_0_177, plain, (p_Rd(X1)|p_Rd_error(X1)|~p_Rd_error(plus(X1,n1)))).
% 0.12/0.39 cnf(i_0_179, plain, (p_Wr(X1)|p_Mem(X2,X3,X1)|~p_Mem(X2,X3,plus(X1,n1)))).
% 0.12/0.39 cnf(i_0_170, plain, (level(plus(X1,n1))=level(X1)|p_Wr(X1)|p_Reset(X1)|gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_168, plain, (p_Rd_error(plus(X1,n1))|p_Reset(X1)|gt(level(X1),n0)|~p_Rd(X1))).
% 0.12/0.39 cnf(i_0_125, plain, (rd_level(plus(X1,n1))=rd_level(X1)|p_Rd(X1)|p_Reset(X1))).
% 0.12/0.39 cnf(i_0_106, plain, (plus(X1,n1)=X2|gt(X2,plus(X1,n1))|~gt(X2,X1))).
% 0.12/0.39 cnf(i_0_155, plain, (p_Data_in(X1,X2)|~p_Rd(X2)|~p_Wr(X2)|~p_Mem(wr_level(X2),X1,plus(X2,n1)))).
% 0.12/0.39 cnf(i_0_175, plain, (p_Rd(X1)|p_Data_out(X2,X1)|~p_Data_out(X2,plus(X1,n1)))).
% 0.12/0.39 cnf(i_0_178, plain, (p_Rd(X1)|p_Rd_error(plus(X1,n1))|p_Reset(X1)|~p_Rd_error(X1))).
% 0.12/0.39 cnf(i_0_96, plain, (plus(minus(X1,X2),X2)=X1|def_10(X2,X1))).
% 0.12/0.39 cnf(i_0_151, plain, (level(plus(X1,n1))=plus(level(X1),n1)|p_Reset(X1)|gt(level(X1),n0)|~p_Rd(X1)|~p_Wr(X1))).
% 0.12/0.39 cnf(i_0_127, plain, (level(plus(X1,n1))=plus(level(X1),n1)|p_Rd(X1)|p_Reset(X1)|~p_Wr(X1)|~gt(fifo_length,level(X1)))).
% 0.12/0.39 cnf(i_0_136, plain, (level(plus(X1,n1))=level(X1)|p_Rd(X1)|p_Reset(X1)|gt(fifo_length,level(X1)))).
% 0.12/0.39 cnf(i_0_97, plain, (minus(plus(X1,X2),X2)=X1|def_10(X2,plus(X1,X2)))).
% 0.12/0.39 cnf(i_0_180, plain, (p_Wr(X1)|p_Mem(X2,X3,plus(X1,n1))|p_Reset(X1)|~p_Mem(X2,X3,X1))).
% 0.12/0.39 cnf(i_0_176, plain, (p_Rd(X1)|p_Data_out(X2,plus(X1,n1))|p_Reset(X1)|~p_Data_out(X2,X1))).
% 0.12/0.39 cnf(i_0_134, plain, (p_Rd(X1)|p_Wr_error(plus(X1,n1))|p_Reset(X1)|gt(fifo_length,level(X1))|~p_Wr(X1))).
% 0.12/0.39 cnf(i_0_169, plain, (rd_level(plus(X1,n1))=rd_level(X1)|p_Reset(X1)|gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_163, plain, (minus(level(X1),n1)=level(plus(X1,n1))|p_Wr(X1)|p_Reset(X1)|~p_Rd(X1)|~gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_135, plain, (wr_level(plus(X1,n1))=wr_level(X1)|p_Rd(X1)|p_Reset(X1)|gt(fifo_length,level(X1)))).
% 0.12/0.39 cnf(i_0_160, plain, (wr_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),wr_level(X1))|~p_Rd(X1)|~p_Wr(X1))).
% 0.12/0.39 cnf(i_0_156, 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.12/0.39 cnf(i_0_128, plain, (p_Data_in(X1,X2)|~p_Wr(X2)|~p_Mem(wr_level(X2),X1,plus(X2,n1))|~gt(fifo_length,level(X2)))).
% 0.12/0.39 cnf(i_0_165, 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.12/0.39 cnf(i_0_159, 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.12/0.39 cnf(i_0_171, plain, (p_Data_out(X1,X2)|gt(level(X2),n0)|~p_Data_out(X1,plus(X2,n1)))).
% 0.12/0.39 cnf(i_0_164, plain, (p_Mem(rd_level(X1),X2,X1)|~p_Rd(X1)|~p_Data_out(X2,plus(X1,n1))|~gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_172, plain, (p_Data_out(X1,plus(X2,n1))|p_Reset(X2)|gt(level(X2),n0)|~p_Data_out(X1,X2))).
% 0.12/0.39 cnf(i_0_133, plain, (wr_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),wr_level(X1))|~p_Wr(X1)|~gt(fifo_length,level(X1)))).
% 0.12/0.39 cnf(i_0_129, 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.12/0.39 cnf(i_0_132, 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.12/0.39 cnf(i_0_166, 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.12/0.39 cnf(i_0_149, plain, (rd_level(plus(X1,n1))=n0|gt(minus(fifo_length,n1),rd_level(X1))|~p_Rd(X1)|~gt(level(X1),n0))).
% 0.12/0.39 cnf(i_0_137, plain, (p_Rd(X1)|p_Mem(X2,X3,X1)|gt(fifo_length,level(X1))|~p_Mem(X2,X3,plus(X1,n1)))).
% 0.12/0.39 cnf(i_0_130, plain, (X1=wr_level(X2)|p_Mem(X1,X3,X2)|~p_Mem(X1,X3,plus(X2,n1)))).
% 0.12/0.39 cnf(i_0_138, 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.12/0.39 cnf(i_0_131, plain, (X1=wr_level(X2)|p_Mem(X1,X3,plus(X2,n1))|p_Reset(X2)|~p_Mem(X1,X3,X2))).
% 0.12/0.39 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.12/0.39 # Begin printing tableau
% 0.12/0.39 # Found 6 steps
% 0.12/0.39 cnf(i_0_183, negated_conjecture, (level(t_139)!=n0|~p_Empty(t_139)), inference(start_rule)).
% 0.12/0.39 cnf(i_0_188, plain, (level(t_139)!=n0), inference(extension_rule, [i_0_102])).
% 0.12/0.39 cnf(i_0_240, plain, (~gt(plus(level(t_139),n1),n0)), inference(closure_rule, [i_0_94])).
% 0.12/0.39 cnf(i_0_239, plain, (gt(level(t_139),n0)), inference(extension_rule, [i_0_98])).
% 0.12/0.39 cnf(i_0_189, plain, (~p_Empty(t_139)), inference(etableau_closure_rule, [i_0_189, ...])).
% 0.12/0.39 cnf(i_0_1316, plain, (~def_10(n0,level(t_139))), inference(etableau_closure_rule, [i_0_1316, ...])).
% 0.12/0.39 # End printing tableau
% 0.12/0.39 # SZS output end
% 0.12/0.39 # Branches closed with saturation will be marked with an "s"
% 0.12/0.39 # Returning from population with 5 new_tableaux and 0 remaining starting tableaux.
% 0.12/0.39 # We now have 5 tableaux to operate on
% 0.12/0.39 # Found closed tableau during pool population.
% 0.12/0.39 # Proof search is over...
% 0.12/0.39 # Freeing feature tree
%------------------------------------------------------------------------------