TSTP Solution File: KLE007+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE007+4 : 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:35 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/SystemOnTPTP7156/KLE007+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7156/KLE007+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7156/KLE007+4.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 7252
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X3]:multiplication(X3,one)=X3,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(5, axiom,![X3]:![X4]:(leq(X3,X4)<=>addition(X3,X4)=X4),file('/tmp/SRASS.s.p', order)).
% fof(6, axiom,![X3]:![X4]:![X5]:multiplication(X3,addition(X4,X5))=addition(multiplication(X3,X4),multiplication(X3,X5)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(8, axiom,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(10, axiom,![X3]:addition(X3,X3)=X3,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(13, axiom,![X1]:![X2]:(test(X1)=>(c(X1)=X2<=>complement(X1,X2))),file('/tmp/SRASS.s.p', test_3)).
% fof(14, axiom,![X1]:![X2]:(complement(X2,X1)<=>((multiplication(X1,X2)=zero&multiplication(X2,X1)=zero)&addition(X1,X2)=one)),file('/tmp/SRASS.s.p', test_2)).
% fof(19, conjecture,![X1]:![X2]:((test(X2)&test(X1))=>(leq(one,addition(multiplication(addition(X1,c(X1)),X2),multiplication(addition(X1,c(X1)),c(X2))))&leq(addition(multiplication(addition(X1,c(X1)),X2),multiplication(addition(X1,c(X1)),c(X2))),one))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X1]:![X2]:((test(X2)&test(X1))=>(leq(one,addition(multiplication(addition(X1,c(X1)),X2),multiplication(addition(X1,c(X1)),c(X2))))&leq(addition(multiplication(addition(X1,c(X1)),X2),multiplication(addition(X1,c(X1)),c(X2))),one)))),inference(assume_negation,[status(cth)],[19])).
% fof(28, plain,![X4]:multiplication(X4,one)=X4,inference(variable_rename,[status(thm)],[3])).
% cnf(29,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(fof_nnf,[status(thm)],[5])).
% fof(33, plain,![X5]:![X6]:((~(leq(X5,X6))|addition(X5,X6)=X6)&(~(addition(X5,X6)=X6)|leq(X5,X6))),inference(variable_rename,[status(thm)],[32])).
% cnf(34,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[33])).
% fof(36, plain,![X6]:![X7]:![X8]:multiplication(X6,addition(X7,X8))=addition(multiplication(X6,X7),multiplication(X6,X8)),inference(variable_rename,[status(thm)],[6])).
% cnf(37,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[40])).
% fof(44, plain,![X4]:addition(X4,X4)=X4,inference(variable_rename,[status(thm)],[10])).
% cnf(45,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[44])).
% fof(51, plain,![X1]:![X2]:(~(test(X1))|((~(c(X1)=X2)|complement(X1,X2))&(~(complement(X1,X2))|c(X1)=X2))),inference(fof_nnf,[status(thm)],[13])).
% fof(52, plain,![X3]:![X4]:(~(test(X3))|((~(c(X3)=X4)|complement(X3,X4))&(~(complement(X3,X4))|c(X3)=X4))),inference(variable_rename,[status(thm)],[51])).
% fof(53, plain,![X3]:![X4]:(((~(c(X3)=X4)|complement(X3,X4))|~(test(X3)))&((~(complement(X3,X4))|c(X3)=X4)|~(test(X3)))),inference(distribute,[status(thm)],[52])).
% cnf(55,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[53])).
% fof(56, plain,![X1]:![X2]:((~(complement(X2,X1))|((multiplication(X1,X2)=zero&multiplication(X2,X1)=zero)&addition(X1,X2)=one))&(((~(multiplication(X1,X2)=zero)|~(multiplication(X2,X1)=zero))|~(addition(X1,X2)=one))|complement(X2,X1))),inference(fof_nnf,[status(thm)],[14])).
% fof(57, plain,![X3]:![X4]:((~(complement(X4,X3))|((multiplication(X3,X4)=zero&multiplication(X4,X3)=zero)&addition(X3,X4)=one))&(((~(multiplication(X3,X4)=zero)|~(multiplication(X4,X3)=zero))|~(addition(X3,X4)=one))|complement(X4,X3))),inference(variable_rename,[status(thm)],[56])).
% fof(58, plain,![X3]:![X4]:((((multiplication(X3,X4)=zero|~(complement(X4,X3)))&(multiplication(X4,X3)=zero|~(complement(X4,X3))))&(addition(X3,X4)=one|~(complement(X4,X3))))&(((~(multiplication(X3,X4)=zero)|~(multiplication(X4,X3)=zero))|~(addition(X3,X4)=one))|complement(X4,X3))),inference(distribute,[status(thm)],[57])).
% cnf(60,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(75, negated_conjecture,?[X1]:?[X2]:((test(X2)&test(X1))&(~(leq(one,addition(multiplication(addition(X1,c(X1)),X2),multiplication(addition(X1,c(X1)),c(X2)))))|~(leq(addition(multiplication(addition(X1,c(X1)),X2),multiplication(addition(X1,c(X1)),c(X2))),one)))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X3]:?[X4]:((test(X4)&test(X3))&(~(leq(one,addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4)))))|~(leq(addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))),one)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, 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)],[76])).
% cnf(78,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)],[77])).
% cnf(79,negated_conjecture,(test(esk2_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(82,plain,(leq(X1,X1)),inference(spm,[status(thm)],[34,45,theory(equality)])).
% cnf(83,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[55,theory(equality)])).
% cnf(153,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)],[78,37,theory(equality)])).
% cnf(154,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)],[153,37,theory(equality)])).
% cnf(236,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[60,83,theory(equality)])).
% cnf(3849,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[236,41,theory(equality)])).
% cnf(3853,negated_conjecture,(~leq(one,multiplication(addition(esk2_0,c(esk2_0)),one))|~leq(multiplication(addition(esk2_0,c(esk2_0)),one),one)|~test(esk3_0)),inference(spm,[status(thm)],[154,3849,theory(equality)])).
% cnf(3917,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))|~leq(multiplication(addition(esk2_0,c(esk2_0)),one),one)|~test(esk3_0)),inference(rw,[status(thm)],[3853,29,theory(equality)])).
% cnf(3918,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))|~leq(addition(esk2_0,c(esk2_0)),one)|~test(esk3_0)),inference(rw,[status(thm)],[3917,29,theory(equality)])).
% cnf(3919,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))|~leq(addition(esk2_0,c(esk2_0)),one)|$false),inference(rw,[status(thm)],[3918,80,theory(equality)])).
% cnf(3920,negated_conjecture,(~leq(one,addition(esk2_0,c(esk2_0)))|~leq(addition(esk2_0,c(esk2_0)),one)),inference(cn,[status(thm)],[3919,theory(equality)])).
% cnf(3989,negated_conjecture,(~leq(one,one)|~test(esk2_0)),inference(spm,[status(thm)],[3920,3849,theory(equality)])).
% cnf(3994,negated_conjecture,($false|~test(esk2_0)),inference(rw,[status(thm)],[3989,82,theory(equality)])).
% cnf(3995,negated_conjecture,($false|$false),inference(rw,[status(thm)],[3994,79,theory(equality)])).
% cnf(3996,negated_conjecture,($false),inference(cn,[status(thm)],[3995,theory(equality)])).
% cnf(3997,negated_conjecture,($false),3996,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 398
% # ...of these trivial : 68
% # ...subsumed : 173
% # ...remaining for further processing: 157
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 3
% # Generated clauses : 2136
% # ...of the previous two non-trivial : 1298
% # Contextual simplify-reflections : 10
% # Paramodulations : 2127
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 153
% # Positive orientable unit clauses: 79
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 71
% # Current number of unprocessed clauses: 910
% # ...number of literals in the above : 1828
% # Clause-clause subsumption calls (NU) : 552
% # Rec. Clause-clause subsumption calls : 540
% # Unit Clause-clause subsumption calls : 6
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 94
% # Indexed BW rewrite successes : 73
% # Backwards rewriting index: 171 leaves, 1.21+/-0.781 terms/leaf
% # Paramod-from index: 90 leaves, 1.13+/-0.521 terms/leaf
% # Paramod-into index: 127 leaves, 1.20+/-0.753 terms/leaf
% # -------------------------------------------------
% # User time : 0.060 s
% # System time : 0.004 s
% # Total time : 0.064 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP7156/KLE007+4.tptp
%
%------------------------------------------------------------------------------