TSTP Solution File: KLE003+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE003+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 : art01.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:53 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP24083/KLE003+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24083/KLE003+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24083/KLE003+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 24179
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(13, conjecture,(![X4]:addition(X4,X4)=X4<=>addition(one,one)=one),file('/tmp/SRASS.s.p', goals)).
% fof(14, negated_conjecture,~((![X4]:addition(X4,X4)=X4<=>addition(one,one)=one)),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(41, negated_conjecture,((?[X4]:~(addition(X4,X4)=X4)|~(addition(one,one)=one))&(![X4]:addition(X4,X4)=X4|addition(one,one)=one)),inference(fof_nnf,[status(thm)],[14])).
% fof(42, negated_conjecture,((?[X5]:~(addition(X5,X5)=X5)|~(addition(one,one)=one))&(![X6]:addition(X6,X6)=X6|addition(one,one)=one)),inference(variable_rename,[status(thm)],[41])).
% fof(43, negated_conjecture,((~(addition(esk1_0,esk1_0)=esk1_0)|~(addition(one,one)=one))&(![X6]:addition(X6,X6)=X6|addition(one,one)=one)),inference(skolemize,[status(esa)],[42])).
% fof(44, negated_conjecture,![X6]:((addition(X6,X6)=X6|addition(one,one)=one)&(~(addition(esk1_0,esk1_0)=esk1_0)|~(addition(one,one)=one))),inference(shift_quantors,[status(thm)],[43])).
% cnf(45,negated_conjecture,(addition(one,one)!=one|addition(esk1_0,esk1_0)!=esk1_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(49,negated_conjecture,($false|addition(esk1_0,esk1_0)!=esk1_0),inference(rw,[status(thm)],[45,20,theory(equality)])).
% cnf(50,negated_conjecture,($false|$false),inference(rw,[status(thm)],[49,20,theory(equality)])).
% cnf(51,negated_conjecture,($false),inference(cn,[status(thm)],[50,theory(equality)])).
% cnf(52,negated_conjecture,($false),51,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 10
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 9
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 0
% # ...of the previous two non-trivial : 0
% # Contextual simplify-reflections : 0
% # Paramodulations : 0
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 1
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 6
% # 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 : 4
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 10 leaves, 1.20+/-0.600 terms/leaf
% # Paramod-from index: 6 leaves, 1.33+/-0.745 terms/leaf
% # Paramod-into index: 9 leaves, 1.22+/-0.629 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.003 s
% # Total time : 0.011 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.21 WC
% FINAL PrfWatch: 0.11 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP24083/KLE003+1.tptp
%
%------------------------------------------------------------------------------