TSTP Solution File: KLE141+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE141+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 : art07.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:08 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP8746/KLE141+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8746/KLE141+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8746/KLE141+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 8842
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% 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(9, 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(10, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(13, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(14, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(19, conjecture,![X4]:multiplication(strong_iteration(one),X4)=strong_iteration(one),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:multiplication(strong_iteration(one),X4)=strong_iteration(one)),inference(assume_negation,[status(cth)],[19])).
% 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(37, plain,![X1]:![X2]:![X3]:(~(leq(X3,addition(multiplication(X1,X3),X2)))|leq(X3,multiplication(strong_iteration(X1),X2))),inference(fof_nnf,[status(thm)],[9])).
% fof(38, plain,![X4]:![X5]:![X6]:(~(leq(X6,addition(multiplication(X4,X6),X5)))|leq(X6,multiplication(strong_iteration(X4),X5))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(leq(X1,multiplication(strong_iteration(X2),X3))|~leq(X1,addition(multiplication(X2,X1),X3))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[10])).
% cnf(41,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[11])).
% cnf(43,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[42])).
% fof(46, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(47,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[14])).
% fof(49, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[48])).
% cnf(50,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[49])).
% cnf(51,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[49])).
% fof(62, negated_conjecture,?[X4]:~(multiplication(strong_iteration(one),X4)=strong_iteration(one)),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(multiplication(strong_iteration(one),X5)=strong_iteration(one)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(multiplication(strong_iteration(one),esk1_0)=strong_iteration(one)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(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)],[43,47,theory(equality)])).
% cnf(120,plain,(leq(X1,multiplication(strong_iteration(one),X2))|~leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[39,26,theory(equality)])).
% cnf(245,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[50,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(5234,plain,(addition(X1,multiplication(strong_iteration(one),X2))=multiplication(strong_iteration(one),X2)),inference(spm,[status(thm)],[51,5231,theory(equality)])).
% cnf(5235,plain,(leq(X1,strong_iteration(one))),inference(spm,[status(thm)],[5231,24,theory(equality)])).
% cnf(5242,plain,(addition(X1,strong_iteration(one))=strong_iteration(one)),inference(spm,[status(thm)],[51,5235,theory(equality)])).
% cnf(5270,plain,(strong_iteration(one)=addition(strong_iteration(one),X1)),inference(spm,[status(thm)],[41,5242,theory(equality)])).
% cnf(10552,plain,(multiplication(strong_iteration(one),X1)=strong_iteration(one)),inference(spm,[status(thm)],[5270,5234,theory(equality)])).
% cnf(10957,negated_conjecture,($false),inference(rw,[status(thm)],[65,10552,theory(equality)])).
% cnf(10958,negated_conjecture,($false),inference(cn,[status(thm)],[10957,theory(equality)])).
% cnf(10959,negated_conjecture,($false),10958,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 679
% # ...of these trivial : 169
% # ...subsumed : 235
% # ...remaining for further processing: 275
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 29
% # Generated clauses : 6175
% # ...of the previous two non-trivial : 3314
% # Contextual simplify-reflections : 0
% # Paramodulations : 6173
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 244
% # Positive orientable unit clauses: 187
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 2436
% # ...number of literals in the above : 3419
% # Clause-clause subsumption calls (NU) : 935
% # Rec. Clause-clause subsumption calls : 935
% # Unit Clause-clause subsumption calls : 45
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 380
% # Indexed BW rewrite successes : 80
% # Backwards rewriting index: 230 leaves, 1.71+/-1.353 terms/leaf
% # Paramod-from index: 122 leaves, 1.57+/-1.342 terms/leaf
% # Paramod-into index: 200 leaves, 1.70+/-1.371 terms/leaf
% # -------------------------------------------------
% # User time : 0.130 s
% # System time : 0.008 s
% # Total time : 0.138 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.32 CPU 0.41 WC
% FINAL PrfWatch: 0.32 CPU 0.41 WC
% SZS output end Solution for /tmp/SystemOnTPTP8746/KLE141+1.tptp
%
%------------------------------------------------------------------------------