TSTP Solution File: KLE026+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE026+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:36:15 EST 2010
% Result : Theorem 0.99s
% Output : Solution 0.99s
% 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/SystemOnTPTP8969/KLE026+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP8969/KLE026+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8969/KLE026+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 9065
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.015 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(2, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(4, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(5, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(6, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(7, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(10, axiom,![X4]:(test(X4)<=>?[X5]:complement(X5,X4)),file('/tmp/SRASS.s.p', test_1)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(18, 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(19, conjecture,![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)=>leq(multiplication(X5,X4),multiplication(X4,X6)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:![X6]:((test(X5)&test(X6))=>(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)=>leq(multiplication(X5,X4),multiplication(X4,X6))))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(23,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(25, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[25])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(31,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[5])).
% 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)],[6])).
% 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)],[7])).
% cnf(37,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(44, plain,![X4]:((~(test(X4))|?[X5]:complement(X5,X4))&(![X5]:~(complement(X5,X4))|test(X4))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, plain,![X6]:((~(test(X6))|?[X7]:complement(X7,X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(variable_rename,[status(thm)],[44])).
% fof(46, plain,![X6]:((~(test(X6))|complement(esk1_1(X6),X6))&(![X8]:~(complement(X8,X6))|test(X6))),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X6]:![X8]:((~(complement(X8,X6))|test(X6))&(~(test(X6))|complement(esk1_1(X6),X6))),inference(shift_quantors,[status(thm)],[46])).
% cnf(48,plain,(complement(esk1_1(X1),X1)|~test(X1)),inference(split_conjunct,[status(thm)],[47])).
% fof(56, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(57,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(68, 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)],[18])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% cnf(72,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% fof(75, negated_conjecture,?[X4]:?[X5]:?[X6]:((test(X5)&test(X6))&(multiplication(X5,X4)=multiplication(multiplication(X5,X4),X6)&~(leq(multiplication(X5,X4),multiplication(X4,X6))))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X7]:?[X8]:?[X9]:((test(X8)&test(X9))&(multiplication(X8,X7)=multiplication(multiplication(X8,X7),X9)&~(leq(multiplication(X8,X7),multiplication(X7,X9))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk3_0)&test(esk4_0))&(multiplication(esk3_0,esk2_0)=multiplication(multiplication(esk3_0,esk2_0),esk4_0)&~(leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(~leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(multiplication(esk3_0,esk2_0)=multiplication(multiplication(esk3_0,esk2_0),esk4_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(81,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(88,plain,(addition(X1,esk1_1(X1))=one|~test(X1)),inference(spm,[status(thm)],[72,48,theory(equality)])).
% cnf(113,negated_conjecture,(multiplication(esk3_0,multiplication(esk2_0,esk4_0))=multiplication(esk3_0,esk2_0)),inference(rw,[status(thm)],[79,23,theory(equality)])).
% cnf(129,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[35,37,theory(equality)])).
% cnf(193,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[31,57,theory(equality)])).
% cnf(575,plain,(addition(X1,one)=one|~test(X1)),inference(spm,[status(thm)],[129,88,theory(equality)])).
% cnf(703,negated_conjecture,(addition(esk3_0,one)=one),inference(spm,[status(thm)],[575,81,theory(equality)])).
% cnf(744,negated_conjecture,(addition(one,esk3_0)=one),inference(rw,[status(thm)],[703,33,theory(equality)])).
% cnf(3511,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[193,33,theory(equality)])).
% cnf(3564,negated_conjecture,(addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0))=multiplication(addition(esk3_0,one),multiplication(esk2_0,esk4_0))),inference(spm,[status(thm)],[3511,113,theory(equality)])).
% cnf(3603,negated_conjecture,(addition(multiplication(esk2_0,esk4_0),multiplication(esk3_0,esk2_0))=multiplication(esk2_0,esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3564,33,theory(equality)]),744,theory(equality)]),57,theory(equality)])).
% cnf(3675,negated_conjecture,(addition(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))=multiplication(esk2_0,esk4_0)),inference(rw,[status(thm)],[3603,33,theory(equality)])).
% cnf(3676,negated_conjecture,(leq(multiplication(esk3_0,esk2_0),multiplication(esk2_0,esk4_0))),inference(spm,[status(thm)],[26,3675,theory(equality)])).
% cnf(3701,negated_conjecture,($false),inference(sr,[status(thm)],[3676,78,theory(equality)])).
% cnf(3702,negated_conjecture,($false),3701,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 363
% # ...of these trivial : 59
% # ...subsumed : 157
% # ...remaining for further processing: 147
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 5
% # Generated clauses : 2029
% # ...of the previous two non-trivial : 1224
% # Contextual simplify-reflections : 0
% # Paramodulations : 2019
% # Factorizations : 0
% # Equation resolutions : 10
% # Current number of processed clauses: 141
% # Positive orientable unit clauses: 81
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 56
% # Current number of unprocessed clauses: 856
% # ...number of literals in the above : 1394
% # Clause-clause subsumption calls (NU) : 379
% # Rec. Clause-clause subsumption calls : 379
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 89
% # Indexed BW rewrite successes : 65
% # Backwards rewriting index: 155 leaves, 1.26+/-0.810 terms/leaf
% # Paramod-from index: 79 leaves, 1.23+/-0.594 terms/leaf
% # Paramod-into index: 121 leaves, 1.26+/-0.841 terms/leaf
% # -------------------------------------------------
% # User time : 0.059 s
% # System time : 0.005 s
% # Total time : 0.064 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.28 WC
% FINAL PrfWatch: 0.20 CPU 0.28 WC
% SZS output end Solution for /tmp/SystemOnTPTP8969/KLE026+2.tptp
%
%------------------------------------------------------------------------------