TSTP Solution File: KLE137+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE137+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 08:09:47 EST 2010
% Result : Theorem 1.18s
% Output : Solution 1.18s
% 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/SystemOnTPTP15691/KLE137+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15691/KLE137+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15691/KLE137+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 15787
% 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]:(leq(X3,addition(multiplication(X1,X3),X2))=>leq(X3,multiplication(strong_iteration(X1),X2))),file('/tmp/SRASS.s.p', infty_coinduction)).
% fof(3, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(4, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(5, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(8, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(19, conjecture,![X4]:leq(X4,strong_iteration(one)),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:leq(X4,strong_iteration(one))),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(26, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(27, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[26])).
% cnf(28,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[27])).
% fof(30, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(31,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(33,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(36, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(39,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[38])).
% fof(62, negated_conjecture,?[X4]:~(leq(X4,strong_iteration(one))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(leq(X5,strong_iteration(one))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(leq(esk1_0,strong_iteration(one))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(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)],[37,39,theory(equality)])).
% cnf(120,plain,(leq(X1,multiplication(strong_iteration(one),X2))|~leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,33,theory(equality)])).
% cnf(245,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[28,111,theory(equality)])).
% cnf(5230,plain,(leq(X1,multiplication(strong_iteration(one),X2))|$false),inference(rw,[status(thm)],[120,245,theory(equality)])).
% cnf(5231,plain,(leq(X1,multiplication(strong_iteration(one),X2))),inference(cn,[status(thm)],[5230,theory(equality)])).
% cnf(5235,plain,(leq(X1,strong_iteration(one))),inference(spm,[status(thm)],[5231,31,theory(equality)])).
% cnf(5243,negated_conjecture,($false),inference(rw,[status(thm)],[65,5235,theory(equality)])).
% cnf(5244,negated_conjecture,($false),inference(cn,[status(thm)],[5243,theory(equality)])).
% cnf(5245,negated_conjecture,($false),5244,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 417
% # ...of these trivial : 90
% # ...subsumed : 142
% # ...remaining for further processing: 185
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 8
% # Generated clauses : 3253
% # ...of the previous two non-trivial : 2051
% # Contextual simplify-reflections : 0
% # Paramodulations : 3252
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 175
% # Positive orientable unit clauses: 137
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 35
% # Current number of unprocessed clauses: 1627
% # ...number of literals in the above : 2243
% # Clause-clause subsumption calls (NU) : 468
% # Rec. Clause-clause subsumption calls : 468
% # Unit Clause-clause subsumption calls : 45
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 204
% # Indexed BW rewrite successes : 62
% # Backwards rewriting index: 176 leaves, 1.50+/-1.022 terms/leaf
% # Paramod-from index: 99 leaves, 1.43+/-0.818 terms/leaf
% # Paramod-into index: 150 leaves, 1.53+/-1.050 terms/leaf
% # -------------------------------------------------
% # User time : 0.077 s
% # System time : 0.004 s
% # Total time : 0.081 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.33 WC
% FINAL PrfWatch: 0.23 CPU 0.33 WC
% SZS output end Solution for /tmp/SystemOnTPTP15691/KLE137+1.tptp
%
%------------------------------------------------------------------------------