%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE004+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:59 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/SystemOnTPTP5860/KLE004+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5860/KLE004+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5860/KLE004+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 5956
% 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(4, axiom,![X2]:addition(X2,zero)=X2,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X2]:multiplication(X2,zero)=zero,file('/tmp/SRASS.s.p', right_annihilation)).
% fof(6, axiom,![X2]:multiplication(zero,X2)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(7, axiom,![X2]:![X3]:addition(X2,X3)=addition(X3,X2),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X1]:![X5]:(complement(X5,X1)<=>((multiplication(X1,X5)=zero&multiplication(X5,X1)=zero)&addition(X1,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(12, axiom,![X1]:![X5]:(test(X1)=>(c(X1)=X5<=>complement(X1,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(15, axiom,![X1]:(test(X1)<=>?[X5]:complement(X5,X1)),file('/tmp/SRASS.s.p', test_1)).
% fof(17, conjecture,c(zero)=one,file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(c(zero)=one),inference(assume_negation,[status(cth)],[17])).
% fof(20, negated_conjecture,~(c(zero)=one),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(28, plain,![X3]:addition(X3,zero)=X3,inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:multiplication(X3,zero)=zero,inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(multiplication(X1,zero)=zero),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:multiplication(zero,X3)=zero,inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:addition(X4,X5)=addition(X5,X4),inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[34])).
% fof(42, plain,![X1]:![X5]:((~(complement(X5,X1))|((multiplication(X1,X5)=zero&multiplication(X5,X1)=zero)&addition(X1,X5)=one))&(((~(multiplication(X1,X5)=zero)|~(multiplication(X5,X1)=zero))|~(addition(X1,X5)=one))|complement(X5,X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(43, plain,![X6]:![X7]:((~(complement(X7,X6))|((multiplication(X6,X7)=zero&multiplication(X7,X6)=zero)&addition(X6,X7)=one))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(variable_rename,[status(thm)],[42])).
% fof(44, plain,![X6]:![X7]:((((multiplication(X6,X7)=zero|~(complement(X7,X6)))&(multiplication(X7,X6)=zero|~(complement(X7,X6))))&(addition(X6,X7)=one|~(complement(X7,X6))))&(((~(multiplication(X6,X7)=zero)|~(multiplication(X7,X6)=zero))|~(addition(X6,X7)=one))|complement(X7,X6))),inference(distribute,[status(thm)],[43])).
% cnf(45,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[44])).
% fof(49, plain,![X1]:![X5]:(~(test(X1))|((~(c(X1)=X5)|complement(X1,X5))&(~(complement(X1,X5))|c(X1)=X5))),inference(fof_nnf,[status(thm)],[12])).
% fof(50, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[49])).
% fof(51, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[50])).
% cnf(52,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(58, plain,![X1]:((~(test(X1))|?[X5]:complement(X5,X1))&(![X5]:~(complement(X5,X1))|test(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(59, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[58])).
% fof(60, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[59])).
% fof(61, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[60])).
% cnf(63,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[61])).
% cnf(68,negated_conjecture,(c(zero)!=one),inference(split_conjunct,[status(thm)],[20])).
% cnf(70,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[29,35,theory(equality)])).
% cnf(83,plain,(complement(X1,zero)|multiplication(X1,zero)!=zero|addition(zero,X1)!=one),inference(spm,[status(thm)],[45,33,theory(equality)])).
% cnf(85,plain,(complement(zero,X1)|multiplication(zero,X1)!=zero|addition(X1,zero)!=one),inference(spm,[status(thm)],[45,31,theory(equality)])).
% cnf(88,plain,(complement(X1,zero)|$false|addition(zero,X1)!=one),inference(rw,[status(thm)],[83,31,theory(equality)])).
% cnf(89,plain,(complement(X1,zero)|addition(zero,X1)!=one),inference(cn,[status(thm)],[88,theory(equality)])).
% cnf(92,plain,(complement(zero,X1)|$false|addition(X1,zero)!=one),inference(rw,[status(thm)],[85,33,theory(equality)])).
% cnf(93,plain,(complement(zero,X1)|$false|X1!=one),inference(rw,[status(thm)],[92,29,theory(equality)])).
% cnf(94,plain,(complement(zero,X1)|X1!=one),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(205,plain,(complement(zero,one)),inference(er,[status(thm)],[94,theory(equality)])).
% cnf(209,plain,(c(zero)=one|~test(zero)),inference(spm,[status(thm)],[52,205,theory(equality)])).
% cnf(213,plain,(~test(zero)),inference(sr,[status(thm)],[209,68,theory(equality)])).
% cnf(235,plain,(complement(X1,zero)|X1!=one),inference(rw,[status(thm)],[89,70,theory(equality)])).
% cnf(236,plain,(complement(one,zero)),inference(er,[status(thm)],[235,theory(equality)])).
% cnf(238,plain,(test(zero)),inference(spm,[status(thm)],[63,236,theory(equality)])).
% cnf(243,plain,($false),inference(sr,[status(thm)],[238,213,theory(equality)])).
% cnf(244,plain,($false),243,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 43
% # ...of these trivial : 1
% # ...subsumed : 4
% # ...remaining for further processing: 38
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 98
% # ...of the previous two non-trivial : 54
% # Contextual simplify-reflections : 0
% # Paramodulations : 94
% # Factorizations : 0
% # Equation resolutions : 4
% # Current number of processed clauses: 37
% # Positive orientable unit clauses: 17
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 17
% # Current number of unprocessed clauses: 31
% # ...number of literals in the above : 44
% # Clause-clause subsumption calls (NU) : 13
% # Rec. Clause-clause subsumption calls : 13
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 35 leaves, 1.31+/-0.949 terms/leaf
% # Paramod-from index: 17 leaves, 1.18+/-0.513 terms/leaf
% # Paramod-into index: 24 leaves, 1.33+/-0.745 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.004 s
% # Total time : 0.017 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/SystemOnTPTP5860/KLE004+1.tptp
%
%------------------------------------------------------------------------------