TSTP Solution File: NUM926+6 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM926+6 : TPTP v5.3.0. Released v5.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sun Dec 4 00:34:50 EST 2011
% Result : Theorem 28.13s
% Output : Solution 28.13s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP13921/NUM926+6.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13921/NUM926+6.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13921/NUM926+6.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.4/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 14151
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.90 CPU 2.04 WC
% # Garbage collection reclaimed 161 unused term cells.
% # Garbage collection reclaimed 2718 unused term cells.
% # Garbage collection reclaimed 2485 unused term cells.
% # Garbage collection reclaimed 2027 unused term cells.
% # Garbage collection reclaimed 1841 unused term cells.
% # Garbage collection reclaimed 1684 unused term cells.
% # Garbage collection reclaimed 1384 unused term cells.
% # Garbage collection reclaimed 1161 unused term cells.
% # Garbage collection reclaimed 1071 unused term cells.
% # Garbage collection reclaimed 943 unused term cells.
% # Garbage collection reclaimed 242 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFSLM32LD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <precrank20>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFSLM32LD
% # Auto-Mode selected heuristic G_E___107_C41_F1_PI_AE_Q4_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Garbage collection reclaimed 842 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 261 unused term cells.
% # Presaturation interreduction done
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 653
% # Removed by relevancy pruning : 0
% # Initial clauses : 854
% # Removed in clause preprocessing : 8
% # Initial clauses in saturation : 846
% # Processed clauses : 1723
% # ...of these trivial : 21
% # ...subsumed : 103
% # ...remaining for further processing: 1599
% # Other redundant clauses eliminated : 5
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 112
% # Generated clauses : 28063
% # ...of the previous two non-trivial : 25901
% # Contextual simplify-reflections : 11
% # Paramodulations : 28042
% # Factorizations : 7
% # Equation resolutions : 14
% # Current number of processed clauses: 737
% # Positive orientable unit clauses: 190
% # Positive unorientable unit clauses: 15
% # Negative unit clauses : 17
% # Non-unit-clauses : 515
% # Current number of unprocessed clauses: 24834
% # ...number of literals in the above : 67207
% # Clause-clause subsumption calls (NU) : 5967
% # Rec. Clause-clause subsumption calls : 4311
% # Unit Clause-clause subsumption calls : 235
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2048
% # Indexed BW rewrite successes : 141
% # Backwards rewriting index : 413 leaves, 2.53+/-4.344 terms/leaf
% # Paramod-from index : 268 leaves, 1.68+/-1.816 terms/leaf
% # Paramod-into index : 370 leaves, 2.28+/-3.825 terms/leaf
% # SZS output start CNFRefutation.
% fof(8, axiom,plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,bit0(bit1(pls))),file('/tmp/SRASS.s.p', fact_37_nat__1__add__1)).
% fof(14, axiom,![X5]:![X11]:times_times(int,X5,X11)=times_times(int,X11,X5),file('/tmp/SRASS.s.p', fact_85_zmult__commute)).
% fof(15, axiom,![X12]:number_number_of(int,X12)=ti(int,X12),file('/tmp/SRASS.s.p', fact_86_number__of__is__id)).
% fof(16, axiom,![X8]:![X9]:![X10]:plus_plus(int,plus_plus(int,X8,X9),X10)=plus_plus(int,X8,plus_plus(int,X9,X10)),file('/tmp/SRASS.s.p', fact_87_zadd__assoc)).
% fof(17, axiom,![X3]:![X4]:![X5]:plus_plus(int,X3,plus_plus(int,X4,X5))=plus_plus(int,X4,plus_plus(int,X3,X5)),file('/tmp/SRASS.s.p', fact_88_zadd__left__commute)).
% fof(18, axiom,![X5]:![X11]:plus_plus(int,X5,X11)=plus_plus(int,X11,X5),file('/tmp/SRASS.s.p', fact_89_zadd__commute)).
% fof(28, axiom,![X12]:plus_plus(int,X12,pls)=ti(int,X12),file('/tmp/SRASS.s.p', fact_123_add__Pls__right)).
% fof(29, axiom,![X12]:plus_plus(int,pls,X12)=ti(int,X12),file('/tmp/SRASS.s.p', fact_124_add__Pls)).
% fof(31, axiom,![X12]:bit0(X12)=plus_plus(int,X12,X12),file('/tmp/SRASS.s.p', fact_126_Bit0__def)).
% fof(40, axiom,![X12]:bit1(X12)=plus_plus(int,plus_plus(int,one_one(int),X12),X12),file('/tmp/SRASS.s.p', fact_151_Bit1__def)).
% fof(41, axiom,one_one(int)=number_number_of(int,bit1(pls)),file('/tmp/SRASS.s.p', fact_158_one__is__num__one)).
% fof(52, axiom,(t=one_one(int)=>?[X20]:?[X21]:plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),file('/tmp/SRASS.s.p', fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)).
% fof(78, axiom,(ord_less(int,one_one(int),t)=>?[X20]:?[X21]:plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),file('/tmp/SRASS.s.p', fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)).
% fof(258, axiom,ti(int,t)=t,file('/tmp/SRASS.s.p', tsy_v_t_____res)).
% fof(369, axiom,![X28]:![X27]:(ord_less(int,X28,X27)<=>(ord_less_eq(int,X28,X27)&~(ti(int,X28)=ti(int,X27)))),file('/tmp/SRASS.s.p', fact_22_zless__le)).
% fof(494, axiom,ord_less_eq(int,one_one(int),t),file('/tmp/SRASS.s.p', fact_0_tpos)).
% fof(653, conjecture,?[X20]:?[X21]:plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),file('/tmp/SRASS.s.p', conj_0)).
% fof(654, negated_conjecture,~(?[X20]:?[X21]:plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(assume_negation,[status(cth)],[653])).
% cnf(698,plain,(plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,bit0(bit1(pls)))),inference(split_conjunct,[status(thm)],[8])).
% fof(711, plain,![X12]:![X13]:times_times(int,X12,X13)=times_times(int,X13,X12),inference(variable_rename,[status(thm)],[14])).
% cnf(712,plain,(times_times(int,X1,X2)=times_times(int,X2,X1)),inference(split_conjunct,[status(thm)],[711])).
% fof(713, plain,![X13]:number_number_of(int,X13)=ti(int,X13),inference(variable_rename,[status(thm)],[15])).
% cnf(714,plain,(number_number_of(int,X1)=ti(int,X1)),inference(split_conjunct,[status(thm)],[713])).
% fof(715, plain,![X11]:![X12]:![X13]:plus_plus(int,plus_plus(int,X11,X12),X13)=plus_plus(int,X11,plus_plus(int,X12,X13)),inference(variable_rename,[status(thm)],[16])).
% cnf(716,plain,(plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3))),inference(split_conjunct,[status(thm)],[715])).
% fof(717, plain,![X6]:![X7]:![X8]:plus_plus(int,X6,plus_plus(int,X7,X8))=plus_plus(int,X7,plus_plus(int,X6,X8)),inference(variable_rename,[status(thm)],[17])).
% cnf(718,plain,(plus_plus(int,X1,plus_plus(int,X2,X3))=plus_plus(int,X2,plus_plus(int,X1,X3))),inference(split_conjunct,[status(thm)],[717])).
% fof(719, plain,![X12]:![X13]:plus_plus(int,X12,X13)=plus_plus(int,X13,X12),inference(variable_rename,[status(thm)],[18])).
% cnf(720,plain,(plus_plus(int,X1,X2)=plus_plus(int,X2,X1)),inference(split_conjunct,[status(thm)],[719])).
% fof(742, plain,![X13]:plus_plus(int,X13,pls)=ti(int,X13),inference(variable_rename,[status(thm)],[28])).
% cnf(743,plain,(plus_plus(int,X1,pls)=ti(int,X1)),inference(split_conjunct,[status(thm)],[742])).
% fof(744, plain,![X13]:plus_plus(int,pls,X13)=ti(int,X13),inference(variable_rename,[status(thm)],[29])).
% cnf(745,plain,(plus_plus(int,pls,X1)=ti(int,X1)),inference(split_conjunct,[status(thm)],[744])).
% fof(748, plain,![X13]:bit0(X13)=plus_plus(int,X13,X13),inference(variable_rename,[status(thm)],[31])).
% cnf(749,plain,(bit0(X1)=plus_plus(int,X1,X1)),inference(split_conjunct,[status(thm)],[748])).
% fof(766, plain,![X13]:bit1(X13)=plus_plus(int,plus_plus(int,one_one(int),X13),X13),inference(variable_rename,[status(thm)],[40])).
% cnf(767,plain,(bit1(X1)=plus_plus(int,plus_plus(int,one_one(int),X1),X1)),inference(split_conjunct,[status(thm)],[766])).
% cnf(768,plain,(one_one(int)=number_number_of(int,bit1(pls))),inference(split_conjunct,[status(thm)],[41])).
% fof(791, plain,(~(t=one_one(int))|?[X20]:?[X21]:plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(fof_nnf,[status(thm)],[52])).
% fof(792, plain,(~(t=one_one(int))|?[X22]:?[X23]:plus_plus(int,power_power(int,X22,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X23,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(variable_rename,[status(thm)],[791])).
% fof(793, plain,(~(t=one_one(int))|plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(skolemize,[status(esa)],[792])).
% cnf(794,plain,(plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))|t!=one_one(int)),inference(split_conjunct,[status(thm)],[793])).
% fof(877, plain,(~(ord_less(int,one_one(int),t))|?[X20]:?[X21]:plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(fof_nnf,[status(thm)],[78])).
% fof(878, plain,(~(ord_less(int,one_one(int),t))|?[X22]:?[X23]:plus_plus(int,power_power(int,X22,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X23,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(variable_rename,[status(thm)],[877])).
% fof(879, plain,(~(ord_less(int,one_one(int),t))|plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(skolemize,[status(esa)],[878])).
% cnf(880,plain,(plus_plus(int,power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))|~ord_less(int,one_one(int),t)),inference(split_conjunct,[status(thm)],[879])).
% cnf(1480,plain,(ti(int,t)=t),inference(split_conjunct,[status(thm)],[258])).
% fof(1900, plain,![X28]:![X27]:((~(ord_less(int,X28,X27))|(ord_less_eq(int,X28,X27)&~(ti(int,X28)=ti(int,X27))))&((~(ord_less_eq(int,X28,X27))|ti(int,X28)=ti(int,X27))|ord_less(int,X28,X27))),inference(fof_nnf,[status(thm)],[369])).
% fof(1901, plain,![X29]:![X30]:((~(ord_less(int,X29,X30))|(ord_less_eq(int,X29,X30)&~(ti(int,X29)=ti(int,X30))))&((~(ord_less_eq(int,X29,X30))|ti(int,X29)=ti(int,X30))|ord_less(int,X29,X30))),inference(variable_rename,[status(thm)],[1900])).
% fof(1902, plain,![X29]:![X30]:(((ord_less_eq(int,X29,X30)|~(ord_less(int,X29,X30)))&(~(ti(int,X29)=ti(int,X30))|~(ord_less(int,X29,X30))))&((~(ord_less_eq(int,X29,X30))|ti(int,X29)=ti(int,X30))|ord_less(int,X29,X30))),inference(distribute,[status(thm)],[1901])).
% cnf(1903,plain,(ord_less(int,X1,X2)|ti(int,X1)=ti(int,X2)|~ord_less_eq(int,X1,X2)),inference(split_conjunct,[status(thm)],[1902])).
% cnf(2299,plain,(ord_less_eq(int,one_one(int),t)),inference(split_conjunct,[status(thm)],[494])).
% fof(2741, negated_conjecture,![X20]:![X21]:~(plus_plus(int,power_power(int,X20,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X21,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(fof_nnf,[status(thm)],[654])).
% fof(2742, negated_conjecture,![X22]:![X23]:~(plus_plus(int,power_power(int,X22,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X23,number_number_of(nat,bit0(bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(variable_rename,[status(thm)],[2741])).
% cnf(2743,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,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))),inference(split_conjunct,[status(thm)],[2742])).
% cnf(2763,plain,(plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),inference(rw,[status(thm)],[698,749,theory(equality)]),['unfolding']).
% cnf(2869,plain,(plus_plus(int,power_power(int,esk1_0,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int))|one_one(int)!=t),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[794,749,theory(equality)]),749,theory(equality)]),749,theory(equality)]),749,theory(equality)]),['unfolding']).
% cnf(2870,plain,(plus_plus(int,power_power(int,esk4_0,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),power_power(int,esk5_0,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))))=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int))|~ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[880,749,theory(equality)]),749,theory(equality)]),749,theory(equality)]),749,theory(equality)]),['unfolding']).
% cnf(2901,negated_conjecture,(plus_plus(int,power_power(int,X1,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))),power_power(int,X2,number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls)))))!=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,bit1(pls),bit1(pls)),plus_plus(int,bit1(pls),bit1(pls)))),m),one_one(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2743,749,theory(equality)]),749,theory(equality)]),749,theory(equality)]),749,theory(equality)]),['unfolding']).
% cnf(2911,plain,(number_number_of(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls))=one_one(int)),inference(rw,[status(thm)],[768,767,theory(equality)]),['unfolding']).
% cnf(2928,plain,(plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2763,767,theory(equality)]),767,theory(equality)]),['unfolding']).
% cnf(3041,plain,(plus_plus(int,power_power(int,esk1_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,esk2_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))))=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))|one_one(int)!=t),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2869,767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),['unfolding']).
% cnf(3042,plain,(plus_plus(int,power_power(int,esk4_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,esk5_0,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))))=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))|~ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2870,767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),['unfolding']).
% cnf(3081,negated_conjecture,(plus_plus(int,power_power(int,X1,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),power_power(int,X2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))))!=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2901,767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),767,theory(equality)]),['unfolding']).
% cnf(3094,plain,(number_number_of(int,t)=t),inference(rw,[status(thm)],[1480,714,theory(equality)])).
% cnf(3100,plain,(number_number_of(int,X1)=plus_plus(int,X1,pls)),inference(rw,[status(thm)],[743,714,theory(equality)])).
% cnf(3101,plain,(ti(int,X1)=plus_plus(int,X1,pls)),inference(rw,[status(thm)],[714,3100,theory(equality)])).
% cnf(3105,plain,(plus_plus(int,X1,pls)=plus_plus(int,pls,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[745,714,theory(equality)]),3100,theory(equality)])).
% cnf(3110,plain,(plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,one_one(int))))=one_one(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2911,3105,theory(equality)]),3105,theory(equality)]),3100,theory(equality)]),3105,theory(equality)])).
% cnf(3200,plain,(number_number_of(nat,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),one_one(int)))))))=plus_plus(nat,one_one(nat),one_one(nat))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2928,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)])).
% cnf(3262,plain,(plus_plus(int,X1,pls)=ti(int,X2)|ord_less(int,X1,X2)|~ord_less_eq(int,X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1903,714,theory(equality)]),3100,theory(equality)])).
% cnf(3514,negated_conjecture,(plus_plus(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,X2,plus_plus(nat,one_one(nat),one_one(nat))))!=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3081,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3200,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3200,theory(equality)])).
% cnf(3515,negated_conjecture,(plus_plus(int,power_power(int,X1,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,X2,plus_plus(nat,one_one(nat),one_one(nat))))!=plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))))))))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3514,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3100,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),3105,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),712,theory(equality)]),720,theory(equality)])).
% cnf(3518,plain,(plus_plus(int,power_power(int,esk1_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk2_0,plus_plus(nat,one_one(nat),one_one(nat))))=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))|one_one(int)!=t),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3041,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3200,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3200,theory(equality)])).
% cnf(3519,plain,(plus_plus(int,power_power(int,esk1_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk2_0,plus_plus(nat,one_one(nat),one_one(nat))))=plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))))))))))|one_one(int)!=t),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3518,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3100,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),3105,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),712,theory(equality)]),720,theory(equality)])).
% cnf(3520,plain,(one_one(int)!=t),inference(sr,[status(thm)],[3519,3515,theory(equality)])).
% cnf(3521,plain,(plus_plus(int,power_power(int,esk4_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk5_0,plus_plus(nat,one_one(nat),one_one(nat))))=plus_plus(int,times_times(int,number_number_of(int,plus_plus(int,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)),plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))),m),one_one(int))|~ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3042,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3200,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3200,theory(equality)])).
% cnf(3522,plain,(plus_plus(int,power_power(int,esk4_0,plus_plus(nat,one_one(nat),one_one(nat))),power_power(int,esk5_0,plus_plus(nat,one_one(nat),one_one(nat))))=plus_plus(int,one_one(int),times_times(int,m,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,pls,plus_plus(int,one_one(int),plus_plus(int,one_one(int),plus_plus(int,one_one(int),one_one(int)))))))))))))))|~ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3521,3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),3105,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),3100,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),716,theory(equality)]),3105,theory(equality)]),718,theory(equality)]),718,theory(equality)]),718,theory(equality)]),712,theory(equality)]),720,theory(equality)])).
% cnf(3523,plain,(~ord_less(int,one_one(int),t)),inference(sr,[status(thm)],[3522,3515,theory(equality)])).
% cnf(3552,plain,(plus_plus(int,pls,t)=t),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3094,3100,theory(equality)]),720,theory(equality)])).
% cnf(3601,plain,(plus_plus(int,X1,pls)=plus_plus(int,X2,pls)|ord_less(int,X1,X2)|~ord_less_eq(int,X1,X2)),inference(rw,[status(thm)],[3262,3101,theory(equality)])).
% cnf(13871,plain,(plus_plus(int,one_one(int),pls)=plus_plus(int,t,pls)|ord_less(int,one_one(int),t)),inference(spm,[status(thm)],[3601,2299,theory(equality)])).
% cnf(13909,plain,(plus_plus(int,pls,one_one(int))=plus_plus(int,t,pls)|ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[13871,3105,theory(equality)])).
% cnf(13910,plain,(plus_plus(int,pls,one_one(int))=t|ord_less(int,one_one(int),t)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[13909,720,theory(equality)]),3552,theory(equality)])).
% cnf(13911,plain,(plus_plus(int,pls,one_one(int))=t),inference(sr,[status(thm)],[13910,3523,theory(equality)])).
% cnf(79527,plain,(t=one_one(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3110,13911,theory(equality)]),3552,theory(equality)]),3552,theory(equality)])).
% cnf(79528,plain,($false),inference(sr,[status(thm)],[79527,3520,theory(equality)])).
% cnf(79529,plain,($false),79528,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 2.75 CPU 2.88 WC
% FINAL PrfWatch: 2.75 CPU 2.88 WC
% SZS output end Solution for /tmp/SystemOnTPTP13921/NUM926+6.tptp
%
%------------------------------------------------------------------------------