TSTP Solution File: KLE024+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE024+2 : 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:35:37 EST 2010
% Result : Theorem 14.53s
% Output : Solution 14.53s
% 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/SystemOnTPTP8084/KLE024+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8084/KLE024+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8084/KLE024+2.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 8180
% 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
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.88 CPU 10.03 WC
% PrfWatch: 11.87 CPU 12.03 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% 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(9, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(13, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(14, 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(15, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(16, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(18, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(19, conjecture,![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(addition(multiplication(X4,c(X6)),multiplication(c(X5),X4))=multiplication(c(X5),X4)=>multiplication(multiplication(X5,X4),c(X6))=zero)),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(addition(multiplication(X4,c(X6)),multiplication(c(X5),X4))=multiplication(c(X5),X4)=>multiplication(multiplication(X5,X4),c(X6))=zero))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(23,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(26, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),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)],[6])).
% cnf(33,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[32])).
% fof(38, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[9])).
% cnf(39,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[38])).
% fof(49, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[13])).
% fof(50, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(54, 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)],[14])).
% fof(55, 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)],[54])).
% fof(56, 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)],[55])).
% cnf(57,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[56])).
% cnf(59,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[56])).
% cnf(60,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[56])).
% fof(61, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[15])).
% fof(62, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[63])).
% cnf(65,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(67, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(68,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[67])).
% fof(71, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[18])).
% fof(72, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[71])).
% cnf(73,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(75, negated_conjecture,?[X4]:?[X5]:?[X6]:((test(X5)&test(X6))&(addition(multiplication(X4,c(X6)),multiplication(c(X5),X4))=multiplication(c(X5),X4)&~(multiplication(multiplication(X5,X4),c(X6))=zero))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(addition(multiplication(X7,c(X9)),multiplication(c(X8),X7))=multiplication(c(X8),X7)&~(multiplication(multiplication(X8,X7),c(X9))=zero))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk3_0)&test(esk4_0))&(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))=multiplication(c(esk3_0),esk2_0)&~(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))=zero))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))!=zero),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))=multiplication(c(esk3_0),esk2_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(81,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(86,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[58,65,theory(equality)])).
% cnf(87,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[60,65,theory(equality)])).
% cnf(89,plain,(multiplication(esk1_1(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[59,65,theory(equality)])).
% cnf(112,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))!=zero),inference(rw,[status(thm)],[78,31,theory(equality)])).
% cnf(133,plain,(complement(X1,X2)|addition(X1,X2)!=one|multiplication(X2,X1)!=zero|multiplication(X1,X2)!=zero),inference(spm,[status(thm)],[57,23,theory(equality)])).
% cnf(146,plain,(leq(multiplication(X1,X2),multiplication(X1,X3))|multiplication(X1,addition(X2,X3))!=multiplication(X1,X3)),inference(spm,[status(thm)],[73,33,theory(equality)])).
% cnf(547,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[31,87,theory(equality)])).
% cnf(551,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[33,87,theory(equality)])).
% cnf(559,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[551,27,theory(equality)])).
% cnf(861,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|multiplication(X1,esk1_1(X1))!=zero|~test(X1)),inference(spm,[status(thm)],[133,86,theory(equality)])).
% cnf(4140,negated_conjecture,(leq(multiplication(X1,multiplication(esk2_0,c(esk4_0))),multiplication(X1,multiplication(c(esk3_0),esk2_0)))),inference(spm,[status(thm)],[146,79,theory(equality)])).
% cnf(29764,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[559,86,theory(equality)])).
% cnf(29831,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[29764,68,theory(equality)])).
% cnf(31651,negated_conjecture,(multiplication(esk3_0,esk3_0)=esk3_0),inference(spm,[status(thm)],[29831,81,theory(equality)])).
% cnf(31940,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,multiplication(esk3_0,X1))),inference(spm,[status(thm)],[31,31651,theory(equality)])).
% cnf(31955,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero|~test(esk3_0)),inference(spm,[status(thm)],[547,31651,theory(equality)])).
% cnf(32022,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero|$false),inference(rw,[status(thm)],[31955,81,theory(equality)])).
% cnf(32023,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero),inference(cn,[status(thm)],[32022,theory(equality)])).
% cnf(33147,negated_conjecture,(multiplication(esk3_0,esk1_1(esk3_0))=zero),inference(rw,[status(thm)],[32023,31940,theory(equality)])).
% cnf(33154,negated_conjecture,(multiplication(zero,X1)=multiplication(esk3_0,multiplication(esk1_1(esk3_0),X1))),inference(spm,[status(thm)],[31,33147,theory(equality)])).
% cnf(33205,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk1_1(esk3_0),X1))),inference(rw,[status(thm)],[33154,39,theory(equality)])).
% cnf(51851,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|~test(X1)),inference(csr,[status(thm)],[861,87])).
% cnf(51852,plain,(complement(X1,esk1_1(X1))|~test(X1)),inference(csr,[status(thm)],[51851,89])).
% cnf(51856,plain,(c(X1)=esk1_1(X1)|~test(X1)),inference(spm,[status(thm)],[52,51852,theory(equality)])).
% cnf(51965,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),X1))=zero|~test(esk3_0)),inference(spm,[status(thm)],[33205,51856,theory(equality)])).
% cnf(52258,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),X1))=zero|$false),inference(rw,[status(thm)],[51965,81,theory(equality)])).
% cnf(52259,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),X1))=zero),inference(cn,[status(thm)],[52258,theory(equality)])).
% cnf(487954,negated_conjecture,(leq(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))),zero)),inference(spm,[status(thm)],[4140,52259,theory(equality)])).
% cnf(488057,negated_conjecture,(addition(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0))),zero)=zero),inference(spm,[status(thm)],[74,487954,theory(equality)])).
% cnf(488061,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))=zero),inference(rw,[status(thm)],[488057,27,theory(equality)])).
% cnf(488062,negated_conjecture,($false),inference(sr,[status(thm)],[488061,112,theory(equality)])).
% cnf(488063,negated_conjecture,($false),488062,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 15309
% # ...of these trivial : 1685
% # ...subsumed : 11497
% # ...remaining for further processing: 2127
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 33
% # Backward-rewritten : 435
% # Generated clauses : 231263
% # ...of the previous two non-trivial : 155828
% # Contextual simplify-reflections : 1238
% # Paramodulations : 230432
% # Factorizations : 2
% # Equation resolutions : 49
% # Current number of processed clauses: 1659
% # Positive orientable unit clauses: 622
% # Positive unorientable unit clauses: 12
% # Negative unit clauses : 32
% # Non-unit-clauses : 993
% # Current number of unprocessed clauses: 118459
% # ...number of literals in the above : 260698
% # Clause-clause subsumption calls (NU) : 92487
% # Rec. Clause-clause subsumption calls : 90817
% # Unit Clause-clause subsumption calls : 4718
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2743
% # Indexed BW rewrite successes : 513
% # Backwards rewriting index: 1121 leaves, 1.61+/-1.529 terms/leaf
% # Paramod-from index: 600 leaves, 1.55+/-1.214 terms/leaf
% # Paramod-into index: 825 leaves, 1.63+/-1.550 terms/leaf
% # -------------------------------------------------
% # User time : 7.113 s
% # System time : 0.272 s
% # Total time : 7.385 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.72 CPU 14.04 WC
% WARNING: TreeLimitedRun lost 0.03s, total lost is 0.03s
% PrfWatch: 13.72 CPU 14.23 WC
% FINAL PrfWatch: 13.72 CPU 14.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP8084/KLE024+2.tptp
%
%------------------------------------------------------------------------------