TSTP Solution File: KLE148+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE148+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 08:13:45 EST 2010
% Result : Theorem 0.94s
% Output : Solution 0.94s
% 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/SystemOnTPTP21717/KLE148+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21717/KLE148+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21717/KLE148+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 21813
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 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(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', distributivity1)).
% fof(7, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(9, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(12, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(19, conjecture,![X4]:![X5]:(multiplication(X4,X5)=zero=>multiplication(X4,strong_iteration(X5))=X4),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:(multiplication(X4,X5)=zero=>multiplication(X4,strong_iteration(X5))=X4)),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(25, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[33])).
% fof(38, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(39,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(44, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(45,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(62, negated_conjecture,?[X4]:?[X5]:(multiplication(X4,X5)=zero&~(multiplication(X4,strong_iteration(X5))=X4)),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X6]:?[X7]:(multiplication(X6,X7)=zero&~(multiplication(X6,strong_iteration(X7))=X6)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(multiplication(esk1_0,esk2_0)=zero&~(multiplication(esk1_0,strong_iteration(esk2_0))=esk1_0)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(multiplication(esk1_0,strong_iteration(esk2_0))!=esk1_0),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,negated_conjecture,(multiplication(esk1_0,esk2_0)=zero),inference(split_conjunct,[status(thm)],[64])).
% cnf(86,negated_conjecture,(multiplication(zero,X1)=multiplication(esk1_0,multiplication(esk2_0,X1))),inference(spm,[status(thm)],[22,66,theory(equality)])).
% cnf(93,negated_conjecture,(zero=multiplication(esk1_0,multiplication(esk2_0,X1))),inference(rw,[status(thm)],[86,24,theory(equality)])).
% cnf(115,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[34,39,theory(equality)])).
% cnf(165,plain,(addition(multiplication(X1,X2),X1)=multiplication(X1,addition(X2,one))),inference(spm,[status(thm)],[30,45,theory(equality)])).
% cnf(969,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(X2,one))),inference(rw,[status(thm)],[165,39,theory(equality)])).
% cnf(999,negated_conjecture,(addition(esk1_0,zero)=multiplication(esk1_0,addition(multiplication(esk2_0,X1),one))),inference(spm,[status(thm)],[969,93,theory(equality)])).
% cnf(1039,negated_conjecture,(esk1_0=multiplication(esk1_0,addition(multiplication(esk2_0,X1),one))),inference(rw,[status(thm)],[999,26,theory(equality)])).
% cnf(2221,negated_conjecture,(multiplication(esk1_0,addition(one,multiplication(esk2_0,X1)))=esk1_0),inference(rw,[status(thm)],[1039,39,theory(equality)])).
% cnf(2237,negated_conjecture,(multiplication(esk1_0,strong_iteration(esk2_0))=esk1_0),inference(spm,[status(thm)],[2221,115,theory(equality)])).
% cnf(2247,negated_conjecture,($false),inference(sr,[status(thm)],[2237,65,theory(equality)])).
% cnf(2248,negated_conjecture,($false),2247,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 231
% # ...of these trivial : 51
% # ...subsumed : 76
% # ...remaining for further processing: 104
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 4
% # Generated clauses : 1288
% # ...of the previous two non-trivial : 852
% # Contextual simplify-reflections : 0
% # Paramodulations : 1287
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 98
% # Positive orientable unit clauses: 72
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 1
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 638
% # ...number of literals in the above : 907
% # Clause-clause subsumption calls (NU) : 247
% # Rec. Clause-clause subsumption calls : 247
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 61
% # Indexed BW rewrite successes : 20
% # Backwards rewriting index: 129 leaves, 1.31+/-0.896 terms/leaf
% # Paramod-from index: 66 leaves, 1.15+/-0.500 terms/leaf
% # Paramod-into index: 107 leaves, 1.30+/-0.919 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.003 s
% # Total time : 0.041 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.14 CPU 0.22 WC
% FINAL PrfWatch: 0.14 CPU 0.22 WC
% SZS output end Solution for /tmp/SystemOnTPTP21717/KLE148+1.tptp
%
%------------------------------------------------------------------------------