%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE113+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 08:06:33 EST 2010
% Result : Theorem 1.15s
% Output : Solution 1.15s
% 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/SystemOnTPTP29899/KLE113+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29899/KLE113+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29899/KLE113+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 30031
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:multiplication(X1,zero)=zero,file('/tmp/SRASS.s.p', right_annihilation)).
% fof(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(4, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(8, axiom,![X4]:![X5]:forward_diamond(X4,X5)=domain(multiplication(X4,domain(X5))),file('/tmp/SRASS.s.p', forward_diamond)).
% fof(10, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(14, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(19, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(25, axiom,![X4]:addition(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(27, conjecture,![X4]:forward_diamond(X4,zero)=zero,file('/tmp/SRASS.s.p', goals)).
% fof(28, negated_conjecture,~(![X4]:forward_diamond(X4,zero)=zero),inference(assume_negation,[status(cth)],[27])).
% fof(29, plain,![X2]:multiplication(X2,zero)=zero,inference(variable_rename,[status(thm)],[1])).
% cnf(30,plain,(multiplication(X1,zero)=zero),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(34,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(36,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[35])).
% fof(43, plain,![X6]:![X7]:forward_diamond(X6,X7)=domain(multiplication(X6,domain(X7))),inference(variable_rename,[status(thm)],[8])).
% cnf(44,plain,(forward_diamond(X1,X2)=domain(multiplication(X1,domain(X2)))),inference(split_conjunct,[status(thm)],[43])).
% fof(47, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[10])).
% cnf(48,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[47])).
% fof(55, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[14])).
% cnf(56,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[55])).
% fof(67, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[19])).
% cnf(68,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[67])).
% fof(79, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[25])).
% cnf(80,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[79])).
% fof(83, negated_conjecture,?[X4]:~(forward_diamond(X4,zero)=zero),inference(fof_nnf,[status(thm)],[28])).
% fof(84, negated_conjecture,?[X5]:~(forward_diamond(X5,zero)=zero),inference(variable_rename,[status(thm)],[83])).
% fof(85, negated_conjecture,~(forward_diamond(esk1_0,zero)=zero),inference(skolemize,[status(esa)],[84])).
% cnf(86,negated_conjecture,(forward_diamond(esk1_0,zero)!=zero),inference(split_conjunct,[status(thm)],[85])).
% cnf(89,plain,(antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2)))))=forward_diamond(X1,X2)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[44,56,theory(equality)]),56,theory(equality)]),['unfolding']).
% cnf(95,negated_conjecture,(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(zero)))))!=zero),inference(rw,[status(thm)],[86,89,theory(equality)]),['unfolding']).
% cnf(97,plain,(zero=antidomain(one)),inference(spm,[status(thm)],[68,48,theory(equality)])).
% cnf(98,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[34,36,theory(equality)])).
% cnf(145,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[80,36,theory(equality)])).
% cnf(272,plain,(addition(zero,antidomain(zero))=one),inference(spm,[status(thm)],[145,97,theory(equality)])).
% cnf(298,plain,(antidomain(zero)=one),inference(rw,[status(thm)],[272,98,theory(equality)])).
% cnf(302,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[95,298,theory(equality)]),97,theory(equality)]),30,theory(equality)]),298,theory(equality)]),97,theory(equality)])).
% cnf(303,negated_conjecture,($false),inference(cn,[status(thm)],[302,theory(equality)])).
% cnf(304,negated_conjecture,($false),303,['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.012 s
% # System time : 0.002 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP29899/KLE113+1.tptp
%
%------------------------------------------------------------------------------