TSTP Solution File: KLE009+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE009+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 : 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:30:58 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP24345/KLE009+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24345/KLE009+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24345/KLE009+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 24441
% 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(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(5, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(7, 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,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(12, axiom,![X4]:![X5]:(test(X4)=>(c(X4)=X5<=>complement(X4,X5))),file('/tmp/SRASS.s.p', test_3)).
% fof(13, 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]:((test(X5)&test(X4))=>one=addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:![X5]:((test(X5)&test(X4))=>one=addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))),inference(assume_negation,[status(cth)],[19])).
% fof(22, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(23,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(30, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(31,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(34, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(35,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[8])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(47, plain,![X4]:![X5]:(~(test(X4))|((~(c(X4)=X5)|complement(X4,X5))&(~(complement(X4,X5))|c(X4)=X5))),inference(fof_nnf,[status(thm)],[12])).
% fof(48, plain,![X6]:![X7]:(~(test(X6))|((~(c(X6)=X7)|complement(X6,X7))&(~(complement(X6,X7))|c(X6)=X7))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X6]:![X7]:(((~(c(X6)=X7)|complement(X6,X7))|~(test(X6)))&((~(complement(X6,X7))|c(X6)=X7)|~(test(X6)))),inference(distribute,[status(thm)],[48])).
% cnf(51,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[49])).
% fof(52, 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)],[13])).
% fof(53, 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)],[52])).
% fof(54, 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)],[53])).
% cnf(56,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[54])).
% fof(75, negated_conjecture,?[X4]:?[X5]:((test(X5)&test(X4))&~(one=addition(addition(addition(multiplication(X4,X5),multiplication(X4,c(X5))),multiplication(c(X4),X5)),multiplication(c(X4),c(X5))))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X6]:?[X7]:((test(X7)&test(X6))&~(one=addition(addition(addition(multiplication(X6,X7),multiplication(X6,c(X7))),multiplication(c(X6),X7)),multiplication(c(X6),c(X7))))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,((test(esk3_0)&test(esk2_0))&~(one=addition(addition(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),multiplication(c(esk2_0),esk3_0)),multiplication(c(esk2_0),c(esk3_0))))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(one!=addition(addition(addition(multiplication(esk2_0,esk3_0),multiplication(esk2_0,c(esk3_0))),multiplication(c(esk2_0),esk3_0)),multiplication(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(83,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(101,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk2_0,c(esk3_0)),addition(multiplication(c(esk2_0),esk3_0),multiplication(c(esk2_0),c(esk3_0)))))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[78,25,theory(equality)]),25,theory(equality)])).
% cnf(141,plain,(addition(multiplication(X1,addition(X2,X3)),X4)=addition(multiplication(X1,X2),addition(multiplication(X1,X3),X4))),inference(spm,[status(thm)],[25,35,theory(equality)])).
% cnf(218,negated_conjecture,(addition(multiplication(esk2_0,esk3_0),addition(multiplication(esk2_0,c(esk3_0)),multiplication(c(esk2_0),addition(esk3_0,c(esk3_0)))))!=one),inference(rw,[status(thm)],[101,35,theory(equality)])).
% cnf(236,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[56,83,theory(equality)])).
% cnf(3861,negated_conjecture,(multiplication(addition(esk2_0,c(esk2_0)),addition(esk3_0,c(esk3_0)))!=one),inference(rw,[status(thm)],[inference(rw,[status(thm)],[218,141,theory(equality)]),37,theory(equality)])).
% cnf(4693,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[236,23,theory(equality)])).
% cnf(4697,negated_conjecture,(multiplication(addition(esk2_0,c(esk2_0)),one)!=one|~test(esk3_0)),inference(spm,[status(thm)],[3861,4693,theory(equality)])).
% cnf(4770,negated_conjecture,(addition(esk2_0,c(esk2_0))!=one|~test(esk3_0)),inference(rw,[status(thm)],[4697,31,theory(equality)])).
% cnf(4771,negated_conjecture,(addition(esk2_0,c(esk2_0))!=one|$false),inference(rw,[status(thm)],[4770,80,theory(equality)])).
% cnf(4772,negated_conjecture,(addition(esk2_0,c(esk2_0))!=one),inference(cn,[status(thm)],[4771,theory(equality)])).
% cnf(4868,negated_conjecture,(~test(esk2_0)),inference(spm,[status(thm)],[4772,4693,theory(equality)])).
% cnf(4871,negated_conjecture,($false),inference(rw,[status(thm)],[4868,79,theory(equality)])).
% cnf(4872,negated_conjecture,($false),inference(cn,[status(thm)],[4871,theory(equality)])).
% cnf(4873,negated_conjecture,($false),4872,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 448
% # ...of these trivial : 80
% # ...subsumed : 202
% # ...remaining for further processing: 166
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 8
% # Generated clauses : 2568
% # ...of the previous two non-trivial : 1575
% # Contextual simplify-reflections : 9
% # Paramodulations : 2559
% # Factorizations : 0
% # Equation resolutions : 9
% # Current number of processed clauses: 157
% # Positive orientable unit clauses: 80
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 2
% # Non-unit-clauses : 72
% # Current number of unprocessed clauses: 1096
% # ...number of literals in the above : 2172
% # Clause-clause subsumption calls (NU) : 591
% # Rec. Clause-clause subsumption calls : 579
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 122
% # Indexed BW rewrite successes : 87
% # Backwards rewriting index: 165 leaves, 1.28+/-0.813 terms/leaf
% # Paramod-from index: 85 leaves, 1.21+/-0.576 terms/leaf
% # Paramod-into index: 123 leaves, 1.28+/-0.810 terms/leaf
% # -------------------------------------------------
% # User time : 0.064 s
% # System time : 0.011 s
% # Total time : 0.075 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.22 CPU 0.32 WC
% FINAL PrfWatch: 0.22 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP24345/KLE009+2.tptp
%
%------------------------------------------------------------------------------