TSTP Solution File: KLE025+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE025+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 : art02.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:49 EST 2010
% Result : Theorem 3.79s
% Output : Solution 3.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/SystemOnTPTP8710/KLE025+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8710/KLE025+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8710/KLE025+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 8806
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.92 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(5, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(6, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_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(9, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(10, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(11, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(12, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(13, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(15, 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]:![X6]:((test(X5)&test(X6))=>(multiplication(multiplication(X5,X4),c(X6))=zero=>multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(multiplication(multiplication(X5,X4),c(X6))=zero=>multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(29, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[5])).
% fof(30, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[30])).
% cnf(33,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[31])).
% fof(34, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(35,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(39,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[10])).
% cnf(43,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[42])).
% fof(44, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(45,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(46, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[12])).
% fof(47, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[46])).
% fof(48, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[47])).
% fof(49, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[48])).
% cnf(50,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[49])).
% fof(52, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(53,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(55,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[54])).
% fof(56, 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)],[15])).
% fof(57, 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)],[56])).
% fof(58, 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)],[57])).
% cnf(60,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% cnf(62,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(67, negated_conjecture,?[X4]:?[X5]:?[X6]:((test(X5)&test(X6))&(multiplication(multiplication(X5,X4),c(X6))=zero&~(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(multiplication(multiplication(X8,X7),c(X9))=zero&~(multiplication(X8,X7)=multiplication(multiplication(X8,X7),X9)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk4_0))&(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))=zero&~(multiplication(esk3_0,esk2_0)=multiplication(multiplication(esk3_0,esk2_0),esk4_0)))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(multiplication(esk3_0,esk2_0)!=multiplication(multiplication(esk3_0,esk2_0),esk4_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))=zero),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(test(esk4_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(76,negated_conjecture,(complement(esk1_1(esk4_0),esk4_0)),inference(spm,[status(thm)],[50,72,theory(equality)])).
% cnf(78,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(105,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))=zero),inference(rw,[status(thm)],[71,21,theory(equality)])).
% cnf(106,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,esk4_0))!=multiplication(esk3_0,esk2_0)),inference(rw,[status(thm)],[70,21,theory(equality)])).
% cnf(122,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[43,45,theory(equality)])).
% cnf(127,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[35,41,theory(equality)])).
% cnf(148,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[37,53,theory(equality)])).
% cnf(178,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[39,55,theory(equality)])).
% cnf(204,negated_conjecture,(multiplication(esk4_0,esk1_1(esk4_0))=zero),inference(spm,[status(thm)],[62,76,theory(equality)])).
% cnf(205,negated_conjecture,(addition(esk4_0,esk1_1(esk4_0))=one),inference(spm,[status(thm)],[60,76,theory(equality)])).
% cnf(221,negated_conjecture,(addition(multiplication(esk4_0,X1),zero)=multiplication(esk4_0,addition(X1,esk1_1(esk4_0)))),inference(spm,[status(thm)],[37,204,theory(equality)])).
% cnf(225,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,addition(X1,esk1_1(esk4_0)))),inference(rw,[status(thm)],[221,35,theory(equality)])).
% cnf(254,negated_conjecture,(complement(esk4_0,c(esk4_0))),inference(spm,[status(thm)],[78,72,theory(equality)])).
% cnf(310,negated_conjecture,(test(c(esk4_0))),inference(spm,[status(thm)],[51,254,theory(equality)])).
% cnf(312,negated_conjecture,(addition(c(esk4_0),esk4_0)=one),inference(spm,[status(thm)],[60,254,theory(equality)])).
% cnf(316,negated_conjecture,(complement(esk1_1(c(esk4_0)),c(esk4_0))),inference(spm,[status(thm)],[50,310,theory(equality)])).
% cnf(385,negated_conjecture,(addition(zero,multiplication(esk3_0,X1))=multiplication(esk3_0,addition(multiplication(esk2_0,c(esk4_0)),X1))),inference(spm,[status(thm)],[37,105,theory(equality)])).
% cnf(393,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,addition(multiplication(esk2_0,c(esk4_0)),X1))),inference(rw,[status(thm)],[385,127,theory(equality)])).
% cnf(416,negated_conjecture,(addition(esk4_0,c(esk4_0))=one),inference(rw,[status(thm)],[312,41,theory(equality)])).
% cnf(532,negated_conjecture,(addition(c(esk4_0),esk1_1(c(esk4_0)))=one),inference(spm,[status(thm)],[60,316,theory(equality)])).
% cnf(551,negated_conjecture,(addition(esk4_0,one)=one),inference(spm,[status(thm)],[122,205,theory(equality)])).
% cnf(593,negated_conjecture,(addition(one,esk4_0)=one),inference(rw,[status(thm)],[551,41,theory(equality)])).
% cnf(843,negated_conjecture,(addition(c(esk4_0),one)=one),inference(spm,[status(thm)],[122,532,theory(equality)])).
% cnf(856,negated_conjecture,(addition(one,c(esk4_0))=one),inference(rw,[status(thm)],[843,41,theory(equality)])).
% cnf(1624,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[148,41,theory(equality)])).
% cnf(2207,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[178,41,theory(equality)])).
% cnf(2475,negated_conjecture,(multiplication(esk4_0,one)=multiplication(esk4_0,esk4_0)),inference(spm,[status(thm)],[225,205,theory(equality)])).
% cnf(2490,negated_conjecture,(esk4_0=multiplication(esk4_0,esk4_0)),inference(rw,[status(thm)],[2475,53,theory(equality)])).
% cnf(2562,negated_conjecture,(addition(multiplication(esk4_0,X1),esk4_0)=multiplication(esk4_0,addition(X1,esk4_0))),inference(spm,[status(thm)],[37,2490,theory(equality)])).
% cnf(2741,negated_conjecture,(multiplication(esk4_0,addition(X1,one))=multiplication(esk4_0,addition(X1,esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2562,41,theory(equality)]),1624,theory(equality)])).
% cnf(2743,negated_conjecture,(addition(addition(X1,esk4_0),multiplication(esk4_0,addition(X1,one)))=multiplication(addition(esk4_0,one),addition(X1,esk4_0))),inference(spm,[status(thm)],[2207,2741,theory(equality)])).
% cnf(2760,negated_conjecture,(addition(X1,multiplication(esk4_0,addition(X1,one)))=multiplication(addition(esk4_0,one),addition(X1,esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2743,43,theory(equality)]),1624,theory(equality)]),43,theory(equality)]),45,theory(equality)])).
% cnf(2761,negated_conjecture,(addition(X1,multiplication(esk4_0,addition(X1,one)))=addition(X1,esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2760,41,theory(equality)]),593,theory(equality)]),55,theory(equality)])).
% cnf(7043,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,addition(c(esk4_0),X1)))=multiplication(esk3_0,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[393,37,theory(equality)])).
% cnf(107739,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,addition(c(esk4_0),esk4_0)))=multiplication(esk3_0,multiplication(esk2_0,multiplication(esk4_0,addition(c(esk4_0),one))))),inference(spm,[status(thm)],[7043,2761,theory(equality)])).
% cnf(107785,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,multiplication(esk4_0,addition(c(esk4_0),one))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[107739,41,theory(equality)]),416,theory(equality)]),53,theory(equality)])).
% cnf(107786,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(esk3_0,multiplication(esk2_0,esk4_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[107785,41,theory(equality)]),856,theory(equality)]),53,theory(equality)])).
% cnf(107787,negated_conjecture,($false),inference(sr,[status(thm)],[107786,106,theory(equality)])).
% cnf(107788,negated_conjecture,($false),107787,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5021
% # ...of these trivial : 901
% # ...subsumed : 3147
% # ...remaining for further processing: 973
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 237
% # Generated clauses : 58012
% # ...of the previous two non-trivial : 41485
% # Contextual simplify-reflections : 1
% # Paramodulations : 58005
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 734
% # Positive orientable unit clauses: 475
% # Positive unorientable unit clauses: 12
% # Negative unit clauses : 1
% # Non-unit-clauses : 246
% # Current number of unprocessed clauses: 32708
% # ...number of literals in the above : 50042
% # Clause-clause subsumption calls (NU) : 15463
% # Rec. Clause-clause subsumption calls : 15461
% # Unit Clause-clause subsumption calls : 505
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 960
% # Indexed BW rewrite successes : 182
% # Backwards rewriting index: 669 leaves, 1.50+/-1.381 terms/leaf
% # Paramod-from index: 351 leaves, 1.41+/-0.929 terms/leaf
% # Paramod-into index: 513 leaves, 1.50+/-1.425 terms/leaf
% # -------------------------------------------------
% # User time : 1.577 s
% # System time : 0.051 s
% # Total time : 1.628 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.98 CPU 3.34 WC
% FINAL PrfWatch: 2.98 CPU 3.34 WC
% SZS output end Solution for /tmp/SystemOnTPTP8710/KLE025+1.tptp
%
%------------------------------------------------------------------------------