%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : NUM925+5 : TPTP v5.3.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art06.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:29:43 EST 2011

% Result   : Theorem 8.01s
% Output   : Solution 8.01s
% 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/SystemOnTPTP30245/NUM925+5.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP30245/NUM925+5.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30245/NUM925+5.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 30359
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.03 WC
% PrfWatch: 1.70 CPU 2.04 WC
% PrfWatch: 3.55 CPU 4.06 WC
% PrfWatch: 5.54 CPU 6.08 WC
% # Garbage collection reclaimed 22 unused term cells.
% # Garbage collection reclaimed 548 unused term cells.
% # Garbage collection reclaimed 431 unused term cells.
% # Garbage collection reclaimed 360 unused term cells.
% # Garbage collection reclaimed 342 unused term cells.
% # Garbage collection reclaimed 290 unused term cells.
% # Garbage collection reclaimed 217 unused term cells.
% # Garbage collection reclaimed 205 unused term cells.
% # Garbage collection reclaimed 247 unused term cells.
% # Garbage collection reclaimed 207 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNFFLM31MD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNFFLM31MD
% # Auto-Mode selected heuristic G_E___103_C18_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms                      : 153
% # Removed by relevancy pruning       : 0
% # Initial clauses                    : 198
% # Removed in clause preprocessing    : 8
% # Initial clauses in saturation      : 190
% # Processed clauses                  : 4908
% # ...of these trivial                : 74
% # ...subsumed                        : 3930
% # ...remaining for further processing: 904
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 22
% # Backward-rewritten                 : 43
% # Generated clauses                  : 74764
% # ...of the previous two non-trivial : 72057
% # Contextual simplify-reflections    : 736
% # Paramodulations                    : 74711
% # Factorizations                     : 2
% # Equation resolutions               : 33
% # Current number of processed clauses: 832
% #    Positive orientable unit clauses: 76
% #    Positive unorientable unit clauses: 27
% #    Negative unit clauses           : 53
% #    Non-unit-clauses                : 676
% # Current number of unprocessed clauses: 63415
% # ...number of literals in the above : 151794
% # Clause-clause subsumption calls (NU) : 50473
% # Rec. Clause-clause subsumption calls : 35471
% # Unit Clause-clause subsumption calls : 3306
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 5549
% # Indexed BW rewrite successes       : 172
% # Backwards rewriting index :   192 leaves,   4.28+/-12.244 terms/leaf
% # Paramod-from index      :   127 leaves,   2.80+/-5.793 terms/leaf
% # Paramod-into index      :   178 leaves,   3.84+/-11.783 terms/leaf
% # SZS output start CNFRefutation.
% fof(3, axiom,zero_zero(int)=number_number_of(int,pls),file('/tmp/SRASS.s.p', fact_19_zero__is__num__zero)).
% fof(13, axiom,plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,bit0(bit1(pls))),file('/tmp/SRASS.s.p', fact_29_nat__1__add__1)).
% fof(27, axiom,![X8]:(bit0(X8)=pls<=>X8=pls),file('/tmp/SRASS.s.p', fact_70_rel__simps_I44_J)).
% fof(30, axiom,pls=zero_zero(int),file('/tmp/SRASS.s.p', fact_73_Pls__def)).
% fof(32, axiom,![X15]:plus_plus(int,X15,pls)=X15,file('/tmp/SRASS.s.p', fact_75_add__Pls__right)).
% fof(35, axiom,![X15]:bit0(X15)=plus_plus(int,X15,X15),file('/tmp/SRASS.s.p', fact_78_Bit0__def)).
% fof(40, axiom,![X15]:bit1(X15)=plus_plus(int,plus_plus(int,one_one(int),X15),X15),file('/tmp/SRASS.s.p', fact_92_Bit1__def)).
% fof(51, axiom,ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),file('/tmp/SRASS.s.p', fact_0_n1pos)).
% fof(65, axiom,![X20]:(number_ring(X20)=>![X26]:plus_plus(X20,X26,number_number_of(X20,pls))=ti(X20,X26)),file('/tmp/SRASS.s.p', fact_85_add__numeral__0__right)).
% fof(76, axiom,![X8]:(ord_less(int,pls,bit0(X8))<=>ord_less(int,pls,X8)),file('/tmp/SRASS.s.p', fact_55_rel__simps_I4_J)).
% fof(109, axiom,~(ord_less(int,pls,pls)),file('/tmp/SRASS.s.p', fact_32_rel__simps_I2_J)).
% fof(114, axiom,![X20]:((((power(X20)&mult_zero(X20))&no_zero_divisors(X20))&zero_neq_one(X20))=>![X23]:![X27]:(power_power(X20,X23,number_number_of(nat,X27))=zero_zero(X20)<=>(ti(X20,X23)=zero_zero(X20)&~(number_number_of(nat,X27)=zero_zero(nat))))),file('/tmp/SRASS.s.p', fact_86_power__eq__0__iff__number__of)).
% fof(129, axiom,number_ring(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Int_Onumber__ring)).
% fof(144, axiom,no_zero_divisors(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Rings_Ono__zero__divisors)).
% fof(146, axiom,zero_neq_one(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Rings_Ozero__neq__one)).
% fof(149, axiom,mult_zero(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Rings_Omult__zero)).
% fof(150, axiom,power(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Power_Opower)).
% fof(153, conjecture,~(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int)),file('/tmp/SRASS.s.p', conj_0)).
% fof(154, negated_conjecture,~(~(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int))),inference(assume_negation,[status(cth)],[153])).
% fof(159, plain,~(ord_less(int,pls,pls)),inference(fof_simplification,[status(thm)],[109,theory(equality)])).
% fof(160, negated_conjecture,power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int),inference(fof_simplification,[status(thm)],[154,theory(equality)])).
% cnf(165,plain,(zero_zero(int)=number_number_of(int,pls)),inference(split_conjunct,[status(thm)],[3])).
% cnf(182,plain,(plus_plus(nat,one_one(nat),one_one(nat))=number_number_of(nat,bit0(bit1(pls)))),inference(split_conjunct,[status(thm)],[13])).
% fof(212, plain,![X8]:((~(bit0(X8)=pls)|X8=pls)&(~(X8=pls)|bit0(X8)=pls)),inference(fof_nnf,[status(thm)],[27])).
% fof(213, plain,![X9]:((~(bit0(X9)=pls)|X9=pls)&(~(X9=pls)|bit0(X9)=pls)),inference(variable_rename,[status(thm)],[212])).
% cnf(214,plain,(bit0(X1)=pls|X1!=pls),inference(split_conjunct,[status(thm)],[213])).
% cnf(221,plain,(pls=zero_zero(int)),inference(split_conjunct,[status(thm)],[30])).
% fof(223, plain,![X16]:plus_plus(int,X16,pls)=X16,inference(variable_rename,[status(thm)],[32])).
% cnf(224,plain,(plus_plus(int,X1,pls)=X1),inference(split_conjunct,[status(thm)],[223])).
% fof(229, plain,![X16]:bit0(X16)=plus_plus(int,X16,X16),inference(variable_rename,[status(thm)],[35])).
% cnf(230,plain,(bit0(X1)=plus_plus(int,X1,X1)),inference(split_conjunct,[status(thm)],[229])).
% fof(239, plain,![X16]:bit1(X16)=plus_plus(int,plus_plus(int,one_one(int),X16),X16),inference(variable_rename,[status(thm)],[40])).
% cnf(240,plain,(bit1(X1)=plus_plus(int,plus_plus(int,one_one(int),X1),X1)),inference(split_conjunct,[status(thm)],[239])).
% cnf(268,plain,(ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))),inference(split_conjunct,[status(thm)],[51])).
% fof(322, plain,![X20]:(~(number_ring(X20))|![X26]:plus_plus(X20,X26,number_number_of(X20,pls))=ti(X20,X26)),inference(fof_nnf,[status(thm)],[65])).
% fof(323, plain,![X27]:(~(number_ring(X27))|![X28]:plus_plus(X27,X28,number_number_of(X27,pls))=ti(X27,X28)),inference(variable_rename,[status(thm)],[322])).
% fof(324, plain,![X27]:![X28]:(~(number_ring(X27))|plus_plus(X27,X28,number_number_of(X27,pls))=ti(X27,X28)),inference(shift_quantors,[status(thm)],[323])).
% cnf(325,plain,(plus_plus(X1,X2,number_number_of(X1,pls))=ti(X1,X2)|~number_ring(X1)),inference(split_conjunct,[status(thm)],[324])).
% fof(360, plain,![X8]:((~(ord_less(int,pls,bit0(X8)))|ord_less(int,pls,X8))&(~(ord_less(int,pls,X8))|ord_less(int,pls,bit0(X8)))),inference(fof_nnf,[status(thm)],[76])).
% fof(361, plain,![X9]:((~(ord_less(int,pls,bit0(X9)))|ord_less(int,pls,X9))&(~(ord_less(int,pls,X9))|ord_less(int,pls,bit0(X9)))),inference(variable_rename,[status(thm)],[360])).
% cnf(362,plain,(ord_less(int,pls,bit0(X1))|~ord_less(int,pls,X1)),inference(split_conjunct,[status(thm)],[361])).
% cnf(477,plain,(~ord_less(int,pls,pls)),inference(split_conjunct,[status(thm)],[159])).
% fof(495, plain,![X20]:((((~(power(X20))|~(mult_zero(X20)))|~(no_zero_divisors(X20)))|~(zero_neq_one(X20)))|![X23]:![X27]:((~(power_power(X20,X23,number_number_of(nat,X27))=zero_zero(X20))|(ti(X20,X23)=zero_zero(X20)&~(number_number_of(nat,X27)=zero_zero(nat))))&((~(ti(X20,X23)=zero_zero(X20))|number_number_of(nat,X27)=zero_zero(nat))|power_power(X20,X23,number_number_of(nat,X27))=zero_zero(X20)))),inference(fof_nnf,[status(thm)],[114])).
% fof(496, plain,![X28]:((((~(power(X28))|~(mult_zero(X28)))|~(no_zero_divisors(X28)))|~(zero_neq_one(X28)))|![X29]:![X30]:((~(power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28))|(ti(X28,X29)=zero_zero(X28)&~(number_number_of(nat,X30)=zero_zero(nat))))&((~(ti(X28,X29)=zero_zero(X28))|number_number_of(nat,X30)=zero_zero(nat))|power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28)))),inference(variable_rename,[status(thm)],[495])).
% fof(497, plain,![X28]:![X29]:![X30]:((((~(power(X28))|~(mult_zero(X28)))|~(no_zero_divisors(X28)))|~(zero_neq_one(X28)))|((~(power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28))|(ti(X28,X29)=zero_zero(X28)&~(number_number_of(nat,X30)=zero_zero(nat))))&((~(ti(X28,X29)=zero_zero(X28))|number_number_of(nat,X30)=zero_zero(nat))|power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28)))),inference(shift_quantors,[status(thm)],[496])).
% fof(498, plain,![X28]:![X29]:![X30]:((((ti(X28,X29)=zero_zero(X28)|~(power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28)))|(((~(power(X28))|~(mult_zero(X28)))|~(no_zero_divisors(X28)))|~(zero_neq_one(X28))))&((~(number_number_of(nat,X30)=zero_zero(nat))|~(power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28)))|(((~(power(X28))|~(mult_zero(X28)))|~(no_zero_divisors(X28)))|~(zero_neq_one(X28)))))&(((~(ti(X28,X29)=zero_zero(X28))|number_number_of(nat,X30)=zero_zero(nat))|power_power(X28,X29,number_number_of(nat,X30))=zero_zero(X28))|(((~(power(X28))|~(mult_zero(X28)))|~(no_zero_divisors(X28)))|~(zero_neq_one(X28))))),inference(distribute,[status(thm)],[497])).
% cnf(501,plain,(ti(X1,X2)=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1)|power_power(X1,X2,number_number_of(nat,X3))!=zero_zero(X1)),inference(split_conjunct,[status(thm)],[498])).
% cnf(554,plain,(number_ring(int)),inference(split_conjunct,[status(thm)],[129])).
% cnf(576,plain,(no_zero_divisors(int)),inference(split_conjunct,[status(thm)],[144])).
% cnf(578,plain,(zero_neq_one(int)),inference(split_conjunct,[status(thm)],[146])).
% cnf(581,plain,(mult_zero(int)),inference(split_conjunct,[status(thm)],[149])).
% cnf(582,plain,(power(int)),inference(split_conjunct,[status(thm)],[150])).
% cnf(590,negated_conjecture,(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int)),inference(split_conjunct,[status(thm)],[160])).
% cnf(597,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)],[182,230,theory(equality)]),['unfolding']).
% cnf(598,negated_conjecture,(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,bit1(pls),bit1(pls))))=zero_zero(int)),inference(rw,[status(thm)],[590,230,theory(equality)]),['unfolding']).
% cnf(603,plain,(plus_plus(int,X1,X1)=pls|pls!=X1),inference(rw,[status(thm)],[214,230,theory(equality)]),['unfolding']).
% cnf(611,plain,(ord_less(int,pls,plus_plus(int,X1,X1))|~ord_less(int,pls,X1)),inference(rw,[status(thm)],[362,230,theory(equality)]),['unfolding']).
% cnf(643,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)],[597,240,theory(equality)]),240,theory(equality)]),['unfolding']).
% cnf(644,negated_conjecture,(power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),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))))=zero_zero(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[598,240,theory(equality)]),240,theory(equality)]),['unfolding']).
% cnf(687,plain,(pls=number_number_of(int,pls)),inference(rw,[status(thm)],[165,221,theory(equality)])).
% cnf(960,plain,(plus_plus(int,X1,number_number_of(int,pls))=ti(int,X1)),inference(spm,[status(thm)],[325,554,theory(equality)])).
% cnf(961,plain,(X1=ti(int,X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[960,687,theory(equality)]),224,theory(equality)])).
% cnf(1300,plain,(ord_less(int,pls,pls)|~ord_less(int,pls,X1)|pls!=X1),inference(spm,[status(thm)],[611,603,theory(equality)])).
% cnf(1308,plain,(~ord_less(int,pls,X1)|pls!=X1),inference(sr,[status(thm)],[1300,477,theory(equality)])).
% cnf(2062,plain,(ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))),inference(rw,[status(thm)],[268,221,theory(equality)])).
% cnf(2970,plain,(number_number_of(nat,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)],[643,224,theory(equality)]),224,theory(equality)]),224,theory(equality)]),224,theory(equality)])).
% cnf(2995,plain,(ti(X1,X2)=zero_zero(X1)|power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat)))!=zero_zero(X1)|~zero_neq_one(X1)|~no_zero_divisors(X1)|~mult_zero(X1)|~power(X1)),inference(spm,[status(thm)],[501,2970,theory(equality)])).
% cnf(3384,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)))=zero_zero(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[644,224,theory(equality)]),224,theory(equality)]),224,theory(equality)]),224,theory(equality)]),2970,theory(equality)])).
% cnf(3385,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),inference(rw,[status(thm)],[3384,221,theory(equality)])).
% cnf(4203,plain,(pls!=plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),inference(spm,[status(thm)],[1308,2062,theory(equality)])).
% cnf(183543,negated_conjecture,(ti(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)))=zero_zero(int)|pls!=zero_zero(int)|~zero_neq_one(int)|~no_zero_divisors(int)|~mult_zero(int)|~power(int)),inference(spm,[status(thm)],[2995,3385,theory(equality)])).
% cnf(183560,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=zero_zero(int)|pls!=zero_zero(int)|~zero_neq_one(int)|~no_zero_divisors(int)|~mult_zero(int)|~power(int)),inference(rw,[status(thm)],[183543,961,theory(equality)])).
% cnf(183561,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls|pls!=zero_zero(int)|~zero_neq_one(int)|~no_zero_divisors(int)|~mult_zero(int)|~power(int)),inference(rw,[status(thm)],[183560,221,theory(equality)])).
% cnf(183562,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls|$false|~zero_neq_one(int)|~no_zero_divisors(int)|~mult_zero(int)|~power(int)),inference(rw,[status(thm)],[183561,221,theory(equality)])).
% cnf(183563,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls|$false|$false|~no_zero_divisors(int)|~mult_zero(int)|~power(int)),inference(rw,[status(thm)],[183562,578,theory(equality)])).
% cnf(183564,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls|$false|$false|$false|~mult_zero(int)|~power(int)),inference(rw,[status(thm)],[183563,576,theory(equality)])).
% cnf(183565,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls|$false|$false|$false|$false|~power(int)),inference(rw,[status(thm)],[183564,581,theory(equality)])).
% cnf(183566,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls|$false|$false|$false|$false|$false),inference(rw,[status(thm)],[183565,582,theory(equality)])).
% cnf(183567,negated_conjecture,(plus_plus(int,one_one(int),semiring_1_of_nat(int,n))=pls),inference(cn,[status(thm)],[183566,theory(equality)])).
% cnf(183568,negated_conjecture,($false),inference(sr,[status(thm)],[183567,4203,theory(equality)])).
% cnf(183569,negated_conjecture,($false),183568,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 6.75 CPU 7.29 WC
% FINAL PrfWatch: 6.75 CPU 7.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP30245/NUM925+5.tptp
% 
%------------------------------------------------------------------------------