TSTP Solution File: KLE142+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE142+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 : art04.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:12:22 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/SystemOnTPTP309/KLE142+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP309/KLE142+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP309/KLE142+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 406
% 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]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(2, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(3, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(4, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(5, 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', idempotence)).
% fof(10, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(14, axiom,![X1]:![X2]:![X3]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(15, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(19, conjecture,![X4]:strong_iteration(strong_iteration(X4))=strong_iteration(one),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:strong_iteration(strong_iteration(X4))=strong_iteration(one)),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(39, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[10])).
% cnf(40,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[39])).
% fof(47, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[14])).
% fof(48, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[47])).
% cnf(49,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[48])).
% fof(50, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(51, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[50])).
% cnf(52,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[51])).
% cnf(53,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(62, negated_conjecture,?[X4]:~(strong_iteration(strong_iteration(X4))=strong_iteration(one)),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(strong_iteration(strong_iteration(X5))=strong_iteration(one)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(strong_iteration(strong_iteration(esk1_0))=strong_iteration(one)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(strong_iteration(strong_iteration(esk1_0))!=strong_iteration(one)),inference(split_conjunct,[status(thm)],[64])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[22,28,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[52,34,theory(equality)])).
% cnf(88,plain,(leq(X1,multiplication(strong_iteration(one),X2))|~leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[49,26,theory(equality)])).
% cnf(119,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[30,34,theory(equality)])).
% cnf(189,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[40,26,theory(equality)])).
% cnf(245,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[52,119,theory(equality)])).
% cnf(672,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[189,28,theory(equality)])).
% cnf(1263,plain,(leq(X1,multiplication(strong_iteration(one),X2))|$false),inference(rw,[status(thm)],[88,245,theory(equality)])).
% cnf(1264,plain,(leq(X1,multiplication(strong_iteration(one),X2))),inference(cn,[status(thm)],[1263,theory(equality)])).
% cnf(1268,plain,(leq(X1,strong_iteration(one))),inference(spm,[status(thm)],[1264,24,theory(equality)])).
% cnf(1274,plain,(addition(X1,strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[53,1268,theory(equality)])).
% cnf(1285,plain,(strong_iteration(one)=addition(strong_iteration(one),X1)),inference(spm,[status(thm)],[28,1274,theory(equality)])).
% cnf(1336,plain,(strong_iteration(one)=multiplication(addition(X1,one),strong_iteration(one))),inference(spm,[status(thm)],[672,1285,theory(equality)])).
% cnf(1571,plain,(multiplication(addition(one,X1),strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[1336,28,theory(equality)])).
% cnf(1941,plain,(multiplication(strong_iteration(X1),strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[1571,76,theory(equality)])).
% cnf(2084,plain,(leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X1)),X2))|~leq(strong_iteration(one),addition(strong_iteration(one),X2))),inference(spm,[status(thm)],[49,1941,theory(equality)])).
% cnf(2104,plain,(leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X1)),X2))|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2084,1285,theory(equality)]),84,theory(equality)])).
% cnf(2105,plain,(leq(strong_iteration(one),multiplication(strong_iteration(strong_iteration(X1)),X2))),inference(cn,[status(thm)],[2104,theory(equality)])).
% cnf(4980,plain,(leq(strong_iteration(one),strong_iteration(strong_iteration(X1)))),inference(spm,[status(thm)],[2105,24,theory(equality)])).
% cnf(4995,plain,(addition(strong_iteration(one),strong_iteration(strong_iteration(X1)))=strong_iteration(strong_iteration(X1))),inference(spm,[status(thm)],[53,4980,theory(equality)])).
% cnf(5003,plain,(strong_iteration(one)=strong_iteration(strong_iteration(X1))),inference(rw,[status(thm)],[4995,1285,theory(equality)])).
% cnf(5105,negated_conjecture,($false),inference(rw,[status(thm)],[65,5003,theory(equality)])).
% cnf(5106,negated_conjecture,($false),inference(cn,[status(thm)],[5105,theory(equality)])).
% cnf(5107,negated_conjecture,($false),5106,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 385
% # ...of these trivial : 97
% # ...subsumed : 123
% # ...remaining for further processing: 165
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 27
% # Generated clauses : 2674
% # ...of the previous two non-trivial : 1282
% # Contextual simplify-reflections : 0
% # Paramodulations : 2672
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 136
% # Positive orientable unit clauses: 99
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 36
% # Current number of unprocessed clauses: 803
% # ...number of literals in the above : 1177
% # Clause-clause subsumption calls (NU) : 401
% # Rec. Clause-clause subsumption calls : 401
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 106
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 161 leaves, 1.46+/-0.991 terms/leaf
% # Paramod-from index: 84 leaves, 1.20+/-0.573 terms/leaf
% # Paramod-into index: 138 leaves, 1.41+/-0.968 terms/leaf
% # -------------------------------------------------
% # User time : 0.062 s
% # System time : 0.007 s
% # Total time : 0.069 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.29 WC
% FINAL PrfWatch: 0.19 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP309/KLE142+1.tptp
%
%------------------------------------------------------------------------------