TSTP Solution File: KLE058+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE058+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 07:51:11 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP5320/KLE058+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5320/KLE058+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5320/KLE058+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 5416
% 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]:addition(domain(X1),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(2, axiom,![X2]:multiplication(X2,one)=X2,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(6, axiom,![X2]:![X4]:addition(X2,X4)=addition(X4,X2),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X1]:addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1),file('/tmp/SRASS.s.p', domain1)).
% fof(18, conjecture,domain(one)=one,file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(domain(one)=one),inference(assume_negation,[status(cth)],[18])).
% fof(20, negated_conjecture,~(domain(one)=one),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(21, plain,![X2]:addition(domain(X2),one)=one,inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:multiplication(X3,one)=X3,inference(variable_rename,[status(thm)],[2])).
% cnf(24,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[23])).
% fof(31, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[6])).
% cnf(32,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[31])).
% fof(40, plain,![X2]:addition(X2,multiplication(domain(X2),X2))=multiplication(domain(X2),X2),inference(variable_rename,[status(thm)],[11])).
% cnf(41,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[40])).
% cnf(56,negated_conjecture,(domain(one)!=one),inference(split_conjunct,[status(thm)],[20])).
% cnf(62,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[22,32,theory(equality)])).
% cnf(132,plain,(addition(one,domain(one))=domain(one)),inference(spm,[status(thm)],[41,24,theory(equality)])).
% cnf(228,plain,(one=domain(one)),inference(rw,[status(thm)],[132,62,theory(equality)])).
% cnf(229,plain,($false),inference(sr,[status(thm)],[228,56,theory(equality)])).
% cnf(230,plain,($false),229,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 26
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 25
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 96
% # ...of the previous two non-trivial : 54
% # Contextual simplify-reflections : 0
% # Paramodulations : 95
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 23
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 44
% # ...number of literals in the above : 50
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 33 leaves, 1.27+/-0.862 terms/leaf
% # Paramod-from index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-into index: 25 leaves, 1.24+/-0.585 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.005 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP5320/KLE058+1.tptp
%
%------------------------------------------------------------------------------