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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : KLE071+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 : art11.cs.miami.edu
% Model    : i686 i686
% CPU      : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory   : 2006MB
% OS       : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 07:57:16 EST 2010

% Result   : Theorem 21.79s
% Output   : Solution 21.79s
% 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/SystemOnTPTP21615/KLE071+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% found
% SZS status THM for /tmp/SystemOnTPTP21615/KLE071+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21615/KLE071+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 21747
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.93 CPU 4.02 WC
% PrfWatch: 5.91 CPU 6.03 WC
% PrfWatch: 7.91 CPU 8.03 WC
% PrfWatch: 9.90 CPU 10.04 WC
% # Preprocessing time     : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.91 CPU 12.05 WC
% PrfWatch: 13.90 CPU 14.05 WC
% PrfWatch: 15.89 CPU 16.06 WC
% PrfWatch: 17.89 CPU 18.06 WC
% PrfWatch: 19.88 CPU 20.07 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% 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(7, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% 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(10, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(15, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(16, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(17, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(18, conjecture,![X4]:![X5]:![X6]:addition(domain(X4),multiplication(domain(X5),domain(X6)))=multiplication(addition(domain(X4),domain(X5)),addition(domain(X4),domain(X6))),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:![X6]:addition(domain(X4),multiplication(domain(X5),domain(X6)))=multiplication(addition(domain(X4),domain(X5)),addition(domain(X4),domain(X6)))),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% 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(32, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[32])).
% 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(38, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[10])).
% cnf(39,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[38])).
% fof(47, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(52, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, negated_conjecture,?[X4]:?[X5]:?[X6]:~(addition(domain(X4),multiplication(domain(X5),domain(X6)))=multiplication(addition(domain(X4),domain(X5)),addition(domain(X4),domain(X6)))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X7]:?[X8]:?[X9]:~(addition(domain(X7),multiplication(domain(X8),domain(X9)))=multiplication(addition(domain(X7),domain(X8)),addition(domain(X7),domain(X9)))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(addition(domain(esk1_0),multiplication(domain(esk2_0),domain(esk3_0)))=multiplication(addition(domain(esk1_0),domain(esk2_0)),addition(domain(esk1_0),domain(esk3_0)))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(addition(domain(esk1_0),multiplication(domain(esk2_0),domain(esk3_0)))!=multiplication(addition(domain(esk1_0),domain(esk2_0)),addition(domain(esk1_0),domain(esk3_0)))),inference(split_conjunct,[status(thm)],[57])).
% cnf(64,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[39,21,theory(equality)])).
% cnf(78,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,25,theory(equality)])).
% cnf(110,negated_conjecture,(multiplication(domain(addition(esk1_0,esk2_0)),domain(addition(esk1_0,esk3_0)))!=addition(domain(esk1_0),multiplication(domain(esk2_0),domain(esk3_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[58,37,theory(equality)]),37,theory(equality)])).
% cnf(117,plain,(addition(domain(X1),domain(multiplication(X2,X3)))=domain(addition(X1,multiplication(X2,domain(X3))))),inference(spm,[status(thm)],[37,35,theory(equality)])).
% cnf(120,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[35,50,theory(equality)])).
% cnf(123,plain,(domain(addition(X1,multiplication(X2,X3)))=domain(addition(X1,multiplication(X2,domain(X3))))),inference(rw,[status(thm)],[117,37,theory(equality)])).
% cnf(127,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[120,50,theory(equality)])).
% cnf(213,plain,(addition(domain(X1),domain(X2))=domain(addition(domain(X1),X2))),inference(spm,[status(thm)],[37,127,theory(equality)])).
% cnf(216,plain,(addition(domain(X1),domain(X2))=domain(addition(X1,domain(X2)))),inference(spm,[status(thm)],[37,127,theory(equality)])).
% cnf(219,plain,(domain(addition(X1,X2))=domain(addition(domain(X1),X2))),inference(rw,[status(thm)],[213,37,theory(equality)])).
% cnf(221,plain,(domain(addition(X1,X2))=domain(addition(X1,domain(X2)))),inference(rw,[status(thm)],[216,37,theory(equality)])).
% cnf(517,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,78,theory(equality)])).
% cnf(573,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[517,21,theory(equality)])).
% cnf(587,plain,(leq(multiplication(X1,X2),multiplication(X1,addition(X3,X2)))),inference(spm,[status(thm)],[573,29,theory(equality)])).
% cnf(588,plain,(leq(multiplication(X1,X2),multiplication(addition(X3,X1),X2))),inference(spm,[status(thm)],[573,31,theory(equality)])).
% cnf(753,plain,(domain(multiplication(X1,domain(addition(X2,X3))))=domain(multiplication(X1,addition(X2,domain(X3))))),inference(spm,[status(thm)],[35,221,theory(equality)])).
% cnf(780,plain,(domain(multiplication(X1,addition(X2,X3)))=domain(multiplication(X1,addition(X2,domain(X3))))),inference(rw,[status(thm)],[753,35,theory(equality)])).
% cnf(5360,plain,(leq(multiplication(X1,domain(X2)),multiplication(X1,one))),inference(spm,[status(thm)],[587,64,theory(equality)])).
% cnf(5393,plain,(leq(multiplication(X1,domain(X2)),X1)),inference(rw,[status(thm)],[5360,48,theory(equality)])).
% cnf(5411,plain,(addition(multiplication(X1,domain(X2)),X1)=X1),inference(spm,[status(thm)],[54,5393,theory(equality)])).
% cnf(5455,plain,(addition(X1,multiplication(X1,domain(X2)))=X1),inference(rw,[status(thm)],[5411,21,theory(equality)])).
% cnf(5470,plain,(domain(domain(X1))=domain(addition(X1,multiplication(domain(X1),domain(X2))))),inference(spm,[status(thm)],[219,5455,theory(equality)])).
% cnf(5480,plain,(addition(X1,X3)=addition(X1,addition(multiplication(X1,domain(X2)),X3))),inference(spm,[status(thm)],[23,5455,theory(equality)])).
% cnf(5557,plain,(domain(X1)=domain(addition(X1,multiplication(domain(X1),domain(X2))))),inference(rw,[status(thm)],[5470,127,theory(equality)])).
% cnf(5558,plain,(domain(X1)=domain(addition(X1,multiplication(domain(X1),X2)))),inference(rw,[status(thm)],[5557,123,theory(equality)])).
% cnf(7292,plain,(leq(multiplication(domain(X1),X2),multiplication(one,X2))),inference(spm,[status(thm)],[588,64,theory(equality)])).
% cnf(7327,plain,(leq(multiplication(domain(X1),X2),X2)),inference(rw,[status(thm)],[7292,50,theory(equality)])).
% cnf(7348,plain,(addition(multiplication(domain(X1),X2),X2)=X2),inference(spm,[status(thm)],[54,7327,theory(equality)])).
% cnf(7401,plain,(addition(X2,multiplication(domain(X1),X2))=X2),inference(rw,[status(thm)],[7348,21,theory(equality)])).
% cnf(7500,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[33,7401,theory(equality)])).
% cnf(7602,plain,(addition(X1,multiplication(X2,X1))=multiplication(addition(domain(X1),X2),X1)),inference(spm,[status(thm)],[31,7500,theory(equality)])).
% cnf(7610,plain,(addition(multiplication(domain(X1),X2),X1)=multiplication(domain(X1),addition(X2,X1))),inference(spm,[status(thm)],[29,7500,theory(equality)])).
% cnf(7683,plain,(addition(X1,multiplication(domain(X1),X2))=multiplication(domain(X1),addition(X2,X1))),inference(rw,[status(thm)],[7610,21,theory(equality)])).
% cnf(8297,plain,(multiplication(domain(addition(X1,X2)),X1)=addition(X1,multiplication(domain(X2),X1))),inference(spm,[status(thm)],[7602,37,theory(equality)])).
% cnf(8372,plain,(multiplication(domain(addition(X1,X2)),X1)=X1),inference(rw,[status(thm)],[8297,7401,theory(equality)])).
% cnf(8406,plain,(multiplication(domain(domain(X1)),domain(addition(X2,X1)))=addition(domain(X1),multiplication(domain(domain(X1)),domain(X2)))),inference(spm,[status(thm)],[7683,37,theory(equality)])).
% cnf(8414,plain,(multiplication(domain(multiplication(domain(X1),X2)),X2)=addition(multiplication(domain(X1),X2),multiplication(domain(multiplication(domain(X1),X2)),X2))),inference(spm,[status(thm)],[7683,7401,theory(equality)])).
% cnf(8487,plain,(multiplication(domain(X1),domain(addition(X2,X1)))=addition(domain(X1),multiplication(domain(domain(X1)),domain(X2)))),inference(rw,[status(thm)],[8406,127,theory(equality)])).
% cnf(8488,plain,(multiplication(domain(X1),domain(addition(X2,X1)))=domain(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8487,127,theory(equality)]),5455,theory(equality)])).
% cnf(8496,plain,(multiplication(domain(multiplication(domain(X1),X2)),X2)=multiplication(domain(X1),X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8414,31,theory(equality)]),37,theory(equality)]),5558,theory(equality)])).
% cnf(8727,plain,(addition(X1,multiplication(domain(addition(X1,X2)),X3))=multiplication(domain(addition(X1,X2)),addition(X1,X3))),inference(spm,[status(thm)],[29,8372,theory(equality)])).
% cnf(9859,plain,(multiplication(domain(multiplication(domain(X1),X2)),domain(X2))=domain(multiplication(domain(X1),X2))),inference(spm,[status(thm)],[8488,7401,theory(equality)])).
% cnf(17975,plain,(multiplication(domain(multiplication(domain(X1),X2)),domain(X2))=multiplication(domain(X1),domain(X2))),inference(spm,[status(thm)],[8496,35,theory(equality)])).
% cnf(37523,plain,(addition(X1,multiplication(addition(X1,X3),domain(X2)))=addition(X1,multiplication(X3,domain(X2)))),inference(spm,[status(thm)],[5480,31,theory(equality)])).
% cnf(63638,plain,(domain(multiplication(domain(X1),X2))=multiplication(domain(X1),domain(X2))),inference(rw,[status(thm)],[17975,9859,theory(equality)])).
% cnf(63720,plain,(addition(domain(X1),multiplication(domain(X2),domain(X3)))=domain(addition(X1,multiplication(domain(X2),X3)))),inference(spm,[status(thm)],[37,63638,theory(equality)])).
% cnf(80255,negated_conjecture,(domain(addition(esk1_0,multiplication(domain(esk2_0),esk3_0)))!=multiplication(domain(addition(esk1_0,esk2_0)),domain(addition(esk1_0,esk3_0)))),inference(rw,[status(thm)],[110,63720,theory(equality)])).
% cnf(108825,plain,(domain(addition(X1,multiplication(domain(addition(X1,X2)),domain(X3))))=domain(multiplication(domain(addition(X1,X2)),addition(X1,X3)))),inference(spm,[status(thm)],[780,8727,theory(equality)])).
% cnf(109161,plain,(domain(addition(X1,multiplication(domain(addition(X1,X2)),X3)))=domain(multiplication(domain(addition(X1,X2)),addition(X1,X3)))),inference(rw,[status(thm)],[108825,123,theory(equality)])).
% cnf(109162,plain,(domain(addition(X1,multiplication(domain(addition(X1,X2)),X3)))=multiplication(domain(addition(X1,X2)),domain(addition(X1,X3)))),inference(rw,[status(thm)],[109161,63638,theory(equality)])).
% cnf(139887,plain,(addition(domain(X1),multiplication(domain(addition(X1,X2)),domain(X3)))=addition(domain(X1),multiplication(domain(X2),domain(X3)))),inference(spm,[status(thm)],[37523,37,theory(equality)])).
% cnf(140360,plain,(domain(addition(X1,multiplication(domain(addition(X1,X2)),X3)))=addition(domain(X1),multiplication(domain(X2),domain(X3)))),inference(rw,[status(thm)],[139887,63720,theory(equality)])).
% cnf(140361,plain,(domain(addition(X1,multiplication(domain(addition(X1,X2)),X3)))=domain(addition(X1,multiplication(domain(X2),X3)))),inference(rw,[status(thm)],[140360,63720,theory(equality)])).
% cnf(785066,plain,(multiplication(domain(addition(X1,X2)),domain(addition(X1,X3)))=domain(addition(X1,multiplication(domain(X2),X3)))),inference(rw,[status(thm)],[140361,109162,theory(equality)])).
% cnf(785859,negated_conjecture,($false),inference(rw,[status(thm)],[80255,785066,theory(equality)])).
% cnf(785860,negated_conjecture,($false),inference(cn,[status(thm)],[785859,theory(equality)])).
% cnf(785861,negated_conjecture,($false),785860,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 15153
% # ...of these trivial                : 5086
% # ...subsumed                        : 8779
% # ...remaining for further processing: 1288
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 0
% # Backward-rewritten                 : 137
% # Generated clauses                  : 395592
% # ...of the previous two non-trivial : 217197
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 395591
% # Factorizations                     : 0
% # Equation resolutions               : 1
% # Current number of processed clauses: 1151
% #    Positive orientable unit clauses: 888
% #    Positive unorientable unit clauses: 11
% #    Negative unit clauses           : 0
% #    Non-unit-clauses                : 252
% # Current number of unprocessed clauses: 184690
% # ...number of literals in the above : 226454
% # Clause-clause subsumption calls (NU) : 76213
% # Rec. Clause-clause subsumption calls : 76213
% # Unit Clause-clause subsumption calls : 106
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 8862
% # Indexed BW rewrite successes       : 318
% # Backwards rewriting index:   416 leaves,   4.82+/-6.887 terms/leaf
% # Paramod-from index:          268 leaves,   3.38+/-4.497 terms/leaf
% # Paramod-into index:          351 leaves,   4.77+/-6.343 terms/leaf
% # -------------------------------------------------
% # User time              : 10.765 s
% # System time            : 0.407 s
% # Total time             : 11.172 s
% # Maximum resident set size: 0 pages
% PrfWatch: 20.70 CPU 20.91 WC
% FINAL PrfWatch: 20.70 CPU 20.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP21615/KLE071+1.tptp
% 
%------------------------------------------------------------------------------