TSTP Solution File: KLE066+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE066+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:52:16 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP6131/KLE066+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6131/KLE066+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6131/KLE066+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 6229
% 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(3, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(4, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(5, axiom,domain(zero)=zero,file('/tmp/SRASS.s.p', domain4)).
% fof(6, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(7, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(18, conjecture,![X4]:![X5]:(multiplication(X4,X5)=zero<=multiplication(X4,domain(X5))=zero),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:(multiplication(X4,X5)=zero<=multiplication(X4,domain(X5))=zero)),inference(assume_negation,[status(cth)],[18])).
% fof(20, negated_conjecture,~(![X4]:![X5]:(multiplication(X4,domain(X5))=zero=>multiplication(X4,X5)=zero)),inference(fof_simplification,[status(thm)],[19,theory(equality)])).
% fof(25, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[4])).
% cnf(28,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,plain,(domain(zero)=zero),inference(split_conjunct,[status(thm)],[5])).
% fof(30, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(56, negated_conjecture,?[X4]:?[X5]:(multiplication(X4,domain(X5))=zero&~(multiplication(X4,X5)=zero)),inference(fof_nnf,[status(thm)],[20])).
% fof(57, negated_conjecture,?[X6]:?[X7]:(multiplication(X6,domain(X7))=zero&~(multiplication(X6,X7)=zero)),inference(variable_rename,[status(thm)],[56])).
% fof(58, negated_conjecture,(multiplication(esk1_0,domain(esk2_0))=zero&~(multiplication(esk1_0,esk2_0)=zero)),inference(skolemize,[status(esa)],[57])).
% cnf(59,negated_conjecture,(multiplication(esk1_0,esk2_0)!=zero),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,negated_conjecture,(multiplication(esk1_0,domain(esk2_0))=zero),inference(split_conjunct,[status(thm)],[58])).
% cnf(123,negated_conjecture,(domain(zero)=domain(multiplication(esk1_0,esk2_0))),inference(spm,[status(thm)],[28,60,theory(equality)])).
% cnf(130,negated_conjecture,(zero=domain(multiplication(esk1_0,esk2_0))),inference(rw,[status(thm)],[123,29,theory(equality)])).
% cnf(223,negated_conjecture,(addition(multiplication(esk1_0,esk2_0),multiplication(zero,multiplication(esk1_0,esk2_0)))=multiplication(zero,multiplication(esk1_0,esk2_0))),inference(spm,[status(thm)],[31,130,theory(equality)])).
% cnf(227,negated_conjecture,(multiplication(esk1_0,esk2_0)=multiplication(zero,multiplication(esk1_0,esk2_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[223,26,theory(equality)]),33,theory(equality)])).
% cnf(228,negated_conjecture,(multiplication(esk1_0,esk2_0)=zero),inference(rw,[status(thm)],[227,26,theory(equality)])).
% cnf(229,negated_conjecture,($false),inference(sr,[status(thm)],[228,59,theory(equality)])).
% cnf(230,negated_conjecture,($false),229,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 23
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 22
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 92
% # ...of the previous two non-trivial : 56
% # Contextual simplify-reflections : 0
% # Paramodulations : 92
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 51
% # ...number of literals in the above : 58
% # 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 : 10
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 34 leaves, 1.26+/-0.851 terms/leaf
% # Paramod-from index: 16 leaves, 1.19+/-0.527 terms/leaf
% # Paramod-into index: 27 leaves, 1.22+/-0.567 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.005 s
% # Total time : 0.014 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/SystemOnTPTP6131/KLE066+1.tptp
%
%------------------------------------------------------------------------------