TSTP Solution File: KLE007+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE007+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 : 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:30:24 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP6895/KLE007+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6895/KLE007+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6895/KLE007+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 6993
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(2, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(3, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(6, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(7, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(8, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% 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(17, conjecture,![X4]:![X5]:((test(X5)&test(X4))=>(leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))))&leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:((test(X5)&test(X4))=>(leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))))&leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one)))),inference(assume_negation,[status(cth)],[17])).
% fof(20, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[1])).
% fof(21, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[21])).
% fof(24, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(37,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(43, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[11])).
% fof(44, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[44])).
% cnf(47,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[45])).
% fof(48, 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(49, 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)],[48])).
% fof(50, 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)],[49])).
% cnf(52,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[50])).
% fof(55, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[13])).
% fof(56, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[57])).
% cnf(59,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[58])).
% cnf(60,plain,(test(X1)|~complement(X2,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(67, negated_conjecture,?[X4]:?[X5]:((test(X5)&test(X4))&(~(leq(one,addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5)))))|~(leq(addition(multiplication(addition(X4,c(X4)),X5),multiplication(addition(X4,c(X4)),c(X5))),one)))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X6]:?[X7]:((test(X7)&test(X6))&(~(leq(one,addition(multiplication(addition(X6,c(X6)),X7),multiplication(addition(X6,c(X6)),c(X7)))))|~(leq(addition(multiplication(addition(X6,c(X6)),X7),multiplication(addition(X6,c(X6)),c(X7))),one)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((test(esk3_0)&test(esk2_0))&(~(leq(one,addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0)))))|~(leq(addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0))),one)))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0))),one)|~leq(one,addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0))))),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(74,plain,(leq(X1,X1)),inference(spm,[status(thm)],[22,37,theory(equality)])).
% cnf(75,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[47,theory(equality)])).
% cnf(77,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[52,59,theory(equality)])).
% cnf(88,plain,(leq(addition(X1,X2),X3)|addition(X1,addition(X2,X3))!=X3),inference(spm,[status(thm)],[22,35,theory(equality)])).
% cnf(92,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[35,37,theory(equality)])).
% cnf(144,plain,(addition(X1,multiplication(X1,X2))=multiplication(X1,addition(one,X2))),inference(spm,[status(thm)],[29,25,theory(equality)])).
% cnf(145,negated_conjecture,(~leq(one,multiplication(addition(esk2_0,c(esk2_0)),addition(esk3_0,c(esk3_0))))|~leq(addition(multiplication(addition(esk2_0,c(esk2_0)),esk3_0),multiplication(addition(esk2_0,c(esk2_0)),c(esk3_0))),one)),inference(rw,[status(thm)],[70,29,theory(equality)])).
% cnf(146,negated_conjecture,(~leq(one,multiplication(addition(esk2_0,c(esk2_0)),addition(esk3_0,c(esk3_0))))|~leq(multiplication(addition(esk2_0,c(esk2_0)),addition(esk3_0,c(esk3_0))),one)),inference(rw,[status(thm)],[145,29,theory(equality)])).
% cnf(218,plain,(test(c(X1))|~test(X1)),inference(spm,[status(thm)],[60,75,theory(equality)])).
% cnf(219,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[52,75,theory(equality)])).
% cnf(296,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[92,77,theory(equality)])).
% cnf(431,negated_conjecture,(addition(esk2_0,one)=one),inference(spm,[status(thm)],[296,71,theory(equality)])).
% cnf(433,plain,(addition(c(X1),one)=one|~test(X1)),inference(spm,[status(thm)],[296,218,theory(equality)])).
% cnf(604,plain,(addition(one,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[433,33,theory(equality)])).
% cnf(606,negated_conjecture,(addition(one,c(esk2_0))=one),inference(spm,[status(thm)],[604,71,theory(equality)])).
% cnf(1158,negated_conjecture,(leq(addition(X1,esk2_0),one)|addition(X1,one)!=one),inference(spm,[status(thm)],[88,431,theory(equality)])).
% cnf(2544,negated_conjecture,(leq(addition(X1,esk2_0),one)|addition(one,X1)!=one),inference(spm,[status(thm)],[1158,33,theory(equality)])).
% cnf(4392,negated_conjecture,(addition(X1,multiplication(X1,c(esk2_0)))=multiplication(X1,one)),inference(spm,[status(thm)],[144,606,theory(equality)])).
% cnf(4457,negated_conjecture,(addition(X1,multiplication(X1,c(esk2_0)))=X1),inference(rw,[status(thm)],[4392,25,theory(equality)])).
% cnf(7067,negated_conjecture,(leq(addition(multiplication(one,c(esk2_0)),esk2_0),one)),inference(spm,[status(thm)],[2544,4457,theory(equality)])).
% cnf(7113,negated_conjecture,(leq(addition(c(esk2_0),esk2_0),one)),inference(rw,[status(thm)],[7067,27,theory(equality)])).
% cnf(7484,negated_conjecture,(leq(addition(esk2_0,c(esk2_0)),one)),inference(rw,[status(thm)],[7113,33,theory(equality)])).
% cnf(8293,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[219,33,theory(equality)])).
% cnf(8335,negated_conjecture,(addition(esk3_0,c(esk3_0))=one),inference(spm,[status(thm)],[8293,72,theory(equality)])).
% cnf(8336,negated_conjecture,(addition(esk2_0,c(esk2_0))=one),inference(spm,[status(thm)],[8293,71,theory(equality)])).
% cnf(8399,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))|~leq(multiplication(addition(esk2_0,c(esk2_0)),addition(esk3_0,c(esk3_0))),one)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[146,8335,theory(equality)]),25,theory(equality)])).
% cnf(8400,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[8399,8335,theory(equality)]),25,theory(equality)]),7484,theory(equality)])).
% cnf(8401,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))),inference(cn,[status(thm)],[8400,theory(equality)])).
% cnf(8470,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[8401,8336,theory(equality)]),74,theory(equality)])).
% cnf(8471,negated_conjecture,($false),inference(cn,[status(thm)],[8470,theory(equality)])).
% cnf(8472,negated_conjecture,($false),8471,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 731
% # ...of these trivial : 150
% # ...subsumed : 346
% # ...remaining for further processing: 235
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 7
% # Generated clauses : 4620
% # ...of the previous two non-trivial : 2997
% # Contextual simplify-reflections : 2
% # Paramodulations : 4610
% # Factorizations : 0
% # Equation resolutions : 10
% # Current number of processed clauses: 227
% # Positive orientable unit clauses: 141
% # Positive unorientable unit clauses: 7
% # Negative unit clauses : 0
% # Non-unit-clauses : 79
% # Current number of unprocessed clauses: 2273
% # ...number of literals in the above : 4086
% # Clause-clause subsumption calls (NU) : 1137
% # Rec. Clause-clause subsumption calls : 1118
% # Unit Clause-clause subsumption calls : 18
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 200
% # Indexed BW rewrite successes : 75
% # Backwards rewriting index: 244 leaves, 1.27+/-0.906 terms/leaf
% # Paramod-from index: 136 leaves, 1.21+/-0.520 terms/leaf
% # Paramod-into index: 198 leaves, 1.25+/-0.800 terms/leaf
% # -------------------------------------------------
% # User time : 0.113 s
% # System time : 0.008 s
% # Total time : 0.121 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.30 CPU 0.38 WC
% FINAL PrfWatch: 0.30 CPU 0.38 WC
% SZS output end Solution for /tmp/SystemOnTPTP6895/KLE007+2.tptp
%
%------------------------------------------------------------------------------