TSTP Solution File: KLE088+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE088+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 : art09.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:54:42 EST 2010
% Result : Theorem 3.28s
% Output : Solution 3.28s
% 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/SystemOnTPTP6651/KLE088+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6651/KLE088+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6651/KLE088+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 6747
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.02 WC
% # 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(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(10, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(11, axiom,![X4]:![X5]:addition(antidomain(multiplication(X4,X5)),antidomain(multiplication(X4,antidomain(antidomain(X5)))))=antidomain(multiplication(X4,antidomain(antidomain(X5)))),file('/tmp/SRASS.s.p', domain2)).
% fof(12, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(13, axiom,![X4]:addition(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(16, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(17, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(21, conjecture,![X4]:![X5]:(multiplication(domain(X4),X5)=zero=>addition(domain(X4),antidomain(X5))=antidomain(X5)),file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(![X4]:![X5]:(multiplication(domain(X4),X5)=zero=>addition(domain(X4),antidomain(X5))=antidomain(X5))),inference(assume_negation,[status(cth)],[21])).
% fof(23, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(24,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(26,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(30,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(34,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(36,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(41, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[10])).
% cnf(42,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:addition(antidomain(multiplication(X6,X7)),antidomain(multiplication(X6,antidomain(antidomain(X7)))))=antidomain(multiplication(X6,antidomain(antidomain(X7)))),inference(variable_rename,[status(thm)],[11])).
% cnf(44,plain,(addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2))))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[12])).
% cnf(46,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[13])).
% cnf(48,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[47])).
% fof(53, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(54,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[53])).
% fof(55, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[17])).
% cnf(56,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[55])).
% fof(65, negated_conjecture,?[X4]:?[X5]:(multiplication(domain(X4),X5)=zero&~(addition(domain(X4),antidomain(X5))=antidomain(X5))),inference(fof_nnf,[status(thm)],[22])).
% fof(66, negated_conjecture,?[X6]:?[X7]:(multiplication(domain(X6),X7)=zero&~(addition(domain(X6),antidomain(X7))=antidomain(X7))),inference(variable_rename,[status(thm)],[65])).
% fof(67, negated_conjecture,(multiplication(domain(esk1_0),esk2_0)=zero&~(addition(domain(esk1_0),antidomain(esk2_0))=antidomain(esk2_0))),inference(skolemize,[status(esa)],[66])).
% cnf(68,negated_conjecture,(addition(domain(esk1_0),antidomain(esk2_0))!=antidomain(esk2_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(multiplication(domain(esk1_0),esk2_0)=zero),inference(split_conjunct,[status(thm)],[67])).
% cnf(70,negated_conjecture,(multiplication(antidomain(antidomain(esk1_0)),esk2_0)=zero),inference(rw,[status(thm)],[69,46,theory(equality)]),['unfolding']).
% cnf(71,negated_conjecture,(addition(antidomain(antidomain(esk1_0)),antidomain(esk2_0))!=antidomain(esk2_0)),inference(rw,[status(thm)],[68,46,theory(equality)]),['unfolding']).
% cnf(73,plain,(zero=antidomain(one)),inference(spm,[status(thm)],[54,42,theory(equality)])).
% cnf(76,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[28,24,theory(equality)])).
% cnf(82,negated_conjecture,(addition(antidomain(esk2_0),antidomain(antidomain(esk1_0)))!=antidomain(esk2_0)),inference(rw,[status(thm)],[71,24,theory(equality)])).
% cnf(92,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[26,30,theory(equality)])).
% cnf(124,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[48,24,theory(equality)])).
% cnf(137,plain,(addition(multiplication(antidomain(X1),X2),zero)=multiplication(antidomain(X1),addition(X2,X1))),inference(spm,[status(thm)],[34,42,theory(equality)])).
% cnf(157,plain,(multiplication(antidomain(X1),X2)=multiplication(antidomain(X1),addition(X2,X1))),inference(rw,[status(thm)],[137,28,theory(equality)])).
% cnf(177,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[36,56,theory(equality)])).
% cnf(179,plain,(addition(multiplication(X1,X2),zero)=multiplication(addition(X1,antidomain(X2)),X2)),inference(spm,[status(thm)],[36,42,theory(equality)])).
% cnf(199,plain,(multiplication(X1,X2)=multiplication(addition(X1,antidomain(X2)),X2)),inference(rw,[status(thm)],[179,28,theory(equality)])).
% cnf(218,negated_conjecture,(addition(antidomain(zero),antidomain(multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(esk2_0)))))=antidomain(multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(esk2_0))))),inference(spm,[status(thm)],[44,70,theory(equality)])).
% cnf(259,plain,(addition(zero,antidomain(zero))=one),inference(spm,[status(thm)],[124,73,theory(equality)])).
% cnf(285,plain,(antidomain(zero)=one),inference(rw,[status(thm)],[259,76,theory(equality)])).
% cnf(301,plain,(addition(antidomain(X1),one)=one),inference(spm,[status(thm)],[92,124,theory(equality)])).
% cnf(398,plain,(addition(one,antidomain(X1))=one),inference(rw,[status(thm)],[301,24,theory(equality)])).
% cnf(949,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[177,24,theory(equality)])).
% cnf(3567,plain,(multiplication(addition(antidomain(X2),X1),X2)=multiplication(X1,X2)),inference(spm,[status(thm)],[199,24,theory(equality)])).
% cnf(5020,plain,(multiplication(antidomain(antidomain(antidomain(X1))),one)=multiplication(antidomain(antidomain(antidomain(X1))),antidomain(X1))),inference(spm,[status(thm)],[157,124,theory(equality)])).
% cnf(5085,plain,(antidomain(antidomain(antidomain(X1)))=multiplication(antidomain(antidomain(antidomain(X1))),antidomain(X1))),inference(rw,[status(thm)],[5020,54,theory(equality)])).
% cnf(5864,plain,(multiplication(one,X1)=multiplication(antidomain(antidomain(X1)),X1)),inference(spm,[status(thm)],[3567,124,theory(equality)])).
% cnf(5906,plain,(X1=multiplication(antidomain(antidomain(X1)),X1)),inference(rw,[status(thm)],[5864,56,theory(equality)])).
% cnf(13879,negated_conjecture,(one=antidomain(multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(esk2_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[218,285,theory(equality)]),398,theory(equality)])).
% cnf(13880,negated_conjecture,(multiplication(one,multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(esk2_0))))=zero),inference(spm,[status(thm)],[42,13879,theory(equality)])).
% cnf(13930,negated_conjecture,(multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(esk2_0)))=zero),inference(rw,[status(thm)],[13880,56,theory(equality)])).
% cnf(13989,negated_conjecture,(addition(zero,multiplication(antidomain(antidomain(esk1_0)),X1))=multiplication(antidomain(antidomain(esk1_0)),addition(antidomain(antidomain(esk2_0)),X1))),inference(spm,[status(thm)],[34,13930,theory(equality)])).
% cnf(14026,negated_conjecture,(multiplication(antidomain(antidomain(esk1_0)),X1)=multiplication(antidomain(antidomain(esk1_0)),addition(antidomain(antidomain(esk2_0)),X1))),inference(rw,[status(thm)],[13989,76,theory(equality)])).
% cnf(20852,plain,(antidomain(X1)=antidomain(antidomain(antidomain(X1)))),inference(rw,[status(thm)],[5085,5906,theory(equality)])).
% cnf(100877,negated_conjecture,(multiplication(antidomain(antidomain(esk1_0)),one)=multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(antidomain(esk2_0))))),inference(spm,[status(thm)],[14026,124,theory(equality)])).
% cnf(100994,negated_conjecture,(antidomain(antidomain(esk1_0))=multiplication(antidomain(antidomain(esk1_0)),antidomain(antidomain(antidomain(esk2_0))))),inference(rw,[status(thm)],[100877,54,theory(equality)])).
% cnf(100995,negated_conjecture,(antidomain(antidomain(esk1_0))=multiplication(antidomain(antidomain(esk1_0)),antidomain(esk2_0))),inference(rw,[status(thm)],[100994,20852,theory(equality)])).
% cnf(101044,negated_conjecture,(addition(antidomain(esk2_0),antidomain(antidomain(esk1_0)))=multiplication(addition(antidomain(antidomain(esk1_0)),one),antidomain(esk2_0))),inference(spm,[status(thm)],[949,100995,theory(equality)])).
% cnf(101099,negated_conjecture,(addition(antidomain(esk2_0),antidomain(antidomain(esk1_0)))=antidomain(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[101044,24,theory(equality)]),398,theory(equality)]),56,theory(equality)])).
% cnf(101100,negated_conjecture,($false),inference(sr,[status(thm)],[101099,82,theory(equality)])).
% cnf(101101,negated_conjecture,($false),101100,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2935
% # ...of these trivial : 766
% # ...subsumed : 1504
% # ...remaining for further processing: 665
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 89
% # Generated clauses : 53390
% # ...of the previous two non-trivial : 26989
% # Contextual simplify-reflections : 0
% # Paramodulations : 53389
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 575
% # Positive orientable unit clauses: 490
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 1
% # Non-unit-clauses : 80
% # Current number of unprocessed clauses: 20831
% # ...number of literals in the above : 24875
% # Clause-clause subsumption calls (NU) : 6097
% # Rec. Clause-clause subsumption calls : 6097
% # Unit Clause-clause subsumption calls : 21
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1090
% # Indexed BW rewrite successes : 103
% # Backwards rewriting index: 558 leaves, 1.72+/-1.349 terms/leaf
% # Paramod-from index: 327 leaves, 1.52+/-1.013 terms/leaf
% # Paramod-into index: 498 leaves, 1.72+/-1.345 terms/leaf
% # -------------------------------------------------
% # User time : 1.182 s
% # System time : 0.052 s
% # Total time : 1.234 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.47 CPU 2.56 WC
% FINAL PrfWatch: 2.47 CPU 2.56 WC
% SZS output end Solution for /tmp/SystemOnTPTP6651/KLE088+1.tptp
%
%------------------------------------------------------------------------------