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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE072+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 : 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 07:52:43 EST 2010

% Result   : Theorem 0.89s
% Output   : Solution 0.89s
% 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/SystemOnTPTP30716/KLE072+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... found
% SZS status THM for /tmp/SystemOnTPTP30716/KLE072+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30716/KLE072+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 30812
% 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(6, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(8, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(9, axiom,![X4]:![X5]:domain(addition(X4,X5))=addition(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', domain5)).
% fof(18, conjecture,![X4]:![X5]:![X6]:domain(multiplication(addition(X4,X5),domain(X6)))=addition(domain(multiplication(X4,domain(X6))),domain(multiplication(X5,domain(X6)))),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:![X6]:domain(multiplication(addition(X4,X5),domain(X6)))=addition(domain(multiplication(X4,domain(X6))),domain(multiplication(X5,domain(X6))))),inference(assume_negation,[status(cth)],[18])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(34, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[8])).
% cnf(35,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X6]:![X7]:domain(addition(X6,X7))=addition(domain(X6),domain(X7)),inference(variable_rename,[status(thm)],[9])).
% cnf(37,plain,(domain(addition(X1,X2))=addition(domain(X1),domain(X2))),inference(split_conjunct,[status(thm)],[36])).
% fof(55, negated_conjecture,?[X4]:?[X5]:?[X6]:~(domain(multiplication(addition(X4,X5),domain(X6)))=addition(domain(multiplication(X4,domain(X6))),domain(multiplication(X5,domain(X6))))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X7]:?[X8]:?[X9]:~(domain(multiplication(addition(X7,X8),domain(X9)))=addition(domain(multiplication(X7,domain(X9))),domain(multiplication(X8,domain(X9))))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0)))=addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_0))))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0)))!=addition(domain(multiplication(esk1_0,domain(esk3_0))),domain(multiplication(esk2_0,domain(esk3_0))))),inference(split_conjunct,[status(thm)],[57])).
% cnf(110,negated_conjecture,(domain(addition(multiplication(esk1_0,domain(esk3_0)),multiplication(esk2_0,domain(esk3_0))))!=domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0)))),inference(rw,[status(thm)],[58,37,theory(equality)])).
% cnf(235,negated_conjecture,(domain(multiplication(addition(esk1_0,esk2_0),esk3_0))!=domain(multiplication(addition(esk1_0,esk2_0),domain(esk3_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[110,31,theory(equality)]),35,theory(equality)])).
% cnf(236,negated_conjecture,($false),inference(rw,[status(thm)],[235,35,theory(equality)])).
% cnf(237,negated_conjecture,($false),inference(cn,[status(thm)],[236,theory(equality)])).
% cnf(238,negated_conjecture,($false),237,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 27
% # ...of these trivial                : 1
% # ...subsumed                        : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 3
% # Generated clauses                  : 96
% # ...of the previous two non-trivial : 58
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 95
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 22
% #    Positive orientable unit clauses: 18
% #    Positive unorientable unit clauses: 1
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 3
% # Current number of unprocessed clauses: 47
% # ...number of literals in the above : 54
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 16
% # Indexed BW rewrite successes       : 12
% # Backwards rewriting index:    32 leaves,   1.28+/-0.874 terms/leaf
% # Paramod-from index:           17 leaves,   1.18+/-0.513 terms/leaf
% # Paramod-into index:           24 leaves,   1.25+/-0.595 terms/leaf
% # -------------------------------------------------
% # User time              : 0.011 s
% # System time            : 0.003 s
% # Total time             : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP30716/KLE072+1.tptp
% 
%------------------------------------------------------------------------------