TSTP Solution File: KLE086+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE086+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 : art06.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:54:29 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP24229/KLE086+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP24229/KLE086+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24229/KLE086+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 24325
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(4, axiom,![X2]:domain(X2)=antidomain(antidomain(X2)),file('/tmp/SRASS.s.p', domain4)).
% fof(5, axiom,![X1]:![X3]:addition(X1,X3)=addition(X3,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(9, axiom,![X2]:multiplication(antidomain(X2),X2)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(15, axiom,![X2]:addition(antidomain(antidomain(X2)),antidomain(X2))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(16, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(21, conjecture,domain(zero)=zero,file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(domain(zero)=zero),inference(assume_negation,[status(cth)],[21])).
% fof(23, negated_conjecture,~(domain(zero)=zero),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% fof(24, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(25,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(30, plain,![X3]:domain(X3)=antidomain(antidomain(X3)),inference(variable_rename,[status(thm)],[4])).
% cnf(31,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:addition(X4,X5)=addition(X5,X4),inference(variable_rename,[status(thm)],[5])).
% cnf(33,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(40, plain,![X3]:multiplication(antidomain(X3),X3)=zero,inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[40])).
% fof(52, plain,![X3]:addition(antidomain(antidomain(X3)),antidomain(X3))=one,inference(variable_rename,[status(thm)],[15])).
% cnf(53,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[16])).
% cnf(55,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[54])).
% cnf(66,negated_conjecture,(domain(zero)!=zero),inference(split_conjunct,[status(thm)],[23])).
% cnf(67,negated_conjecture,(antidomain(antidomain(zero))!=zero),inference(rw,[status(thm)],[66,31,theory(equality)]),['unfolding']).
% cnf(69,plain,(zero=antidomain(one)),inference(spm,[status(thm)],[55,41,theory(equality)])).
% cnf(70,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[25,33,theory(equality)])).
% cnf(117,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[53,33,theory(equality)])).
% cnf(244,plain,(addition(zero,antidomain(zero))=one),inference(spm,[status(thm)],[117,69,theory(equality)])).
% cnf(270,plain,(antidomain(zero)=one),inference(rw,[status(thm)],[244,70,theory(equality)])).
% cnf(274,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[67,270,theory(equality)]),69,theory(equality)])).
% cnf(275,negated_conjecture,($false),inference(cn,[status(thm)],[274,theory(equality)])).
% cnf(276,negated_conjecture,($false),275,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 30
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 28
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 117
% # ...of the previous two non-trivial : 74
% # Contextual simplify-reflections : 0
% # Paramodulations : 116
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 3
% # Current number of unprocessed clauses: 64
% # ...number of literals in the above : 71
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 41 leaves, 1.27+/-0.797 terms/leaf
% # Paramod-from index: 22 leaves, 1.14+/-0.457 terms/leaf
% # Paramod-into index: 35 leaves, 1.23+/-0.539 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.005 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP24229/KLE086+1.tptp
%
%------------------------------------------------------------------------------