TSTP Solution File: NUM925+5 by Etableau---0.67

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Etableau---0.67
% Problem  : NUM925+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 : n017.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:50 EDT 2022

% Result   : Theorem 0.19s 0.47s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% 0.12/0.13  % Command  : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34  % Computer : n017.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jul  6 16:38:14 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.39  # No SInE strategy applied
% 0.19/0.39  # Auto-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S04AN
% 0.19/0.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 0.19/0.39  #
% 0.19/0.39  # Presaturation interreduction done
% 0.19/0.39  # Number of axioms: 190 Number of unprocessed: 159
% 0.19/0.39  # Tableaux proof search.
% 0.19/0.39  # APR header successfully linked.
% 0.19/0.39  # Hello from C++
% 0.19/0.41  # The folding up rule is enabled...
% 0.19/0.41  # Local unification is enabled...
% 0.19/0.41  # Any saturation attempts will use folding labels...
% 0.19/0.41  # 159 beginning clauses after preprocessing and clausification
% 0.19/0.41  # Creating start rules for all 1 conjectures.
% 0.19/0.41  # There are 1 start rule candidates:
% 0.19/0.41  # Found 60 unit axioms.
% 0.19/0.41  # 1 start rule tableaux created.
% 0.19/0.41  # 99 extension rule candidate clauses
% 0.19/0.41  # 60 unit axiom clauses
% 0.19/0.41  
% 0.19/0.41  # Requested 8, 32 cores available to the main process.
% 0.19/0.41  # There are not enough tableaux to fork, creating more from the initial 1
% 0.19/0.41  # Creating equality axioms
% 0.19/0.41  # Ran out of tableaux, making start rules for all clauses
% 0.19/0.41  # Returning from population with 192 new_tableaux and 0 remaining starting tableaux.
% 0.19/0.41  # We now have 192 tableaux to operate on
% 0.19/0.47  # There were 1 total branch saturation attempts.
% 0.19/0.47  # There were 0 of these attempts blocked.
% 0.19/0.47  # There were 0 deferred branch saturation attempts.
% 0.19/0.47  # There were 0 free duplicated saturations.
% 0.19/0.47  # There were 1 total successful branch saturations.
% 0.19/0.47  # There were 0 successful branch saturations in interreduction.
% 0.19/0.47  # There were 0 successful branch saturations on the branch.
% 0.19/0.47  # There were 1 successful branch saturations after the branch.
% 0.19/0.47  # There were 1 total branch saturation attempts.
% 0.19/0.47  # There were 0 of these attempts blocked.
% 0.19/0.47  # There were 0 deferred branch saturation attempts.
% 0.19/0.47  # There were 0 free duplicated saturations.
% 0.19/0.47  # There were 1 total successful branch saturations.
% 0.19/0.47  # There were 0 successful branch saturations in interreduction.
% 0.19/0.47  # There were 0 successful branch saturations on the branch.
% 0.19/0.47  # There were 1 successful branch saturations after the branch.
% 0.19/0.47  # SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Begin clausification derivation
% 0.19/0.47  
% 0.19/0.47  # End clausification derivation
% 0.19/0.47  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls)).
% 0.19/0.47  cnf(i_0_62, plain, (number_number_of(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_69, plain, (zero_zero(nat)=number_number_of(nat,pls))).
% 0.19/0.47  cnf(i_0_187, plain, (power(int))).
% 0.19/0.47  cnf(i_0_195, plain, (power(nat))).
% 0.19/0.47  cnf(i_0_183, plain, (semiring_0(int))).
% 0.19/0.47  cnf(i_0_193, plain, (semiring_0(nat))).
% 0.19/0.47  cnf(i_0_176, plain, (linord219039673up_add(int))).
% 0.19/0.47  cnf(i_0_180, plain, (number_semiring(int))).
% 0.19/0.47  cnf(i_0_190, plain, (number_semiring(nat))).
% 0.19/0.47  cnf(i_0_67, plain, (semiring_1_of_nat(int,one_one(nat))=one_one(int))).
% 0.19/0.47  cnf(i_0_72, plain, (semiring_1_of_nat(int,number_number_of(nat,pls))=pls)).
% 0.19/0.47  cnf(i_0_184, plain, (mult_zero(int))).
% 0.19/0.47  cnf(i_0_194, plain, (mult_zero(nat))).
% 0.19/0.47  cnf(i_0_178, plain, (no_zero_divisors(int))).
% 0.19/0.47  cnf(i_0_189, plain, (no_zero_divisors(nat))).
% 0.19/0.47  cnf(i_0_181, plain, (zero_neq_one(int))).
% 0.19/0.47  cnf(i_0_191, plain, (zero_neq_one(nat))).
% 0.19/0.47  cnf(i_0_188, plain, (number(int))).
% 0.19/0.47  cnf(i_0_16, hypothesis, (ti(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_35, hypothesis, (ti(nat,n)=n)).
% 0.19/0.47  cnf(i_0_196, plain, (number(nat))).
% 0.19/0.47  cnf(i_0_179, plain, (linordered_idom(int))).
% 0.19/0.47  cnf(i_0_182, plain, (semiring_1(int))).
% 0.19/0.47  cnf(i_0_192, plain, (semiring_1(nat))).
% 0.19/0.47  cnf(i_0_177, plain, (ring_11004092258visors(int))).
% 0.19/0.47  cnf(i_0_186, plain, (number_ring(int))).
% 0.19/0.47  cnf(i_0_185, plain, (ring_char_0(int))).
% 0.19/0.47  cnf(i_0_36, plain, (ti(int,t)=t)).
% 0.19/0.47  cnf(i_0_148, plain, (plus_plus(int,X1,pls)=X1)).
% 0.19/0.47  cnf(i_0_149, plain, (plus_plus(int,pls,X1)=X1)).
% 0.19/0.47  cnf(i_0_55, plain, (ord_less(nat,number_number_of(nat,pls),n))).
% 0.19/0.47  cnf(i_0_11, plain, (ti(X1,undefined(X1))=undefined(X1))).
% 0.19/0.47  cnf(i_0_38, plain, (ord_less(int,one_one(int),t))).
% 0.19/0.47  cnf(i_0_124, plain, (ord_less(int,pls,one_one(int)))).
% 0.19/0.47  cnf(i_0_73, plain, (number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))=plus_plus(nat,one_one(nat),one_one(nat)))).
% 0.19/0.47  cnf(i_0_37, plain, (ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))))).
% 0.19/0.47  cnf(i_0_198, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),plus_plus(nat,one_one(nat),one_one(nat)))=pls)).
% 0.19/0.47  cnf(i_0_13, hypothesis, (ti(int,plus_plus(int,X1,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_64, plain, (semiring_1_of_nat(int,power_power(nat,X1,X2))=power_power(int,semiring_1_of_nat(int,X1),X2))).
% 0.19/0.47  cnf(i_0_59, plain, (plus_plus(int,number_number_of(int,X1),number_number_of(int,X2))=number_number_of(int,plus_plus(int,X1,X2)))).
% 0.19/0.47  cnf(i_0_66, plain, (plus_plus(int,semiring_1_of_nat(int,X1),semiring_1_of_nat(int,X2))=semiring_1_of_nat(int,plus_plus(nat,X1,X2)))).
% 0.19/0.47  cnf(i_0_197, plain, (ti(X1,ti(X1,X2))=ti(X1,X2))).
% 0.19/0.47  cnf(i_0_12, hypothesis, (plus_plus(int,ti(int,X1),ti(int,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_100, plain, (plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3)))).
% 0.19/0.47  cnf(i_0_15, hypothesis, (ti(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)))=plus_plus(int,X1,plus_plus(int,one_one(int),X1)))).
% 0.19/0.47  cnf(i_0_65, plain, (plus_plus(int,semiring_1_of_nat(int,X1),plus_plus(int,semiring_1_of_nat(int,X2),X3))=plus_plus(int,semiring_1_of_nat(int,plus_plus(nat,X1,X2)),X3))).
% 0.19/0.47  cnf(i_0_50, plain, (power_power(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),plus_plus(nat,one_one(nat),one_one(nat)))=power_power(int,X1,number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))).
% 0.19/0.47  cnf(i_0_89, plain, (number_number_of(nat,one_one(int))=one_one(nat))).
% 0.19/0.47  cnf(i_0_87, plain, (number_number_of(int,one_one(int))=one_one(int))).
% 0.19/0.47  cnf(i_0_125, plain, (ord_less(int,X1,plus_plus(int,X1,one_one(int))))).
% 0.19/0.47  cnf(i_0_102, plain, (plus_plus(int,X1,X2)=plus_plus(int,X2,X1))).
% 0.19/0.47  cnf(i_0_101, plain, (plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3)))).
% 0.19/0.47  cnf(i_0_166, plain, (plus_plus(int,X1,plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,one_one(int),X2))))=plus_plus(int,one_one(int),plus_plus(int# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Begin clausification derivation
% 0.19/0.47  
% 0.19/0.47  # End clausification derivation
% 0.19/0.47  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls)).
% 0.19/0.47  cnf(i_0_62, plain, (number_number_of(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_69, plain, (zero_zero(nat)=number_number_of(nat,pls))).
% 0.19/0.47  cnf(i_0_187, plain, (power(int))).
% 0.19/0.47  cnf(i_0_195, plain, (power(nat))).
% 0.19/0.47  cnf(i_0_183, plain, (semiring_0(int))).
% 0.19/0.47  cnf(i_0_193, plain, (semiring_0(nat))).
% 0.19/0.47  cnf(i_0_176, plain, (linord219039673up_add(int))).
% 0.19/0.47  cnf(i_0_180, plain, (number_semiring(int))).
% 0.19/0.47  cnf(i_0_190, plain, (number_semiring(nat))).
% 0.19/0.47  cnf(i_0_67, plain, (semiring_1_of_nat(int,one_one(nat))=one_one(int))).
% 0.19/0.47  cnf(i_0_72, plain, (semiring_1_of_nat(int,number_number_of(nat,pls))=pls)).
% 0.19/0.47  cnf(i_0_184, plain, (mult_zero(int))).
% 0.19/0.47  cnf(i_0_194, plain, (mult_zero(nat))).
% 0.19/0.47  cnf(i_0_178, plain, (no_zero_divisors(int))).
% 0.19/0.47  cnf(i_0_189, plain, (no_zero_divisors(nat))).
% 0.19/0.47  cnf(i_0_181, plain, (zero_neq_one(int))).
% 0.19/0.47  cnf(i_0_191, plain, (zero_neq_one(nat))).
% 0.19/0.47  cnf(i_0_188, plain, (number(int))).
% 0.19/0.47  cnf(i_0_16, hypothesis, (ti(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_35, hypothesis, (ti(nat,n)=n)).
% 0.19/0.47  cnf(i_0_196, plain, (number(nat))).
% 0.19/0.47  cnf(i_0_179, plain, (linordered_idom(int))).
% 0.19/0.47  cnf(i_0_182, plain, (semiring_1(int))).
% 0.19/0.47  cnf(i_0_192, plain, (semiring_1(nat))).
% 0.19/0.47  cnf(i_0_177, plain, (ring_11004092258visors(int))).
% 0.19/0.47  cnf(i_0_186, plain, (number_ring(int))).
% 0.19/0.47  cnf(i_0_185, plain, (ring_char_0(int))).
% 0.19/0.47  cnf(i_0_36, plain, (ti(int,t)=t)).
% 0.19/0.47  cnf(i_0_148, plain, (plus_plus(int,X1,pls)=X1)).
% 0.19/0.47  cnf(i_0_149, plain, (plus_plus(int,pls,X1)=X1)).
% 0.19/0.47  cnf(i_0_55, plain, (ord_less(nat,number_number_of(nat,pls),n))).
% 0.19/0.47  cnf(i_0_11, plain, (ti(X1,undefined(X1))=undefined(X1))).
% 0.19/0.47  cnf(i_0_38, plain, (ord_less(int,one_one(int),t))).
% 0.19/0.47  cnf(i_0_124, plain, (ord_less(int,pls,one_one(int)))).
% 0.19/0.47  cnf(i_0_73, plain, (number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))=plus_plus(nat,one_one(nat),one_one(nat)))).
% 0.19/0.47  cnf(i_0_37, plain, (ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))))).
% 0.19/0.47  cnf(i_0_198, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),plus_plus(nat,one_one(nat),one_one(nat)))=pls)).
% 0.19/0.47  cnf(i_0_13, hypothesis, (ti(int,plus_plus(int,X1,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_64, plain, (semiring_1_of_nat(int,power_power(nat,X1,X2))=power_power(int,semiring_1_of_nat(int,X1),X2))).
% 0.19/0.47  cnf(i_0_59, plain, (plus_plus(int,number_number_of(int,X1),number_number_of(int,X2))=number_number_of(int,plus_plus(int,X1,X2)))).
% 0.19/0.47  cnf(i_0_66, plain, (plus_plus(int,semiring_1_of_nat(int,X1),semiring_1_of_nat(int,X2))=semiring_1_of_nat(int,plus_plus(nat,X1,X2)))).
% 0.19/0.47  cnf(i_0_197, plain, (ti(X1,ti(X1,X2))=ti(X1,X2))).
% 0.19/0.47  cnf(i_0_12, hypothesis, (plus_plus(int,ti(int,X1),ti(int,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_100, plain, (plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3)))).
% 0.19/0.47  cnf(i_0_15, hypothesis, (ti(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)))=plus_plus(int,X1,plus_plus(int,one_one(int),X1)))).
% 0.19/0.47  cnf(i_0_65, plain, (plus_plus(int,semiring_1_of_nat(int,X1),plus_plus(int,semiring_1_of_nat(int,X2),X3))=plus_plus(int,semiring_1_of_nat(int,plus_plus(nat,X1,X2)),X3))).
% 0.19/0.47  cnf(i_0_50, plain, (power_power(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),plus_plus(nat,one_one(nat),one_one(nat)))=power_power(int,X1,number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))).
% 0.19/0.47  cnf(i_0_89, plain, (number_number_of(nat,one_one(int))=one_one(nat))).
% 0.19/0.47  cnf(i_0_87, plain, (number_number_of(int,one_one(int))=one_one(int))).
% 0.19/0.47  cnf(i_0_125, plain, (ord_less(int,X1,plus_plus(int,X1,one_one(int))))).
% 0.19/0.47  cnf(i_0_102, plain, (plus_plus(int,X1,X2)=plus_plus(int,X2,X1))).
% 0.19/0.47  cnf(i_0_101, plain, (plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3)))).
% 0.19/0.47  cnf(i_0_166, plain, (plus_plus(int,X1,plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,one_one(int),X2))))=plus_plus(int,one_one(int),plus_plus(int# There were 1 total branch saturation attempts.
% 0.19/0.47  # There were 0 of these attempts blocked.
% 0.19/0.47  # There were 0 deferred branch saturation attempts.
% 0.19/0.47  # There were 0 free duplicated saturations.
% 0.19/0.47  # There were 1 total successful branch saturations.
% 0.19/0.47  # There were 0 successful branch saturations in interreduction.
% 0.19/0.47  # There were 0 successful branch saturations on the branch.
% 0.19/0.47  # There were 1 successful branch saturations after the branch.
% 0.19/0.47  ,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_165, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,X2))))=plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_147, plain, (one_one(int)!=pls)).
% 0.19/0.47  cnf(i_0_78, plain, (~ord_less(int,pls,pls))).
% 0.19/0.47  cnf(i_0_128, plain, (~ord_less(int,semiring_1_of_nat(int,X1),pls))).
% 0.19/0.47  cnf(i_0_140, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_138, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=pls)).
% 0.19/0.47  cnf(i_0_71, plain, (X1=number_number_of(nat,pls)|semiring_1_of_nat(int,X1)!=pls)).
% 0.19/0.47  cnf(i_0_156, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_154, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_142, plain, (X1=pls|plus_plus(int,X1,X1)!=pls)).
% 0.19/0.47  cnf(i_0_104, plain, (X1=X2|semiring_1_of_nat(int,X1)!=semiring_1_of_nat(int,X2))).
% 0.19/0.47  cnf(i_0_9, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_28, plain, (ord_less(nat,X1,X2)|~ord_less(nat,X1,ti(nat,X2)))).
% 0.19/0.47  cnf(i_0_26, plain, (ord_less(nat,X1,X2)|~ord_less(nat,ti(nat,X1),X2))).
% 0.19/0.47  cnf(i_0_97, plain, (X1=X2|plus_plus(int,X1,X1)!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_116, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,X1),pls))).
% 0.19/0.47  cnf(i_0_53, plain, (number_number_of(X1,one_one(int))=one_one(X1)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_1, plain, (ti(X1,one_one(X1))=one_one(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_118, plain, (ord_less(int,pls,X1)|~ord_less(int,pls,plus_plus(int,X1,X1)))).
% 0.19/0.47  cnf(i_0_24, plain, (ord_less(X1,X2,X3)|~ord_less(X1,X2,ti(X1,X3))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_22, plain, (ord_less(X1,X2,X3)|~ord_less(X1,ti(X1,X2),X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_91, plain, (X1=X2|number_number_of(X3,X1)!=number_number_of(X3,X2)|~ring_char_0(X3)|~number_ring(X3))).
% 0.19/0.47  cnf(i_0_10, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_169, plain, (number_number_of(X1,semiring_1_of_nat(int,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_58, plain, (ord_less(int,X1,X2)|~ord_less(int,number_number_of(int,X1),number_number_of(int,X2)))).
% 0.19/0.47  cnf(i_0_27, plain, (ord_less(nat,X1,ti(nat,X2))|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_25, plain, (ord_less(nat,ti(nat,X1),X2)|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_19, plain, (semiring_1_of_nat(X1,ti(nat,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_86, 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.47  cnf(i_0_95, plain, (X1=X2|plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,plus_plus(int,one_one(int),X2)))).
% 0.19/0.47  cnf(i_0_110, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),pls))).
% 0.19/0.47  cnf(i_0_8, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_20, plain, (ti(X1,semiring_1_of_nat(X1,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_80, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_106, plain, (ord_less(int,X1,pls)|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),zero_zero(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_117, plain, (ord_less(int,pls,plus_plus(int,X1,X1))|~ord_less(int,pls,X1))).
% 0.19/0.47  cnf(i_0_115, plain, (ord_less(int,plus_plus(int,X1,X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_17, plain, (number_number_of(X1,ti(int,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_108, plain, (ord_less(int,pls,X1)|~number_ring(X2)|~ord_less(X2,zero_zero(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_18, plain, (ti(X1,number_number_of(X1,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_23, plain, (ord_less(X1,X2,ti(X1,X3))|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_21, plain, (ord_less(X1,ti(X1,X2),X3)|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_57, plain, (ord_less(int,number_number_of(int,X1),number_number_of(int,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_109, plain, (ord_less(int,plus_plus(# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Begin clausification derivation
% 0.19/0.47  
% 0.19/0.47  # End clausification derivation
% 0.19/0.47  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls)).
% 0.19/0.47  cnf(i_0_62, plain, (number_number_of(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_69, plain, (zero_zero(nat)=number_number_of(nat,pls))).
% 0.19/0.47  cnf(i_0_187, plain, (power(int))).
% 0.19/0.47  cnf(i_0_195, plain, (power(nat))).
% 0.19/0.47  cnf(i_0_183, plain, (semiring_0(int))).
% 0.19/0.47  cnf(i_0_193, plain, (semiring_0(nat))).
% 0.19/0.47  cnf(i_0_176, plain, (linord219039673up_add(int))).
% 0.19/0.47  cnf(i_0_180, plain, (number_semiring(int))).
% 0.19/0.47  cnf(i_0_190, plain, (number_semiring(nat))).
% 0.19/0.47  cnf(i_0_67, plain, (semiring_1_of_nat(int,one_one(nat))=one_one(int))).
% 0.19/0.47  cnf(i_0_72, plain, (semiring_1_of_nat(int,number_number_of(nat,pls))=pls)).
% 0.19/0.47  cnf(i_0_184, plain, (mult_zero(int))).
% 0.19/0.47  cnf(i_0_194, plain, (mult_zero(nat))).
% 0.19/0.47  cnf(i_0_178, plain, (no_zero_divisors(int))).
% 0.19/0.47  cnf(i_0_189, plain, (no_zero_divisors(nat))).
% 0.19/0.47  cnf(i_0_181, plain, (zero_neq_one(int))).
% 0.19/0.47  cnf(i_0_191, plain, (zero_neq_one(nat))).
% 0.19/0.47  cnf(i_0_188, plain, (number(int))).
% 0.19/0.47  cnf(i_0_16, hypothesis, (ti(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_35, hypothesis, (ti(nat,n)=n)).
% 0.19/0.47  cnf(i_0_196, plain, (number(nat))).
% 0.19/0.47  cnf(i_0_179, plain, (linordered_idom(int))).
% 0.19/0.47  cnf(i_0_182, plain, (semiring_1(int))).
% 0.19/0.47  cnf(i_0_192, plain, (semiring_1(nat))).
% 0.19/0.47  cnf(i_0_177, plain, (ring_11004092258visors(int))).
% 0.19/0.47  cnf(i_0_186, plain, (number_ring(int))).
% 0.19/0.47  cnf(i_0_185, plain, (ring_char_0(int))).
% 0.19/0.47  cnf(i_0_36, plain, (ti(int,t)=t)).
% 0.19/0.47  cnf(i_0_148, plain, (plus_plus(int,X1,pls)=X1)).
% 0.19/0.47  cnf(i_0_149, plain, (plus_plus(int,pls,X1)=X1)).
% 0.19/0.47  cnf(i_0_55, plain, (ord_less(nat,number_number_of(nat,pls),n))).
% 0.19/0.47  cnf(i_0_11, plain, (ti(X1,undefined(X1))=undefined(X1))).
% 0.19/0.47  cnf(i_0_38, plain, (ord_less(int,one_one(int),t))).
% 0.19/0.47  cnf(i_0_124, plain, (ord_less(int,pls,one_one(int)))).
% 0.19/0.47  cnf(i_0_73, plain, (number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))=plus_plus(nat,one_one(nat),one_one(nat)))).
% 0.19/0.47  cnf(i_0_37, plain, (ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))))).
% 0.19/0.47  cnf(i_0_198, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),plus_plus(nat,one_one(nat),one_one(nat)))=pls)).
% 0.19/0.47  cnf(i_0_13, hypothesis, (ti(int,plus_plus(int,X1,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_64, plain, (semiring_1_of_nat(int,power_power(nat,X1,X2))=power_power(int,semiring_1_of_nat(int,X1),X2))).
% 0.19/0.47  cnf(i_0_59, plain, (plus_plus(int,number_number_of(int,X1),number_number_of(int,X2))=number_number_of(int,plus_plus(int,X1,X2)))).
% 0.19/0.47  cnf(i_0_66, plain, (plus_plus(int,semiring_1_of_nat(int,X1),semiring_1_of_nat(int,X2))=semiring_1_of_nat(int,plus_plus(nat,X1,X2)))).
% 0.19/0.47  cnf(i_0_197, plain, (ti(X1,ti(X1,X2))=ti(X1,X2))).
% 0.19/0.47  cnf(i_0_12, hypothesis, (plus_plus(int,ti(int,X1),ti(int,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_100, plain, (plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3)))).
% 0.19/0.47  cnf(i_0_15, hypothesis, (ti(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)))=plus_plus(int,X1,plus_plus(int,one_one(int),X1)))).
% 0.19/0.47  cnf(i_0_65, plain, (plus_plus(int,semiring_1_of_nat(int,X1),plus_plus(int,semiring_1_of_nat(int,X2),X3))=plus_plus(int,semiring_1_of_nat(int,plus_plus(nat,X1,X2)),X3))).
% 0.19/0.47  cnf(i_0_50, plain, (power_power(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),plus_plus(nat,one_one(nat),one_one(nat)))=power_power(int,X1,number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))).
% 0.19/0.47  cnf(i_0_89, plain, (number_number_of(nat,one_one(int))=one_one(nat))).
% 0.19/0.47  cnf(i_0_87, plain, (number_number_of(int,one_one(int))=one_one(int))).
% 0.19/0.47  cnf(i_0_125, plain, (ord_less(int,X1,plus_plus(int,X1,one_one(int))))).
% 0.19/0.47  cnf(i_0_102, plain, (plus_plus(int,X1,X2)=plus_plus(int,X2,X1))).
% 0.19/0.47  cnf(i_0_101, plain, (plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3)))).
% 0.19/0.47  cnf(i_0_166, plain, (plus_plus(int,X1,plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,one_one(int),X2))))=plus_plus(int,one_one(int),plus_plus(intint,X1,plus_plus(int,one_one(int),X1)),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_126, plain, (ord_less(int,X1,plus_plus(int,X2,one_one(int)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_135, plain, (plus_plus(X1,X2,X2)=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_158, plain, (plus_plus(X1,X2,number_number_of(X1,pls))=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_99, plain, (ord_less(X1,X2,zero_zero(X1))|~ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_136, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,X2,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_61, plain, (ord_less(int,X1,X2)|~number_ring(X3)|~ord_less(X3,number_number_of(X3,X1),number_number_of(X3,X2))|~linordered_idom(X3))).
% 0.19/0.47  cnf(i_0_127, plain, (X1=X2|ord_less(int,X1,X2)|~ord_less(int,X1,plus_plus(int,X2,one_one(int))))).
% 0.19/0.47  cnf(i_0_157, plain, (plus_plus(X1,number_number_of(X1,pls),X2)=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_42, plain, (power_power(X1,one_one(X1),plus_plus(nat,one_one(nat),one_one(nat)))=one_one(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_43, plain, (power_power(X1,zero_zero(X1),plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_56, plain, (X1=X2|ord_less(int,X1,X2)|ord_less(int,X2,X1))).
% 0.19/0.47  cnf(i_0_6, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_160, plain, (power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|number_number_of(nat,X3)!=number_number_of(nat,pls)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_5, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_7, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_3, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_172, plain, (~ord_less(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_85, 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.47  cnf(i_0_51, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=zero_zero(X1)|number_number_of(nat,X2)=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_2, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_4, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_112, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_161, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_33, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_45, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_52, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=one_one(X1)|number_number_of(nat,X2)!=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_75, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2))))).
% 0.19/0.47  cnf(i_0_32, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_83, plain, (ord_less(int,plus_plus(int,X1,X2),plus_plus(int,X3,X2))|~ord_less(int,X1,X3))).
% 0.19/0.47  cnf(i_0_34, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_107, plain, (ord_less(X1,zero_zero(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,pls,X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_105, plain, (ord_less(X1,number_number_of(X1,X2),zero_zero(X1))|~number_ring(X1)|~ord_less(int,X2,pls)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_98, plain, (ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~ord_less(X1,X2,zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_79, plain, (ord_less(int,plus_plus(int,X1,X1),plus_p# There were 1 total branch saturation attempts.
% 0.19/0.47  # There were 0 of these attempts blocked.
% 0.19/0.47  # There were 0 deferred branch saturation attempts.
% 0.19/0.47  # There were 0 free duplicated saturations.
% 0.19/0.47  # There were 1 total successful branch saturations.
% 0.19/0.47  # There were 0 successful branch saturations in interreduction.
% 0.19/0.47  # There were 0 successful branch saturations on the branch.
% 0.19/0.47  # There were 1 successful branch saturations after the branch.
% 0.19/0.47  ,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_165, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,X2))))=plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_147, plain, (one_one(int)!=pls)).
% 0.19/0.47  cnf(i_0_78, plain, (~ord_less(int,pls,pls))).
% 0.19/0.47  cnf(i_0_128, plain, (~ord_less(int,semiring_1_of_nat(int,X1),pls))).
% 0.19/0.47  cnf(i_0_140, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_138, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=pls)).
% 0.19/0.47  cnf(i_0_71, plain, (X1=number_number_of(nat,pls)|semiring_1_of_nat(int,X1)!=pls)).
% 0.19/0.47  cnf(i_0_156, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_154, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_142, plain, (X1=pls|plus_plus(int,X1,X1)!=pls)).
% 0.19/0.47  cnf(i_0_104, plain, (X1=X2|semiring_1_of_nat(int,X1)!=semiring_1_of_nat(int,X2))).
% 0.19/0.47  cnf(i_0_9, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_28, plain, (ord_less(nat,X1,X2)|~ord_less(nat,X1,ti(nat,X2)))).
% 0.19/0.47  cnf(i_0_26, plain, (ord_less(nat,X1,X2)|~ord_less(nat,ti(nat,X1),X2))).
% 0.19/0.47  cnf(i_0_97, plain, (X1=X2|plus_plus(int,X1,X1)!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_116, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,X1),pls))).
% 0.19/0.47  cnf(i_0_53, plain, (number_number_of(X1,one_one(int))=one_one(X1)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_1, plain, (ti(X1,one_one(X1))=one_one(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_118, plain, (ord_less(int,pls,X1)|~ord_less(int,pls,plus_plus(int,X1,X1)))).
% 0.19/0.47  cnf(i_0_24, plain, (ord_less(X1,X2,X3)|~ord_less(X1,X2,ti(X1,X3))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_22, plain, (ord_less(X1,X2,X3)|~ord_less(X1,ti(X1,X2),X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_91, plain, (X1=X2|number_number_of(X3,X1)!=number_number_of(X3,X2)|~ring_char_0(X3)|~number_ring(X3))).
% 0.19/0.47  cnf(i_0_10, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_169, plain, (number_number_of(X1,semiring_1_of_nat(int,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_58, plain, (ord_less(int,X1,X2)|~ord_less(int,number_number_of(int,X1),number_number_of(int,X2)))).
% 0.19/0.47  cnf(i_0_27, plain, (ord_less(nat,X1,ti(nat,X2))|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_25, plain, (ord_less(nat,ti(nat,X1),X2)|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_19, plain, (semiring_1_of_nat(X1,ti(nat,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_86, 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.47  cnf(i_0_95, plain, (X1=X2|plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,plus_plus(int,one_one(int),X2)))).
% 0.19/0.47  cnf(i_0_110, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),pls))).
% 0.19/0.47  cnf(i_0_8, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_20, plain, (ti(X1,semiring_1_of_nat(X1,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_80, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_106, plain, (ord_less(int,X1,pls)|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),zero_zero(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_117, plain, (ord_less(int,pls,plus_plus(int,X1,X1))|~ord_less(int,pls,X1))).
% 0.19/0.47  cnf(i_0_115, plain, (ord_less(int,plus_plus(int,X1,X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_17, plain, (number_number_of(X1,ti(int,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_108, plain, (ord_less(int,pls,X1)|~number_ring(X2)|~ord_less(X2,zero_zero(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_18, plain, (ti(X1,number_number_of(X1,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_23, plain, (ord_less(X1,X2,ti(X1,X3))|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_21, plain, (ord_less(X1,ti(X1,X2),X3)|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_57, plain, (ord_less(int,number_number_of(int,X1),number_number_of(int,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_109, plain, (ord_less(int,plus_plus(lus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_49, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_48, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_44, plain, (power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_159, plain, (power_power(X1,X2,number_number_of(nat,X3))=zero_zero(X1)|number_number_of(nat,X3)=number_number_of(nat,pls)|ti(X1,X2)!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_164, plain, (plus_plus(X1,number_number_of(X1,X2),number_number_of(X1,X3))=number_number_of(X1,plus_plus(int,X2,X3))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_60, plain, (ord_less(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~number_ring(X1)|~ord_less(int,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_30, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_29, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_31, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_84, 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.47  cnf(i_0_171, plain, (ti(X1,X2)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_111, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_130, plain, (ord_less(int,X1,one_one(int))|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),one_one(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_131, plain, (ord_less(X1,one_one(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,one_one(int),X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_129, plain, (ord_less(X1,number_number_of(X1,X2),one_one(X1))|~number_ring(X1)|~ord_less(int,X2,one_one(int))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_132, plain, (ord_less(int,one_one(int),X1)|~number_ring(X2)|~ord_less(X2,one_one(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_162, plain, (plus_plus(X1,number_number_of(X1,X2),plus_plus(X1,number_number_of(X1,X3),X4))=plus_plus(X1,number_number_of(X1,plus_plus(int,X2,X3)),X4)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_46, plain, (plus_plus(X1,one_one(X1),number_number_of(X1,X2))=number_number_of(X1,plus_plus(int,one_one(int),X2))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_47, plain, (plus_plus(X1,number_number_of(X1,X2),one_one(X1))=number_number_of(X1,plus_plus(int,X2,one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_74, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_40, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_41, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_175, plain, (ti(X1,X2)!=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_170, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_39, plain, (plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|ti# SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # SZS output start for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Begin clausification derivation
% 0.19/0.47  
% 0.19/0.47  # End clausification derivation
% 0.19/0.47  # Begin listing active clauses obtained from FOF to CNF conversion
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls)).
% 0.19/0.47  cnf(i_0_62, plain, (number_number_of(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_69, plain, (zero_zero(nat)=number_number_of(nat,pls))).
% 0.19/0.47  cnf(i_0_187, plain, (power(int))).
% 0.19/0.47  cnf(i_0_195, plain, (power(nat))).
% 0.19/0.47  cnf(i_0_183, plain, (semiring_0(int))).
% 0.19/0.47  cnf(i_0_193, plain, (semiring_0(nat))).
% 0.19/0.47  cnf(i_0_176, plain, (linord219039673up_add(int))).
% 0.19/0.47  cnf(i_0_180, plain, (number_semiring(int))).
% 0.19/0.47  cnf(i_0_190, plain, (number_semiring(nat))).
% 0.19/0.47  cnf(i_0_67, plain, (semiring_1_of_nat(int,one_one(nat))=one_one(int))).
% 0.19/0.47  cnf(i_0_72, plain, (semiring_1_of_nat(int,number_number_of(nat,pls))=pls)).
% 0.19/0.47  cnf(i_0_184, plain, (mult_zero(int))).
% 0.19/0.47  cnf(i_0_194, plain, (mult_zero(nat))).
% 0.19/0.47  cnf(i_0_178, plain, (no_zero_divisors(int))).
% 0.19/0.47  cnf(i_0_189, plain, (no_zero_divisors(nat))).
% 0.19/0.47  cnf(i_0_181, plain, (zero_neq_one(int))).
% 0.19/0.47  cnf(i_0_191, plain, (zero_neq_one(nat))).
% 0.19/0.47  cnf(i_0_188, plain, (number(int))).
% 0.19/0.47  cnf(i_0_16, hypothesis, (ti(int,pls)=pls)).
% 0.19/0.47  cnf(i_0_35, hypothesis, (ti(nat,n)=n)).
% 0.19/0.47  cnf(i_0_196, plain, (number(nat))).
% 0.19/0.47  cnf(i_0_179, plain, (linordered_idom(int))).
% 0.19/0.47  cnf(i_0_182, plain, (semiring_1(int))).
% 0.19/0.47  cnf(i_0_192, plain, (semiring_1(nat))).
% 0.19/0.47  cnf(i_0_177, plain, (ring_11004092258visors(int))).
% 0.19/0.47  cnf(i_0_186, plain, (number_ring(int))).
% 0.19/0.47  cnf(i_0_185, plain, (ring_char_0(int))).
% 0.19/0.47  cnf(i_0_36, plain, (ti(int,t)=t)).
% 0.19/0.47  cnf(i_0_148, plain, (plus_plus(int,X1,pls)=X1)).
% 0.19/0.47  cnf(i_0_149, plain, (plus_plus(int,pls,X1)=X1)).
% 0.19/0.47  cnf(i_0_55, plain, (ord_less(nat,number_number_of(nat,pls),n))).
% 0.19/0.47  cnf(i_0_11, plain, (ti(X1,undefined(X1))=undefined(X1))).
% 0.19/0.47  cnf(i_0_38, plain, (ord_less(int,one_one(int),t))).
% 0.19/0.47  cnf(i_0_124, plain, (ord_less(int,pls,one_one(int)))).
% 0.19/0.47  cnf(i_0_73, plain, (number_number_of(nat,plus_plus(int,one_one(int),one_one(int)))=plus_plus(nat,one_one(nat),one_one(nat)))).
% 0.19/0.47  cnf(i_0_37, plain, (ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))))).
% 0.19/0.47  cnf(i_0_198, negated_conjecture, (power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),plus_plus(nat,one_one(nat),one_one(nat)))=pls)).
% 0.19/0.47  cnf(i_0_13, hypothesis, (ti(int,plus_plus(int,X1,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_64, plain, (semiring_1_of_nat(int,power_power(nat,X1,X2))=power_power(int,semiring_1_of_nat(int,X1),X2))).
% 0.19/0.47  cnf(i_0_59, plain, (plus_plus(int,number_number_of(int,X1),number_number_of(int,X2))=number_number_of(int,plus_plus(int,X1,X2)))).
% 0.19/0.47  cnf(i_0_66, plain, (plus_plus(int,semiring_1_of_nat(int,X1),semiring_1_of_nat(int,X2))=semiring_1_of_nat(int,plus_plus(nat,X1,X2)))).
% 0.19/0.47  cnf(i_0_197, plain, (ti(X1,ti(X1,X2))=ti(X1,X2))).
% 0.19/0.47  cnf(i_0_12, hypothesis, (plus_plus(int,ti(int,X1),ti(int,X1))=plus_plus(int,X1,X1))).
% 0.19/0.47  cnf(i_0_100, plain, (plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3)))).
% 0.19/0.47  cnf(i_0_15, hypothesis, (ti(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)))=plus_plus(int,X1,plus_plus(int,one_one(int),X1)))).
% 0.19/0.47  cnf(i_0_65, plain, (plus_plus(int,semiring_1_of_nat(int,X1),plus_plus(int,semiring_1_of_nat(int,X2),X3))=plus_plus(int,semiring_1_of_nat(int,plus_plus(nat,X1,X2)),X3))).
% 0.19/0.47  cnf(i_0_50, plain, (power_power(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),plus_plus(nat,one_one(nat),one_one(nat)))=power_power(int,X1,number_number_of(nat,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))).
% 0.19/0.47  cnf(i_0_89, plain, (number_number_of(nat,one_one(int))=one_one(nat))).
% 0.19/0.47  cnf(i_0_87, plain, (number_number_of(int,one_one(int))=one_one(int))).
% 0.19/0.47  cnf(i_0_125, plain, (ord_less(int,X1,plus_plus(int,X1,one_one(int))))).
% 0.19/0.47  cnf(i_0_102, plain, (plus_plus(int,X1,X2)=plus_plus(int,X2,X1))).
% 0.19/0.47  cnf(i_0_101, plain, (plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3)))).
% 0.19/0.47  cnf(i_0_166, plain, (plus_plus(int,X1,plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,one_one(int),X2))))=plus_plus(int,one_one(int),plus_plus(int(X1,X2)!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_173, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_174, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_482, plain, (X243=X243)).
% 0.19/0.47  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.47  # Begin printing tableau
% 0.19/0.47  # Found 7 steps
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls), inference(start_rule)).
% 0.19/0.47  cnf(i_0_508, plain, (zero_zero(int)=pls), inference(extension_rule, [i_0_503])).
% 0.19/0.47  cnf(i_0_1184, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1185, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1183, plain, (power_power(zero_zero(int),zero_zero(int),zero_zero(int))=power_power(pls,pls,pls)), inference(extension_rule, [i_0_485])).
% 0.19/0.47  cnf(i_0_1483, plain, (power_power(pls,pls,pls)!=plus_plus(int,power_power(pls,pls,pls),pls)), inference(closure_rule, [i_0_148])).
% 0.19/0.47  cnf(i_0_1481, plain, (power_power(zero_zero(int),zero_zero(int),zero_zero(int))=plus_plus(int,power_power(pls,pls,pls),pls)), inference(etableau_closure_rule, [i_0_1481, ...])).
% 0.19/0.47  # End printing tableau
% 0.19/0.47  # SZS output end
% 0.19/0.47  # Branches closed with saturation will be marked with an "s"
% 0.19/0.47  int,X1,plus_plus(int,one_one(int),X1)),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_126, plain, (ord_less(int,X1,plus_plus(int,X2,one_one(int)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_135, plain, (plus_plus(X1,X2,X2)=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_158, plain, (plus_plus(X1,X2,number_number_of(X1,pls))=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_99, plain, (ord_less(X1,X2,zero_zero(X1))|~ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_136, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,X2,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_61, plain, (ord_less(int,X1,X2)|~number_ring(X3)|~ord_less(X3,number_number_of(X3,X1),number_number_of(X3,X2))|~linordered_idom(X3))).
% 0.19/0.47  cnf(i_0_127, plain, (X1=X2|ord_less(int,X1,X2)|~ord_less(int,X1,plus_plus(int,X2,one_one(int))))).
% 0.19/0.47  cnf(i_0_157, plain, (plus_plus(X1,number_number_of(X1,pls),X2)=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_42, plain, (power_power(X1,one_one(X1),plus_plus(nat,one_one(nat),one_one(nat)))=one_one(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_43, plain, (power_power(X1,zero_zero(X1),plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_56, plain, (X1=X2|ord_less(int,X1,X2)|ord_less(int,X2,X1))).
% 0.19/0.47  cnf(i_0_6, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_160, plain, (power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|number_number_of(nat,X3)!=number_number_of(nat,pls)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_5, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_7, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_3, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_172, plain, (~ord_less(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_85, 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.47  cnf(i_0_51, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=zero_zero(X1)|number_number_of(nat,X2)=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_2, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_4, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_112, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_161, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_33, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_45, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_52, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=one_one(X1)|number_number_of(nat,X2)!=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_75, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2))))).
% 0.19/0.47  cnf(i_0_32, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_83, plain, (ord_less(int,plus_plus(int,X1,X2),plus_plus(int,X3,X2))|~ord_less(int,X1,X3))).
% 0.19/0.47  cnf(i_0_34, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_107, plain, (ord_less(X1,zero_zero(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,pls,X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_105, plain, (ord_less(X1,number_number_of(X1,X2),zero_zero(X1))|~number_ring(X1)|~ord_less(int,X2,pls)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_98, plain, (ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~ord_less(X1,X2,zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_79, plain, (ord_less(int,plus_plus(int,X1,X1),plus_p,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_165, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,X2))))=plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_147, plain, (one_one(int)!=pls)).
% 0.19/0.47  cnf(i_0_78, plain, (~ord_less(int,pls,pls))).
% 0.19/0.47  cnf(i_0_128, plain, (~ord_less(int,semiring_1_of_nat(int,X1),pls))).
% 0.19/0.47  cnf(i_0_140, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_138, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=pls)).
% 0.19/0.47  cnf(i_0_71, plain, (X1=number_number_of(nat,pls)|semiring_1_of_nat(int,X1)!=pls)).
% 0.19/0.47  cnf(i_0_156, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_154, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_142, plain, (X1=pls|plus_plus(int,X1,X1)!=pls)).
% 0.19/0.47  cnf(i_0_104, plain, (X1=X2|semiring_1_of_nat(int,X1)!=semiring_1_of_nat(int,X2))).
% 0.19/0.47  cnf(i_0_9, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_28, plain, (ord_less(nat,X1,X2)|~ord_less(nat,X1,ti(nat,X2)))).
% 0.19/0.47  cnf(i_0_26, plain, (ord_less(nat,X1,X2)|~ord_less(nat,ti(nat,X1),X2))).
% 0.19/0.47  cnf(i_0_97, plain, (X1=X2|plus_plus(int,X1,X1)!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_116, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,X1),pls))).
% 0.19/0.47  cnf(i_0_53, plain, (number_number_of(X1,one_one(int))=one_one(X1)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_1, plain, (ti(X1,one_one(X1))=one_one(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_118, plain, (ord_less(int,pls,X1)|~ord_less(int,pls,plus_plus(int,X1,X1)))).
% 0.19/0.47  cnf(i_0_24, plain, (ord_less(X1,X2,X3)|~ord_less(X1,X2,ti(X1,X3))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_22, plain, (ord_less(X1,X2,X3)|~ord_less(X1,ti(X1,X2),X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_91, plain, (X1=X2|number_number_of(X3,X1)!=number_number_of(X3,X2)|~ring_char_0(X3)|~number_ring(X3))).
% 0.19/0.47  cnf(i_0_10, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_169, plain, (number_number_of(X1,semiring_1_of_nat(int,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_58, plain, (ord_less(int,X1,X2)|~ord_less(int,number_number_of(int,X1),number_number_of(int,X2)))).
% 0.19/0.47  cnf(i_0_27, plain, (ord_less(nat,X1,ti(nat,X2))|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_25, plain, (ord_less(nat,ti(nat,X1),X2)|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_19, plain, (semiring_1_of_nat(X1,ti(nat,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_86, 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.47  cnf(i_0_95, plain, (X1=X2|plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,plus_plus(int,one_one(int),X2)))).
% 0.19/0.47  cnf(i_0_110, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),pls))).
% 0.19/0.47  cnf(i_0_8, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_20, plain, (ti(X1,semiring_1_of_nat(X1,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_80, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_106, plain, (ord_less(int,X1,pls)|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),zero_zero(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_117, plain, (ord_less(int,pls,plus_plus(int,X1,X1))|~ord_less(int,pls,X1))).
% 0.19/0.47  cnf(i_0_115, plain, (ord_less(int,plus_plus(int,X1,X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_17, plain, (number_number_of(X1,ti(int,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_108, plain, (ord_less(int,pls,X1)|~number_ring(X2)|~ord_less(X2,zero_zero(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_18, plain, (ti(X1,number_number_of(X1,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_23, plain, (ord_less(X1,X2,ti(X1,X3))|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_21, plain, (ord_less(X1,ti(X1,X2),X3)|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_57, plain, (ord_less(int,number_number_of(int,X1),number_number_of(int,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_109, plain, (ord_less(int,plus_plus(lus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_49, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_48, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_44, plain, (power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_159, plain, (power_power(X1,X2,number_number_of(nat,X3))=zero_zero(X1)|number_number_of(nat,X3)=number_number_of(nat,pls)|ti(X1,X2)!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_164, plain, (plus_plus(X1,number_number_of(X1,X2),number_number_of(X1,X3))=number_number_of(X1,plus_plus(int,X2,X3))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_60, plain, (ord_less(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~number_ring(X1)|~ord_less(int,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_30, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_29, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_31, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_84, 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.47  cnf(i_0_171, plain, (ti(X1,X2)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_111, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_130, plain, (ord_less(int,X1,one_one(int))|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),one_one(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_131, plain, (ord_less(X1,one_one(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,one_one(int),X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_129, plain, (ord_less(X1,number_number_of(X1,X2),one_one(X1))|~number_ring(X1)|~ord_less(int,X2,one_one(int))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_132, plain, (ord_less(int,one_one(int),X1)|~number_ring(X2)|~ord_less(X2,one_one(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_162, plain, (plus_plus(X1,number_number_of(X1,X2),plus_plus(X1,number_number_of(X1,X3),X4))=plus_plus(X1,number_number_of(X1,plus_plus(int,X2,X3)),X4)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_46, plain, (plus_plus(X1,one_one(X1),number_number_of(X1,X2))=number_number_of(X1,plus_plus(int,one_one(int),X2))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_47, plain, (plus_plus(X1,number_number_of(X1,X2),one_one(X1))=number_number_of(X1,plus_plus(int,X2,one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_74, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_40, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_41, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_175, plain, (ti(X1,X2)!=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_170, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_39, plain, (plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_173, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_174, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_482, plain, (X243=X243)).
% 0.19/0.47  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.47  # Begin printing tableau
% 0.19/0.47  # Found 8 steps
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls), inference(start_rule)).
% 0.19/0.47  cnf(i_0_508, plain, (zero_zero(int)=pls), inference(extension_rule, [i_0_502])).
% 0.19/0.47  cnf(i_0_1178, plain, (ord_less(int,pls,pls)), inference(closure_rule, [i_0_78])).
% 0.19/0.47  cnf(i_0_1179, plain, ($false), inference(closure_rule, [i_0_482])).
% 0.19/0.47  cnf(i_0_1180, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1182, plain, (~ord_less(int,zero_zero(int),zero_zero(int))), inference(extension_rule, [i_0_24])).
% 0.19/0.47  cnf(i_0_1228, plain, (~linordered_idom(int)), inference(closure_rule, [i_0_179])).
% 0.19/0.47  cnf(i_0_1227, plain, (~ord_less(int,zero_zero(int),ti(int,zero_zero(int)))), inference(etableau_closure_rule, [i_0_1227, ...])).
% 0.19/0.47  # End printing tableau
% 0.19/0.47  # SZS output end
% 0.19/0.47  # Branches closed with saturation will be marked with an "s"
% 0.19/0.47  int,X1,plus_plus(int,one_one(int),X1)),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_126, plain, (ord_less(int,X1,plus_plus(int,X2,one_one(int)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_135, plain, (plus_plus(X1,X2,X2)=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_158, plain, (plus_plus(X1,X2,number_number_of(X1,pls))=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_99, plain, (ord_less(X1,X2,zero_zero(X1))|~ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_136, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,X2,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_61, plain, (ord_less(int,X1,X2)|~number_ring(X3)|~ord_less(X3,number_number_of(X3,X1),number_number_of(X3,X2))|~linordered_idom(X3))).
% 0.19/0.47  cnf(i_0_127, plain, (X1=X2|ord_less(int,X1,X2)|~ord_less(int,X1,plus_plus(int,X2,one_one(int))))).
% 0.19/0.47  cnf(i_0_157, plain, (plus_plus(X1,number_number_of(X1,pls),X2)=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_42, plain, (power_power(X1,one_one(X1),plus_plus(nat,one_one(nat),one_one(nat)))=one_one(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_43, plain, (power_power(X1,zero_zero(X1),plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_56, plain, (X1=X2|ord_less(int,X1,X2)|ord_less(int,X2,X1))).
% 0.19/0.47  cnf(i_0_6, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_160, plain, (power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|number_number_of(nat,X3)!=number_number_of(nat,pls)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_5, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_7, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_3, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_172, plain, (~ord_less(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_85, 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.47  cnf(i_0_51, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=zero_zero(X1)|number_number_of(nat,X2)=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_2, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_4, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_112, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_161, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_33, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_45, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_52, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=one_one(X1)|number_number_of(nat,X2)!=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_75, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2))))).
% 0.19/0.47  cnf(i_0_32, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_83, plain, (ord_less(int,plus_plus(int,X1,X2),plus_plus(int,X3,X2))|~ord_less(int,X1,X3))).
% 0.19/0.47  cnf(i_0_34, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_107, plain, (ord_less(X1,zero_zero(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,pls,X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_105, plain, (ord_less(X1,number_number_of(X1,X2),zero_zero(X1))|~number_ring(X1)|~ord_less(int,X2,pls)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_98, plain, (ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~ord_less(X1,X2,zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_79, plain, (ord_less(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_49, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_48, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_44, plain, (power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_159, plain, (power_power(X1,X2,number_number_of(nat,X3))=zero_zero(X1)|number_number_of(nat,X3)=number_number_of(nat,pls)|ti(X1,X2)!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_164, plain, (plus_plus(X1,number_number_of(X1,X2),number_number_of(X1,X3))=number_number_of(X1,plus_plus(int,X2,X3))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_60, plain, (ord_less(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~number_ring(X1)|~ord_less(int,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_30, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_29, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_31, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_84, 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.47  cnf(i_0_171, plain, (ti(X1,X2)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_111, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_130, plain, (ord_less(int,X1,one_one(int))|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),one_one(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_131, plain, (ord_less(X1,one_one(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,one_one(int),X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_129, plain, (ord_less(X1,number_number_of(X1,X2),one_one(X1))|~number_ring(X1)|~ord_less(int,X2,one_one(int))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_132, plain, (ord_less(int,one_one(int),X1)|~number_ring(X2)|~ord_less(X2,one_one(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_162, plain, (plus_plus(X1,number_number_of(X1,X2),plus_plus(X1,number_number_of(X1,X3),X4))=plus_plus(X1,number_number_of(X1,plus_plus(int,X2,X3)),X4)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_46, plain, (plus_plus(X1,one_one(X1),number_number_of(X1,X2))=number_number_of(X1,plus_plus(int,one_one(int),X2))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_47, plain, (plus_plus(X1,number_number_of(X1,X2),one_one(X1))=number_number_of(X1,plus_plus(int,X2,one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_74, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_40, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_41, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_175, plain, (ti(X1,X2)!=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_170, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_39, plain, (plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_173, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_174, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_482, plain, (X243=X243)).
% 0.19/0.47  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.47  # Begin printing tableau
% 0.19/0.47  # Found 7 steps
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls), inference(start_rule)).
% 0.19/0.47  cnf(i_0_508, plain, (zero_zero(int)=pls), inference(extension_rule, [i_0_503])).
% 0.19/0.47  cnf(i_0_1185, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1186, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1183, plain, (power_power(zero_zero(int),zero_zero(int),zero_zero(int))=power_power(pls,pls,pls)), inference(extension_rule, [i_0_485])).
% 0.19/0.47  cnf(i_0_1483, plain, (power_power(pls,pls,pls)!=plus_plus(int,power_power(pls,pls,pls),pls)), inference(closure_rule, [i_0_148])).
% 0.19/0.47  cnf(i_0_1481, plain, (power_power(zero_zero(int),zero_zero(int),zero_zero(int))=plus_plus(int,power_power(pls,pls,pls),pls)), inference(etableau_closure_rule, [i_0_1481, ...])).
% 0.19/0.47  # End printing tableau
% 0.19/0.47  # SZS output end
% 0.19/0.47  # Branches closed with saturation will be marked with an "s"
% 0.19/0.47  ,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_165, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,X2))))=plus_plus(int,one_one(int),plus_plus(int,X1,plus_plus(int,X2,plus_plus(int,X1,X2)))))).
% 0.19/0.47  cnf(i_0_147, plain, (one_one(int)!=pls)).
% 0.19/0.47  cnf(i_0_78, plain, (~ord_less(int,pls,pls))).
% 0.19/0.47  cnf(i_0_128, plain, (~ord_less(int,semiring_1_of_nat(int,X1),pls))).
% 0.19/0.47  cnf(i_0_140, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_138, plain, (plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=pls)).
% 0.19/0.47  cnf(i_0_71, plain, (X1=number_number_of(nat,pls)|semiring_1_of_nat(int,X1)!=pls)).
% 0.19/0.47  cnf(i_0_156, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_154, plain, (zero_zero(X1)=number_number_of(X1,pls)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_142, plain, (X1=pls|plus_plus(int,X1,X1)!=pls)).
% 0.19/0.47  cnf(i_0_104, plain, (X1=X2|semiring_1_of_nat(int,X1)!=semiring_1_of_nat(int,X2))).
% 0.19/0.47  cnf(i_0_9, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_28, plain, (ord_less(nat,X1,X2)|~ord_less(nat,X1,ti(nat,X2)))).
% 0.19/0.47  cnf(i_0_26, plain, (ord_less(nat,X1,X2)|~ord_less(nat,ti(nat,X1),X2))).
% 0.19/0.47  cnf(i_0_97, plain, (X1=X2|plus_plus(int,X1,X1)!=plus_plus(int,X2,X2))).
% 0.19/0.47  cnf(i_0_116, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,X1),pls))).
% 0.19/0.47  cnf(i_0_53, plain, (number_number_of(X1,one_one(int))=one_one(X1)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_1, plain, (ti(X1,one_one(X1))=one_one(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_118, plain, (ord_less(int,pls,X1)|~ord_less(int,pls,plus_plus(int,X1,X1)))).
% 0.19/0.47  cnf(i_0_24, plain, (ord_less(X1,X2,X3)|~ord_less(X1,X2,ti(X1,X3))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_22, plain, (ord_less(X1,X2,X3)|~ord_less(X1,ti(X1,X2),X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_91, plain, (X1=X2|number_number_of(X3,X1)!=number_number_of(X3,X2)|~ring_char_0(X3)|~number_ring(X3))).
% 0.19/0.47  cnf(i_0_10, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_169, plain, (number_number_of(X1,semiring_1_of_nat(int,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_58, plain, (ord_less(int,X1,X2)|~ord_less(int,number_number_of(int,X1),number_number_of(int,X2)))).
% 0.19/0.47  cnf(i_0_27, plain, (ord_less(nat,X1,ti(nat,X2))|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_25, plain, (ord_less(nat,ti(nat,X1),X2)|~ord_less(nat,X1,X2))).
% 0.19/0.47  cnf(i_0_19, plain, (semiring_1_of_nat(X1,ti(nat,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_86, 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.47  cnf(i_0_95, plain, (X1=X2|plus_plus(int,X1,plus_plus(int,one_one(int),X1))!=plus_plus(int,X2,plus_plus(int,one_one(int),X2)))).
% 0.19/0.47  cnf(i_0_110, plain, (ord_less(int,X1,pls)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),pls))).
% 0.19/0.47  cnf(i_0_8, plain, (ti(X1,zero_zero(X1))=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_20, plain, (ti(X1,semiring_1_of_nat(X1,X2))=semiring_1_of_nat(X1,X2)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_80, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_106, plain, (ord_less(int,X1,pls)|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),zero_zero(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_117, plain, (ord_less(int,pls,plus_plus(int,X1,X1))|~ord_less(int,pls,X1))).
% 0.19/0.47  cnf(i_0_115, plain, (ord_less(int,plus_plus(int,X1,X1),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_17, plain, (number_number_of(X1,ti(int,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_108, plain, (ord_less(int,pls,X1)|~number_ring(X2)|~ord_less(X2,zero_zero(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_18, plain, (ti(X1,number_number_of(X1,X2))=number_number_of(X1,X2)|~number(X1))).
% 0.19/0.47  cnf(i_0_23, plain, (ord_less(X1,X2,ti(X1,X3))|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_21, plain, (ord_less(X1,ti(X1,X2),X3)|~ord_less(X1,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_57, plain, (ord_less(int,number_number_of(int,X1),number_number_of(int,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_109, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),pls)|~ord_less(int,X1,pls))).
% 0.19/0.47  cnf(i_0_126, plain, (ord_less(int,X1,plus_plus(int,X2,one_one(int)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_135, plain, (plus_plus(X1,X2,X2)=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_158, plain, (plus_plus(X1,X2,number_number_of(X1,pls))=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_99, plain, (ord_less(X1,X2,zero_zero(X1))|~ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_136, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,X2,X2)!=zero_zero(X1)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_61, plain, (ord_less(int,X1,X2)|~number_ring(X3)|~ord_less(X3,number_number_of(X3,X1),number_number_of(X3,X2))|~linordered_idom(X3))).
% 0.19/0.47  cnf(i_0_127, plain, (X1=X2|ord_less(int,X1,X2)|~ord_less(int,X1,plus_plus(int,X2,one_one(int))))).
% 0.19/0.47  cnf(i_0_157, plain, (plus_plus(X1,number_number_of(X1,pls),X2)=ti(X1,X2)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_42, plain, (power_power(X1,one_one(X1),plus_plus(nat,one_one(nat),one_one(nat)))=one_one(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_43, plain, (power_power(X1,zero_zero(X1),plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|~semiring_1(X1))).
% 0.19/0.47  cnf(i_0_56, plain, (X1=X2|ord_less(int,X1,X2)|ord_less(int,X2,X1))).
% 0.19/0.47  cnf(i_0_6, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_160, plain, (power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|number_number_of(nat,X3)!=number_number_of(nat,pls)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_5, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_7, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_3, plain, (plus_plus(X1,X2,ti(X1,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_172, plain, (~ord_less(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_85, 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.47  cnf(i_0_51, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=zero_zero(X1)|number_number_of(nat,X2)=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_2, plain, (plus_plus(X1,ti(X1,X2),X3)=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_4, plain, (ti(X1,plus_plus(X1,X2,X3))=plus_plus(X1,X2,X3)|~linord219039673up_add(X1))).
% 0.19/0.47  cnf(i_0_112, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2)))).
% 0.19/0.47  cnf(i_0_161, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_33, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_45, plain, (ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_52, plain, (power_power(X1,zero_zero(X1),number_number_of(nat,X2))=one_one(X1)|number_number_of(nat,X2)!=number_number_of(nat,pls)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_75, plain, (ord_less(int,X1,X2)|~ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2))))).
% 0.19/0.47  cnf(i_0_32, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_83, plain, (ord_less(int,plus_plus(int,X1,X2),plus_plus(int,X3,X2))|~ord_less(int,X1,X3))).
% 0.19/0.47  cnf(i_0_34, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~semiring_0(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_107, plain, (ord_less(X1,zero_zero(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,pls,X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_105, plain, (ord_less(X1,number_number_of(X1,X2),zero_zero(X1))|~number_ring(X1)|~ord_less(int,X2,pls)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_98, plain, (ord_less(X1,plus_plus(X1,X2,X2),zero_zero(X1))|~ord_less(X1,X2,zero_zero(X1))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_79, plain, (ord_less(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_49, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_semiring(X1))).
% 0.19/0.47  cnf(i_0_48, plain, (plus_plus(X1,one_one(X1),one_one(X1))=number_number_of(X1,plus_plus(int,one_one(int),one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_44, plain, (power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~ring_11004092258visors(X1))).
% 0.19/0.47  cnf(i_0_159, plain, (power_power(X1,X2,number_number_of(nat,X3))=zero_zero(X1)|number_number_of(nat,X3)=number_number_of(nat,pls)|ti(X1,X2)!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_164, plain, (plus_plus(X1,number_number_of(X1,X2),number_number_of(X1,X3))=number_number_of(X1,plus_plus(int,X2,X3))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_60, plain, (ord_less(X1,number_number_of(X1,X2),number_number_of(X1,X3))|~number_ring(X1)|~ord_less(int,X2,X3)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_30, plain, (power_power(X1,X2,ti(nat,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_29, plain, (power_power(X1,ti(X1,X2),X3)=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_31, plain, (ti(X1,power_power(X1,X2,X3))=power_power(X1,X2,X3)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1))).
% 0.19/0.47  cnf(i_0_84, 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.47  cnf(i_0_171, plain, (ti(X1,X2)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_111, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,X2))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_130, plain, (ord_less(int,X1,one_one(int))|~number_ring(X2)|~ord_less(X2,number_number_of(X2,X1),one_one(X2))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_131, plain, (ord_less(X1,one_one(X1),number_number_of(X1,X2))|~number_ring(X1)|~ord_less(int,one_one(int),X2)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_129, plain, (ord_less(X1,number_number_of(X1,X2),one_one(X1))|~number_ring(X1)|~ord_less(int,X2,one_one(int))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_132, plain, (ord_less(int,one_one(int),X1)|~number_ring(X2)|~ord_less(X2,one_one(X2),number_number_of(X2,X1))|~linordered_idom(X2))).
% 0.19/0.47  cnf(i_0_162, plain, (plus_plus(X1,number_number_of(X1,X2),plus_plus(X1,number_number_of(X1,X3),X4))=plus_plus(X1,number_number_of(X1,plus_plus(int,X2,X3)),X4)|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_46, plain, (plus_plus(X1,one_one(X1),number_number_of(X1,X2))=number_number_of(X1,plus_plus(int,one_one(int),X2))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_47, plain, (plus_plus(X1,number_number_of(X1,X2),one_one(X1))=number_number_of(X1,plus_plus(int,X2,one_one(int)))|~number_ring(X1))).
% 0.19/0.47  cnf(i_0_74, plain, (ord_less(int,plus_plus(int,X1,plus_plus(int,one_one(int),X1)),plus_plus(int,X2,plus_plus(int,one_one(int),X2)))|~ord_less(int,X1,X2))).
% 0.19/0.47  cnf(i_0_40, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_41, plain, (ti(X1,X2)=zero_zero(X1)|plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_175, plain, (ti(X1,X2)!=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|~ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_170, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_39, plain, (plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))))=zero_zero(X1)|ti(X1,X3)!=zero_zero(X1)|ti(X1,X2)!=zero_zero(X1)|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_173, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_174, plain, (ti(X1,X2)=zero_zero(X1)|ord_less(X1,zero_zero(X1),plus_plus(X1,power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))),power_power(X1,X3,plus_plus(nat,one_one(nat),one_one(nat)))))|~linordered_idom(X1))).
% 0.19/0.47  cnf(i_0_482, plain, (X243=X243)).
% 0.19/0.47  # End listing active clauses.  There is an equivalent clause to each of these in the clausification!
% 0.19/0.47  # Begin printing tableau
% 0.19/0.47  # Found 7 steps
% 0.19/0.47  cnf(i_0_146, plain, (zero_zero(int)=pls), inference(start_rule)).
% 0.19/0.47  cnf(i_0_508, plain, (zero_zero(int)=pls), inference(extension_rule, [i_0_503])).
% 0.19/0.47  cnf(i_0_1184, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1186, plain, (zero_zero(int)!=pls), inference(closure_rule, [i_0_146])).
% 0.19/0.47  cnf(i_0_1183, plain, (power_power(zero_zero(int),zero_zero(int),zero_zero(int))=power_power(pls,pls,pls)), inference(extension_rule, [i_0_485])).
% 0.19/0.47  cnf(i_0_1483, plain, (power_power(pls,pls,pls)!=plus_plus(int,power_power(pls,pls,pls),pls)), inference(closure_rule, [i_0_148])).
% 0.19/0.47  cnf(i_0_1481, plain, (power_power(zero_zero(int),zero_zero(int),zero_zero(int))=plus_plus(int,power_power(pls,pls,pls),pls)), inference(etableau_closure_rule, [i_0_1481, ...])).
% 0.19/0.47  # End printing tableau
% 0.19/0.47  # SZS output end
% 0.19/0.47  # Branches closed with saturation will be marked with an "s"
% 0.19/0.48  # Child (17775) has found a proof.
% 0.19/0.48  
% 0.19/0.48  # Proof search is over...
% 0.19/0.48  # Freeing feature tree
%------------------------------------------------------------------------------