TSTP Solution File: KLE015+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE015+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 : art06.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:32:54 EST 2010
% Result : Theorem 1.43s
% Output : Solution 1.43s
% 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/SystemOnTPTP13514/KLE015+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13514/KLE015+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13514/KLE015+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 13610
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(4, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(9, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(11, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(12, 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(13, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(15, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(17, conjecture,![X4]:![X5]:((test(X5)&test(X4))=>multiplication(multiplication(addition(X4,X5),c(X4)),c(X5))=zero),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:((test(X5)&test(X4))=>multiplication(multiplication(addition(X4,X5),c(X4)),c(X5))=zero)),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,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[32])).
% fof(36, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[9])).
% cnf(37,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[36])).
% fof(41, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[11])).
% fof(42, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[42])).
% cnf(45,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[43])).
% fof(46, 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)],[12])).
% fof(47, 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)],[46])).
% fof(48, 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)],[47])).
% cnf(50,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(53, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[13])).
% fof(54, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[54])).
% fof(56, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[55])).
% cnf(57,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(61, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(62,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[16])).
% fof(64, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[64])).
% fof(67, negated_conjecture,?[X4]:?[X5]:((test(X5)&test(X4))&~(multiplication(multiplication(addition(X4,X5),c(X4)),c(X5))=zero)),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X6]:?[X7]:((test(X7)&test(X6))&~(multiplication(multiplication(addition(X6,X7),c(X6)),c(X7))=zero)),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk2_0))&~(multiplication(multiplication(addition(esk2_0,esk3_0),c(esk2_0)),c(esk3_0))=zero)),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(multiplication(multiplication(addition(esk2_0,esk3_0),c(esk2_0)),c(esk3_0))!=zero),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,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[25,21,theory(equality)])).
% cnf(82,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[50,57,theory(equality)])).
% cnf(87,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(97,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,27,theory(equality)])).
% cnf(122,negated_conjecture,(multiplication(addition(esk2_0,esk3_0),multiplication(c(esk2_0),c(esk3_0)))!=zero),inference(rw,[status(thm)],[70,29,theory(equality)])).
% cnf(165,plain,(leq(multiplication(X1,X2),multiplication(X3,X2))|multiplication(addition(X1,X3),X2)!=multiplication(X3,X2)),inference(spm,[status(thm)],[65,33,theory(equality)])).
% cnf(226,plain,(test(c(X1))|~test(X1)),inference(spm,[status(thm)],[58,87,theory(equality)])).
% cnf(227,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[50,87,theory(equality)])).
% cnf(228,plain,(multiplication(c(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[52,87,theory(equality)])).
% cnf(229,plain,(multiplication(X1,c(X1))=zero|~test(X1)),inference(spm,[status(thm)],[51,87,theory(equality)])).
% cnf(237,plain,(addition(multiplication(X1,X2),zero)=multiplication(addition(X1,c(X2)),X2)|~test(X2)),inference(spm,[status(thm)],[33,228,theory(equality)])).
% cnf(243,plain,(multiplication(X1,X2)=multiplication(addition(X1,c(X2)),X2)|~test(X2)),inference(rw,[status(thm)],[237,25,theory(equality)])).
% cnf(264,plain,(zero=multiplication(X1,multiplication(X2,c(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[29,229,theory(equality)])).
% cnf(265,plain,(multiplication(zero,X2)=multiplication(X1,multiplication(c(X1),X2))|~test(X1)),inference(spm,[status(thm)],[29,229,theory(equality)])).
% cnf(273,plain,(zero=multiplication(X1,multiplication(c(X1),X2))|~test(X1)),inference(rw,[status(thm)],[265,37,theory(equality)])).
% cnf(355,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[227,21,theory(equality)])).
% cnf(465,plain,(addition(zero,multiplication(X3,multiplication(c(X1),X2)))=multiplication(addition(X1,X3),multiplication(c(X1),X2))|~test(X1)),inference(spm,[status(thm)],[33,273,theory(equality)])).
% cnf(485,plain,(multiplication(X3,multiplication(c(X1),X2))=multiplication(addition(X1,X3),multiplication(c(X1),X2))|~test(X1)),inference(rw,[status(thm)],[465,73,theory(equality)])).
% cnf(2319,plain,(leq(multiplication(X1,X2),multiplication(addition(X1,X3),X2))),inference(spm,[status(thm)],[165,97,theory(equality)])).
% cnf(2395,plain,(leq(multiplication(X1,X2),multiplication(one,X2))|~test(X1)),inference(spm,[status(thm)],[2319,82,theory(equality)])).
% cnf(2446,plain,(leq(multiplication(X1,X2),X2)|~test(X1)),inference(rw,[status(thm)],[2395,62,theory(equality)])).
% cnf(2967,plain,(addition(multiplication(X1,X2),X2)=X2|~test(X1)),inference(spm,[status(thm)],[66,2446,theory(equality)])).
% cnf(2994,plain,(addition(X2,multiplication(X1,X2))=X2|~test(X1)),inference(rw,[status(thm)],[2967,21,theory(equality)])).
% cnf(6522,plain,(multiplication(one,X1)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[243,355,theory(equality)])).
% cnf(6567,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[6522,62,theory(equality)])).
% cnf(6616,negated_conjecture,(multiplication(esk3_0,esk3_0)=esk3_0),inference(spm,[status(thm)],[6567,72,theory(equality)])).
% cnf(6651,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,multiplication(esk3_0,X1))),inference(spm,[status(thm)],[29,6616,theory(equality)])).
% cnf(9474,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,c(esk3_0)))=zero|~test(esk3_0)),inference(spm,[status(thm)],[264,6616,theory(equality)])).
% cnf(9520,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero|~test(esk3_0)),inference(rw,[status(thm)],[9474,6651,theory(equality)])).
% cnf(9521,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero|$false),inference(rw,[status(thm)],[9520,72,theory(equality)])).
% cnf(9522,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=zero),inference(cn,[status(thm)],[9521,theory(equality)])).
% cnf(9591,negated_conjecture,(addition(zero,multiplication(esk3_0,X1))=multiplication(esk3_0,addition(c(esk3_0),X1))),inference(spm,[status(thm)],[31,9522,theory(equality)])).
% cnf(9626,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,addition(c(esk3_0),X1))),inference(rw,[status(thm)],[9591,73,theory(equality)])).
% cnf(12987,negated_conjecture,(multiplication(esk3_0,c(esk3_0))=multiplication(esk3_0,multiplication(X1,c(esk3_0)))|~test(X1)),inference(spm,[status(thm)],[9626,2994,theory(equality)])).
% cnf(13039,negated_conjecture,(zero=multiplication(esk3_0,multiplication(X1,c(esk3_0)))|~test(X1)),inference(rw,[status(thm)],[12987,9522,theory(equality)])).
% cnf(23173,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk2_0),c(esk3_0)))!=zero|~test(esk2_0)),inference(spm,[status(thm)],[122,485,theory(equality)])).
% cnf(23305,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk2_0),c(esk3_0)))!=zero|$false),inference(rw,[status(thm)],[23173,71,theory(equality)])).
% cnf(23306,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk2_0),c(esk3_0)))!=zero),inference(cn,[status(thm)],[23305,theory(equality)])).
% cnf(23499,negated_conjecture,(~test(c(esk2_0))),inference(spm,[status(thm)],[23306,13039,theory(equality)])).
% cnf(23527,negated_conjecture,(~test(esk2_0)),inference(spm,[status(thm)],[23499,226,theory(equality)])).
% cnf(23535,negated_conjecture,($false),inference(rw,[status(thm)],[23527,71,theory(equality)])).
% cnf(23536,negated_conjecture,($false),inference(cn,[status(thm)],[23535,theory(equality)])).
% cnf(23537,negated_conjecture,($false),23536,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 714
% # ...of these trivial : 98
% # ...subsumed : 265
% # ...remaining for further processing: 351
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 19
% # Generated clauses : 11168
% # ...of the previous two non-trivial : 6553
% # Contextual simplify-reflections : 18
% # Paramodulations : 11155
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 318
% # Positive orientable unit clauses: 198
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 3
% # Non-unit-clauses : 114
% # Current number of unprocessed clauses: 5675
% # ...number of literals in the above : 10824
% # Clause-clause subsumption calls (NU) : 1347
% # Rec. Clause-clause subsumption calls : 1332
% # Unit Clause-clause subsumption calls : 14
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 123
% # Indexed BW rewrite successes : 37
% # Backwards rewriting index: 349 leaves, 1.33+/-0.859 terms/leaf
% # Paramod-from index: 221 leaves, 1.20+/-0.503 terms/leaf
% # Paramod-into index: 307 leaves, 1.30+/-0.762 terms/leaf
% # -------------------------------------------------
% # User time : 0.262 s
% # System time : 0.018 s
% # Total time : 0.280 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.62 CPU 0.71 WC
% FINAL PrfWatch: 0.62 CPU 0.71 WC
% SZS output end Solution for /tmp/SystemOnTPTP13514/KLE015+1.tptp
%
%------------------------------------------------------------------------------