%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE024+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 : art09.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:35:31 EST 2010
% Result : Theorem 15.07s
% Output : Solution 15.07s
% 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/SystemOnTPTP29861/KLE024+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29861/KLE024+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29861/KLE024+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 29957
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.90 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.87 CPU 8.02 WC
% PrfWatch: 9.85 CPU 10.03 WC
% PrfWatch: 11.85 CPU 12.03 WC
% PrfWatch: 13.84 CPU 14.04 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(9, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(11, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(12, axiom,![X4]:![X5]:(complement(X5,X4)<=>((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(13, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(14, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(17, conjecture,![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(addition(multiplication(X4,c(X6)),multiplication(c(X5),X4))=multiplication(c(X5),X4)=>multiplication(multiplication(X5,X4),c(X6))=zero)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(addition(multiplication(X4,c(X6)),multiplication(c(X5),X4))=multiplication(c(X5),X4)=>multiplication(multiplication(X5,X4),c(X6))=zero))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(36, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[9])).
% cnf(37,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[36])).
% fof(41, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[11])).
% fof(42, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(c(X1)=X2|~test(X1)|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[43])).
% fof(46, plain,![X4]:![X5]:((~(complement(X5,X4))|((multiplication(X4,X5)=zero&multiplication(X5,X4)=zero)&addition(X4,X5)=one))&(((~(multiplication(X4,X5)=zero)|~(multiplication(X5,X4)=zero))|~(addition(X4,X5)=one))|complement(X5,X4))),inference(fof_nnf,[status(thm)],[12])).
% fof(47, 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)],[46])).
% fof(48, 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)],[47])).
% cnf(49,plain,(complement(X1,X2)|addition(X2,X1)!=one|multiplication(X1,X2)!=zero|multiplication(X2,X1)!=zero),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(multiplication(X1,X2)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,plain,(multiplication(X2,X1)=zero|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[48])).
% fof(53, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[13])).
% fof(54, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[53])).
% fof(55, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[54])).
% fof(56, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[55])).
% cnf(57,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(59, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(60,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[59])).
% fof(67, negated_conjecture,?[X4]:?[X5]:?[X6]:((test(X5)&test(X6))&(addition(multiplication(X4,c(X6)),multiplication(c(X5),X4))=multiplication(c(X5),X4)&~(multiplication(multiplication(X5,X4),c(X6))=zero))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(addition(multiplication(X7,c(X9)),multiplication(c(X8),X7))=multiplication(c(X8),X7)&~(multiplication(multiplication(X8,X7),c(X9))=zero))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk4_0))&(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))=multiplication(c(esk3_0),esk2_0)&~(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))=zero))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(multiplication(multiplication(esk3_0,esk2_0),c(esk4_0))!=zero),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(addition(multiplication(esk2_0,c(esk4_0)),multiplication(c(esk3_0),esk2_0))=multiplication(c(esk3_0),esk2_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(73,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(81,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[50,57,theory(equality)])).
% cnf(82,plain,(multiplication(X1,esk1_1(X1))=zero|~test(X1)),inference(spm,[status(thm)],[52,57,theory(equality)])).
% cnf(83,plain,(multiplication(esk1_1(X1),X1)=zero|~test(X1)),inference(spm,[status(thm)],[51,57,theory(equality)])).
% cnf(107,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))!=zero),inference(rw,[status(thm)],[70,29,theory(equality)])).
% cnf(135,plain,(complement(X1,X2)|addition(X1,X2)!=one|multiplication(X2,X1)!=zero|multiplication(X1,X2)!=zero),inference(spm,[status(thm)],[49,21,theory(equality)])).
% cnf(541,plain,(zero=multiplication(X1,multiplication(X2,esk1_1(multiplication(X1,X2))))|~test(multiplication(X1,X2))),inference(spm,[status(thm)],[29,82,theory(equality)])).
% cnf(545,plain,(addition(multiplication(X1,X2),zero)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(spm,[status(thm)],[31,82,theory(equality)])).
% cnf(553,plain,(multiplication(X1,X2)=multiplication(X1,addition(X2,esk1_1(X1)))|~test(X1)),inference(rw,[status(thm)],[545,25,theory(equality)])).
% cnf(1239,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|multiplication(X1,esk1_1(X1))!=zero|~test(X1)),inference(spm,[status(thm)],[135,81,theory(equality)])).
% cnf(25418,plain,(multiplication(X1,one)=multiplication(X1,X1)|~test(X1)),inference(spm,[status(thm)],[553,81,theory(equality)])).
% cnf(25496,plain,(X1=multiplication(X1,X1)|~test(X1)),inference(rw,[status(thm)],[25418,60,theory(equality)])).
% cnf(31300,negated_conjecture,(multiplication(esk3_0,esk3_0)=esk3_0),inference(spm,[status(thm)],[25496,73,theory(equality)])).
% cnf(31494,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,multiplication(esk3_0,X1))),inference(spm,[status(thm)],[29,31300,theory(equality)])).
% cnf(31507,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero|~test(esk3_0)),inference(spm,[status(thm)],[541,31300,theory(equality)])).
% cnf(31557,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero|$false),inference(rw,[status(thm)],[31507,73,theory(equality)])).
% cnf(31558,negated_conjecture,(multiplication(esk3_0,multiplication(esk3_0,esk1_1(esk3_0)))=zero),inference(cn,[status(thm)],[31557,theory(equality)])).
% cnf(32500,negated_conjecture,(multiplication(esk3_0,esk1_1(esk3_0))=zero),inference(rw,[status(thm)],[31558,31494,theory(equality)])).
% cnf(32503,negated_conjecture,(multiplication(zero,X1)=multiplication(esk3_0,multiplication(esk1_1(esk3_0),X1))),inference(spm,[status(thm)],[29,32500,theory(equality)])).
% cnf(32543,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk1_1(esk3_0),X1))),inference(rw,[status(thm)],[32503,37,theory(equality)])).
% cnf(47195,plain,(complement(X1,esk1_1(X1))|multiplication(esk1_1(X1),X1)!=zero|~test(X1)),inference(csr,[status(thm)],[1239,82])).
% cnf(47196,plain,(complement(X1,esk1_1(X1))|~test(X1)),inference(csr,[status(thm)],[47195,83])).
% cnf(47200,plain,(c(X1)=esk1_1(X1)|~test(X1)),inference(spm,[status(thm)],[44,47196,theory(equality)])).
% cnf(47315,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),X1))=zero|~test(esk3_0)),inference(spm,[status(thm)],[32543,47200,theory(equality)])).
% cnf(47635,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),X1))=zero|$false),inference(rw,[status(thm)],[47315,73,theory(equality)])).
% cnf(47636,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),X1))=zero),inference(cn,[status(thm)],[47635,theory(equality)])).
% cnf(49270,negated_conjecture,(addition(multiplication(esk3_0,X1),zero)=multiplication(esk3_0,addition(X1,multiplication(c(esk3_0),X2)))),inference(spm,[status(thm)],[31,47636,theory(equality)])).
% cnf(49335,negated_conjecture,(multiplication(esk3_0,X1)=multiplication(esk3_0,addition(X1,multiplication(c(esk3_0),X2)))),inference(rw,[status(thm)],[49270,25,theory(equality)])).
% cnf(537865,negated_conjecture,(multiplication(esk3_0,multiplication(c(esk3_0),esk2_0))=multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))),inference(spm,[status(thm)],[49335,71,theory(equality)])).
% cnf(538186,negated_conjecture,(zero=multiplication(esk3_0,multiplication(esk2_0,c(esk4_0)))),inference(rw,[status(thm)],[537865,47636,theory(equality)])).
% cnf(538187,negated_conjecture,($false),inference(sr,[status(thm)],[538186,107,theory(equality)])).
% cnf(538188,negated_conjecture,($false),538187,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16459
% # ...of these trivial : 3433
% # ...subsumed : 10998
% # ...remaining for further processing: 2028
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 10
% # Backward-rewritten : 411
% # Generated clauses : 257735
% # ...of the previous two non-trivial : 163635
% # Contextual simplify-reflections : 570
% # Paramodulations : 257712
% # Factorizations : 0
% # Equation resolutions : 23
% # Current number of processed clauses: 1607
% # Positive orientable unit clauses: 859
% # Positive unorientable unit clauses: 13
% # Negative unit clauses : 1
% # Non-unit-clauses : 734
% # Current number of unprocessed clauses: 128818
% # ...number of literals in the above : 231324
% # Clause-clause subsumption calls (NU) : 64829
% # Rec. Clause-clause subsumption calls : 63791
% # Unit Clause-clause subsumption calls : 421
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3563
% # Indexed BW rewrite successes : 503
% # Backwards rewriting index: 1118 leaves, 1.75+/-1.645 terms/leaf
% # Paramod-from index: 619 leaves, 1.72+/-1.431 terms/leaf
% # Paramod-into index: 838 leaves, 1.80+/-1.687 terms/leaf
% # -------------------------------------------------
% # User time : 7.275 s
% # System time : 0.291 s
% # Total time : 7.566 s
% # Maximum resident set size: 0 pages
% PrfWatch: 14.24 CPU 14.44 WC
% FINAL PrfWatch: 14.24 CPU 14.44 WC
% SZS output end Solution for /tmp/SystemOnTPTP29861/KLE024+1.tptp
%
%------------------------------------------------------------------------------