TSTP Solution File: KLE027+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE027+4 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art09.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:36:51 EST 2010
% Result : Theorem 38.92s
% Output : Solution 38.92s
% 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/SystemOnTPTP30120/KLE027+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30120/KLE027+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30120/KLE027+4.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 30216
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.87 CPU 10.03 WC
% PrfWatch: 11.86 CPU 12.03 WC
% PrfWatch: 13.83 CPU 14.04 WC
% PrfWatch: 15.82 CPU 16.04 WC
% PrfWatch: 17.81 CPU 18.05 WC
% PrfWatch: 19.79 CPU 20.05 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 21.49 CPU 22.09 WC
% PrfWatch: 23.11 CPU 24.09 WC
% PrfWatch: 25.07 CPU 26.10 WC
% PrfWatch: 27.07 CPU 28.10 WC
% PrfWatch: 29.06 CPU 30.11 WC
% PrfWatch: 31.05 CPU 32.11 WC
% PrfWatch: 33.03 CPU 34.11 WC
% PrfWatch: 35.03 CPU 36.12 WC
% PrfWatch: 37.02 CPU 38.12 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X3]:![X4]:(leq(X3,X4)<=>addition(X3,X4)=X4),file('/tmp/SRASS.s.p', order)).
% fof(4, axiom,![X3]:![X4]:![X5]:multiplication(X3,addition(X4,X5))=addition(multiplication(X3,X4),multiplication(X3,X5)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(5, axiom,![X3]:![X4]:![X5]:multiplication(addition(X3,X4),X5)=addition(multiplication(X3,X5),multiplication(X4,X5)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(6, axiom,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(8, axiom,![X3]:addition(X3,X3)=X3,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(9, axiom,![X3]:![X4]:![X5]:multiplication(X3,multiplication(X4,X5))=multiplication(multiplication(X3,X4),X5),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(11, axiom,![X1]:![X2]:(test(X1)=>(c(X1)=X2<=>complement(X1,X2))),file('/tmp/SRASS.s.p', test_3)).
% fof(14, axiom,![X3]:multiplication(one,X3)=X3,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(15, axiom,![X3]:addition(X3,zero)=X3,file('/tmp/SRASS.s.p', additive_identity)).
% fof(17, axiom,![X3]:multiplication(zero,X3)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(18, axiom,![X1]:![X2]:(complement(X2,X1)<=>((multiplication(X1,X2)=zero&multiplication(X2,X1)=zero)&addition(X1,X2)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(19, conjecture,![X1]:![X2]:![X6]:![X7]:![X8]:((test(X7)&test(X8))=>(leq(addition(multiplication(X7,addition(multiplication(X7,X1),multiplication(c(X7),X2))),multiplication(c(X7),X6)),addition(multiplication(X7,X1),multiplication(c(X7),X6)))&leq(addition(multiplication(X7,X1),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X1),multiplication(c(X7),X2))),multiplication(c(X7),X6))))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X1]:![X2]:![X6]:![X7]:![X8]:((test(X7)&test(X8))=>(leq(addition(multiplication(X7,addition(multiplication(X7,X1),multiplication(c(X7),X2))),multiplication(c(X7),X6)),addition(multiplication(X7,X1),multiplication(c(X7),X6)))&leq(addition(multiplication(X7,X1),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X1),multiplication(c(X7),X2))),multiplication(c(X7),X6)))))),inference(assume_negation,[status(cth)],[19])).
% fof(28, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X5]:![X6]:((~(leq(X5,X6))|addition(X5,X6)=X6)&(~(addition(X5,X6)=X6)|leq(X5,X6))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[29])).
% fof(32, plain,![X6]:![X7]:![X8]:multiplication(X6,addition(X7,X8))=addition(multiplication(X6,X7),multiplication(X6,X8)),inference(variable_rename,[status(thm)],[4])).
% cnf(33,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X6]:![X7]:![X8]:multiplication(addition(X6,X7),X8)=addition(multiplication(X6,X8),multiplication(X7,X8)),inference(variable_rename,[status(thm)],[5])).
% cnf(35,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[6])).
% cnf(37,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X4]:addition(X4,X4)=X4,inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X6]:![X7]:![X8]:multiplication(X6,multiplication(X7,X8))=multiplication(multiplication(X6,X7),X8),inference(variable_rename,[status(thm)],[9])).
% cnf(43,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[42])).
% fof(47, plain,![X1]:![X2]:(~(test(X1))|((~(c(X1)=X2)|complement(X1,X2))&(~(complement(X1,X2))|c(X1)=X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(48, plain,![X3]:![X4]:(~(test(X3))|((~(c(X3)=X4)|complement(X3,X4))&(~(complement(X3,X4))|c(X3)=X4))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:(((~(c(X3)=X4)|complement(X3,X4))|~(test(X3)))&((~(complement(X3,X4))|c(X3)=X4)|~(test(X3)))),inference(distribute,[status(thm)],[48])).
% cnf(51,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[49])).
% fof(60, plain,![X4]:multiplication(one,X4)=X4,inference(variable_rename,[status(thm)],[14])).
% cnf(61,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[60])).
% fof(62, plain,![X4]:addition(X4,zero)=X4,inference(variable_rename,[status(thm)],[15])).
% cnf(63,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[62])).
% fof(66, plain,![X4]:multiplication(zero,X4)=zero,inference(variable_rename,[status(thm)],[17])).
% cnf(67,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[66])).
% fof(68, plain,![X1]:![X2]:((~(complement(X2,X1))|((multiplication(X1,X2)=zero&multiplication(X2,X1)=zero)&addition(X1,X2)=one))&(((~(multiplication(X1,X2)=zero)|~(multiplication(X2,X1)=zero))|~(addition(X1,X2)=one))|complement(X2,X1))),inference(fof_nnf,[status(thm)],[18])).
% fof(69, plain,![X3]:![X4]:((~(complement(X4,X3))|((multiplication(X3,X4)=zero&multiplication(X4,X3)=zero)&addition(X3,X4)=one))&(((~(multiplication(X3,X4)=zero)|~(multiplication(X4,X3)=zero))|~(addition(X3,X4)=one))|complement(X4,X3))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X3]:![X4]:((((multiplication(X3,X4)=zero|~(complement(X4,X3)))&(multiplication(X4,X3)=zero|~(complement(X4,X3))))&(addition(X3,X4)=one|~(complement(X4,X3))))&(((~(multiplication(X3,X4)=zero)|~(multiplication(X4,X3)=zero))|~(addition(X3,X4)=one))|complement(X4,X3))),inference(distribute,[status(thm)],[69])).
% cnf(72,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% cnf(73,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% cnf(74,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% fof(75, negated_conjecture,?[X1]:?[X2]:?[X6]:?[X7]:?[X8]:((test(X7)&test(X8))&(~(leq(addition(multiplication(X7,addition(multiplication(X7,X1),multiplication(c(X7),X2))),multiplication(c(X7),X6)),addition(multiplication(X7,X1),multiplication(c(X7),X6))))|~(leq(addition(multiplication(X7,X1),multiplication(c(X7),X6)),addition(multiplication(X7,addition(multiplication(X7,X1),multiplication(c(X7),X2))),multiplication(c(X7),X6)))))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:((test(X12)&test(X13))&(~(leq(addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)),addition(multiplication(X12,X9),multiplication(c(X12),X11))))|~(leq(addition(multiplication(X12,X9),multiplication(c(X12),X11)),addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11)))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk5_0)&test(esk6_0))&(~(leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0))))|~(leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)))|~leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(test(esk5_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(82,plain,(leq(X1,X1)),inference(spm,[status(thm)],[30,41,theory(equality)])).
% cnf(83,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(133,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0))),multiplication(c(esk5_0),esk4_0)),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[78,37,theory(equality)])).
% cnf(134,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[133,37,theory(equality)])).
% cnf(236,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[72,83,theory(equality)])).
% cnf(237,plain,(multiplication(c(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[74,83,theory(equality)])).
% cnf(238,plain,(multiplication(X1,c(X1))=zero|~test(X1)),inference(spm,[status(thm)],[73,83,theory(equality)])).
% cnf(4287,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[236,37,theory(equality)])).
% cnf(10977,negated_conjecture,(multiplication(c(esk5_0),esk5_0)=zero),inference(spm,[status(thm)],[237,80,theory(equality)])).
% cnf(11100,negated_conjecture,(addition(multiplication(X1,esk5_0),zero)=multiplication(addition(X1,c(esk5_0)),esk5_0)),inference(spm,[status(thm)],[35,10977,theory(equality)])).
% cnf(11128,negated_conjecture,(multiplication(X1,esk5_0)=multiplication(addition(X1,c(esk5_0)),esk5_0)),inference(rw,[status(thm)],[11100,63,theory(equality)])).
% cnf(11720,negated_conjecture,(multiplication(esk5_0,c(esk5_0))=zero),inference(spm,[status(thm)],[238,80,theory(equality)])).
% cnf(11837,negated_conjecture,(multiplication(zero,X1)=multiplication(esk5_0,multiplication(c(esk5_0),X1))),inference(spm,[status(thm)],[43,11720,theory(equality)])).
% cnf(11862,negated_conjecture,(zero=multiplication(esk5_0,multiplication(c(esk5_0),X1))),inference(rw,[status(thm)],[11837,67,theory(equality)])).
% cnf(13827,negated_conjecture,(addition(multiplication(esk5_0,X1),zero)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(spm,[status(thm)],[33,11862,theory(equality)])).
% cnf(13872,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(rw,[status(thm)],[13827,63,theory(equality)])).
% cnf(14082,negated_conjecture,(multiplication(one,esk5_0)=multiplication(esk5_0,esk5_0)|~test(esk5_0)),inference(spm,[status(thm)],[11128,4287,theory(equality)])).
% cnf(14124,negated_conjecture,(esk5_0=multiplication(esk5_0,esk5_0)|~test(esk5_0)),inference(rw,[status(thm)],[14082,61,theory(equality)])).
% cnf(14125,negated_conjecture,(esk5_0=multiplication(esk5_0,esk5_0)|$false),inference(rw,[status(thm)],[14124,80,theory(equality)])).
% cnf(14126,negated_conjecture,(esk5_0=multiplication(esk5_0,esk5_0)),inference(cn,[status(thm)],[14125,theory(equality)])).
% cnf(14129,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,multiplication(esk5_0,X1))),inference(spm,[status(thm)],[43,14126,theory(equality)])).
% cnf(14557,negated_conjecture,(addition(multiplication(esk5_0,X1),multiplication(esk5_0,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(spm,[status(thm)],[33,14129,theory(equality)])).
% cnf(14590,negated_conjecture,(multiplication(esk5_0,addition(X1,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(rw,[status(thm)],[14557,33,theory(equality)])).
% cnf(148086,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[134,14590,theory(equality)])).
% cnf(148087,negated_conjecture,(~leq(addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)),addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))))|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[148086,14590,theory(equality)])).
% cnf(1196859,negated_conjecture,($false|~leq(addition(multiplication(c(esk5_0),esk4_0),multiplication(esk5_0,addition(esk2_0,multiplication(c(esk5_0),esk3_0)))),addition(multiplication(esk5_0,esk2_0),multiplication(c(esk5_0),esk4_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[148087,13872,theory(equality)]),37,theory(equality)]),82,theory(equality)])).
% cnf(1196860,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1196859,13872,theory(equality)]),37,theory(equality)]),82,theory(equality)])).
% cnf(1196861,negated_conjecture,($false),inference(cn,[status(thm)],[1196860,theory(equality)])).
% cnf(1196862,negated_conjecture,($false),1196861,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 27868
% # ...of these trivial : 2297
% # ...subsumed : 22549
% # ...remaining for further processing: 3022
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 104
% # Backward-rewritten : 443
% # Generated clauses : 556831
% # ...of the previous two non-trivial : 410592
% # Contextual simplify-reflections : 2493
% # Paramodulations : 556745
% # Factorizations : 2
% # Equation resolutions : 84
% # Current number of processed clauses: 2475
% # Positive orientable unit clauses: 794
% # Positive unorientable unit clauses: 21
% # Negative unit clauses : 0
% # Non-unit-clauses : 1660
% # Current number of unprocessed clauses: 350851
% # ...number of literals in the above : 822233
% # Clause-clause subsumption calls (NU) : 199431
% # Rec. Clause-clause subsumption calls : 193422
% # Unit Clause-clause subsumption calls : 635
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2964
% # Indexed BW rewrite successes : 544
% # Backwards rewriting index: 1375 leaves, 2.10+/-3.277 terms/leaf
% # Paramod-from index: 756 leaves, 1.69+/-1.365 terms/leaf
% # Paramod-into index: 958 leaves, 1.97+/-2.193 terms/leaf
% # -------------------------------------------------
% # User time : 19.693 s
% # System time : 0.834 s
% # Total time : 20.527 s
% # Maximum resident set size: 0 pages
% PrfWatch: 38.03 CPU 39.14 WC
% FINAL PrfWatch: 38.03 CPU 39.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP30120/KLE027+4.tptp
%
%------------------------------------------------------------------------------