TSTP Solution File: KLE022+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE022+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 : art01.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:39 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP25759/KLE022+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25759/KLE022+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25759/KLE022+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 25855
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(8, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(13, 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)=>X4=addition(multiplication(X4,X5),multiplication(X4,c(X5)))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X4]:![X5]:(test(X5)=>X4=addition(multiplication(X4,X5),multiplication(X4,c(X5))))),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(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(35, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[8])).
% fof(36, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[35])).
% fof(37, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[36])).
% cnf(39,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[37])).
% fof(52, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(53,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[52])).
% 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)&~(X4=addition(multiplication(X4,X5),multiplication(X4,c(X5))))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X6]:?[X7]:(test(X7)&~(X6=addition(multiplication(X6,X7),multiplication(X6,c(X7))))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,(test(esk3_0)&~(esk2_0=addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(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(86,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[39,theory(equality)])).
% cnf(139,negated_conjecture,(multiplication(esk2_0,addition(esk3_0,c(esk3_0)))!=esk2_0),inference(rw,[status(thm)],[70,29,theory(equality)])).
% cnf(222,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[64,86,theory(equality)])).
% cnf(227,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[222,21,theory(equality)])).
% cnf(228,negated_conjecture,(multiplication(esk2_0,one)!=esk2_0|~test(esk3_0)),inference(spm,[status(thm)],[139,227,theory(equality)])).
% cnf(235,negated_conjecture,($false|~test(esk3_0)),inference(rw,[status(thm)],[228,53,theory(equality)])).
% cnf(236,negated_conjecture,($false|$false),inference(rw,[status(thm)],[235,71,theory(equality)])).
% cnf(237,negated_conjecture,($false),inference(cn,[status(thm)],[236,theory(equality)])).
% cnf(238,negated_conjecture,($false),237,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 32
% # ...of these trivial : 1
% # ...subsumed : 0
% # ...remaining for further processing: 31
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 92
% # ...of the previous two non-trivial : 49
% # Contextual simplify-reflections : 0
% # Paramodulations : 91
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 73
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 34 leaves, 1.32+/-0.962 terms/leaf
% # Paramod-from index: 18 leaves, 1.17+/-0.500 terms/leaf
% # Paramod-into index: 28 leaves, 1.25+/-0.575 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.21 WC
% FINAL PrfWatch: 0.11 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP25759/KLE022+1.tptp
%
%------------------------------------------------------------------------------