TSTP Solution File: NUM926+5 by Etableau---0.67
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.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 : n023.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 : Mon Jul 18 09:46:56 EDT 2022
% Result : Theorem 0.19s 0.42s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0.
% 0.07/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 : n023.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 : Thu Jul 7 16:44:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.38 # No SInE strategy applied
% 0.12/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.12/0.38 #
% 0.12/0.38 # Presaturation interreduction done
% 0.12/0.38 # Number of axioms: 180 Number of unprocessed: 152
% 0.12/0.38 # Tableaux proof search.
% 0.12/0.38 # APR header successfully linked.
% 0.12/0.38 # Hello from C++
% 0.19/0.39 # The folding up rule is enabled...
% 0.19/0.39 # Local unification is enabled...
% 0.19/0.39 # Any saturation attempts will use folding labels...
% 0.19/0.39 # 152 beginning clauses after preprocessing and clausification
% 0.19/0.39 # Creating start rules for all 1 conjectures.
% 0.19/0.39 # There are 1 start rule candidates:
% 0.19/0.39 # Found 53 unit axioms.
% 0.19/0.39 # 1 start rule tableaux created.
% 0.19/0.39 # 99 extension rule candidate clauses
% 0.19/0.39 # 53 unit axiom clauses
% 0.19/0.39
% 0.19/0.39 # Requested 8, 32 cores available to the main process.
% 0.19/0.39 # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.39 # Returning from population with 16 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.39 # We now have 16 tableaux to operate on
% 0.19/0.42 # There were 1 total branch saturation attempts.
% 0.19/0.42 # There were 0 of these attempts blocked.
% 0.19/0.42 # There were 0 deferred branch saturation attempts.
% 0.19/0.42 # There were 0 free duplicated saturations.
% 0.19/0.42 # There were 1 total successful branch saturations.
% 0.19/0.42 # There were 0 successful branch saturations in interreduction.
% 0.19/0.42 # There were 0 successful branch saturations on the branch.
% 0.19/0.42 # There were 1 successful branch saturations after the branch.
% 0.19/0.42 # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 # Begin clausification derivation
% 0.19/0.42
% 0.19/0.42 # End clausification derivation
% 0.19/0.42 # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.42 cnf(i_0_174, plain, (semiring_1(int))).
% 0.19/0.42 cnf(i_0_105, plain, (one_one(nat)=number_number_of(nat,bit1(pls)))).
% 0.19/0.42 cnf(i_0_76, plain, (plus_plus(nat,number_number_of(nat,bit1(pls)),number_number_of(nat,bit1(pls)))=number_number_of(nat,bit0(bit1(pls))))).
% 0.19/0.42 cnf(i_0_15, hypothesis, (ti(int,pls)=pls)).
% 0.19/0.42 cnf(i_0_182, plain, (semiring_1(nat))).
% 0.19/0.42 cnf(i_0_170, plain, (comm_semiring_1(int))).
% 0.19/0.42 cnf(i_0_178, plain, (comm_semiring_1(nat))).
% 0.19/0.42 cnf(i_0_173, plain, (monoid_mult(int))).
% 0.19/0.42 cnf(i_0_181, plain, (monoid_mult(nat))).
% 0.19/0.42 cnf(i_0_177, plain, (number(int))).
% 0.19/0.42 cnf(i_0_183, plain, (number(nat))).
% 0.19/0.42 cnf(i_0_31, hypothesis, (ti(int,m)=m)).
% 0.19/0.42 cnf(i_0_172, plain, (linorder(int))).
% 0.19/0.42 cnf(i_0_180, plain, (linorder(nat))).
% 0.19/0.42 cnf(i_0_171, plain, (number_semiring(int))).
% 0.19/0.42 cnf(i_0_179, plain, (number_semiring(nat))).
% 0.19/0.42 cnf(i_0_176, plain, (number_ring(int))).
% 0.19/0.42 cnf(i_0_169, plain, (linordered_idom(int))).
% 0.19/0.42 cnf(i_0_175, plain, (ring_char_0(int))).
% 0.19/0.42 cnf(i_0_149, plain, (number_number_of(int,X1)=X1)).
% 0.19/0.42 cnf(i_0_123, plain, (zprime(bit0(bit1(pls))))).
% 0.19/0.42 cnf(i_0_32, plain, (ti(int,s)=s)).
% 0.19/0.42 cnf(i_0_33, plain, (ti(int,t)=t)).
% 0.19/0.42 cnf(i_0_12, hypothesis, (ti(int,bit0(X1))=bit0(X1))).
% 0.19/0.42 cnf(i_0_14, hypothesis, (ti(int,bit1(X1))=bit1(X1))).
% 0.19/0.42 cnf(i_0_11, hypothesis, (bit0(ti(int,X1))=bit0(X1))).
% 0.19/0.42 cnf(i_0_13, hypothesis, (bit1(ti(int,X1))=bit1(X1))).
% 0.19/0.42 cnf(i_0_34, plain, (ord_less_eq(int,one_one(int),t))).
% 0.19/0.42 cnf(i_0_8, plain, (ti(X1,undefined(X1))=undefined(X1))).
% 0.19/0.42 cnf(i_0_54, plain, (ord_less_eq(int,X1,X1))).
% 0.19/0.42 cnf(i_0_38, plain, (zprime(plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))))).
% 0.19/0.42 cnf(i_0_184, plain, (ti(X1,ti(X1,X2))=ti(X1,X2))).
% 0.19/0.42 cnf(i_0_39, plain, (times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))=plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))))).
% 0.19/0.42 cnf(i_0_53, plain, (times_times(int,esk5_0,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))=plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))))).
% 0.19/0.42 cnf(i_0_45, plain, (times_times(int,X1,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))))=power_power(int,X1,number_number_of(nat,bit1(bit1(pls)))))).
% 0.19/0.42 cnf(i_0_37, plain, (ord_less(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))))).
% 0.19/0.42 cnf(i_0_40, plain, (twoSqu33214720sum2sq(plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls)))))))).
% 0.19/0.42 cnf(i_0_150, plain, (plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3)))).
% 0.19/0.42 cnf(i_0_147, plain, (times_times(int,times_times(int,X1,X2),X3)=times_times(int,X1,times_times(int,X2,X3)))).
% 0.19/0.42 cnf(i_0_64, plain, (power_power(int,power_power(int,X1,X2),X3)=power_power(int,X1,times_times(nat,X2,X3)))).
% 0.19/0.42 cnf(i_0_73, plain, (times_times(int,power_power(int,X1,X2),power_power(int,X1,X3))=power_power(int,X1,plus_plus(nat,X2,X3)))).
% 0.19/0.42 cnf(i_0_41, plain, (plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),plus_plus(int,power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))),times_times(int,bit0(bit1(pls)),times_times(int,X1,X2))))=power_power(int,plus_plus(int,X1,X2),number_number_of(nat,bit0(bit1(pls)))))).
% 0.19/0.42 cnf(i_0_42, plain, (plus_plus(int,power_power(int,X1,number_number_of(nat,bit1(bit1(pls)))),plus_plus(int,power_power(int,X2,number_number_of(nat,bit1(bit1(pls)))),plus_plus(int,times_times(int,bit1(bit1(pls)),times_times(int,X1,power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))))),times_times(int,bit1(bit1(pls)),times_times(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),X2)))))=power_power(int,plus_plus(int,X1,X2),number_number_of(nat,bit1(bit1(pls)))))).
% 0.19/0.42 cnf(i_0_152, plain, (plus_plus(int,X1,X2)=plus_plus(int,X2,X1))).
% 0.19/0.42 cnf(i_0_148, plain, (times_times(int,X1,X2)=times_times(int,X2,X1))).
% 0.19/0.42 cnf(i_0_75, plain, (times_times(nat,X1,number_number_of(nat,bit0(bit1(pls))))=plus_plus(nat,X1,X1))).
% 0.19/0.42 cnf(i_0_74, plain, (times_times(nat,number_number_of(nat,bit0(bit1(pls))),X1)=plus_plus(nat,X1,X1))).
% 0.19/0.42 cnf(i_0_151, plain, (plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3)))).
% 0.19/0.42 cnf(i_0_85, plain, (~ord_less(int,pls,pls))).
% 0.19/0.42 cnf(i_0_57, plain, (~ord_less(int,X1,X1))).
% 0.19/0.42 cnf(i_0_185, negated_conjecture, (plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))).
% 0.19/0.42 cnf(i_0_35, plain, (one_one(int)!=t)).
% 0.19/0.42 cnf(i_0_36, plain, (~ord_less(int,one_one(int),t))).
% 0.19/0.42 cnf(i_0_10, plain, (zprime(X1)|~zprime(ti(int,X1)))).
% 0.19/0.42 cnf(i_0_30, plain, (twoSqu33214720sum2sq(X1)|~twoSqu33214720sum2sq(ti(int,X1)))).
% 0.19/0.42 cnf(i_0_146, plain, (X1=X2|bit0(X1)!=bit0(X2))).
% 0.19/0.42 cnf(i_0_144, plain, (X1=X2|bit1(X1)!=bit1(X2))).
% 0.19/0.42 cnf(i_0_9, plain, (zprime(ti(int,X1))|~zprime(X1))).
% 0.19/0.42 cnf(i_0_29, plain, (twoSqu33214720sum2sq(ti(int,X1))|~twoSqu33214720sum2sq(X1))).
% 0.19/0.42 cnf(i_0_58, plain, (ord_less_eq(int,X1,X2)|~ord_less(int,X1,X2))).
% 0.19/0.42 cnf(i_0_61, plain, (X1=X2|~ord_less_eq(int,X2,X1)|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_108, plain, (ord_less(int,pls,bit1(X1))|~ord_less_eq(int,pls,X1))).
% 0.19/0.42 cnf(i_0_160, plain, (ord_less(int,X1,pls)|~ord_less(int,bit0(X1),pls))).
% 0.19/0.42 cnf(i_0_1, plain, (ti(X1,one_one(X1))=one_one(X1)|~semiring_1(X1))).
% 0.19/0.42 cnf(i_0_154, plain, (ord_less(int,X1,pls)|~ord_less(int,bit1(X1),pls))).
% 0.19/0.42 cnf(i_0_107, plain, (ord_less(int,X1,pls)|~ord_less_eq(int,bit1(X1),pls))).
% 0.19/0.42 cnf(i_0_162, plain, (ord_less(int,pls,X1)|~ord_less(int,pls,bit0(X1)))).
% 0.19/0.42 cnf(i_0_164, plain, (ord_less_eq(int,pls,X1)|~ord_less_eq(int,pls,bit1(X1)))).
% 0.19/0.42 cnf(i_0_109, plain, (ord_less_eq(int,pls,X1)|~ord_less(int,pls,bit1(X1)))).
% 0.19/0.42 cnf(i_0_161, plain, (ord_less(int,pls,bit0(X1))|~ord_less(int,pls,X1))).
% 0.19/0.42 cnf(i_0_87, plain, (ord_less(int,X1,X2)|~ord_less(int,bit0(X1),bit0(X2)))).
% 0.19/0.42 cnf(i_0_156, plain, (ord_less(int,X1,X2)|~ord_less(int,bit1(X1),bit0(X2)))).
% 0.19/0.42 cnf(i_0_163, plain, (ord_less_eq(int,pls,bit1(X1))|~ord_less_eq(int,pls,X1))).
% 0.19/0.42 cnf(i_0_16, plain, (number_number_of(X1,ti(int,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.42 cnf(i_0_159, plain, (ord_less(int,bit0(X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.42 cnf(i_0_78, plain, (ord_less(int,X1,X2)|~ord_less(int,bit1(X1),bit1(X2)))).
% 0.19/0.42 cnf(i_0_111, plain, (ord_less(int,X1,X2)|~ord_less_eq(int,bit1(X1),bit0(X2)))).
% 0.19/0.42 cnf(i_0_153, plain, (ord_less(int,bit1(X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.42 cnf(i_0_106, plain, (ord_less_eq(int,bit1(X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.42 cnf(i_0_46, plain, (power_power(X1,one_one(X1),number_number_of(nat,bit0(bit1(pls))))=one_one(X1)|~semiring_1(X1))).
% 0.19/0.42 cnf(i_0_103, plain, (plus_plus(nat,number_number_of(nat,X1),number_number_of(nat,X2))=number_number_of(nat,X2)|~ord_less(int,X1,pls))).
% 0.19/0.42 cnf(i_0_140, plain, (X1=X2|number_number_of(X3,X1)!=number_number_of(X3,X2)|~ring_char_0(X3)|~number_ring(X3))).
% 0.19/0.42 cnf(i_0_63, plain, (power_power(X1,X2,number_number_of(nat,bit1(pls)))=ti(X1,X2)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_115, plain, (ord_less_eq(int,X1,X2)|~ord_less(int,bit0(X1),bit1(X2)))).
% 0.19/0.42 cnf(i_0_92, plain, (ord_less_eq(int,X1,X2)|~ord_less_eq(int,bit0(X1),bit0(X2)))).
% 0.19/0.42 cnf(i_0_17, plain, (ti(X1,number_number_of(X1,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.42 cnf(i_0_166, plain, (ord_less_eq(int,X1,X2)|~ord_less_eq(int,bit0(X1),bit1(X2)))).
% 0.19/0.42 cnf(i_0_82, plain, (ord_less_eq(int,X1,X2)|~ord_less_eq(int,bit1(X1),bit1(X2)))).
% 0.19/0.42 cnf(i_0_52, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,bit0(bit1(pls)))|~number_ring(X1))).
% 0.19/0.42 cnf(i_0_86, plain, (ord_less(int,bit0(X1),bit0(X2))|~ord_less(int,X1,X2))).
% 0.19/0.42 cnf(i_0_56, plain, (X1=X2|ord_less(int,X1,X2)|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_124, plain, (twoSqu33214720sum2sq(times_times(int,X1,X2))|~twoSqu33214720sum2sq(X2)|~twoSqu33214720sum2sq(X1))).
% 0.19/0.42 cnf(i_0_21, plain, (ord_less(X1,X2,X3)|~ord_less(X1,X2,ti(X1,X3))|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_122, plain, (ord_less_eq(int,X1,X2)|~ord_less(int,X1,plus_plus(int,X2,one_one(int))))).
% 0.19/0.42 cnf(i_0_120, plain, (ord_less(int,X1,X2)|~ord_less_eq(int,plus_plus(int,X1,one_one(int)),X2))).
% 0.19/0.42 cnf(i_0_55, plain, (ord_less_eq(int,X1,X2)|ord_less_eq(int,X2,X1))).
% 0.19/0.42 cnf(i_0_114, plain, (ord_less(int,bit0(X1),bit1(X2))|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_25, plain, (ord_less_eq(X1,X2,X3)|~ord_less_eq(X1,X2,ti(X1,X3))|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_19, plain, (ord_less(X1,X2,X3)|~ord_less(X1,ti(X1,X2),X3)|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_23, plain, (ord_less_eq(X1,X2,X3)|~ord_less_eq(X1,ti(X1,X2),X3)|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_66, plain, (~ord_less_eq(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~ord_less(X1,number_number_of(X1,X3),number_number_of(X1,X2))|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_155, plain, (ord_less(int,bit1(X1),bit0(X2))|~ord_less(int,X1,X2))).
% 0.19/0.42 cnf(i_0_77, plain, (ord_less(int,bit1(X1),bit1(X2))|~ord_less(int,X1,X2))).
% 0.19/0.42 cnf(i_0_59, plain, (X1=X2|ord_less(int,X1,X2)|ord_less(int,X2,X1))).
% 0.19/0.42 cnf(i_0_91, plain, (ord_less_eq(int,bit0(X1),bit0(X2))|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_165, plain, (ord_less_eq(int,bit0(X1),bit1(X2))|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_110, plain, (ord_less_eq(int,bit1(X1),bit0(X2))|~ord_less(int,X1,X2))).
% 0.19/0.42 cnf(i_0_81, plain, (ord_less_eq(int,bit1(X1),bit1(X2))|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_138, plain, (plus_plus(X1,X2,X3)=plus_plus(X1,X3,X2)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_60, plain, (ord_less_eq(int,X1,X2)|~ord_less_eq(int,X3,X2)|~ord_less_eq(int,X1,X3))).
% 0.19/0.42 cnf(i_0_20, plain, (ord_less(X1,X2,ti(X1,X3))|~ord_less(X1,X2,X3)|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_24, plain, (ord_less_eq(X1,X2,ti(X1,X3))|~ord_less_eq(X1,X2,X3)|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_18, plain, (ord_less(X1,ti(X1,X2),X3)|~ord_less(X1,X2,X3)|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_121, plain, (ord_less(int,X1,plus_plus(int,X2,one_one(int)))|~ord_less_eq(int,X1,X2))).
% 0.19/0.42 cnf(i_0_118, plain, (ord_less_eq(int,plus_plus(int,X1,one_one(int)),X2)|~ord_less(int,X1,X2))).
% 0.19/0.42 cnf(i_0_132, plain, (times_times(X1,X2,X3)=times_times(X1,X3,X2)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_22, plain, (ord_less_eq(X1,ti(X1,X2),X3)|~ord_less_eq(X1,X2,X3)|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_68, plain, (ord_less(int,X1,X2)|~linordered_idom(X3)|~number_ring(X3)|~ord_less(X3,number_number_of(X3,X1),number_number_of(X3,X2)))).
% 0.19/0.42 cnf(i_0_70, plain, (ord_less_eq(int,X1,X2)|~linordered_idom(X3)|~number_ring(X3)|~ord_less_eq(X3,number_number_of(X3,X1),number_number_of(X3,X2)))).
% 0.19/0.42 cnf(i_0_3, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_27, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_102, plain, (plus_plus(nat,number_number_of(nat,X1),number_number_of(nat,X2))=number_number_of(nat,X1)|ord_less(int,X1,pls)|~ord_less(int,X2,pls))).
% 0.19/0.42 cnf(i_0_47, plain, (times_times(X1,X2,X2)=power_power(X1,X2,number_number_of(nat,bit0(bit1(pls))))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_6, plain, (times_times(X1,X2,ti(X1,X3))=times_times(X1,X2,X3)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_2, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_5, plain, (times_times(X1,ti(X1,X2),X3)=times_times(X1,X2,X3)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_26, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_4, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_7, plain, (ti(X1,times_times(X1,X2,X3))=times_times(X1,X2,X3)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_28, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_48, plain, (power_power(X1,X2,number_number_of(nat,bit0(bit1(pls))))=times_times(X1,X2,X2)|~monoid_mult(X1))).
% 0.19/0.42 cnf(i_0_50, plain, (plus_plus(X1,one_one(X1),number_number_of(X1,X2))=number_number_of(X1,plus_plus(int,bit1(pls),X2))|~number_ring(X1))).
% 0.19/0.42 cnf(i_0_51, plain, (plus_plus(X1,number_number_of(X1,X2),one_one(X1))=number_number_of(X1,plus_plus(int,X2,bit1(pls)))|~number_ring(X1))).
% 0.19/0.42 cnf(i_0_99, plain, (ord_less(int,plus_plus(int,X1,X2),plus_plus(int,X3,X2))|~ord_less(int,X1,X3))).
% 0.19/0.42 cnf(i_0_67, plain, (ord_less(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~linordered_idom(X1)|~number_ring(X1)|~ord_less(int,X2,X3))).
% 0.19/0.42 cnf(i_0_100, plain, (ord_less_eq(int,plus_plus(int,X1,X2),plus_plus(int,X1,X3))|~ord_less_eq(int,X2,X3))).
% 0.19/0.42 cnf(i_0_69, plain, (ord_less_eq(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~linordered_idom(X1)|~number_ring(X1)|~ord_less_eq(int,X2,X3))).
% 0.19/0.42 cnf(i_0_130, plain, (times_times(X1,times_times(X1,X2,X3),X4)=times_times(X1,X2,times_times(X1,X3,X4))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_62, plain, (power_power(X1,power_power(X1,X2,X3),X4)=power_power(X1,X2,times_times(nat,X3,X4))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_101, plain, (plus_plus(nat,number_number_of(nat,X1),number_number_of(nat,X2))=number_number_of(nat,plus_plus(int,X1,X2))|ord_less(int,X2,pls)|ord_less(int,X1,pls))).
% 0.19/0.42 cnf(i_0_71, plain, (ord_less(int,plus_plus(int,X1,X2),plus_plus(int,X3,X4))|~ord_less_eq(int,X2,X4)|~ord_less(int,X1,X3))).
% 0.19/0.42 cnf(i_0_136, plain, (plus_plus(X1,plus_plus(X1,X2,X3),X4)=plus_plus(X1,X2,plus_plus(X1,X3,X4))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_65, plain, (ord_less_eq(X1,number_number_of(X1,X2),number_number_of(X1,X3))|ord_less(X1,number_number_of(X1,X3),number_number_of(X1,X2))|~linorder(X1)|~number(X1))).
% 0.19/0.42 cnf(i_0_131, plain, (times_times(X1,X2,times_times(X1,X3,X4))=times_times(X1,X3,times_times(X1,X2,X4))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_72, plain, (times_times(X1,power_power(X1,X2,X3),power_power(X1,X2,X4))=power_power(X1,X2,plus_plus(nat,X3,X4))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_128, plain, (times_times(X1,times_times(X1,X2,X3),X4)=times_times(X1,times_times(X1,X2,X4),X3)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_137, plain, (plus_plus(X1,X2,plus_plus(X1,X3,X4))=plus_plus(X1,X3,plus_plus(X1,X2,X4))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_134, plain, (plus_plus(X1,plus_plus(X1,X2,X3),X4)=plus_plus(X1,plus_plus(X1,X2,X4),X3)|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_49, plain, (times_times(X1,power_power(X1,X2,X3),power_power(X1,X2,X3))=power_power(X1,X2,times_times(nat,number_number_of(nat,bit0(bit1(pls))),X3))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_133, plain, (plus_plus(X1,plus_plus(X1,X2,X3),plus_plus(X1,X4,X5))=plus_plus(X1,plus_plus(X1,X2,X4),plus_plus(X1,X3,X5))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_125, plain, (times_times(X1,times_times(X1,X2,X3),times_times(X1,X4,X5))=times_times(X1,times_times(X1,X2,X4),times_times(X1,X3,X5))|~comm_semiring_1(X1))).
% 0.19/0.42 cnf(i_0_43, plain, (plus_plus(X1,plus_plus(X1,power_power(X1,X2,number_number_of(nat,bit0(bit1(pls)))),power_power(X1,X3,number_number_of(nat,bit0(bit1(pls))))),times_times(X1,times_times(X1,number_number_of(X1,bit0(bit1(pls))),X2),X3))=power_power(X1,plus_plus(X1,X2,X3),number_number_of(nat,bit0(bit1(pls))))|~number_semiring(X1))).
% 0.19/0.42 # End listing active clauses. There is an equivalent clause to each of these in the clausification!
% 0.19/0.42 # Begin printing tableau
% 0.19/0.42 # Found 6 steps
% 0.19/0.42 cnf(i_0_185, negated_conjecture, (plus_plus(int,power_power(int,X6,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))), inference(start_rule)).
% 0.19/0.42 cnf(i_0_187, plain, (plus_plus(int,power_power(int,X6,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))))!=plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))), inference(extension_rule, [i_0_140])).
% 0.19/0.42 cnf(i_0_247, plain, (~ring_char_0(int)), inference(closure_rule, [i_0_175])).
% 0.19/0.42 cnf(i_0_248, plain, (~number_ring(int)), inference(closure_rule, [i_0_176])).
% 0.19/0.42 cnf(i_0_246, plain, (number_number_of(int,plus_plus(int,power_power(int,X6,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,number_number_of(nat,bit0(bit1(pls))))))!=number_number_of(int,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))))), inference(extension_rule, [i_0_146])).
% 0.19/0.42 cnf(i_0_17570, plain, (bit0(number_number_of(int,plus_plus(int,power_power(int,X6,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X5,number_number_of(nat,bit0(bit1(pls)))))))!=bit0(number_number_of(int,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))))), inference(etableau_closure_rule, [i_0_17570, ...])).
% 0.19/0.42 # End printing tableau
% 0.19/0.42 # SZS output end
% 0.19/0.42 # Branches closed with saturation will be marked with an "s"
% 0.19/0.42 # Child (3890) has found a proof.
% 0.19/0.42
% 0.19/0.42 # Proof search is over...
% 0.19/0.42 # Freeing feature tree
%------------------------------------------------------------------------------