TSTP Solution File: NUM925+7 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM925+7 : 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:30:00 EST 2011
% Result : Theorem 163.99s
% Output : Solution 163.99s
% 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/SystemOnTPTP30589/NUM925+7.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% WARNING: TreeLimitedRun lost 0.55s, total lost is 0.55s
% found
% SZS status THM for /tmp/SystemOnTPTP30589/NUM925+7.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30589/NUM925+7.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 30935
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Garbage collection reclaimed 411 unused term cells.
% # Garbage collection reclaimed 5948 unused term cells.
% # Garbage collection reclaimed 4877 unused term cells.
% # Garbage collection reclaimed 4491 unused term cells.
% # Garbage collection reclaimed 3951 unused term cells.
% # Garbage collection reclaimed 3718 unused term cells.
% # Garbage collection reclaimed 3371 unused term cells.
% # Garbage collection reclaimed 2958 unused term cells.
% # Garbage collection reclaimed 2563 unused term cells.
% # Garbage collection reclaimed 2335 unused term cells.
% # Garbage collection reclaimed 94 unused term cells.
% # Auto-Ordering is analysing problem.
% # Problem is type GHSMNSSLM32LD
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHSMNSSLM32LD
% # Auto-Mode selected heuristic G_E___008_C45_F1_AE_CS_SP_PS_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # Initializing proof state
% # Scanning for AC axioms
% # Garbage collection reclaimed 2432 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 260 unused term cells.
% # Garbage collection reclaimed 268 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 257 unused term cells.
% # Garbage collection reclaimed 259 unused term cells.
% # Garbage collection reclaimed 255 unused term cells.
% # Garbage collection reclaimed 262 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 269 unused term cells.
% # Garbage collection reclaimed 262 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 265 unused term cells.
% # Garbage collection reclaimed 256 unused term cells.
% # Garbage collection reclaimed 262 unused term cells.
% # Presaturation interreduction done
% # Garbage collection reclaimed 256 unused term cells.
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 1251
% # Removed by relevancy pruning : 0
% # Initial clauses : 1729
% # Removed in clause preprocessing : 83
% # Initial clauses in saturation : 1646
% # Processed clauses : 4807
% # ...of these trivial : 89
% # ...subsumed : 2385
% # ...remaining for further processing: 2333
% # Other redundant clauses eliminated : 16
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 177
% # Generated clauses : 8718
% # ...of the previous two non-trivial : 7507
% # Contextual simplify-reflections : 233
% # Paramodulations : 8685
% # Factorizations : 2
% # Equation resolutions : 31
% # Current number of processed clauses: 752
% # Positive orientable unit clauses: 369
% # Positive unorientable unit clauses: 14
% # Negative unit clauses : 130
% # Non-unit-clauses : 239
% # Current number of unprocessed clauses: 5408
% # ...number of literals in the above : 10202
% # Clause-clause subsumption calls (NU) : 24629
% # Rec. Clause-clause subsumption calls : 16939
% # Unit Clause-clause subsumption calls : 2201
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7483
% # Indexed BW rewrite successes : 720
% # Backwards rewriting index : 457 leaves, 2.25+/-5.845 terms/leaf
% # Paramod-from index : 297 leaves, 1.57+/-2.876 terms/leaf
% # Paramod-into index : 433 leaves, 2.16+/-5.339 terms/leaf
% # SZS output start CNFRefutation.
% fof(7, axiom,![X4]:![X5]:plus_plus(int,hAPP(nat,int,semiring_1_of_nat(int),X4),hAPP(nat,int,semiring_1_of_nat(int),X5))=hAPP(nat,int,semiring_1_of_nat(int),plus_plus(nat,X4,X5)),file('/tmp/SRASS.s.p', fact_23_zadd__int)).
% fof(12, axiom,hAPP(nat,int,semiring_1_of_nat(int),zero_zero(nat))=zero_zero(int),file('/tmp/SRASS.s.p', fact_28_int__0)).
% fof(14, axiom,one_one(int)=number_number_of(int,bit1(pls)),file('/tmp/SRASS.s.p', fact_37_one__is__num__one)).
% fof(19, axiom,![X10]:![X11]:![X12]:plus_plus(int,plus_plus(int,X10,X11),X12)=plus_plus(int,X10,plus_plus(int,X11,X12)),file('/tmp/SRASS.s.p', fact_45_zadd__assoc)).
% fof(21, axiom,![X6]:![X3]:plus_plus(int,X6,X3)=plus_plus(int,X3,X6),file('/tmp/SRASS.s.p', fact_47_zadd__commute)).
% fof(29, axiom,bit0(pls)=pls,file('/tmp/SRASS.s.p', fact_72_Bit0__Pls)).
% fof(30, axiom,pls=zero_zero(int),file('/tmp/SRASS.s.p', fact_73_Pls__def)).
% fof(35, axiom,![X15]:bit0(X15)=plus_plus(int,X15,X15),file('/tmp/SRASS.s.p', fact_78_Bit0__def)).
% fof(36, axiom,![X6]:plus_plus(int,X6,zero_zero(int))=ti(int,X6),file('/tmp/SRASS.s.p', fact_79_zadd__0__right)).
% fof(37, axiom,![X6]:plus_plus(int,zero_zero(int),X6)=ti(int,X6),file('/tmp/SRASS.s.p', fact_80_zadd__0)).
% fof(45, axiom,![X15]:number_number_of(int,X15)=ti(int,X15),file('/tmp/SRASS.s.p', fact_120_number__of__is__id)).
% fof(54, axiom,![X5]:plus_plus(nat,zero_zero(nat),X5)=X5,file('/tmp/SRASS.s.p', fact_156_plus__nat_Oadd__0)).
% fof(108, axiom,![X24]:(ring_11004092258visors(X24)=>![X5]:![X22]:(~(ti(X24,X22)=zero_zero(X24))=>~(hAPP(nat,X24,power_power(X24,X22),X5)=zero_zero(X24)))),file('/tmp/SRASS.s.p', fact_165_field__power__not__zero)).
% fof(158, axiom,hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n)))),file('/tmp/SRASS.s.p', fact_0_n1pos)).
% fof(171, axiom,![X15]:succ(X15)=plus_plus(int,X15,one_one(int)),file('/tmp/SRASS.s.p', fact_519_succ__def)).
% fof(208, axiom,![X15]:succ(bit0(X15))=bit1(X15),file('/tmp/SRASS.s.p', fact_514_succ__Bit0)).
% fof(223, axiom,![X15]:![X16]:minus_minus(int,bit0(X15),bit0(X16))=bit0(minus_minus(int,X15,X16)),file('/tmp/SRASS.s.p', fact_591_diff__bin__simps_I7_J)).
% fof(276, axiom,![X21]:ti(int,succ(X21))=succ(X21),file('/tmp/SRASS.s.p', tsy_c_Int_Osucc_res)).
% fof(856, axiom,![X15]:minus_minus(int,X15,min)=succ(X15),file('/tmp/SRASS.s.p', fact_777_diff__bin__simps_I2_J)).
% fof(916, axiom,![X40]:![X36]:(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X40),X36))<=>(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X40),X36))&~(ti(int,X40)=ti(int,X36)))),file('/tmp/SRASS.s.p', fact_380_zless__le)).
% fof(1158, axiom,ring_11004092258visors(int),file('/tmp/SRASS.s.p', arity_Int_Oint___Rings_Oring__1__no__zero__divisors)).
% fof(1251, conjecture,~(hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,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(1252, negated_conjecture,~(~(hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int))),inference(assume_negation,[status(cth)],[1251])).
% fof(1336, negated_conjecture,hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int),inference(fof_simplification,[status(thm)],[1252,theory(equality)])).
% fof(1348, plain,![X6]:![X7]:plus_plus(int,hAPP(nat,int,semiring_1_of_nat(int),X6),hAPP(nat,int,semiring_1_of_nat(int),X7))=hAPP(nat,int,semiring_1_of_nat(int),plus_plus(nat,X6,X7)),inference(variable_rename,[status(thm)],[7])).
% cnf(1349,plain,(plus_plus(int,hAPP(nat,int,semiring_1_of_nat(int),X1),hAPP(nat,int,semiring_1_of_nat(int),X2))=hAPP(nat,int,semiring_1_of_nat(int),plus_plus(nat,X1,X2))),inference(split_conjunct,[status(thm)],[1348])).
% cnf(1357,plain,(hAPP(nat,int,semiring_1_of_nat(int),zero_zero(nat))=zero_zero(int)),inference(split_conjunct,[status(thm)],[12])).
% cnf(1359,plain,(one_one(int)=number_number_of(int,bit1(pls))),inference(split_conjunct,[status(thm)],[14])).
% fof(1370, plain,![X13]:![X14]:![X15]:plus_plus(int,plus_plus(int,X13,X14),X15)=plus_plus(int,X13,plus_plus(int,X14,X15)),inference(variable_rename,[status(thm)],[19])).
% cnf(1371,plain,(plus_plus(int,plus_plus(int,X1,X2),X3)=plus_plus(int,X1,plus_plus(int,X2,X3))),inference(split_conjunct,[status(thm)],[1370])).
% fof(1374, plain,![X7]:![X8]:plus_plus(int,X7,X8)=plus_plus(int,X8,X7),inference(variable_rename,[status(thm)],[21])).
% cnf(1375,plain,(plus_plus(int,X1,X2)=plus_plus(int,X2,X1)),inference(split_conjunct,[status(thm)],[1374])).
% cnf(1396,plain,(bit0(pls)=pls),inference(split_conjunct,[status(thm)],[29])).
% cnf(1397,plain,(pls=zero_zero(int)),inference(split_conjunct,[status(thm)],[30])).
% fof(1405, plain,![X16]:bit0(X16)=plus_plus(int,X16,X16),inference(variable_rename,[status(thm)],[35])).
% cnf(1406,plain,(bit0(X1)=plus_plus(int,X1,X1)),inference(split_conjunct,[status(thm)],[1405])).
% fof(1407, plain,![X7]:plus_plus(int,X7,zero_zero(int))=ti(int,X7),inference(variable_rename,[status(thm)],[36])).
% cnf(1408,plain,(plus_plus(int,X1,zero_zero(int))=ti(int,X1)),inference(split_conjunct,[status(thm)],[1407])).
% fof(1409, plain,![X7]:plus_plus(int,zero_zero(int),X7)=ti(int,X7),inference(variable_rename,[status(thm)],[37])).
% cnf(1410,plain,(plus_plus(int,zero_zero(int),X1)=ti(int,X1)),inference(split_conjunct,[status(thm)],[1409])).
% fof(1422, plain,![X16]:number_number_of(int,X16)=ti(int,X16),inference(variable_rename,[status(thm)],[45])).
% cnf(1423,plain,(number_number_of(int,X1)=ti(int,X1)),inference(split_conjunct,[status(thm)],[1422])).
% fof(1449, plain,![X6]:plus_plus(nat,zero_zero(nat),X6)=X6,inference(variable_rename,[status(thm)],[54])).
% cnf(1450,plain,(plus_plus(nat,zero_zero(nat),X1)=X1),inference(split_conjunct,[status(thm)],[1449])).
% fof(1603, plain,![X24]:(~(ring_11004092258visors(X24))|![X5]:![X22]:(ti(X24,X22)=zero_zero(X24)|~(hAPP(nat,X24,power_power(X24,X22),X5)=zero_zero(X24)))),inference(fof_nnf,[status(thm)],[108])).
% fof(1604, plain,![X25]:(~(ring_11004092258visors(X25))|![X26]:![X27]:(ti(X25,X27)=zero_zero(X25)|~(hAPP(nat,X25,power_power(X25,X27),X26)=zero_zero(X25)))),inference(variable_rename,[status(thm)],[1603])).
% fof(1605, plain,![X25]:![X26]:![X27]:(~(ring_11004092258visors(X25))|(ti(X25,X27)=zero_zero(X25)|~(hAPP(nat,X25,power_power(X25,X27),X26)=zero_zero(X25)))),inference(shift_quantors,[status(thm)],[1604])).
% cnf(1606,plain,(ti(X1,X2)=zero_zero(X1)|hAPP(nat,X1,power_power(X1,X2),X3)!=zero_zero(X1)|~ring_11004092258visors(X1)),inference(split_conjunct,[status(thm)],[1605])).
% cnf(1761,plain,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(split_conjunct,[status(thm)],[158])).
% fof(1805, plain,![X16]:succ(X16)=plus_plus(int,X16,one_one(int)),inference(variable_rename,[status(thm)],[171])).
% cnf(1806,plain,(succ(X1)=plus_plus(int,X1,one_one(int))),inference(split_conjunct,[status(thm)],[1805])).
% fof(1942, plain,![X16]:succ(bit0(X16))=bit1(X16),inference(variable_rename,[status(thm)],[208])).
% cnf(1943,plain,(succ(bit0(X1))=bit1(X1)),inference(split_conjunct,[status(thm)],[1942])).
% fof(1981, plain,![X17]:![X18]:minus_minus(int,bit0(X17),bit0(X18))=bit0(minus_minus(int,X17,X18)),inference(variable_rename,[status(thm)],[223])).
% cnf(1982,plain,(minus_minus(int,bit0(X1),bit0(X2))=bit0(minus_minus(int,X1,X2))),inference(split_conjunct,[status(thm)],[1981])).
% fof(2159, plain,![X22]:ti(int,succ(X22))=succ(X22),inference(variable_rename,[status(thm)],[276])).
% cnf(2160,plain,(ti(int,succ(X1))=succ(X1)),inference(split_conjunct,[status(thm)],[2159])).
% fof(4300, plain,![X16]:minus_minus(int,X16,min)=succ(X16),inference(variable_rename,[status(thm)],[856])).
% cnf(4301,plain,(minus_minus(int,X1,min)=succ(X1)),inference(split_conjunct,[status(thm)],[4300])).
% fof(4474, plain,![X40]:![X36]:((~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X40),X36)))|(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X40),X36))&~(ti(int,X40)=ti(int,X36))))&((~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X40),X36)))|ti(int,X40)=ti(int,X36))|hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X40),X36)))),inference(fof_nnf,[status(thm)],[916])).
% fof(4475, plain,![X41]:![X42]:((~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X41),X42)))|(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X41),X42))&~(ti(int,X41)=ti(int,X42))))&((~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X41),X42)))|ti(int,X41)=ti(int,X42))|hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X41),X42)))),inference(variable_rename,[status(thm)],[4474])).
% fof(4476, plain,![X41]:![X42]:(((hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X41),X42))|~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X41),X42))))&(~(ti(int,X41)=ti(int,X42))|~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X41),X42)))))&((~(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X41),X42)))|ti(int,X41)=ti(int,X42))|hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X41),X42)))),inference(distribute,[status(thm)],[4475])).
% cnf(4478,plain,(~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))|ti(int,X1)!=ti(int,X2)),inference(split_conjunct,[status(thm)],[4476])).
% cnf(5393,plain,(ring_11004092258visors(int)),inference(split_conjunct,[status(thm)],[1158])).
% cnf(5517,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(bit1(pls))))=zero_zero(int)),inference(split_conjunct,[status(thm)],[1336])).
% cnf(5525,plain,(number_number_of(int,succ(bit0(pls)))=one_one(int)),inference(rw,[status(thm)],[1359,1943,theory(equality)]),['unfolding']).
% cnf(5552,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,bit0(succ(bit0(pls)))))=zero_zero(int)),inference(rw,[status(thm)],[5517,1943,theory(equality)]),['unfolding']).
% cnf(5728,plain,(plus_plus(int,pls,pls)=pls),inference(rw,[status(thm)],[1396,1406,theory(equality)]),['unfolding']).
% cnf(5737,plain,(number_number_of(int,succ(plus_plus(int,pls,pls)))=one_one(int)),inference(rw,[status(thm)],[5525,1406,theory(equality)]),['unfolding']).
% cnf(5749,plain,(minus_minus(int,plus_plus(int,X1,X1),plus_plus(int,X2,X2))=plus_plus(int,minus_minus(int,X1,X2),minus_minus(int,X1,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1982,1406,theory(equality)]),1406,theory(equality)]),1406,theory(equality)]),['unfolding']).
% cnf(5768,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,plus_plus(int,succ(plus_plus(int,pls,pls)),succ(plus_plus(int,pls,pls)))))=zero_zero(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5552,1406,theory(equality)]),1406,theory(equality)]),['unfolding']).
% cnf(5987,plain,(ti(int,minus_minus(int,X1,min))=minus_minus(int,X1,min)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2160,4301,theory(equality)]),4301,theory(equality)]),['unfolding']).
% cnf(5990,plain,(number_number_of(int,minus_minus(int,plus_plus(int,pls,pls),min))=one_one(int)),inference(rw,[status(thm)],[5737,4301,theory(equality)]),['unfolding']).
% cnf(5991,plain,(plus_plus(int,X1,one_one(int))=minus_minus(int,X1,min)),inference(rw,[status(thm)],[1806,4301,theory(equality)]),['unfolding']).
% cnf(6018,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,one_one(int),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,plus_plus(int,minus_minus(int,plus_plus(int,pls,pls),min),minus_minus(int,plus_plus(int,pls,pls),min))))=zero_zero(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5768,4301,theory(equality)]),4301,theory(equality)]),['unfolding']).
% cnf(6202,plain,(hAPP(nat,int,semiring_1_of_nat(int),zero_zero(nat))=pls),inference(rw,[status(thm)],[1357,1397,theory(equality)])).
% cnf(6209,plain,(number_number_of(int,minus_minus(int,pls,min))=one_one(int)),inference(rw,[status(thm)],[5990,5728,theory(equality)])).
% cnf(6216,plain,(plus_plus(int,X1,pls)=ti(int,X1)),inference(rw,[status(thm)],[1408,1397,theory(equality)])).
% cnf(6227,plain,(plus_plus(int,pls,X1)=ti(int,X1)),inference(rw,[status(thm)],[1410,1397,theory(equality)])).
% cnf(6228,plain,(plus_plus(int,pls,X1)=plus_plus(int,X1,pls)),inference(rw,[status(thm)],[6227,6216,theory(equality)])).
% cnf(6230,plain,(plus_plus(int,X1,pls)=number_number_of(int,X1)),inference(rw,[status(thm)],[1423,6216,theory(equality)])).
% cnf(6234,plain,(plus_plus(int,pls,minus_minus(int,pls,min))=one_one(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[6209,6230,theory(equality)]),6228,theory(equality)])).
% cnf(6246,plain,(plus_plus(int,pls,minus_minus(int,X1,min))=minus_minus(int,X1,min)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[5987,6216,theory(equality)]),6228,theory(equality)])).
% cnf(6247,plain,(minus_minus(int,pls,min)=one_one(int)),inference(rw,[status(thm)],[6234,6246,theory(equality)])).
% cnf(6250,plain,(plus_plus(int,X1,minus_minus(int,pls,min))=minus_minus(int,X1,min)),inference(rw,[status(thm)],[5991,6247,theory(equality)])).
% cnf(6271,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,minus_minus(int,minus_minus(int,pls,min),min)))=zero_zero(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[6018,6247,theory(equality)]),5728,theory(equality)]),5728,theory(equality)]),6250,theory(equality)])).
% cnf(6272,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,minus_minus(int,minus_minus(int,pls,min),min)))=pls),inference(rw,[status(thm)],[6271,1397,theory(equality)])).
% cnf(6438,plain,(plus_plus(int,X1,pls)!=ti(int,X2)|~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))),inference(rw,[status(thm)],[4478,6216,theory(equality)])).
% cnf(6439,plain,(plus_plus(int,X1,pls)!=plus_plus(int,X2,pls)|~hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))),inference(rw,[status(thm)],[6438,6216,theory(equality)])).
% cnf(6446,plain,(hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),pls),plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1761,1397,theory(equality)]),6247,theory(equality)])).
% cnf(7675,plain,(plus_plus(int,pls,hAPP(nat,int,semiring_1_of_nat(int),X1))=hAPP(nat,int,semiring_1_of_nat(int),plus_plus(nat,zero_zero(nat),X1))),inference(spm,[status(thm)],[1349,6202,theory(equality)])).
% cnf(7682,plain,(plus_plus(int,pls,hAPP(nat,int,semiring_1_of_nat(int),X1))=hAPP(nat,int,semiring_1_of_nat(int),X1)),inference(rw,[status(thm)],[7675,1450,theory(equality)])).
% cnf(9134,plain,(minus_minus(int,plus_plus(int,pls,pls),plus_plus(int,min,min))=minus_minus(int,minus_minus(int,pls,min),min)),inference(spm,[status(thm)],[6250,5749,theory(equality)])).
% cnf(9158,plain,(minus_minus(int,pls,plus_plus(int,min,min))=minus_minus(int,minus_minus(int,pls,min),min)),inference(rw,[status(thm)],[9134,5728,theory(equality)])).
% cnf(9251,negated_conjecture,(hAPP(nat,int,power_power(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,minus_minus(int,pls,plus_plus(int,min,min))))=pls),inference(rw,[status(thm)],[6272,9158,theory(equality)])).
% cnf(23711,plain,(plus_plus(int,pls,pls)!=plus_plus(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n)),pls)),inference(spm,[status(thm)],[6439,6446,theory(equality)])).
% cnf(23725,plain,(pls!=plus_plus(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n)),pls)),inference(rw,[status(thm)],[23711,5728,theory(equality)])).
% cnf(23726,plain,(pls!=plus_plus(int,minus_minus(int,pls,min),plus_plus(int,hAPP(nat,int,semiring_1_of_nat(int),n),pls))),inference(rw,[status(thm)],[23725,1371,theory(equality)])).
% cnf(23735,plain,(plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))!=pls),inference(rw,[status(thm)],[inference(rw,[status(thm)],[23726,1375,theory(equality)]),7682,theory(equality)])).
% cnf(24285,negated_conjecture,(ti(int,plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n)))=zero_zero(int)|pls!=zero_zero(int)|~ring_11004092258visors(int)),inference(spm,[status(thm)],[1606,9251,theory(equality)])).
% cnf(24336,negated_conjecture,(plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))=zero_zero(int)|pls!=zero_zero(int)|~ring_11004092258visors(int)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24285,6216,theory(equality)]),1371,theory(equality)]),1375,theory(equality)]),7682,theory(equality)])).
% cnf(24337,negated_conjecture,(plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))=pls|pls!=zero_zero(int)|~ring_11004092258visors(int)),inference(rw,[status(thm)],[24336,1397,theory(equality)])).
% cnf(24338,negated_conjecture,(plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))=pls|$false|~ring_11004092258visors(int)),inference(rw,[status(thm)],[24337,1397,theory(equality)])).
% cnf(24339,negated_conjecture,(plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))=pls|$false|$false),inference(rw,[status(thm)],[24338,5393,theory(equality)])).
% cnf(24340,negated_conjecture,(plus_plus(int,minus_minus(int,pls,min),hAPP(nat,int,semiring_1_of_nat(int),n))=pls),inference(cn,[status(thm)],[24339,theory(equality)])).
% cnf(24341,negated_conjecture,($false),inference(sr,[status(thm)],[24340,23735,theory(equality)])).
% cnf(24342,negated_conjecture,($false),24341,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 1.86 CPU 1.98 WC
% FINAL PrfWatch: 1.86 CPU 1.98 WC
% SZS output end Solution for /tmp/SystemOnTPTP30589/NUM925+7.tptp
%
%------------------------------------------------------------------------------