TSTP Solution File: KLE075+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE075+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 : art05.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:53:04 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/SystemOnTPTP16045/KLE075+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP16045/KLE075+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16045/KLE075+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 16141
% 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(3, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(4, axiom,![X4]:![X5]:domain(multiplication(X4,X5))=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', domain2)).
% fof(18, conjecture,![X4]:domain(multiplication(one,domain(X4)))=domain(X4),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:domain(multiplication(one,domain(X4)))=domain(X4)),inference(assume_negation,[status(cth)],[18])).
% fof(24, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X6]:![X7]:domain(multiplication(X6,X7))=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[4])).
% cnf(27,plain,(domain(multiplication(X1,X2))=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[26])).
% fof(55, negated_conjecture,?[X4]:~(domain(multiplication(one,domain(X4)))=domain(X4)),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X5]:~(domain(multiplication(one,domain(X5)))=domain(X5)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(domain(multiplication(one,domain(esk1_0)))=domain(esk1_0)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(domain(multiplication(one,domain(esk1_0)))!=domain(esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(domain(domain(esk1_0))!=domain(esk1_0)),inference(rw,[status(thm)],[58,25,theory(equality)])).
% cnf(120,plain,(domain(domain(X1))=domain(multiplication(one,X1))),inference(spm,[status(thm)],[27,25,theory(equality)])).
% cnf(127,plain,(domain(domain(X1))=domain(X1)),inference(rw,[status(thm)],[120,25,theory(equality)])).
% cnf(219,negated_conjecture,($false),inference(rw,[status(thm)],[59,127,theory(equality)])).
% cnf(220,negated_conjecture,($false),inference(cn,[status(thm)],[219,theory(equality)])).
% cnf(221,negated_conjecture,($false),220,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 25
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 24
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 89
% # ...of the previous two non-trivial : 50
% # Contextual simplify-reflections : 0
% # Paramodulations : 88
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 43
% # ...number of literals in the above : 49
% # 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: 31 leaves, 1.29+/-0.887 terms/leaf
% # Paramod-from index: 16 leaves, 1.19+/-0.527 terms/leaf
% # Paramod-into index: 23 leaves, 1.26+/-0.606 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.003 s
% # Total time : 0.013 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/SystemOnTPTP16045/KLE075+1.tptp
%
%------------------------------------------------------------------------------