TSTP Solution File: KLE034+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE034+2 : 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 07:45:41 EST 2010
% Result : Theorem 3.72s
% Output : Solution 3.72s
% 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/SystemOnTPTP14302/KLE034+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14302/KLE034+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14302/KLE034+2.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 14434
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.93 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X2]:multiplication(zero,X2)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(4, axiom,![X2]:![X3]:![X4]:multiplication(X2,multiplication(X3,X4))=multiplication(multiplication(X2,X3),X4),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(7, axiom,![X2]:![X3]:(leq(X2,X3)<=>addition(X2,X3)=X3),file('/tmp/SRASS.s.p', order)).
% fof(8, axiom,![X1]:![X5]:(test(X1)=>(c(X1)=X5<=>complement(X1,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(9, axiom,![X2]:addition(X2,zero)=X2,file('/tmp/SRASS.s.p', additive_identity)).
% fof(10, axiom,![X2]:![X3]:addition(X2,X3)=addition(X3,X2),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(14, axiom,![X2]:![X3]:![X4]:multiplication(addition(X2,X3),X4)=addition(multiplication(X2,X4),multiplication(X3,X4)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(16, 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(18, axiom,![X2]:multiplication(one,X2)=X2,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(19, conjecture,![X1]:![X5]:![X6]:![X7]:![X8]:(((((test(X7)&test(X6))&test(X8))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X7,X5),c(X8)),zero))=>leq(multiplication(multiplication(multiplication(X6,X1),X5),c(X8)),zero)),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X1]:![X5]:![X6]:![X7]:![X8]:(((((test(X7)&test(X6))&test(X8))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X7,X5),c(X8)),zero))=>leq(multiplication(multiplication(multiplication(X6,X1),X5),c(X8)),zero))),inference(assume_negation,[status(cth)],[19])).
% fof(27, plain,![X3]:multiplication(zero,X3)=zero,inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X5]:![X6]:![X7]:multiplication(X5,multiplication(X6,X7))=multiplication(multiplication(X5,X6),X7),inference(variable_rename,[status(thm)],[4])).
% cnf(30,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[29])).
% fof(37, plain,![X2]:![X3]:((~(leq(X2,X3))|addition(X2,X3)=X3)&(~(addition(X2,X3)=X3)|leq(X2,X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(38, plain,![X4]:![X5]:((~(leq(X4,X5))|addition(X4,X5)=X5)&(~(addition(X4,X5)=X5)|leq(X4,X5))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[38])).
% cnf(40,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(41, plain,![X1]:![X5]:(~(test(X1))|((~(c(X1)=X5)|complement(X1,X5))&(~(complement(X1,X5))|c(X1)=X5))),inference(fof_nnf,[status(thm)],[8])).
% 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(45,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[43])).
% fof(46, plain,![X3]:addition(X3,zero)=X3,inference(variable_rename,[status(thm)],[9])).
% cnf(47,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[46])).
% fof(48, plain,![X4]:![X5]:addition(X4,X5)=addition(X5,X4),inference(variable_rename,[status(thm)],[10])).
% cnf(49,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(56, plain,![X5]:![X6]:![X7]:multiplication(addition(X5,X6),X7)=addition(multiplication(X5,X7),multiplication(X6,X7)),inference(variable_rename,[status(thm)],[14])).
% cnf(57,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[56])).
% fof(64, 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)],[16])).
% fof(65, 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)],[64])).
% fof(66, 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)],[65])).
% cnf(68,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[66])).
% fof(73, plain,![X3]:multiplication(one,X3)=X3,inference(variable_rename,[status(thm)],[18])).
% cnf(74,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[73])).
% fof(75, negated_conjecture,?[X1]:?[X5]:?[X6]:?[X7]:?[X8]:(((((test(X7)&test(X6))&test(X8))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X7,X5),c(X8)),zero))&~(leq(multiplication(multiplication(multiplication(X6,X1),X5),c(X8)),zero))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:(((((test(X12)&test(X11))&test(X13))&leq(multiplication(multiplication(X11,X9),c(X12)),zero))&leq(multiplication(multiplication(X12,X10),c(X13)),zero))&~(leq(multiplication(multiplication(multiplication(X11,X9),X10),c(X13)),zero))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,(((((test(esk5_0)&test(esk4_0))&test(esk6_0))&leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero))&leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero))&~(leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(~leq(multiplication(multiplication(multiplication(esk4_0,esk2_0),esk3_0),c(esk6_0)),zero)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(leq(multiplication(multiplication(esk5_0,esk3_0),c(esk6_0)),zero)),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[77])).
% cnf(83,negated_conjecture,(test(esk5_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(87,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(102,negated_conjecture,(~leq(multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0)))),zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[78,30,theory(equality)]),30,theory(equality)])).
% cnf(122,negated_conjecture,(leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero)),inference(rw,[status(thm)],[80,30,theory(equality)])).
% cnf(123,negated_conjecture,(addition(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero)=zero),inference(spm,[status(thm)],[40,122,theory(equality)])).
% cnf(125,negated_conjecture,(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0)))=zero),inference(rw,[status(thm)],[123,47,theory(equality)])).
% cnf(128,negated_conjecture,(leq(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))),zero)),inference(rw,[status(thm)],[79,30,theory(equality)])).
% cnf(129,negated_conjecture,(addition(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0))),zero)=zero),inference(spm,[status(thm)],[40,128,theory(equality)])).
% cnf(131,negated_conjecture,(multiplication(esk5_0,multiplication(esk3_0,c(esk6_0)))=zero),inference(rw,[status(thm)],[129,47,theory(equality)])).
% cnf(135,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[47,49,theory(equality)])).
% cnf(249,plain,(leq(zero,X1)),inference(spm,[status(thm)],[39,135,theory(equality)])).
% cnf(260,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[68,87,theory(equality)])).
% cnf(485,negated_conjecture,(multiplication(zero,X1)=multiplication(esk4_0,multiplication(multiplication(esk2_0,c(esk5_0)),X1))),inference(spm,[status(thm)],[30,125,theory(equality)])).
% cnf(493,negated_conjecture,(zero=multiplication(esk4_0,multiplication(multiplication(esk2_0,c(esk5_0)),X1))),inference(rw,[status(thm)],[485,28,theory(equality)])).
% cnf(494,negated_conjecture,(zero=multiplication(esk4_0,multiplication(esk2_0,multiplication(c(esk5_0),X1)))),inference(rw,[status(thm)],[493,30,theory(equality)])).
% cnf(504,negated_conjecture,(addition(zero,multiplication(X1,multiplication(esk3_0,c(esk6_0))))=multiplication(addition(esk5_0,X1),multiplication(esk3_0,c(esk6_0)))),inference(spm,[status(thm)],[57,131,theory(equality)])).
% cnf(513,negated_conjecture,(multiplication(X1,multiplication(esk3_0,c(esk6_0)))=multiplication(addition(esk5_0,X1),multiplication(esk3_0,c(esk6_0)))),inference(rw,[status(thm)],[504,135,theory(equality)])).
% cnf(6606,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[260,49,theory(equality)])).
% cnf(28086,negated_conjecture,(multiplication(one,multiplication(esk3_0,c(esk6_0)))=multiplication(c(esk5_0),multiplication(esk3_0,c(esk6_0)))|~test(esk5_0)),inference(spm,[status(thm)],[513,6606,theory(equality)])).
% cnf(28138,negated_conjecture,(multiplication(esk3_0,c(esk6_0))=multiplication(c(esk5_0),multiplication(esk3_0,c(esk6_0)))|~test(esk5_0)),inference(rw,[status(thm)],[28086,74,theory(equality)])).
% cnf(28139,negated_conjecture,(multiplication(esk3_0,c(esk6_0))=multiplication(c(esk5_0),multiplication(esk3_0,c(esk6_0)))|$false),inference(rw,[status(thm)],[28138,83,theory(equality)])).
% cnf(28140,negated_conjecture,(multiplication(esk3_0,c(esk6_0))=multiplication(c(esk5_0),multiplication(esk3_0,c(esk6_0)))),inference(cn,[status(thm)],[28139,theory(equality)])).
% cnf(37069,negated_conjecture,(multiplication(esk4_0,multiplication(esk2_0,multiplication(esk3_0,c(esk6_0))))=zero),inference(spm,[status(thm)],[494,28140,theory(equality)])).
% cnf(116530,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[102,37069,theory(equality)]),249,theory(equality)])).
% cnf(116531,negated_conjecture,($false),inference(cn,[status(thm)],[116530,theory(equality)])).
% cnf(116532,negated_conjecture,($false),116531,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5221
% # ...of these trivial : 979
% # ...subsumed : 3109
% # ...remaining for further processing: 1133
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 265
% # Generated clauses : 58853
% # ...of the previous two non-trivial : 36908
% # Contextual simplify-reflections : 192
% # Paramodulations : 58828
% # Factorizations : 0
% # Equation resolutions : 25
% # Current number of processed clauses: 863
% # Positive orientable unit clauses: 619
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 0
% # Non-unit-clauses : 238
% # Current number of unprocessed clauses: 26073
% # ...number of literals in the above : 45326
% # Clause-clause subsumption calls (NU) : 12341
% # Rec. Clause-clause subsumption calls : 12274
% # Unit Clause-clause subsumption calls : 47
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1992
% # Indexed BW rewrite successes : 260
% # Backwards rewriting index: 756 leaves, 1.68+/-1.786 terms/leaf
% # Paramod-from index: 381 leaves, 1.80+/-1.964 terms/leaf
% # Paramod-into index: 626 leaves, 1.77+/-1.899 terms/leaf
% # -------------------------------------------------
% # User time : 1.354 s
% # System time : 0.048 s
% # Total time : 1.402 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.70 CPU 2.94 WC
% FINAL PrfWatch: 2.70 CPU 2.94 WC
% SZS output end Solution for /tmp/SystemOnTPTP14302/KLE034+2.tptp
%
%------------------------------------------------------------------------------