TSTP Solution File: KLE001+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE001+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 : art02.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:29:28 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/SystemOnTPTP5601/KLE001+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5601/KLE001+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5601/KLE001+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 5697
% 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(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(4, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(13, conjecture,![X4]:![X5]:![X6]:(leq(X4,X5)=>leq(addition(X4,X6),addition(X4,X6))),file('/tmp/SRASS.s.p', goals)).
% fof(14, negated_conjecture,~(![X4]:![X5]:![X6]:(leq(X4,X5)=>leq(addition(X4,X6),addition(X4,X6)))),inference(assume_negation,[status(cth)],[13])).
% fof(19, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(20,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[22])).
% fof(41, negated_conjecture,?[X4]:?[X5]:?[X6]:(leq(X4,X5)&~(leq(addition(X4,X6),addition(X4,X6)))),inference(fof_nnf,[status(thm)],[14])).
% fof(42, negated_conjecture,?[X7]:?[X8]:?[X9]:(leq(X7,X8)&~(leq(addition(X7,X9),addition(X7,X9)))),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,(leq(esk1_0,esk2_0)&~(leq(addition(esk1_0,esk3_0),addition(esk1_0,esk3_0)))),inference(skolemize,[status(esa)],[42])).
% cnf(44,negated_conjecture,(~leq(addition(esk1_0,esk3_0),addition(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[43])).
% cnf(59,plain,(leq(X1,X1)),inference(spm,[status(thm)],[23,20,theory(equality)])).
% cnf(64,negated_conjecture,($false),inference(rw,[status(thm)],[44,59,theory(equality)])).
% cnf(65,negated_conjecture,($false),inference(cn,[status(thm)],[64,theory(equality)])).
% cnf(66,negated_conjecture,($false),65,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 14
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 14
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 14
% # ...of the previous two non-trivial : 9
% # Contextual simplify-reflections : 0
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 9
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 12
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 15 leaves, 1.20+/-0.542 terms/leaf
% # Paramod-from index: 9 leaves, 1.22+/-0.629 terms/leaf
% # Paramod-into index: 13 leaves, 1.23+/-0.576 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.002 s
% # Total time : 0.011 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/SystemOnTPTP5601/KLE001+1.tptp
%
%------------------------------------------------------------------------------