TSTP Solution File: KLE022+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE022+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:34:48 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP7933/KLE022+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP7933/KLE022+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7933/KLE022+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 8029
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 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]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(4, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(6, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(9, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(14, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(16, 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(17, conjecture,![X4]:![X5]:(test(X5)=>(leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5))))&leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:(test(X5)=>(leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5))))&leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4)))),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,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(39, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[9])).
% fof(40, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[40])).
% cnf(43,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[41])).
% fof(56, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(57,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[56])).
% fof(60, 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)],[16])).
% fof(61, 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)],[60])).
% fof(62, 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)],[61])).
% cnf(64,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[62])).
% fof(67, negated_conjecture,?[X4]:?[X5]:(test(X5)&(~(leq(X4,addition(multiplication(X4,X5),multiplication(X4,c(X5)))))|~(leq(addition(multiplication(X4,X5),multiplication(X4,c(X5))),X4)))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X6]:?[X7]:(test(X7)&(~(leq(X6,addition(multiplication(X6,X7),multiplication(X6,c(X7)))))|~(leq(addition(multiplication(X6,X7),multiplication(X6,c(X7))),X6)))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,(test(esk3_0)&(~(leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0)))))|~(leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0)))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0)|~leq(esk2_0,addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))))),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[69])).
% cnf(81,plain,(leq(X1,X1)),inference(spm,[status(thm)],[22,33,theory(equality)])).
% cnf(84,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[43,theory(equality)])).
% cnf(147,negated_conjecture,(~leq(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0))))|~leq(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),esk2_0)),inference(rw,[status(thm)],[70,25,theory(equality)])).
% cnf(148,negated_conjecture,(~leq(esk2_0,multiplication(esk2_0,addition(esk3_0,c(esk3_0))))|~leq(multiplication(esk2_0,addition(esk3_0,c(esk3_0))),esk2_0)),inference(rw,[status(thm)],[147,25,theory(equality)])).
% cnf(223,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[64,84,theory(equality)])).
% cnf(1081,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[223,29,theory(equality)])).
% cnf(1082,negated_conjecture,(~leq(esk2_0,multiplication(esk2_0,one))|~leq(multiplication(esk2_0,one),esk2_0)|~test(esk3_0)),inference(spm,[status(thm)],[148,1081,theory(equality)])).
% cnf(1107,negated_conjecture,($false|~leq(multiplication(esk2_0,one),esk2_0)|~test(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1082,57,theory(equality)]),81,theory(equality)])).
% cnf(1108,negated_conjecture,($false|$false|~test(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1107,57,theory(equality)]),81,theory(equality)])).
% cnf(1109,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[1108,71,theory(equality)])).
% cnf(1110,negated_conjecture,($false),inference(cn,[status(thm)],[1109,theory(equality)])).
% cnf(1111,negated_conjecture,($false),1110,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 138
% # ...of these trivial : 26
% # ...subsumed : 27
% # ...remaining for further processing: 85
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 560
% # ...of the previous two non-trivial : 278
% # Contextual simplify-reflections : 0
% # Paramodulations : 552
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 82
% # Positive orientable unit clauses: 43
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 38
% # Current number of unprocessed clauses: 163
% # ...number of literals in the above : 299
% # Clause-clause subsumption calls (NU) : 129
% # Rec. Clause-clause subsumption calls : 124
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 30
% # Indexed BW rewrite successes : 8
% # Backwards rewriting index: 82 leaves, 1.37+/-0.957 terms/leaf
% # Paramod-from index: 45 leaves, 1.22+/-0.466 terms/leaf
% # Paramod-into index: 65 leaves, 1.37+/-0.904 terms/leaf
% # -------------------------------------------------
% # User time : 0.023 s
% # System time : 0.003 s
% # Total time : 0.026 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP7933/KLE022+2.tptp
%
%------------------------------------------------------------------------------