TSTP Solution File: KLE027+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE027+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 : art03.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:24 EST 2010
% Result : Theorem 19.27s
% Output : Solution 19.27s
% 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/SystemOnTPTP8273/KLE027+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8273/KLE027+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8273/KLE027+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 8369
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.93 CPU 2.02 WC
% PrfWatch: 3.91 CPU 4.03 WC
% PrfWatch: 5.90 CPU 6.03 WC
% PrfWatch: 7.90 CPU 8.04 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 9.88 CPU 10.04 WC
% PrfWatch: 11.87 CPU 12.05 WC
% PrfWatch: 13.86 CPU 14.05 WC
% PrfWatch: 15.85 CPU 16.06 WC
% PrfWatch: 17.85 CPU 18.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(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(8, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(9, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(10, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(12, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(13, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(16, 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]:![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(18, 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)],[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(26, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(35, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[8])).
% fof(36, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[36])).
% cnf(38,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[37])).
% fof(40, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[9])).
% fof(41, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[41])).
% fof(43, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[42])).
% cnf(44,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(46, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(47,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[46])).
% fof(50, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[12])).
% cnf(51,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[50])).
% 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(60, 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)],[16])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% cnf(63,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[62])).
% cnf(64,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(65,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% cnf(66,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, 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)],[18])).
% fof(68, 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)],[67])).
% fof(69, 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)],[68])).
% cnf(70,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)],[69])).
% cnf(72,negated_conjecture,(test(esk5_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(80,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[64,44,theory(equality)])).
% cnf(81,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[66,44,theory(equality)])).
% cnf(82,plain,(multiplication(esk1_1(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[65,44,theory(equality)])).
% cnf(121,plain,(complement(X1,X2)|addition(X1,X2)!=one|multiplication(X2,X1)!=zero|multiplication(X1,X2)!=zero),inference(spm,[status(thm)],[63,21,theory(equality)])).
% cnf(128,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)],[70,21,theory(equality)])).
% cnf(533,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[27,81,theory(equality)])).
% cnf(537,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[29,81,theory(equality)])).
% cnf(545,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[537,47,theory(equality)])).
% cnf(816,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|multiplication(X1,esk1_1(X1))!=zero|~test(X1)),inference(spm,[status(thm)],[121,80,theory(equality)])).
% cnf(23640,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[545,80,theory(equality)])).
% cnf(23724,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[23640,53,theory(equality)])).
% cnf(27946,negated_conjecture,(multiplication(esk5_0,esk5_0)=esk5_0),inference(spm,[status(thm)],[23724,72,theory(equality)])).
% cnf(28100,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,multiplication(esk5_0,X1))),inference(spm,[status(thm)],[27,27946,theory(equality)])).
% cnf(28113,negated_conjecture,(multiplication(esk5_0,multiplication(esk5_0,esk1_1(esk5_0)))=zero|~test(esk5_0)),inference(spm,[status(thm)],[533,27946,theory(equality)])).
% cnf(28140,negated_conjecture,(multiplication(esk5_0,multiplication(esk5_0,esk1_1(esk5_0)))=zero|$false),inference(rw,[status(thm)],[28113,72,theory(equality)])).
% cnf(28141,negated_conjecture,(multiplication(esk5_0,multiplication(esk5_0,esk1_1(esk5_0)))=zero),inference(cn,[status(thm)],[28140,theory(equality)])).
% cnf(28651,negated_conjecture,(addition(multiplication(esk5_0,X1),multiplication(esk5_0,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(spm,[status(thm)],[29,28100,theory(equality)])).
% cnf(28698,negated_conjecture,(multiplication(esk5_0,addition(X1,X2))=multiplication(esk5_0,addition(multiplication(esk5_0,X1),X2))),inference(rw,[status(thm)],[28651,29,theory(equality)])).
% cnf(29022,negated_conjecture,(multiplication(esk5_0,esk1_1(esk5_0))=zero),inference(rw,[status(thm)],[28141,28100,theory(equality)])).
% cnf(29025,negated_conjecture,(multiplication(zero,X1)=multiplication(esk5_0,multiplication(esk1_1(esk5_0),X1))),inference(spm,[status(thm)],[27,29022,theory(equality)])).
% cnf(29063,negated_conjecture,(zero=multiplication(esk5_0,multiplication(esk1_1(esk5_0),X1))),inference(rw,[status(thm)],[29025,51,theory(equality)])).
% cnf(35370,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|~test(X1)),inference(csr,[status(thm)],[816,81])).
% cnf(35371,plain,(complement(X1,esk1_1(X1))|~test(X1)),inference(csr,[status(thm)],[35370,82])).
% cnf(35375,plain,(c(X1)=esk1_1(X1)|~test(X1)),inference(spm,[status(thm)],[38,35371,theory(equality)])).
% cnf(35476,negated_conjecture,(multiplication(esk5_0,multiplication(c(esk5_0),X1))=zero|~test(esk5_0)),inference(spm,[status(thm)],[29063,35375,theory(equality)])).
% cnf(35719,negated_conjecture,(multiplication(esk5_0,multiplication(c(esk5_0),X1))=zero|$false),inference(rw,[status(thm)],[35476,72,theory(equality)])).
% cnf(35720,negated_conjecture,(multiplication(esk5_0,multiplication(c(esk5_0),X1))=zero),inference(cn,[status(thm)],[35719,theory(equality)])).
% cnf(39318,negated_conjecture,(addition(multiplication(esk5_0,X1),zero)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(spm,[status(thm)],[29,35720,theory(equality)])).
% cnf(39380,negated_conjecture,(multiplication(esk5_0,X1)=multiplication(esk5_0,addition(X1,multiplication(c(esk5_0),X2)))),inference(rw,[status(thm)],[39318,47,theory(equality)])).
% cnf(136957,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)],[128,28698,theory(equality)])).
% cnf(635344,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[136957,39380,theory(equality)]),21,theory(equality)])).
% cnf(635345,negated_conjecture,($false),inference(cn,[status(thm)],[635344,theory(equality)])).
% cnf(635346,negated_conjecture,($false),635345,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17897
% # ...of these trivial : 3670
% # ...subsumed : 12116
% # ...remaining for further processing: 2111
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 43
% # Backward-rewritten : 410
% # Generated clauses : 304694
% # ...of the previous two non-trivial : 207109
% # Contextual simplify-reflections : 758
% # Paramodulations : 304647
% # Factorizations : 0
% # Equation resolutions : 47
% # Current number of processed clauses: 1658
% # Positive orientable unit clauses: 861
% # Positive unorientable unit clauses: 15
% # Negative unit clauses : 0
% # Non-unit-clauses : 782
% # Current number of unprocessed clauses: 168099
% # ...number of literals in the above : 324308
% # Clause-clause subsumption calls (NU) : 72545
% # Rec. Clause-clause subsumption calls : 70386
% # Unit Clause-clause subsumption calls : 405
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3622
% # Indexed BW rewrite successes : 491
% # Backwards rewriting index: 1123 leaves, 1.93+/-2.217 terms/leaf
% # Paramod-from index: 623 leaves, 1.74+/-1.437 terms/leaf
% # Paramod-into index: 825 leaves, 1.87+/-1.856 terms/leaf
% # -------------------------------------------------
% # User time : 9.290 s
% # System time : 0.361 s
% # Total time : 9.651 s
% # Maximum resident set size: 0 pages
% PrfWatch: 18.43 CPU 18.65 WC
% FINAL PrfWatch: 18.43 CPU 18.65 WC
% SZS output end Solution for /tmp/SystemOnTPTP8273/KLE027+1.tptp
%
%------------------------------------------------------------------------------