TSTP Solution File: KLE027+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE027+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:38 EST 2010
% Result : Theorem 48.83s
% Output : Solution 48.83s
% 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/SystemOnTPTP26283/KLE027+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26283/KLE027+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26283/KLE027+3.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 26379
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.03 WC
% PrfWatch: 3.91 CPU 4.04 WC
% PrfWatch: 5.51 CPU 6.04 WC
% PrfWatch: 7.13 CPU 8.05 WC
% PrfWatch: 9.11 CPU 10.06 WC
% PrfWatch: 11.09 CPU 12.07 WC
% PrfWatch: 13.07 CPU 14.07 WC
% PrfWatch: 15.06 CPU 16.08 WC
% PrfWatch: 17.04 CPU 18.09 WC
% PrfWatch: 19.02 CPU 20.09 WC
% PrfWatch: 20.99 CPU 22.10 WC
% PrfWatch: 22.98 CPU 24.11 WC
% PrfWatch: 24.95 CPU 26.11 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 26.94 CPU 28.12 WC
% PrfWatch: 28.93 CPU 30.13 WC
% PrfWatch: 30.92 CPU 32.13 WC
% PrfWatch: 32.89 CPU 34.14 WC
% PrfWatch: 34.88 CPU 36.15 WC
% PrfWatch: 36.49 CPU 38.16 WC
% PrfWatch: 38.14 CPU 40.16 WC
% PrfWatch: 40.13 CPU 42.17 WC
% PrfWatch: 42.12 CPU 44.18 WC
% PrfWatch: 44.12 CPU 46.18 WC
% PrfWatch: 46.11 CPU 48.19 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_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]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(12, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(15, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(17, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(18, 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(19, conjecture,![X4]:![X5]:![X6]:![X7]:![X8]:((test(X7)&test(X8))=>addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))=addition(multiplication(X7,X4),multiplication(c(X7),X6))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:![X6]:![X7]:![X8]:((test(X7)&test(X8))=>addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))=addition(multiplication(X7,X4),multiplication(c(X7),X6)))),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(28, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% 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)],[5])).
% cnf(31,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(43, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[10])).
% fof(44, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[44])).
% cnf(46,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(48, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[11])).
% fof(49, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[48])).
% fof(50, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[49])).
% fof(51, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[50])).
% cnf(52,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[51])).
% fof(54, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(55,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[54])).
% fof(62, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(63,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[62])).
% fof(66, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[17])).
% cnf(67,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[66])).
% fof(68, 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)],[18])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% cnf(71,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[70])).
% 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,?[X4]:?[X5]:?[X6]:?[X7]:?[X8]:((test(X7)&test(X8))&~(addition(multiplication(X7,addition(multiplication(X7,X4),multiplication(c(X7),X5))),multiplication(c(X7),X6))=addition(multiplication(X7,X4),multiplication(c(X7),X6)))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:((test(X12)&test(X13))&~(addition(multiplication(X12,addition(multiplication(X12,X9),multiplication(c(X12),X10))),multiplication(c(X12),X11))=addition(multiplication(X12,X9),multiplication(c(X12),X11)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk5_0)&test(esk6_0))&~(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(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(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(85,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[72,52,theory(equality)])).
% cnf(86,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[74,52,theory(equality)])).
% cnf(88,plain,(multiplication(esk1_1(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[73,52,theory(equality)])).
% cnf(126,plain,(complement(X1,X2)|addition(X1,X2)!=one|multiplication(X2,X1)!=zero|multiplication(X1,X2)!=zero),inference(spm,[status(thm)],[71,23,theory(equality)])).
% cnf(133,negated_conjecture,(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)],[78,23,theory(equality)])).
% cnf(564,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[29,86,theory(equality)])).
% cnf(568,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[31,86,theory(equality)])).
% cnf(576,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[568,63,theory(equality)])).
% cnf(886,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|multiplication(X1,esk1_1(X1))!=zero|~test(X1)),inference(spm,[status(thm)],[126,85,theory(equality)])).
% cnf(30825,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[576,85,theory(equality)])).
% cnf(30915,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[30825,55,theory(equality)])).
% cnf(31317,negated_conjecture,(multiplication(esk5_0,esk5_0)=esk5_0),inference(spm,[status(thm)],[30915,80,theory(equality)])).
% cnf(31516,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,multiplication(esk5_0,X1))),inference(spm,[status(thm)],[29,31317,theory(equality)])).
% cnf(31533,negated_conjecture,(multiplication(esk5_0,multiplication(esk5_0,esk1_1(esk5_0)))=zero|~test(esk5_0)),inference(spm,[status(thm)],[564,31317,theory(equality)])).
% cnf(31585,negated_conjecture,(multiplication(esk5_0,multiplication(esk5_0,esk1_1(esk5_0)))=zero|$false),inference(rw,[status(thm)],[31533,80,theory(equality)])).
% cnf(31586,negated_conjecture,(multiplication(esk5_0,multiplication(esk5_0,esk1_1(esk5_0)))=zero),inference(cn,[status(thm)],[31585,theory(equality)])).
% cnf(32402,negated_conjecture,(addition(multiplication(esk5_0,X1),multiplication(esk5_0,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(spm,[status(thm)],[31,31516,theory(equality)])).
% cnf(32465,negated_conjecture,(multiplication(esk5_0,addition(X1,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(rw,[status(thm)],[32402,31,theory(equality)])).
% cnf(32806,negated_conjecture,(multiplication(esk5_0,esk1_1(esk5_0))=zero),inference(rw,[status(thm)],[31586,31516,theory(equality)])).
% cnf(32813,negated_conjecture,(multiplication(zero,X1)=multiplication(esk5_0,multiplication(esk1_1(esk5_0),X1))),inference(spm,[status(thm)],[29,32806,theory(equality)])).
% cnf(32869,negated_conjecture,(zero=multiplication(esk5_0,multiplication(esk1_1(esk5_0),X1))),inference(rw,[status(thm)],[32813,67,theory(equality)])).
% cnf(52486,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|~test(X1)),inference(csr,[status(thm)],[886,86])).
% cnf(52487,plain,(complement(X1,esk1_1(X1))|~test(X1)),inference(csr,[status(thm)],[52486,88])).
% cnf(52491,plain,(c(X1)=esk1_1(X1)|~test(X1)),inference(spm,[status(thm)],[46,52487,theory(equality)])).
% cnf(52622,negated_conjecture,(multiplication(esk5_0,multiplication(c(esk5_0),X1))=zero|~test(esk5_0)),inference(spm,[status(thm)],[32869,52491,theory(equality)])).
% cnf(52974,negated_conjecture,(multiplication(esk5_0,multiplication(c(esk5_0),X1))=zero|$false),inference(rw,[status(thm)],[52622,80,theory(equality)])).
% cnf(52975,negated_conjecture,(multiplication(esk5_0,multiplication(c(esk5_0),X1))=zero),inference(cn,[status(thm)],[52974,theory(equality)])).
% cnf(56369,negated_conjecture,(addition(multiplication(esk5_0,X1),zero)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(spm,[status(thm)],[31,52975,theory(equality)])).
% cnf(56478,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(rw,[status(thm)],[56369,63,theory(equality)])).
% cnf(183337,negated_conjecture,(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)],[133,32465,theory(equality)])).
% cnf(1481289,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[183337,56478,theory(equality)]),23,theory(equality)])).
% cnf(1481290,negated_conjecture,($false),inference(cn,[status(thm)],[1481289,theory(equality)])).
% cnf(1481291,negated_conjecture,($false),1481290,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32185
% # ...of these trivial : 2799
% # ...subsumed : 26276
% # ...remaining for further processing: 3110
% # Other redundant clauses eliminated : 8
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 69
% # Backward-rewritten : 529
% # Generated clauses : 686314
% # ...of the previous two non-trivial : 512620
% # Contextual simplify-reflections : 3178
% # Paramodulations : 686230
% # Factorizations : 2
% # Equation resolutions : 82
% # Current number of processed clauses: 2512
% # Positive orientable unit clauses: 828
% # Positive unorientable unit clauses: 22
% # Negative unit clauses : 0
% # Non-unit-clauses : 1662
% # Current number of unprocessed clauses: 435865
% # ...number of literals in the above : 1047781
% # Clause-clause subsumption calls (NU) : 237982
% # Rec. Clause-clause subsumption calls : 230651
% # Unit Clause-clause subsumption calls : 609
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3912
% # Indexed BW rewrite successes : 532
% # Backwards rewriting index: 1384 leaves, 2.22+/-3.675 terms/leaf
% # Paramod-from index: 747 leaves, 1.75+/-1.399 terms/leaf
% # Paramod-into index: 953 leaves, 2.07+/-2.382 terms/leaf
% # -------------------------------------------------
% # User time : 25.138 s
% # System time : 0.971 s
% # Total time : 26.109 s
% # Maximum resident set size: 0 pages
% PrfWatch: 47.70 CPU 49.78 WC
% FINAL PrfWatch: 47.70 CPU 49.78 WC
% SZS output end Solution for /tmp/SystemOnTPTP26283/KLE027+3.tptp
%
%------------------------------------------------------------------------------