%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE170+1.002 : TPTP v5.2.0. Released v5.2.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 : Mon Feb 28 19:39:35 EST 2011
% Result : Theorem 4.78s
% Output : Solution 4.78s
% 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/SystemOnTPTP24491/KLE170+1.002.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24491/KLE170+1.002.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24491/KLE170+1.002.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 24579
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.95 CPU 2.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 3.90 CPU 4.03 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:(leq(addition(multiplication(X1,X2),X3),X1)=>leq(multiplication(X3,star(X2)),X1)),file('/tmp/SRASS.s.p', star_induction_right)).
% fof(3, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(4, axiom,![X1]:leq(addition(one,multiplication(star(X1),X1)),star(X1)),file('/tmp/SRASS.s.p', star_unfold_left)).
% fof(6, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(7, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(8, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(9, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(10, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(11, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(12, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(13, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(17, conjecture,leq(multiplication(a,a),star(a)),file('/tmp/SRASS.s.p', a)).
% fof(18, negated_conjecture,~(leq(multiplication(a,a),star(a))),inference(assume_negation,[status(cth)],[17])).
% fof(19, negated_conjecture,~(leq(multiplication(a,a),star(a))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(23, plain,![X1]:![X2]:![X3]:(~(leq(addition(multiplication(X1,X2),X3),X1))|leq(multiplication(X3,star(X2)),X1)),inference(fof_nnf,[status(thm)],[2])).
% fof(24, plain,![X4]:![X5]:![X6]:(~(leq(addition(multiplication(X4,X5),X6),X4))|leq(multiplication(X6,star(X5)),X4)),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(leq(multiplication(X1,star(X2)),X3)|~leq(addition(multiplication(X3,X2),X1),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X2]:leq(addition(one,multiplication(star(X2),X2)),star(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(leq(addition(one,multiplication(star(X1),X1)),star(X1))),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[6])).
% fof(33, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(39,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[10])).
% cnf(43,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(45,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[12])).
% cnf(47,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(49,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[48])).
% cnf(56,negated_conjecture,(~leq(multiplication(a,a),star(a))),inference(split_conjunct,[status(thm)],[19])).
% cnf(86,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[47,49,theory(equality)])).
% cnf(87,plain,(addition(addition(X2,X1),X3)=addition(X1,addition(X2,X3))),inference(spm,[status(thm)],[47,45,theory(equality)])).
% cnf(92,plain,(addition(X2,addition(X1,X3))=addition(X1,addition(X2,X3))),inference(rw,[status(thm)],[87,47,theory(equality)])).
% cnf(96,plain,(leq(X1,X1)),inference(spm,[status(thm)],[34,49,theory(equality)])).
% cnf(103,plain,(leq(multiplication(X1,star(one)),X2)|~leq(addition(X2,X1),X2)),inference(spm,[status(thm)],[25,37,theory(equality)])).
% cnf(131,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[41,37,theory(equality)])).
% cnf(164,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[43,39,theory(equality)])).
% cnf(189,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[35,27,theory(equality)])).
% cnf(191,plain,(leq(addition(one,star(one)),star(one))),inference(spm,[status(thm)],[27,39,theory(equality)])).
% cnf(193,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[189,47,theory(equality)])).
% cnf(195,plain,(addition(addition(one,multiplication(star(X1),X1)),star(X1))=star(X1)),inference(spm,[status(thm)],[35,29,theory(equality)])).
% cnf(198,plain,(addition(one,addition(multiplication(star(X1),X1),star(X1)))=star(X1)),inference(rw,[status(thm)],[195,47,theory(equality)])).
% cnf(257,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[34,86,theory(equality)])).
% cnf(330,plain,(addition(addition(one,star(one)),star(one))=star(one)),inference(spm,[status(thm)],[35,191,theory(equality)])).
% cnf(331,plain,(addition(one,star(one))=star(one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[330,47,theory(equality)]),49,theory(equality)])).
% cnf(1260,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[131,45,theory(equality)])).
% cnf(1272,plain,(addition(multiplication(X1,addition(X2,one)),X3)=addition(X1,addition(multiplication(X1,X2),X3))),inference(spm,[status(thm)],[47,1260,theory(equality)])).
% cnf(1363,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[164,45,theory(equality)])).
% cnf(1378,plain,(leq(X1,multiplication(addition(X2,one),X1))),inference(spm,[status(thm)],[257,1363,theory(equality)])).
% cnf(2715,plain,(leq(multiplication(X1,star(one)),X1)|~leq(X1,X1)),inference(spm,[status(thm)],[103,49,theory(equality)])).
% cnf(2730,plain,(leq(multiplication(X1,star(one)),X1)|$false),inference(rw,[status(thm)],[2715,96,theory(equality)])).
% cnf(2731,plain,(leq(multiplication(X1,star(one)),X1)),inference(cn,[status(thm)],[2730,theory(equality)])).
% cnf(2735,plain,(leq(star(one),one)),inference(spm,[status(thm)],[2731,39,theory(equality)])).
% cnf(2743,plain,(addition(star(one),one)=one),inference(spm,[status(thm)],[35,2735,theory(equality)])).
% cnf(2745,plain,(star(one)=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2743,45,theory(equality)]),331,theory(equality)])).
% cnf(2779,plain,(leq(X1,X2)|~leq(addition(X2,X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[103,2745,theory(equality)]),37,theory(equality)])).
% cnf(3131,plain,(leq(X1,X2)|~leq(addition(X1,X2),X2)),inference(spm,[status(thm)],[2779,45,theory(equality)])).
% cnf(7766,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[193,45,theory(equality)]),1363,theory(equality)])).
% cnf(7769,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[86,7766,theory(equality)])).
% cnf(7776,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|~leq(star(X1),multiplication(addition(X1,one),star(X1)))),inference(spm,[status(thm)],[3131,7766,theory(equality)])).
% cnf(7867,plain,(leq(one,multiplication(addition(X1,one),star(X1)))|$false),inference(rw,[status(thm)],[7776,1378,theory(equality)])).
% cnf(7868,plain,(leq(one,multiplication(addition(X1,one),star(X1)))),inference(cn,[status(thm)],[7867,theory(equality)])).
% cnf(7901,plain,(addition(star(X1),X2)=addition(one,addition(star(X1),X2))),inference(spm,[status(thm)],[47,7769,theory(equality)])).
% cnf(8617,plain,(addition(one,multiplication(star(X1),addition(X2,one)))=multiplication(star(X1),addition(X2,one))),inference(spm,[status(thm)],[7901,1260,theory(equality)])).
% cnf(8908,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=multiplication(addition(X1,one),star(X1))),inference(spm,[status(thm)],[35,7868,theory(equality)])).
% cnf(8916,plain,(star(X1)=multiplication(addition(X1,one),star(X1))),inference(rw,[status(thm)],[8908,7766,theory(equality)])).
% cnf(8927,plain,(addition(addition(X1,one),star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(spm,[status(thm)],[1260,8916,theory(equality)])).
% cnf(8975,plain,(addition(X1,star(X1))=multiplication(addition(X1,one),addition(star(X1),one))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8927,47,theory(equality)]),7769,theory(equality)])).
% cnf(8976,plain,(addition(X1,star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8975,45,theory(equality)]),7769,theory(equality)]),8916,theory(equality)])).
% cnf(9081,plain,(addition(X1,star(X2))=addition(X2,addition(X1,star(X2)))),inference(spm,[status(thm)],[92,8976,theory(equality)])).
% cnf(13711,plain,(multiplication(star(X1),addition(X1,one))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[198,45,theory(equality)]),1260,theory(equality)]),8617,theory(equality)])).
% cnf(13714,plain,(addition(star(X1),multiplication(X2,addition(X1,one)))=multiplication(addition(star(X1),X2),addition(X1,one))),inference(spm,[status(thm)],[43,13711,theory(equality)])).
% cnf(166166,plain,(addition(multiplication(X1,addition(X2,one)),star(X1))=addition(multiplication(X1,X2),star(X1))),inference(spm,[status(thm)],[9081,1272,theory(equality)])).
% cnf(168631,plain,(addition(star(X1),multiplication(X1,addition(X2,one)))=addition(multiplication(X1,X2),star(X1))),inference(rw,[status(thm)],[166166,45,theory(equality)])).
% cnf(169030,plain,(addition(multiplication(X1,X1),star(X1))=multiplication(addition(star(X1),X1),addition(X1,one))),inference(spm,[status(thm)],[13714,168631,theory(equality)])).
% cnf(169303,plain,(addition(multiplication(X1,X1),star(X1))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[169030,45,theory(equality)]),8976,theory(equality)]),13711,theory(equality)])).
% cnf(169361,plain,(leq(multiplication(X1,X1),star(X1))),inference(spm,[status(thm)],[34,169303,theory(equality)])).
% cnf(172475,negated_conjecture,($false),inference(rw,[status(thm)],[56,169361,theory(equality)])).
% cnf(172476,negated_conjecture,($false),inference(cn,[status(thm)],[172475,theory(equality)])).
% cnf(172477,negated_conjecture,($false),172476,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4577
% # ...of these trivial : 1802
% # ...subsumed : 1873
% # ...remaining for further processing: 902
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 155
% # Generated clauses : 96013
% # ...of the previous two non-trivial : 55883
% # Contextual simplify-reflections : 0
% # Paramodulations : 96012
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 742
% # Positive orientable unit clauses: 542
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 0
% # Non-unit-clauses : 194
% # Current number of unprocessed clauses: 45228
% # ...number of literals in the above : 61014
% # Clause-clause subsumption calls (NU) : 18957
% # Rec. Clause-clause subsumption calls : 18957
% # Unit Clause-clause subsumption calls : 263
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4047
% # Indexed BW rewrite successes : 180
% # Backwards rewriting index: 327 leaves, 3.62+/-3.848 terms/leaf
% # Paramod-from index: 178 leaves, 3.10+/-4.113 terms/leaf
% # Paramod-into index: 288 leaves, 3.70+/-3.962 terms/leaf
% # -------------------------------------------------
% # User time : 2.184 s
% # System time : 0.106 s
% # Total time : 2.290 s
% # Maximum resident set size: 0 pages
% PrfWatch: 4.26 CPU 4.41 WC
% FINAL PrfWatch: 4.26 CPU 4.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP24491/KLE170+1.002.tptp
%
%------------------------------------------------------------------------------