TSTP Solution File: KLE037+1 by SRASS---0.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE037+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 : art02.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 07:43:01 EST 2010

% Result   : Theorem 1.06s
% Output   : Solution 1.06s
% 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/SystemOnTPTP12558/KLE037+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP12558/KLE037+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12558/KLE037+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 12654
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:leq(addition(one,multiplication(X1,star(X1))),star(X1)),file('/tmp/SRASS.s.p', star_unfold_right)).
% fof(6, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% 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,![X4]:leq(one,star(X4)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:leq(one,star(X4))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X2]:leq(addition(one,multiplication(X2,star(X2))),star(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(leq(addition(one,multiplication(X1,star(X1))),star(X1))),inference(split_conjunct,[status(thm)],[19])).
% 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,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(34, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[33])).
% cnf(35,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[34])).
% cnf(36,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[34])).
% fof(41, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[10])).
% cnf(42,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[11])).
% cnf(44,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[12])).
% cnf(46,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(48,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(55, negated_conjecture,?[X4]:~(leq(one,star(X4))),inference(fof_nnf,[status(thm)],[18])).
% fof(56, negated_conjecture,?[X5]:~(leq(one,star(X5))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(leq(one,star(esk1_0))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(~leq(one,star(esk1_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(88,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[46,48,theory(equality)])).
% cnf(167,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[42,32,theory(equality)])).
% cnf(191,plain,(addition(addition(one,multiplication(X1,star(X1))),star(X1))=star(X1)),inference(spm,[status(thm)],[36,20,theory(equality)])).
% cnf(195,plain,(addition(one,addition(multiplication(X1,star(X1)),star(X1)))=star(X1)),inference(rw,[status(thm)],[191,46,theory(equality)])).
% cnf(259,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[35,88,theory(equality)])).
% cnf(1365,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[167,44,theory(equality)])).
% cnf(7648,plain,(addition(one,multiplication(addition(X1,one),star(X1)))=star(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[195,44,theory(equality)]),1365,theory(equality)])).
% cnf(7654,plain,(leq(one,star(X1))),inference(spm,[status(thm)],[259,7648,theory(equality)])).
% cnf(7905,negated_conjecture,($false),inference(rw,[status(thm)],[58,7654,theory(equality)])).
% cnf(7906,negated_conjecture,($false),inference(cn,[status(thm)],[7905,theory(equality)])).
% cnf(7907,negated_conjecture,($false),7906,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 646
% # ...of these trivial                : 219
% # ...subsumed                        : 239
% # ...remaining for further processing: 188
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 56
% # Generated clauses                  : 4667
% # ...of the previous two non-trivial : 3044
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 4666
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 132
% #    Positive orientable unit clauses: 78
% #    Positive unorientable unit clauses: 3
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 51
% # Current number of unprocessed clauses: 1943
% # ...number of literals in the above : 2750
% # Clause-clause subsumption calls (NU) : 1397
% # Rec. Clause-clause subsumption calls : 1397
% # Unit Clause-clause subsumption calls : 20
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 255
% # Indexed BW rewrite successes       : 41
% # Backwards rewriting index:   106 leaves,   2.18+/-1.715 terms/leaf
% # Paramod-from index:           41 leaves,   2.02+/-1.554 terms/leaf
% # Paramod-into index:           87 leaves,   2.22+/-1.777 terms/leaf
% # -------------------------------------------------
% # User time              : 0.109 s
% # System time            : 0.005 s
% # Total time             : 0.114 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.35 WC
% FINAL PrfWatch: 0.27 CPU 0.35 WC
% SZS output end Solution for /tmp/SystemOnTPTP12558/KLE037+1.tptp
% 
%------------------------------------------------------------------------------