TSTP Solution File: KLE141+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE141+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 : art03.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:14 EST 2010
% Result : Theorem 1.02s
% Output : Solution 1.02s
% 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/SystemOnTPTP27722/KLE141+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27722/KLE141+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27722/KLE141+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 27818
% 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]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% 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(5, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(10, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(12, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(19, conjecture,![X4]:(leq(multiplication(strong_iteration(one),X4),strong_iteration(one))&leq(strong_iteration(one),multiplication(strong_iteration(one),X4))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:(leq(multiplication(strong_iteration(one),X4),strong_iteration(one))&leq(strong_iteration(one),multiplication(strong_iteration(one),X4)))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(22, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% 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(44, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[10])).
% cnf(45,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[44])).
% fof(48, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(49,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[48])).
% fof(62, negated_conjecture,?[X4]:(~(leq(multiplication(strong_iteration(one),X4),strong_iteration(one)))|~(leq(strong_iteration(one),multiplication(strong_iteration(one),X4)))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:(~(leq(multiplication(strong_iteration(one),X5),strong_iteration(one)))|~(leq(strong_iteration(one),multiplication(strong_iteration(one),X5)))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one)))|~(leq(strong_iteration(one),multiplication(strong_iteration(one),esk1_0)))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(strong_iteration(one),multiplication(strong_iteration(one),esk1_0))|~leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one))),inference(split_conjunct,[status(thm)],[64])).
% cnf(111,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[45,49,theory(equality)])).
% cnf(120,plain,(leq(X1,multiplication(strong_iteration(one),X2))|~leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,27,theory(equality)])).
% cnf(245,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[32,111,theory(equality)])).
% cnf(5245,plain,(leq(X1,multiplication(strong_iteration(one),X2))|$false),inference(rw,[status(thm)],[120,245,theory(equality)])).
% cnf(5246,plain,(leq(X1,multiplication(strong_iteration(one),X2))),inference(cn,[status(thm)],[5245,theory(equality)])).
% cnf(5250,plain,(leq(X1,strong_iteration(one))),inference(spm,[status(thm)],[5246,25,theory(equality)])).
% cnf(5253,negated_conjecture,($false|~leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one))),inference(rw,[status(thm)],[65,5246,theory(equality)])).
% cnf(5254,negated_conjecture,(~leq(multiplication(strong_iteration(one),esk1_0),strong_iteration(one))),inference(cn,[status(thm)],[5253,theory(equality)])).
% cnf(5260,negated_conjecture,($false),inference(rw,[status(thm)],[5254,5250,theory(equality)])).
% cnf(5261,negated_conjecture,($false),inference(cn,[status(thm)],[5260,theory(equality)])).
% cnf(5262,negated_conjecture,($false),5261,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 418
% # ...of these trivial : 89
% # ...subsumed : 142
% # ...remaining for further processing: 187
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 9
% # Generated clauses : 3260
% # ...of the previous two non-trivial : 2051
% # Contextual simplify-reflections : 0
% # Paramodulations : 3259
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 176
% # Positive orientable unit clauses: 138
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 1626
% # ...number of literals in the above : 2243
% # Clause-clause subsumption calls (NU) : 461
% # Rec. Clause-clause subsumption calls : 461
% # Unit Clause-clause subsumption calls : 45
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 209
% # Indexed BW rewrite successes : 63
% # Backwards rewriting index: 177 leaves, 1.50+/-1.020 terms/leaf
% # Paramod-from index: 100 leaves, 1.43+/-0.816 terms/leaf
% # Paramod-into index: 151 leaves, 1.52+/-1.047 terms/leaf
% # -------------------------------------------------
% # User time : 0.073 s
% # System time : 0.006 s
% # Total time : 0.079 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.30 WC
% FINAL PrfWatch: 0.21 CPU 0.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP27722/KLE141+2.tptp
%
%------------------------------------------------------------------------------