TSTP Solution File: KLE021+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE021+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 : 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:33 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP25500/KLE021+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP25500/KLE021+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP25500/KLE021+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 25596
% 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(3, axiom,![X3]:![X4]:(leq(X3,X4)<=>addition(X3,X4)=X4),file('/tmp/SRASS.s.p', order)).
% fof(5, axiom,![X3]:![X4]:![X5]:multiplication(addition(X3,X4),X5)=addition(multiplication(X3,X5),multiplication(X4,X5)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(6, axiom,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(8, axiom,![X3]:addition(X3,X3)=X3,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(11, axiom,![X1]:![X2]:(test(X1)=>(c(X1)=X2<=>complement(X1,X2))),file('/tmp/SRASS.s.p', test_3)).
% fof(14, axiom,![X3]:multiplication(one,X3)=X3,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(18, 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)=>(leq(X1,addition(multiplication(X2,X1),multiplication(c(X2),X1)))&leq(addition(multiplication(X2,X1),multiplication(c(X2),X1)),X1))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X1]:![X2]:(test(X2)=>(leq(X1,addition(multiplication(X2,X1),multiplication(c(X2),X1)))&leq(addition(multiplication(X2,X1),multiplication(c(X2),X1)),X1)))),inference(assume_negation,[status(cth)],[19])).
% fof(28, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X5]:![X6]:((~(leq(X5,X6))|addition(X5,X6)=X6)&(~(addition(X5,X6)=X6)|leq(X5,X6))),inference(variable_rename,[status(thm)],[28])).
% cnf(30,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[29])).
% fof(34, plain,![X6]:![X7]:![X8]:multiplication(addition(X6,X7),X8)=addition(multiplication(X6,X8),multiplication(X7,X8)),inference(variable_rename,[status(thm)],[5])).
% cnf(35,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[6])).
% cnf(37,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[36])).
% fof(40, plain,![X4]:addition(X4,X4)=X4,inference(variable_rename,[status(thm)],[8])).
% cnf(41,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(47, plain,![X1]:![X2]:(~(test(X1))|((~(c(X1)=X2)|complement(X1,X2))&(~(complement(X1,X2))|c(X1)=X2))),inference(fof_nnf,[status(thm)],[11])).
% fof(48, plain,![X3]:![X4]:(~(test(X3))|((~(c(X3)=X4)|complement(X3,X4))&(~(complement(X3,X4))|c(X3)=X4))),inference(variable_rename,[status(thm)],[47])).
% fof(49, plain,![X3]:![X4]:(((~(c(X3)=X4)|complement(X3,X4))|~(test(X3)))&((~(complement(X3,X4))|c(X3)=X4)|~(test(X3)))),inference(distribute,[status(thm)],[48])).
% cnf(51,plain,(complement(X1,X2)|~test(X1)|c(X1)!=X2),inference(split_conjunct,[status(thm)],[49])).
% fof(60, plain,![X4]:multiplication(one,X4)=X4,inference(variable_rename,[status(thm)],[14])).
% cnf(61,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[60])).
% fof(68, 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)],[18])).
% fof(69, 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)],[68])).
% fof(70, 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)],[69])).
% cnf(72,plain,(addition(X2,X1)=one|~complement(X1,X2)),inference(split_conjunct,[status(thm)],[70])).
% fof(75, negated_conjecture,?[X1]:?[X2]:(test(X2)&(~(leq(X1,addition(multiplication(X2,X1),multiplication(c(X2),X1))))|~(leq(addition(multiplication(X2,X1),multiplication(c(X2),X1)),X1)))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, negated_conjecture,?[X3]:?[X4]:(test(X4)&(~(leq(X3,addition(multiplication(X4,X3),multiplication(c(X4),X3))))|~(leq(addition(multiplication(X4,X3),multiplication(c(X4),X3)),X3)))),inference(variable_rename,[status(thm)],[75])).
% fof(77, negated_conjecture,(test(esk3_0)&(~(leq(esk2_0,addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0))))|~(leq(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),esk2_0)))),inference(skolemize,[status(esa)],[76])).
% cnf(78,negated_conjecture,(~leq(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),esk2_0)|~leq(esk2_0,addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)))),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(test(esk3_0)),inference(split_conjunct,[status(thm)],[77])).
% cnf(87,plain,(leq(X1,X1)),inference(spm,[status(thm)],[30,41,theory(equality)])).
% cnf(90,plain,(complement(X1,c(X1))|~test(X1)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(188,negated_conjecture,(~leq(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0))|~leq(addition(multiplication(esk3_0,esk2_0),multiplication(c(esk3_0),esk2_0)),esk2_0)),inference(rw,[status(thm)],[78,35,theory(equality)])).
% cnf(189,negated_conjecture,(~leq(esk2_0,multiplication(addition(esk3_0,c(esk3_0)),esk2_0))|~leq(multiplication(addition(esk3_0,c(esk3_0)),esk2_0),esk2_0)),inference(rw,[status(thm)],[188,35,theory(equality)])).
% cnf(235,plain,(addition(c(X1),X1)=one|~test(X1)),inference(spm,[status(thm)],[72,90,theory(equality)])).
% cnf(1124,plain,(addition(X1,c(X1))=one|~test(X1)),inference(rw,[status(thm)],[235,37,theory(equality)])).
% cnf(1125,negated_conjecture,(~leq(esk2_0,multiplication(one,esk2_0))|~leq(multiplication(one,esk2_0),esk2_0)|~test(esk3_0)),inference(spm,[status(thm)],[189,1124,theory(equality)])).
% cnf(1151,negated_conjecture,($false|~leq(multiplication(one,esk2_0),esk2_0)|~test(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1125,61,theory(equality)]),87,theory(equality)])).
% cnf(1152,negated_conjecture,($false|$false|~test(esk3_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1151,61,theory(equality)]),87,theory(equality)])).
% cnf(1153,negated_conjecture,($false|$false|$false),inference(rw,[status(thm)],[1152,79,theory(equality)])).
% cnf(1154,negated_conjecture,($false),inference(cn,[status(thm)],[1153,theory(equality)])).
% cnf(1155,negated_conjecture,($false),1154,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 140
% # ...of these trivial : 26
% # ...subsumed : 27
% # ...remaining for further processing: 87
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 580
% # ...of the previous two non-trivial : 304
% # Contextual simplify-reflections : 0
% # Paramodulations : 572
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 84
% # Positive orientable unit clauses: 42
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 41
% # Current number of unprocessed clauses: 189
% # ...number of literals in the above : 406
% # Clause-clause subsumption calls (NU) : 131
% # Rec. Clause-clause subsumption calls : 126
% # 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: 86 leaves, 1.35+/-0.937 terms/leaf
% # Paramod-from index: 47 leaves, 1.21+/-0.458 terms/leaf
% # Paramod-into index: 67 leaves, 1.36+/-0.893 terms/leaf
% # -------------------------------------------------
% # User time : 0.022 s
% # System time : 0.006 s
% # Total time : 0.028 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.23 WC
% FINAL PrfWatch: 0.13 CPU 0.23 WC
% SZS output end Solution for /tmp/SystemOnTPTP25500/KLE021+4.tptp
%
%------------------------------------------------------------------------------