TSTP Solution File: KLE067+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE067+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 07:52:20 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/SystemOnTPTP30457/KLE067+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP30457/KLE067+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30457/KLE067+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 30553
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X4]:![X5]:domain(addition(X4,X5))=addition(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', domain5)).
% fof(6, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(18, conjecture,![X4]:![X5]:domain(addition(domain(X4),domain(X5)))=addition(domain(X4),domain(X5)),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:domain(addition(domain(X4),domain(X5)))=addition(domain(X4),domain(X5))),inference(assume_negation,[status(cth)],[18])).
% fof(26, plain,![X6]:![X7]:domain(addition(X6,X7))=addition(domain(X6),domain(X7)),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(domain(addition(X1,X2))=addition(domain(X1),domain(X2))),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[30])).
% fof(45, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(55, negated_conjecture,?[X4]:?[X5]:~(domain(addition(domain(X4),domain(X5)))=addition(domain(X4),domain(X5))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X6]:?[X7]:~(domain(addition(domain(X6),domain(X7)))=addition(domain(X6),domain(X7))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(domain(addition(domain(esk1_0),domain(esk2_0)))=addition(domain(esk1_0),domain(esk2_0))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(domain(addition(domain(esk1_0),domain(esk2_0)))!=addition(domain(esk1_0),domain(esk2_0))),inference(split_conjunct,[status(thm)],[57])).
% cnf(110,negated_conjecture,(domain(domain(addition(esk1_0,esk2_0)))!=addition(domain(esk1_0),domain(esk2_0))),inference(rw,[status(thm)],[58,27,theory(equality)])).
% cnf(111,negated_conjecture,(domain(domain(addition(esk1_0,esk2_0)))!=domain(addition(esk1_0,esk2_0))),inference(rw,[status(thm)],[110,27,theory(equality)])).
% cnf(121,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[31,46,theory(equality)])).
% cnf(128,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[121,46,theory(equality)])).
% cnf(236,negated_conjecture,($false),inference(rw,[status(thm)],[111,128,theory(equality)])).
% cnf(237,negated_conjecture,($false),inference(cn,[status(thm)],[236,theory(equality)])).
% cnf(238,negated_conjecture,($false),237,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 27
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 96
% # ...of the previous two non-trivial : 58
% # Contextual simplify-reflections : 0
% # Paramodulations : 95
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 22
% # Positive orientable unit clauses: 18
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 47
% # ...number of literals in the above : 54
% # 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 : 13
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 32 leaves, 1.28+/-0.874 terms/leaf
% # Paramod-from index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-into index: 24 leaves, 1.25+/-0.595 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.004 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP30457/KLE067+1.tptp
%
%------------------------------------------------------------------------------