TSTP Solution File: KLE139+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE139+1 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Wed Dec 29 08:10:32 EST 2010
% Result : Theorem 11.46s
% Output : Solution 11.46s
% 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/SystemOnTPTP16212/KLE139+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16212/KLE139+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16212/KLE139+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 16308
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.92 CPU 2.03 WC
% PrfWatch: 3.90 CPU 4.04 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.90 CPU 6.04 WC
% PrfWatch: 7.89 CPU 8.05 WC
% PrfWatch: 9.89 CPU 10.06 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(5, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(6, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(8, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(9, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(10, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(11, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(13, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(14, axiom,![X1]:strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero)),file('/tmp/SRASS.s.p', isolation)).
% fof(15, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(16, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(18, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X3,X1),X2),X3)=>leq(multiplication(X2,star(X1)),X3)),file('/tmp/SRASS.s.p', star_induction2)).
% fof(19, conjecture,![X4]:strong_iteration(X4)=addition(multiplication(strong_iteration(X4),X4),one),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:strong_iteration(X4)=addition(multiplication(strong_iteration(X4),X4),one)),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(32,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(36,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[9])).
% cnf(38,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[10])).
% cnf(40,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[11])).
% cnf(42,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(46, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(47,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X2]:strong_iteration(X2)=addition(star(X2),multiplication(strong_iteration(X2),zero)),inference(variable_rename,[status(thm)],[14])).
% cnf(49,plain,(strong_iteration(X1)=addition(star(X1),multiplication(strong_iteration(X1),zero))),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(51, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(54, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[16])).
% cnf(55,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[54])).
% fof(59, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X3,X1),X2),X3))|leq(multiplication(X2,star(X1)),X3)),inference(fof_nnf,[status(thm)],[18])).
% fof(60, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X6,X4),X5),X6))|leq(multiplication(X5,star(X4)),X6)),inference(variable_rename,[status(thm)],[59])).
% cnf(61,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, negated_conjecture,?[X4]:~(strong_iteration(X4)=addition(multiplication(strong_iteration(X4),X4),one)),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(strong_iteration(X5)=addition(multiplication(strong_iteration(X5),X5),one)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(strong_iteration(esk1_0)=addition(multiplication(strong_iteration(esk1_0),esk1_0),one)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(strong_iteration(esk1_0)!=addition(multiplication(strong_iteration(esk1_0),esk1_0),one)),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[47,22,theory(equality)])).
% cnf(70,negated_conjecture,(addition(one,multiplication(strong_iteration(esk1_0),esk1_0))!=strong_iteration(esk1_0)),inference(rw,[status(thm)],[65,22,theory(equality)])).
% cnf(77,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[38,22,theory(equality)])).
% cnf(85,plain,(leq(X1,X1)),inference(spm,[status(thm)],[52,26,theory(equality)])).
% cnf(94,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(star(X1),X1),X2))),inference(spm,[status(thm)],[24,42,theory(equality)])).
% cnf(95,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(X1,star(X1)),X2))),inference(spm,[status(thm)],[24,40,theory(equality)])).
% cnf(98,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[24,26,theory(equality)])).
% cnf(133,plain,(leq(multiplication(multiplication(X1,X2),star(X2)),X1)|~leq(multiplication(X1,X2),X1)),inference(spm,[status(thm)],[61,26,theory(equality)])).
% cnf(137,plain,(leq(multiplication(X1,multiplication(X2,star(X2))),X1)|~leq(multiplication(X1,X2),X1)),inference(rw,[status(thm)],[133,28,theory(equality)])).
% cnf(147,plain,(addition(strong_iteration(X1),X2)=addition(star(X1),addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[24,49,theory(equality)])).
% cnf(154,plain,(leq(multiplication(multiplication(X1,X2),star(X3)),X1)|~leq(multiplication(X1,addition(X3,X2)),X1)),inference(spm,[status(thm)],[61,34,theory(equality)])).
% cnf(159,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[34,30,theory(equality)])).
% cnf(167,plain,(leq(multiplication(X1,multiplication(X2,star(X3))),X1)|~leq(multiplication(X1,addition(X3,X2)),X1)),inference(rw,[status(thm)],[154,28,theory(equality)])).
% cnf(190,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[36,32,theory(equality)])).
% cnf(191,plain,(addition(multiplication(X1,X2),multiplication(X3,multiplication(X4,X2)))=multiplication(addition(X1,multiplication(X3,X4)),X2)),inference(spm,[status(thm)],[36,28,theory(equality)])).
% cnf(195,plain,(addition(multiplication(X1,multiplication(X2,X3)),multiplication(X4,X3))=multiplication(addition(multiplication(X1,X2),X4),X3)),inference(spm,[status(thm)],[36,28,theory(equality)])).
% cnf(253,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[98,42,theory(equality)])).
% cnf(460,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[159,22,theory(equality)])).
% cnf(632,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[190,22,theory(equality)])).
% cnf(633,plain,(multiplication(addition(X1,one),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[66,632,theory(equality)])).
% cnf(650,plain,(multiplication(addition(X1,one),X1)=multiplication(X1,addition(X1,one))),inference(spm,[status(thm)],[460,632,theory(equality)])).
% cnf(677,plain,(multiplication(addition(one,X1),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[633,22,theory(equality)])).
% cnf(713,plain,(multiplication(strong_iteration(X1),zero)=multiplication(multiplication(X1,strong_iteration(X1)),zero)),inference(spm,[status(thm)],[677,77,theory(equality)])).
% cnf(739,plain,(multiplication(strong_iteration(X1),zero)=multiplication(X1,multiplication(strong_iteration(X1),zero))),inference(rw,[status(thm)],[713,28,theory(equality)])).
% cnf(935,plain,(multiplication(addition(one,X1),X1)=multiplication(X1,addition(one,X1))),inference(spm,[status(thm)],[650,22,theory(equality)])).
% cnf(969,plain,(multiplication(star(X1),multiplication(star(X1),X1))=multiplication(multiplication(star(X1),X1),star(X1))),inference(spm,[status(thm)],[935,42,theory(equality)])).
% cnf(970,plain,(multiplication(star(X1),multiplication(X1,star(X1)))=multiplication(multiplication(X1,star(X1)),star(X1))),inference(spm,[status(thm)],[935,40,theory(equality)])).
% cnf(991,plain,(multiplication(star(X1),multiplication(star(X1),X1))=multiplication(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[969,28,theory(equality)])).
% cnf(992,plain,(multiplication(star(X1),multiplication(X1,star(X1)))=multiplication(X1,multiplication(star(X1),star(X1)))),inference(rw,[status(thm)],[970,28,theory(equality)])).
% cnf(1485,plain,(addition(multiplication(strong_iteration(X1),zero),multiplication(X1,X2))=multiplication(X1,addition(multiplication(strong_iteration(X1),zero),X2))),inference(spm,[status(thm)],[34,739,theory(equality)])).
% cnf(1824,plain,(addition(one,multiplication(star(X1),X1))=addition(star(X1),multiplication(star(X1),X1))),inference(spm,[status(thm)],[94,26,theory(equality)])).
% cnf(1849,plain,(star(X1)=addition(star(X1),multiplication(star(X1),X1))),inference(rw,[status(thm)],[1824,42,theory(equality)])).
% cnf(1850,plain,(star(X1)=multiplication(star(X1),addition(X1,one))),inference(rw,[status(thm)],[1849,460,theory(equality)])).
% cnf(2125,plain,(addition(one,multiplication(X1,star(X1)))=addition(star(X1),multiplication(X1,star(X1)))),inference(spm,[status(thm)],[95,26,theory(equality)])).
% cnf(2156,plain,(star(X1)=addition(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[2125,40,theory(equality)])).
% cnf(2157,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[2156,632,theory(equality)])).
% cnf(2217,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(spm,[status(thm)],[632,1850,theory(equality)])).
% cnf(2234,plain,(addition(X1,star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2217,24,theory(equality)]),253,theory(equality)])).
% cnf(2235,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2234,22,theory(equality)]),253,theory(equality)]),1850,theory(equality)])).
% cnf(3322,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[2157,22,theory(equality)])).
% cnf(4722,plain,(multiplication(star(X1),star(star(X1)))=star(star(X1))),inference(spm,[status(thm)],[3322,253,theory(equality)])).
% cnf(19196,plain,(addition(star(X1),multiplication(strong_iteration(X1),addition(zero,X2)))=addition(strong_iteration(X1),multiplication(strong_iteration(X1),X2))),inference(spm,[status(thm)],[147,34,theory(equality)])).
% cnf(19301,plain,(addition(star(X1),multiplication(strong_iteration(X1),X2))=addition(strong_iteration(X1),multiplication(strong_iteration(X1),X2))),inference(rw,[status(thm)],[19196,66,theory(equality)])).
% cnf(19302,plain,(addition(star(X1),multiplication(strong_iteration(X1),X2))=multiplication(strong_iteration(X1),addition(X2,one))),inference(rw,[status(thm)],[19301,460,theory(equality)])).
% cnf(23558,plain,(leq(multiplication(star(X1),multiplication(one,star(X1))),star(X1))|~leq(star(X1),star(X1))),inference(spm,[status(thm)],[167,1850,theory(equality)])).
% cnf(23605,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|~leq(star(X1),star(X1))),inference(rw,[status(thm)],[23558,32,theory(equality)])).
% cnf(23606,plain,(leq(multiplication(star(X1),star(X1)),star(X1))|$false),inference(rw,[status(thm)],[23605,85,theory(equality)])).
% cnf(23607,plain,(leq(multiplication(star(X1),star(X1)),star(X1))),inference(cn,[status(thm)],[23606,theory(equality)])).
% cnf(24924,plain,(leq(multiplication(star(X1),multiplication(star(X1),star(star(X1)))),star(X1))),inference(spm,[status(thm)],[137,23607,theory(equality)])).
% cnf(24945,plain,(leq(star(star(X1)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24924,4722,theory(equality)]),4722,theory(equality)])).
% cnf(24955,plain,(addition(star(star(X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[53,24945,theory(equality)])).
% cnf(24994,plain,(star(star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[24955,22,theory(equality)]),2235,theory(equality)])).
% cnf(25110,plain,(multiplication(star(X1),star(X1))=star(star(X1))),inference(rw,[status(thm)],[4722,24994,theory(equality)])).
% cnf(25111,plain,(multiplication(star(X1),star(X1))=star(X1)),inference(rw,[status(thm)],[25110,24994,theory(equality)])).
% cnf(25244,plain,(multiplication(star(X1),X2)=multiplication(star(X1),multiplication(star(X1),X2))),inference(spm,[status(thm)],[28,25111,theory(equality)])).
% cnf(29889,plain,(multiplication(star(X1),multiplication(X1,star(X1)))=multiplication(X1,star(X1))),inference(rw,[status(thm)],[992,25111,theory(equality)])).
% cnf(29958,plain,(multiplication(star(X1),multiplication(star(X1),X1))=multiplication(X1,star(X1))),inference(rw,[status(thm)],[991,29889,theory(equality)])).
% cnf(30628,plain,(addition(multiplication(X1,X2),multiplication(X3,zero))=multiplication(addition(X1,multiplication(X3,zero)),X2)),inference(spm,[status(thm)],[191,55,theory(equality)])).
% cnf(32586,plain,(addition(multiplication(X1,zero),multiplication(X3,X2))=multiplication(addition(multiplication(X1,zero),X3),X2)),inference(spm,[status(thm)],[195,55,theory(equality)])).
% cnf(83593,plain,(multiplication(X1,star(X1))=multiplication(star(X1),X1)),inference(spm,[status(thm)],[25244,29958,theory(equality)])).
% cnf(86910,plain,(addition(multiplication(X1,star(X1)),multiplication(X2,zero))=multiplication(addition(star(X1),multiplication(X2,zero)),X1)),inference(spm,[status(thm)],[30628,83593,theory(equality)])).
% cnf(87035,plain,(multiplication(addition(X1,multiplication(X2,zero)),star(X1))=multiplication(addition(star(X1),multiplication(X2,zero)),X1)),inference(rw,[status(thm)],[86910,30628,theory(equality)])).
% cnf(162963,plain,(multiplication(addition(X1,multiplication(strong_iteration(X1),zero)),X2)=multiplication(X1,addition(multiplication(strong_iteration(X1),zero),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1485,32586,theory(equality)]),22,theory(equality)])).
% cnf(443011,plain,(multiplication(multiplication(strong_iteration(X1),addition(zero,one)),X1)=multiplication(addition(X1,multiplication(strong_iteration(X1),zero)),star(X1))),inference(spm,[status(thm)],[87035,19302,theory(equality)])).
% cnf(443554,plain,(multiplication(strong_iteration(X1),X1)=multiplication(addition(X1,multiplication(strong_iteration(X1),zero)),star(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[443011,66,theory(equality)]),30,theory(equality)])).
% cnf(443555,plain,(multiplication(strong_iteration(X1),X1)=multiplication(X1,strong_iteration(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[443554,162963,theory(equality)]),22,theory(equality)]),19302,theory(equality)]),66,theory(equality)]),30,theory(equality)])).
% cnf(444145,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[70,443555,theory(equality)]),77,theory(equality)])).
% cnf(444146,negated_conjecture,($false),inference(cn,[status(thm)],[444145,theory(equality)])).
% cnf(444147,negated_conjecture,($false),444146,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8576
% # ...of these trivial : 2553
% # ...subsumed : 4425
% # ...remaining for further processing: 1598
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 9
% # Backward-rewritten : 242
% # Generated clauses : 227500
% # ...of the previous two non-trivial : 101364
% # Contextual simplify-reflections : 0
% # Paramodulations : 227498
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 1347
% # Positive orientable unit clauses: 1040
% # Positive unorientable unit clauses: 12
% # Negative unit clauses : 0
% # Non-unit-clauses : 295
% # Current number of unprocessed clauses: 86811
% # ...number of literals in the above : 119532
% # Clause-clause subsumption calls (NU) : 23035
% # Rec. Clause-clause subsumption calls : 23035
% # Unit Clause-clause subsumption calls : 592
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6018
% # Indexed BW rewrite successes : 390
% # Backwards rewriting index: 773 leaves, 2.62+/-2.743 terms/leaf
% # Paramod-from index: 471 leaves, 2.25+/-2.723 terms/leaf
% # Paramod-into index: 658 leaves, 2.67+/-2.830 terms/leaf
% # -------------------------------------------------
% # User time : 5.124 s
% # System time : 0.241 s
% # Total time : 5.365 s
% # Maximum resident set size: 0 pages
% PrfWatch: 10.47 CPU 10.66 WC
% FINAL PrfWatch: 10.47 CPU 10.66 WC
% SZS output end Solution for /tmp/SystemOnTPTP16212/KLE139+1.tptp
%
%------------------------------------------------------------------------------