TSTP Solution File: KLE143+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE143+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art07.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:12:41 EST 2010
% Result : Theorem 12.51s
% Output : Solution 12.51s
% 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/SystemOnTPTP9005/KLE143+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP9005/KLE143+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP9005/KLE143+2.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 9101
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.03 WC
% PrfWatch: 5.53 CPU 6.03 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.18 CPU 8.04 WC
% PrfWatch: 9.17 CPU 10.04 WC
% PrfWatch: 11.17 CPU 12.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(2, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(3, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(6, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(7, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(9, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(10, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(11, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(13, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(14, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(15, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(17, axiom,![X1]:addition(one,multiplication(X1,star(X1)))=star(X1),file('/tmp/SRASS.s.p', star_unfold1)).
% fof(18, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(19, conjecture,![X4]:(leq(multiplication(strong_iteration(X4),strong_iteration(X4)),strong_iteration(X4))&leq(strong_iteration(X4),multiplication(strong_iteration(X4),strong_iteration(X4)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:(leq(multiplication(strong_iteration(X4),strong_iteration(X4)),strong_iteration(X4))&leq(strong_iteration(X4),multiplication(strong_iteration(X4),strong_iteration(X4))))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(22, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[25])).
% cnf(27,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[3])).
% cnf(29,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(36, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(37,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[7])).
% cnf(39,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[38])).
% fof(42, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(43,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(45,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(47,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[46])).
% fof(50, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[13])).
% cnf(51,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[14])).
% cnf(53,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[15])).
% cnf(55,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[54])).
% fof(58, plain,![X2]:addition(one,multiplication(X2,star(X2)))=star(X2),inference(variable_rename,[status(thm)],[17])).
% cnf(59,plain,(addition(one,multiplication(X1,star(X1)))=star(X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[18])).
% cnf(61,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[60])).
% fof(62, negated_conjecture,?[X4]:(~(leq(multiplication(strong_iteration(X4),strong_iteration(X4)),strong_iteration(X4)))|~(leq(strong_iteration(X4),multiplication(strong_iteration(X4),strong_iteration(X4))))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:(~(leq(multiplication(strong_iteration(X5),strong_iteration(X5)),strong_iteration(X5)))|~(leq(strong_iteration(X5),multiplication(strong_iteration(X5),strong_iteration(X5))))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0)))|~(leq(strong_iteration(esk1_0),multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0))))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(strong_iteration(esk1_0),multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)))|~leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0))),inference(split_conjunct,[status(thm)],[64])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[51,37,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[26,43,theory(equality)])).
% cnf(92,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(X3,multiplication(X2,X1)))),inference(spm,[status(thm)],[23,37,theory(equality)])).
% cnf(95,plain,(addition(one,multiplication(X1,multiplication(X2,star(multiplication(X1,X2)))))=star(multiplication(X1,X2))),inference(spm,[status(thm)],[59,29,theory(equality)])).
% cnf(115,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(star(X1),X1),X2))),inference(spm,[status(thm)],[39,61,theory(equality)])).
% cnf(116,plain,(addition(star(X1),X2)=addition(one,addition(multiplication(X1,star(X1)),X2))),inference(spm,[status(thm)],[39,59,theory(equality)])).
% cnf(117,plain,(addition(strong_iteration(X1),X2)=addition(one,addition(multiplication(X1,strong_iteration(X1)),X2))),inference(spm,[status(thm)],[39,76,theory(equality)])).
% cnf(119,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[39,43,theory(equality)])).
% cnf(162,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[53,45,theory(equality)])).
% cnf(192,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[55,47,theory(equality)])).
% cnf(250,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[26,119,theory(equality)])).
% cnf(255,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[119,61,theory(equality)])).
% cnf(294,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[250,37,theory(equality)])).
% cnf(381,plain,(leq(X1,multiplication(strong_iteration(X2),X1))),inference(spm,[status(thm)],[23,294,theory(equality)])).
% cnf(415,negated_conjecture,($false|~leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0))),inference(rw,[status(thm)],[65,381,theory(equality)])).
% cnf(416,negated_conjecture,(~leq(multiplication(strong_iteration(esk1_0),strong_iteration(esk1_0)),strong_iteration(esk1_0))),inference(cn,[status(thm)],[415,theory(equality)])).
% cnf(466,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[162,37,theory(equality)])).
% cnf(639,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[192,37,theory(equality)])).
% cnf(3607,plain,(leq(multiplication(X1,star(multiplication(X2,X1))),multiplication(strong_iteration(X2),one))|~leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1)))),inference(spm,[status(thm)],[92,95,theory(equality)])).
% cnf(3647,plain,(leq(multiplication(X1,star(multiplication(X2,X1))),strong_iteration(X2))|~leq(multiplication(X1,star(multiplication(X2,X1))),star(multiplication(X2,X1)))),inference(rw,[status(thm)],[3607,45,theory(equality)])).
% cnf(6068,plain,(addition(one,multiplication(star(X1),X1))=addition(star(X1),multiplication(star(X1),X1))),inference(spm,[status(thm)],[115,43,theory(equality)])).
% cnf(6118,plain,(star(X1)=addition(star(X1),multiplication(star(X1),X1))),inference(rw,[status(thm)],[6068,61,theory(equality)])).
% cnf(6119,plain,(star(X1)=multiplication(star(X1),addition(X1,one))),inference(rw,[status(thm)],[6118,466,theory(equality)])).
% cnf(6134,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(spm,[status(thm)],[639,6119,theory(equality)])).
% cnf(6166,plain,(addition(X1,star(X1))=multiplication(addition(star(X1),one),addition(X1,one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[6134,39,theory(equality)]),255,theory(equality)])).
% cnf(6167,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[6166,37,theory(equality)]),255,theory(equality)]),6119,theory(equality)])).
% cnf(6753,plain,(addition(one,multiplication(X1,star(X1)))=addition(star(X1),multiplication(X1,star(X1)))),inference(spm,[status(thm)],[116,43,theory(equality)])).
% cnf(6809,plain,(star(X1)=addition(star(X1),multiplication(X1,star(X1)))),inference(rw,[status(thm)],[6753,59,theory(equality)])).
% cnf(6810,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[6809,639,theory(equality)])).
% cnf(7514,plain,(addition(one,star(multiplication(X1,strong_iteration(X1))))=addition(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1))))),inference(spm,[status(thm)],[117,6167,theory(equality)])).
% cnf(7580,plain,(star(multiplication(X1,strong_iteration(X1)))=addition(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1))))),inference(rw,[status(thm)],[7514,255,theory(equality)])).
% cnf(7736,plain,(multiplication(addition(one,X1),star(X1))=star(X1)),inference(spm,[status(thm)],[6810,37,theory(equality)])).
% cnf(8647,plain,(multiplication(strong_iteration(X1),star(multiplication(X1,strong_iteration(X1))))=star(multiplication(X1,strong_iteration(X1)))),inference(spm,[status(thm)],[7736,76,theory(equality)])).
% cnf(495839,plain,(leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1))|~leq(star(multiplication(X1,strong_iteration(X1))),star(multiplication(X1,strong_iteration(X1))))),inference(spm,[status(thm)],[3647,8647,theory(equality)])).
% cnf(496502,plain,(leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1))|$false),inference(rw,[status(thm)],[495839,84,theory(equality)])).
% cnf(496503,plain,(leq(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1))),inference(cn,[status(thm)],[496502,theory(equality)])).
% cnf(496674,plain,(addition(star(multiplication(X1,strong_iteration(X1))),strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[27,496503,theory(equality)])).
% cnf(499130,plain,(star(multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[496674,37,theory(equality)]),7580,theory(equality)])).
% cnf(499883,plain,(multiplication(strong_iteration(X1),strong_iteration(X1))=star(multiplication(X1,strong_iteration(X1)))),inference(rw,[status(thm)],[8647,499130,theory(equality)])).
% cnf(499884,plain,(multiplication(strong_iteration(X1),strong_iteration(X1))=strong_iteration(X1)),inference(rw,[status(thm)],[499883,499130,theory(equality)])).
% cnf(502252,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[416,499884,theory(equality)]),84,theory(equality)])).
% cnf(502253,negated_conjecture,($false),inference(cn,[status(thm)],[502252,theory(equality)])).
% cnf(502254,negated_conjecture,($false),502253,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 8871
% # ...of these trivial : 2661
% # ...subsumed : 4545
% # ...remaining for further processing: 1665
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 345
% # Generated clauses : 254223
% # ...of the previous two non-trivial : 104443
% # Contextual simplify-reflections : 0
% # Paramodulations : 254221
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 1317
% # Positive orientable unit clauses: 1009
% # Positive unorientable unit clauses: 9
% # Negative unit clauses : 0
% # Non-unit-clauses : 299
% # Current number of unprocessed clauses: 78994
% # ...number of literals in the above : 107991
% # Clause-clause subsumption calls (NU) : 23472
% # Rec. Clause-clause subsumption calls : 23472
% # Unit Clause-clause subsumption calls : 554
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6696
% # Indexed BW rewrite successes : 244
% # Backwards rewriting index: 759 leaves, 2.65+/-2.679 terms/leaf
% # Paramod-from index: 452 leaves, 2.27+/-2.657 terms/leaf
% # Paramod-into index: 641 leaves, 2.69+/-2.753 terms/leaf
% # -------------------------------------------------
% # User time : 5.675 s
% # System time : 0.271 s
% # Total time : 5.946 s
% # Maximum resident set size: 0 pages
% PrfWatch: 11.68 CPU 12.57 WC
% FINAL PrfWatch: 11.68 CPU 12.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP9005/KLE143+2.tptp
%
%------------------------------------------------------------------------------