TSTP Solution File: KLE148+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE148+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 08:13:51 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP30512/KLE148+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30512/KLE148+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30512/KLE148+2.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 30608
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(4, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(7, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(9, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(12, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(13, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(14, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(15, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(19, conjecture,![X4]:![X5]:((multiplication(X4,X5)=zero=>leq(multiplication(X4,strong_iteration(X5)),X4))&leq(X4,multiplication(X4,strong_iteration(X5)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:((multiplication(X4,X5)=zero=>leq(multiplication(X4,strong_iteration(X5)),X4))&leq(X4,multiplication(X4,strong_iteration(X5))))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[23])).
% fof(28, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(31, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[30])).
% cnf(32,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[31])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[40])).
% fof(48, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[13])).
% cnf(51,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[50])).
% fof(52, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(53,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(55,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[54])).
% fof(62, negated_conjecture,?[X4]:?[X5]:((multiplication(X4,X5)=zero&~(leq(multiplication(X4,strong_iteration(X5)),X4)))|~(leq(X4,multiplication(X4,strong_iteration(X5))))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X6]:?[X7]:((multiplication(X6,X7)=zero&~(leq(multiplication(X6,strong_iteration(X7)),X6)))|~(leq(X6,multiplication(X6,strong_iteration(X7))))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,((multiplication(esk1_0,esk2_0)=zero&~(leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0)))|~(leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0))))),inference(skolemize,[status(esa)],[63])).
% fof(65, negated_conjecture,((multiplication(esk1_0,esk2_0)=zero|~(leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0)))))&(~(leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0))|~(leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0)))))),inference(distribute,[status(thm)],[64])).
% cnf(66,negated_conjecture,(~leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0)))|~leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,negated_conjecture,(multiplication(esk1_0,esk2_0)=zero|~leq(esk1_0,multiplication(esk1_0,strong_iteration(esk2_0)))),inference(split_conjunct,[status(thm)],[65])).
% cnf(78,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[41,49,theory(equality)])).
% cnf(86,plain,(leq(X1,X1)),inference(spm,[status(thm)],[32,53,theory(equality)])).
% cnf(113,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[51,53,theory(equality)])).
% cnf(160,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[37,55,theory(equality)])).
% cnf(247,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[32,113,theory(equality)])).
% cnf(254,plain,(addition(one,strong_iteration(X1))=strong_iteration(X1)),inference(spm,[status(thm)],[113,78,theory(equality)])).
% cnf(462,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[160,49,theory(equality)])).
% cnf(474,plain,(leq(X1,multiplication(X1,addition(X2,one)))),inference(spm,[status(thm)],[247,462,theory(equality)])).
% cnf(796,plain,(leq(X1,multiplication(X1,addition(one,X2)))),inference(spm,[status(thm)],[474,49,theory(equality)])).
% cnf(1357,plain,(leq(X1,multiplication(X1,strong_iteration(X2)))),inference(spm,[status(thm)],[796,254,theory(equality)])).
% cnf(1403,negated_conjecture,($false|~leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0)),inference(rw,[status(thm)],[66,1357,theory(equality)])).
% cnf(1404,negated_conjecture,(~leq(multiplication(esk1_0,strong_iteration(esk2_0)),esk1_0)),inference(cn,[status(thm)],[1403,theory(equality)])).
% cnf(1405,negated_conjecture,(multiplication(esk1_0,esk2_0)=zero|$false),inference(rw,[status(thm)],[67,1357,theory(equality)])).
% cnf(1406,negated_conjecture,(multiplication(esk1_0,esk2_0)=zero),inference(cn,[status(thm)],[1405,theory(equality)])).
% cnf(1413,negated_conjecture,(multiplication(zero,X1)=multiplication(esk1_0,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[22,1406,theory(equality)])).
% cnf(1425,negated_conjecture,(zero=multiplication(esk1_0,multiplication(esk2_0,X1))),inference(rw,[status(thm)],[1413,24,theory(equality)])).
% cnf(1579,negated_conjecture,(addition(esk1_0,zero)=multiplication(esk1_0,addition(multiplication(esk2_0,X1),one))),inference(spm,[status(thm)],[462,1425,theory(equality)])).
% cnf(1597,negated_conjecture,(esk1_0=multiplication(esk1_0,addition(multiplication(esk2_0,X1),one))),inference(rw,[status(thm)],[1579,29,theory(equality)])).
% cnf(4292,negated_conjecture,(multiplication(esk1_0,addition(one,multiplication(esk2_0,X1)))=esk1_0),inference(rw,[status(thm)],[1597,49,theory(equality)])).
% cnf(4312,negated_conjecture,(multiplication(esk1_0,strong_iteration(esk2_0))=esk1_0),inference(spm,[status(thm)],[4292,78,theory(equality)])).
% cnf(4353,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1404,4312,theory(equality)]),86,theory(equality)])).
% cnf(4354,negated_conjecture,($false),inference(cn,[status(thm)],[4353,theory(equality)])).
% cnf(4355,negated_conjecture,($false),4354,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 361
% # ...of these trivial : 75
% # ...subsumed : 121
% # ...remaining for further processing: 165
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 10
% # Generated clauses : 2599
% # ...of the previous two non-trivial : 1706
% # Contextual simplify-reflections : 0
% # Paramodulations : 2598
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 153
% # Positive orientable unit clauses: 118
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 32
% # Current number of unprocessed clauses: 1339
% # ...number of literals in the above : 1887
% # Clause-clause subsumption calls (NU) : 407
% # Rec. Clause-clause subsumption calls : 407
% # Unit Clause-clause subsumption calls : 40
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 138
% # Indexed BW rewrite successes : 57
% # Backwards rewriting index: 181 leaves, 1.33+/-0.898 terms/leaf
% # Paramod-from index: 100 leaves, 1.23+/-0.646 terms/leaf
% # Paramod-into index: 156 leaves, 1.33+/-0.914 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.003 s
% # Total time : 0.070 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.28 WC
% FINAL PrfWatch: 0.19 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP30512/KLE148+2.tptp
%
%------------------------------------------------------------------------------