TSTP Solution File: KLE010+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE010+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 : art05.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:31:15 EST 2010
% Result : Theorem 24.72s
% Output : Solution 24.72s
% 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/SystemOnTPTP7272/KLE010+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7272/KLE010+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7272/KLE010+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 7368
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% PrfWatch: 7.88 CPU 8.02 WC
% PrfWatch: 9.86 CPU 10.03 WC
% PrfWatch: 11.85 CPU 12.03 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 13.83 CPU 14.04 WC
% PrfWatch: 15.82 CPU 16.04 WC
% PrfWatch: 17.82 CPU 18.05 WC
% PrfWatch: 19.81 CPU 20.05 WC
% PrfWatch: 21.80 CPU 22.06 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]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(6, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(8, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(10, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(11, axiom,![X4]:![X5]:(complement(X5,X4)<=>((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(17, conjecture,![X4]:![X5]:((test(X5)&test(X4))=>one=addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:((test(X5)&test(X4))=>one=addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))),inference(assume_negation,[status(cth)],[17])).
% 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,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(35,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(39, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[10])).
% fof(40, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[40])).
% cnf(43,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[41])).
% fof(44, plain,![X4]:![X5]:((~(complement(X5,X4))|((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one))&(((~(multiplication(X4,X5)=zero)|~(multiplication(X5,X4)=zero))|~(addition(X4,X5)=one))|complement(X5,X4))),inference(fof_nnf,[status(thm)],[11])).
% fof(45, plain,![X6]:![X7]:((~(complement(X7,X6))|((multiplication(X6,X7)=zero&multiplication(X7,X6)=zero)&addition(X6,X7)=one))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X6]:![X7]:((((multiplication(X6,X7)=zero|~(complement(X7,X6)))&(multiplication(X7,X6)=zero|~(complement(X7,X6))))&(addition(X6,X7)=one|~(complement(X7,X6))))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(distribute,[status(thm)],[45])).
% cnf(48,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[46])).
% fof(67, negated_conjecture,?[X4]:?[X5]:((test(X5)&test(X4))&~(one=addition(addition(addition(addition(multiplication(X5,X4),multiplication(c(X5),X4)),multiplication(X4,X5)),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X6]:?[X7]:((test(X7)&test(X6))&~(one=addition(addition(addition(addition(multiplication(X7,X6),multiplication(c(X7),X6)),multiplication(X6,X7)),multiplication(c(X6),X7)),multiplication(c(X6),c(X7))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk2_0))&~(one=addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(one!=addition(addition(addition(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),multiplication(esk2_0,esk3_0)),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0)))),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),multiplication(c(esk2_0),c(esk3_0)))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[70,35,theory(equality)]),21,theory(equality)]),23,theory(equality)]),21,theory(equality)]),23,theory(equality)]),23,theory(equality)])).
% cnf(78,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,25,theory(equality)])).
% cnf(82,plain,(addition(X3,addition(X1,X2))=addition(X1,addition(X2,X3))),inference(spm,[status(thm)],[23,21,theory(equality)])).
% cnf(124,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[33,29,theory(equality)])).
% cnf(147,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(205,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[48,147,theory(equality)])).
% cnf(239,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[205,21,theory(equality)])).
% cnf(240,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(multiplication(one,esk2_0),multiplication(c(esk2_0),c(esk3_0)))))!=one|~test(esk3_0)),inference(spm,[status(thm)],[73,239,theory(equality)])).
% cnf(243,plain,(addition(one,X2)=addition(X1,addition(c(X1),X2))|~test(X1)),inference(spm,[status(thm)],[23,239,theory(equality)])).
% cnf(246,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0)))))!=one|~test(esk3_0)),inference(rw,[status(thm)],[240,31,theory(equality)])).
% cnf(247,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0)))))!=one|$false),inference(rw,[status(thm)],[246,72,theory(equality)])).
% cnf(248,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(c(esk2_0),esk3_0),addition(esk2_0,multiplication(c(esk2_0),c(esk3_0)))))!=one),inference(cn,[status(thm)],[247,theory(equality)])).
% cnf(302,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[78,239,theory(equality)])).
% cnf(324,negated_conjecture,(addition(esk3_0,one)=one),inference(spm,[status(thm)],[302,72,theory(equality)])).
% cnf(325,negated_conjecture,(addition(esk2_0,one)=one),inference(spm,[status(thm)],[302,71,theory(equality)])).
% cnf(329,negated_conjecture,(addition(one,esk3_0)=one),inference(rw,[status(thm)],[324,21,theory(equality)])).
% cnf(335,negated_conjecture,(addition(one,esk2_0)=one),inference(rw,[status(thm)],[325,21,theory(equality)])).
% cnf(352,plain,(addition(X1,addition(X3,addition(X1,X2)))=addition(X3,addition(X1,X2))),inference(spm,[status(thm)],[78,82,theory(equality)])).
% cnf(401,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(c(esk2_0),addition(esk3_0,c(esk3_0)))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[248,82,theory(equality)]),33,theory(equality)]),21,theory(equality)]),82,theory(equality)]),21,theory(equality)])).
% cnf(436,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(c(esk2_0),one)))!=one|~test(esk3_0)),inference(spm,[status(thm)],[401,239,theory(equality)])).
% cnf(440,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))!=one|~test(esk3_0)),inference(rw,[status(thm)],[436,29,theory(equality)])).
% cnf(441,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))!=one|$false),inference(rw,[status(thm)],[440,72,theory(equality)])).
% cnf(442,negated_conjecture,(addition(esk2_0,addition(multiplication(esk2_0,esk3_0),c(esk2_0)))!=one),inference(cn,[status(thm)],[441,theory(equality)])).
% cnf(1107,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[124,21,theory(equality)])).
% cnf(5099,plain,(addition(c(X1),addition(X1,X2))=addition(one,addition(X1,X2))|~test(X1)),inference(spm,[status(thm)],[243,352,theory(equality)])).
% cnf(646362,plain,(addition(X1,addition(X2,c(X1)))=addition(one,addition(X1,X2))|~test(X1)),inference(rw,[status(thm)],[5099,82,theory(equality)])).
% cnf(646401,negated_conjecture,(addition(one,addition(esk2_0,multiplication(esk2_0,esk3_0)))!=one|~test(esk2_0)),inference(spm,[status(thm)],[442,646362,theory(equality)])).
% cnf(647299,negated_conjecture,($false|~test(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[646401,1107,theory(equality)]),21,theory(equality)]),329,theory(equality)]),29,theory(equality)]),335,theory(equality)])).
% cnf(647300,negated_conjecture,($false|$false),inference(rw,[status(thm)],[647299,71,theory(equality)])).
% cnf(647301,negated_conjecture,($false),inference(cn,[status(thm)],[647300,theory(equality)])).
% cnf(647302,negated_conjecture,($false),647301,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 23.79 CPU 24.06 WC
% # Processed clauses : 9828
% # ...of these trivial : 447
% # ...subsumed : 8314
% # ...remaining for further processing: 1067
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 33
% # Backward-rewritten : 115
% # Generated clauses : 321197
% # ...of the previous two non-trivial : 279218
% # Contextual simplify-reflections : 951
% # Paramodulations : 321191
% # Factorizations : 0
% # Equation resolutions : 6
% # Current number of processed clauses: 894
% # Positive orientable unit clauses: 199
% # Positive unorientable unit clauses: 24
% # Negative unit clauses : 50
% # Non-unit-clauses : 621
% # Current number of unprocessed clauses: 247609
% # ...number of literals in the above : 640673
% # Clause-clause subsumption calls (NU) : 46616
% # Rec. Clause-clause subsumption calls : 44312
% # Unit Clause-clause subsumption calls : 759
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 900
% # Indexed BW rewrite successes : 188
% # Backwards rewriting index: 543 leaves, 2.67+/-3.804 terms/leaf
% # Paramod-from index: 358 leaves, 1.78+/-2.120 terms/leaf
% # Paramod-into index: 490 leaves, 2.37+/-3.170 terms/leaf
% # -------------------------------------------------
% # User time : 12.709 s
% # System time : 0.516 s
% # Total time : 13.225 s
% # Maximum resident set size: 0 pages
% PrfWatch: 23.86 CPU 24.12 WC
% FINAL PrfWatch: 23.86 CPU 24.12 WC
% SZS output end Solution for /tmp/SystemOnTPTP7272/KLE010+1.tptp
%
%------------------------------------------------------------------------------