TSTP Solution File: KLE144+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE144+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 : 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:12:59 EST 2010
% Result : Theorem 1.41s
% Output : Solution 1.41s
% 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/SystemOnTPTP17549/KLE144+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17549/KLE144+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17549/KLE144+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 17648
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(6, axiom,![X1]:addition(one,multiplication(star(X1),X1))=star(X1),file('/tmp/SRASS.s.p', star_unfold2)).
% fof(7, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(8, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(9, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% 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(14, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(18, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(19, conjecture,![X4]:(leq(strong_iteration(star(X4)),strong_iteration(one))&leq(strong_iteration(one),strong_iteration(star(X4)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:(leq(strong_iteration(star(X4)),strong_iteration(one))&leq(strong_iteration(one),strong_iteration(star(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(34, plain,![X2]:addition(one,multiplication(star(X2),X2))=star(X2),inference(variable_rename,[status(thm)],[6])).
% cnf(35,plain,(addition(one,multiplication(star(X1),X1))=star(X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(37, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[36])).
% cnf(38,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(40, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[9])).
% cnf(43,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[42])).
% fof(46, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(47,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[48])).
% fof(52, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(53,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[52])).
% fof(60, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[18])).
% cnf(61,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[60])).
% fof(62, negated_conjecture,?[X4]:(~(leq(strong_iteration(star(X4)),strong_iteration(one)))|~(leq(strong_iteration(one),strong_iteration(star(X4))))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:(~(leq(strong_iteration(star(X5)),strong_iteration(one)))|~(leq(strong_iteration(one),strong_iteration(star(X5))))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(leq(strong_iteration(star(esk1_0)),strong_iteration(one)))|~(leq(strong_iteration(one),strong_iteration(star(esk1_0))))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(strong_iteration(one),strong_iteration(star(esk1_0)))|~leq(strong_iteration(star(esk1_0)),strong_iteration(one))),inference(split_conjunct,[status(thm)],[64])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[38,53,theory(equality)])).
% cnf(111,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[49,53,theory(equality)])).
% cnf(120,plain,(leq(X1,multiplication(strong_iteration(one),X2))|~leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,43,theory(equality)])).
% cnf(189,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[61,43,theory(equality)])).
% cnf(245,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[38,111,theory(equality)])).
% cnf(251,plain,(addition(one,star(X1))=star(X1)),inference(spm,[status(thm)],[111,35,theory(equality)])).
% cnf(672,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[189,47,theory(equality)])).
% cnf(5230,plain,(leq(X1,multiplication(strong_iteration(one),X2))|$false),inference(rw,[status(thm)],[120,245,theory(equality)])).
% cnf(5231,plain,(leq(X1,multiplication(strong_iteration(one),X2))),inference(cn,[status(thm)],[5230,theory(equality)])).
% cnf(5235,plain,(leq(X1,strong_iteration(one))),inference(spm,[status(thm)],[5231,41,theory(equality)])).
% cnf(5242,plain,(addition(X1,strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[39,5235,theory(equality)])).
% cnf(5243,negated_conjecture,(~leq(strong_iteration(one),strong_iteration(star(esk1_0)))|$false),inference(rw,[status(thm)],[65,5235,theory(equality)])).
% cnf(5244,negated_conjecture,(~leq(strong_iteration(one),strong_iteration(star(esk1_0)))),inference(cn,[status(thm)],[5243,theory(equality)])).
% cnf(5272,plain,(strong_iteration(one)=addition(strong_iteration(one),X1)),inference(spm,[status(thm)],[47,5242,theory(equality)])).
% cnf(5411,plain,(strong_iteration(one)=multiplication(addition(X1,one),strong_iteration(one))),inference(spm,[status(thm)],[672,5272,theory(equality)])).
% cnf(6418,plain,(multiplication(addition(one,X1),strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[5411,47,theory(equality)])).
% cnf(7352,plain,(multiplication(star(X1),strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[6418,251,theory(equality)])).
% cnf(7576,plain,(leq(strong_iteration(one),multiplication(strong_iteration(star(X1)),X2))|~leq(strong_iteration(one),addition(strong_iteration(one),X2))),inference(spm,[status(thm)],[23,7352,theory(equality)])).
% cnf(7610,plain,(leq(strong_iteration(one),multiplication(strong_iteration(star(X1)),X2))|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[7576,5272,theory(equality)]),84,theory(equality)])).
% cnf(7611,plain,(leq(strong_iteration(one),multiplication(strong_iteration(star(X1)),X2))),inference(cn,[status(thm)],[7610,theory(equality)])).
% cnf(16890,plain,(leq(strong_iteration(one),strong_iteration(star(X1)))),inference(spm,[status(thm)],[7611,41,theory(equality)])).
% cnf(16912,negated_conjecture,($false),inference(rw,[status(thm)],[5244,16890,theory(equality)])).
% cnf(16913,negated_conjecture,($false),inference(cn,[status(thm)],[16912,theory(equality)])).
% cnf(16914,negated_conjecture,($false),16913,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 918
% # ...of these trivial : 226
% # ...subsumed : 327
% # ...remaining for further processing: 365
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 62
% # Generated clauses : 9320
% # ...of the previous two non-trivial : 4720
% # Contextual simplify-reflections : 0
% # Paramodulations : 9318
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 301
% # Positive orientable unit clauses: 226
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 72
% # Current number of unprocessed clauses: 3274
% # ...number of literals in the above : 4667
% # Clause-clause subsumption calls (NU) : 1262
% # Rec. Clause-clause subsumption calls : 1262
% # Unit Clause-clause subsumption calls : 45
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 642
% # Indexed BW rewrite successes : 94
% # Backwards rewriting index: 270 leaves, 1.81+/-1.605 terms/leaf
% # Paramod-from index: 145 leaves, 1.59+/-1.587 terms/leaf
% # Paramod-into index: 231 leaves, 1.84+/-1.662 terms/leaf
% # -------------------------------------------------
% # User time : 0.197 s
% # System time : 0.009 s
% # Total time : 0.206 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.46 CPU 0.57 WC
% FINAL PrfWatch: 0.46 CPU 0.57 WC
% SZS output end Solution for /tmp/SystemOnTPTP17549/KLE144+2.tptp
%
%------------------------------------------------------------------------------