TSTP Solution File: KLE090+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE090+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:58 EST 2010
% Result : Theorem 1.44s
% Output : Solution 1.44s
% 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/SystemOnTPTP6910/KLE090+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6910/KLE090+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6910/KLE090+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 7006
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(4, 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(5, axiom,![X4]:addition(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% 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(10, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% 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,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(16, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(21, conjecture,![X4]:![X5]:(addition(X4,X5)=X5=>addition(antidomain(X5),antidomain(X4))=antidomain(X4)),file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(![X4]:![X5]:(addition(X4,X5)=X5=>addition(antidomain(X5),antidomain(X4))=antidomain(X4))),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,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(29, 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)],[4])).
% cnf(30,plain,(addition(antidomain(multiplication(X1,X2)),antidomain(multiplication(X1,antidomain(antidomain(X2)))))=antidomain(multiplication(X1,antidomain(antidomain(X2))))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[5])).
% cnf(32,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[31])).
% fof(35, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(36,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[37])).
% fof(41, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[10])).
% cnf(42,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[41])).
% fof(47, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(48,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(50,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[49])).
% fof(51, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(52, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[16])).
% cnf(56,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[55])).
% fof(65, negated_conjecture,?[X4]:?[X5]:(addition(X4,X5)=X5&~(addition(antidomain(X5),antidomain(X4))=antidomain(X4))),inference(fof_nnf,[status(thm)],[22])).
% fof(66, negated_conjecture,?[X6]:?[X7]:(addition(X6,X7)=X7&~(addition(antidomain(X7),antidomain(X6))=antidomain(X6))),inference(variable_rename,[status(thm)],[65])).
% fof(67, negated_conjecture,(addition(esk1_0,esk2_0)=esk2_0&~(addition(antidomain(esk2_0),antidomain(esk1_0))=antidomain(esk1_0))),inference(skolemize,[status(esa)],[66])).
% cnf(68,negated_conjecture,(addition(antidomain(esk2_0),antidomain(esk1_0))!=antidomain(esk1_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(addition(esk1_0,esk2_0)=esk2_0),inference(split_conjunct,[status(thm)],[67])).
% cnf(71,plain,(zero=antidomain(one)),inference(spm,[status(thm)],[48,56,theory(equality)])).
% cnf(75,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[42,24,theory(equality)])).
% cnf(81,negated_conjecture,(addition(antidomain(esk1_0),antidomain(esk2_0))!=antidomain(esk1_0)),inference(rw,[status(thm)],[68,24,theory(equality)])).
% cnf(92,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[26,28,theory(equality)])).
% cnf(122,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[32,24,theory(equality)])).
% cnf(124,plain,(addition(one,X2)=addition(antidomain(X1),addition(antidomain(antidomain(X1)),X2))),inference(spm,[status(thm)],[26,122,theory(equality)])).
% cnf(130,plain,(leq(multiplication(X1,X2),multiplication(X1,X3))|multiplication(X1,addition(X2,X3))!=multiplication(X1,X3)),inference(spm,[status(thm)],[53,36,theory(equality)])).
% cnf(139,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[36,48,theory(equality)])).
% cnf(174,plain,(addition(multiplication(X1,X2),zero)=multiplication(addition(X1,antidomain(X2)),X2)),inference(spm,[status(thm)],[38,56,theory(equality)])).
% cnf(193,plain,(multiplication(X1,X2)=multiplication(addition(X1,antidomain(X2)),X2)),inference(rw,[status(thm)],[174,42,theory(equality)])).
% cnf(249,plain,(addition(zero,antidomain(zero))=one),inference(spm,[status(thm)],[122,71,theory(equality)])).
% cnf(277,plain,(antidomain(zero)=one),inference(rw,[status(thm)],[249,75,theory(equality)])).
% cnf(454,plain,(addition(antidomain(X1),one)=one),inference(spm,[status(thm)],[92,122,theory(equality)])).
% cnf(541,plain,(addition(one,antidomain(X1))=one),inference(rw,[status(thm)],[454,24,theory(equality)])).
% cnf(658,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[139,24,theory(equality)])).
% cnf(3689,negated_conjecture,(leq(multiplication(X1,esk1_0),multiplication(X1,esk2_0))),inference(spm,[status(thm)],[130,69,theory(equality)])).
% cnf(4100,negated_conjecture,(leq(multiplication(antidomain(esk2_0),esk1_0),zero)),inference(spm,[status(thm)],[3689,56,theory(equality)])).
% cnf(4118,negated_conjecture,(addition(multiplication(antidomain(esk2_0),esk1_0),zero)=zero),inference(spm,[status(thm)],[54,4100,theory(equality)])).
% cnf(4119,negated_conjecture,(multiplication(antidomain(esk2_0),esk1_0)=zero),inference(rw,[status(thm)],[4118,42,theory(equality)])).
% cnf(4123,negated_conjecture,(addition(antidomain(zero),antidomain(multiplication(antidomain(esk2_0),antidomain(antidomain(esk1_0)))))=antidomain(multiplication(antidomain(esk2_0),antidomain(antidomain(esk1_0))))),inference(spm,[status(thm)],[30,4119,theory(equality)])).
% cnf(4138,negated_conjecture,(one=antidomain(multiplication(antidomain(esk2_0),antidomain(antidomain(esk1_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[4123,277,theory(equality)]),541,theory(equality)])).
% cnf(4846,negated_conjecture,(multiplication(one,multiplication(antidomain(esk2_0),antidomain(antidomain(esk1_0))))=zero),inference(spm,[status(thm)],[56,4138,theory(equality)])).
% cnf(4867,negated_conjecture,(multiplication(antidomain(esk2_0),antidomain(antidomain(esk1_0)))=zero),inference(rw,[status(thm)],[4846,50,theory(equality)])).
% cnf(4891,negated_conjecture,(addition(zero,multiplication(X1,antidomain(antidomain(esk1_0))))=multiplication(addition(antidomain(esk2_0),X1),antidomain(antidomain(esk1_0)))),inference(spm,[status(thm)],[38,4867,theory(equality)])).
% cnf(4906,negated_conjecture,(multiplication(X1,antidomain(antidomain(esk1_0)))=multiplication(addition(antidomain(esk2_0),X1),antidomain(antidomain(esk1_0)))),inference(rw,[status(thm)],[4891,75,theory(equality)])).
% cnf(23719,negated_conjecture,(multiplication(one,antidomain(antidomain(esk1_0)))=multiplication(antidomain(antidomain(esk2_0)),antidomain(antidomain(esk1_0)))),inference(spm,[status(thm)],[4906,122,theory(equality)])).
% cnf(23765,negated_conjecture,(antidomain(antidomain(esk1_0))=multiplication(antidomain(antidomain(esk2_0)),antidomain(antidomain(esk1_0)))),inference(rw,[status(thm)],[23719,50,theory(equality)])).
% cnf(23777,negated_conjecture,(addition(antidomain(antidomain(esk2_0)),antidomain(antidomain(esk1_0)))=multiplication(antidomain(antidomain(esk2_0)),addition(antidomain(antidomain(esk1_0)),one))),inference(spm,[status(thm)],[658,23765,theory(equality)])).
% cnf(23813,negated_conjecture,(addition(antidomain(antidomain(esk2_0)),antidomain(antidomain(esk1_0)))=antidomain(antidomain(esk2_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[23777,24,theory(equality)]),541,theory(equality)]),48,theory(equality)])).
% cnf(23826,negated_conjecture,(addition(antidomain(antidomain(esk1_0)),antidomain(antidomain(esk2_0)))=antidomain(antidomain(esk2_0))),inference(rw,[status(thm)],[23813,24,theory(equality)])).
% cnf(23889,negated_conjecture,(addition(antidomain(esk1_0),antidomain(antidomain(esk2_0)))=addition(one,antidomain(antidomain(esk2_0)))),inference(spm,[status(thm)],[124,23826,theory(equality)])).
% cnf(23931,negated_conjecture,(addition(antidomain(esk1_0),antidomain(antidomain(esk2_0)))=one),inference(rw,[status(thm)],[23889,541,theory(equality)])).
% cnf(24073,negated_conjecture,(multiplication(one,antidomain(esk2_0))=multiplication(antidomain(esk1_0),antidomain(esk2_0))),inference(spm,[status(thm)],[193,23931,theory(equality)])).
% cnf(24109,negated_conjecture,(antidomain(esk2_0)=multiplication(antidomain(esk1_0),antidomain(esk2_0))),inference(rw,[status(thm)],[24073,50,theory(equality)])).
% cnf(24133,negated_conjecture,(addition(antidomain(esk1_0),antidomain(esk2_0))=multiplication(antidomain(esk1_0),addition(antidomain(esk2_0),one))),inference(spm,[status(thm)],[658,24109,theory(equality)])).
% cnf(24164,negated_conjecture,(addition(antidomain(esk1_0),antidomain(esk2_0))=antidomain(esk1_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24133,24,theory(equality)]),541,theory(equality)]),48,theory(equality)])).
% cnf(24165,negated_conjecture,($false),inference(sr,[status(thm)],[24164,81,theory(equality)])).
% cnf(24166,negated_conjecture,($false),24165,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1229
% # ...of these trivial : 310
% # ...subsumed : 568
% # ...remaining for further processing: 351
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 25
% # Generated clauses : 13115
% # ...of the previous two non-trivial : 7072
% # Contextual simplify-reflections : 0
% # Paramodulations : 13114
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 325
% # Positive orientable unit clauses: 263
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 5612
% # ...number of literals in the above : 6680
% # Clause-clause subsumption calls (NU) : 2215
% # Rec. Clause-clause subsumption calls : 2215
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 332
% # Indexed BW rewrite successes : 63
% # Backwards rewriting index: 336 leaves, 1.59+/-1.177 terms/leaf
% # Paramod-from index: 184 leaves, 1.46+/-0.908 terms/leaf
% # Paramod-into index: 297 leaves, 1.61+/-1.188 terms/leaf
% # -------------------------------------------------
% # User time : 0.283 s
% # System time : 0.015 s
% # Total time : 0.298 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.63 CPU 0.72 WC
% FINAL PrfWatch: 0.63 CPU 0.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP6910/KLE090+1.tptp
%
%------------------------------------------------------------------------------