TSTP Solution File: KLE026+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE026+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 : 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:09 EST 2010
% Result : Theorem 1.21s
% Output : Solution 1.21s
% 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/SystemOnTPTP26024/KLE026+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP26024/KLE026+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP26024/KLE026+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 26120
% 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]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(2, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(5, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(6, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(7, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(8, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(12, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_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]:((test(X5)&test(X6))=>(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)=>leq(multiplication(X5,X4),multiplication(X4,X6)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)=>leq(multiplication(X5,X4),multiplication(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(22, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[22])).
% cnf(24,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[23])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[8])).
% fof(37, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[36])).
% fof(38, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[37])).
% fof(39, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[38])).
% cnf(40,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[39])).
% fof(48, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[48])).
% 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(64,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, negated_conjecture,?[X4]:?[X5]:?[X6]:((test(X5)&test(X6))&(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)&~(leq(multiplication(X5,X4),multiplication(X4,X6))))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(multiplication(X8,X7)=multiplication(multiplication(X8,X7),X9)&~(leq(multiplication(X8,X7),multiplication(X7,X9))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk4_0))&(multiplication(esk3_0,esk2_0)=multiplication(multiplication(esk3_0,esk2_0),esk4_0)&~(leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(multiplication(esk3_0,esk2_0),esk4_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(77,negated_conjecture,(complement(esk1_1(esk3_0),esk3_0)),inference(spm,[status(thm)],[40,73,theory(equality)])).
% cnf(102,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,esk4_0))=multiplication(esk3_0,esk2_0)),inference(rw,[status(thm)],[71,21,theory(equality)])).
% cnf(118,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[33,35,theory(equality)])).
% cnf(125,plain,(leq(X1,X2)|addition(X2,X1)!=X2),inference(spm,[status(thm)],[24,31,theory(equality)])).
% cnf(207,negated_conjecture,(addition(esk3_0,esk1_1(esk3_0))=one),inference(spm,[status(thm)],[64,77,theory(equality)])).
% cnf(268,plain,(leq(multiplication(X1,X2),multiplication(X3,X2))|multiplication(addition(X3,X1),X2)!=multiplication(X3,X2)),inference(spm,[status(thm)],[125,29,theory(equality)])).
% cnf(544,negated_conjecture,(addition(esk3_0,one)=one),inference(spm,[status(thm)],[118,207,theory(equality)])).
% cnf(594,negated_conjecture,(addition(one,esk3_0)=one),inference(rw,[status(thm)],[544,31,theory(equality)])).
% cnf(5731,negated_conjecture,(leq(multiplication(esk3_0,X1),multiplication(one,X1))),inference(spm,[status(thm)],[268,594,theory(equality)])).
% cnf(5774,negated_conjecture,(leq(multiplication(esk3_0,X1),X1)),inference(rw,[status(thm)],[5731,49,theory(equality)])).
% cnf(5986,negated_conjecture,(leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))),inference(spm,[status(thm)],[5774,102,theory(equality)])).
% cnf(5993,negated_conjecture,($false),inference(sr,[status(thm)],[5986,70,theory(equality)])).
% cnf(5994,negated_conjecture,($false),5993,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 505
% # ...of these trivial : 55
% # ...subsumed : 210
% # ...remaining for further processing: 240
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 44
% # Generated clauses : 3255
% # ...of the previous two non-trivial : 2313
% # Contextual simplify-reflections : 1
% # Paramodulations : 3248
% # Factorizations : 0
% # Equation resolutions : 7
% # Current number of processed clauses: 196
% # Positive orientable unit clauses: 134
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 58
% # Current number of unprocessed clauses: 1641
% # ...number of literals in the above : 2346
% # Clause-clause subsumption calls (NU) : 601
% # Rec. Clause-clause subsumption calls : 601
% # Unit Clause-clause subsumption calls : 26
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 68
% # Indexed BW rewrite successes : 45
% # Backwards rewriting index: 211 leaves, 1.20+/-0.860 terms/leaf
% # Paramod-from index: 127 leaves, 1.10+/-0.394 terms/leaf
% # Paramod-into index: 165 leaves, 1.21+/-0.842 terms/leaf
% # -------------------------------------------------
% # User time : 0.088 s
% # System time : 0.008 s
% # Total time : 0.096 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.26 CPU 0.36 WC
% FINAL PrfWatch: 0.26 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP26024/KLE026+1.tptp
%
%------------------------------------------------------------------------------