TSTP Solution File: KLE035+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE035+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 07:45:48 EST 2010
% Result : Theorem 3.63s
% Output : Solution 3.63s
% 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/SystemOnTPTP14651/KLE035+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14651/KLE035+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14651/KLE035+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 14783
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 1.94 CPU 2.01 WC
% # SZS output start CNFRefutation.
% fof(2, axiom,![X2]:![X3]:(leq(X2,X3)<=>addition(X2,X3)=X3),file('/tmp/SRASS.s.p', order)).
% fof(3, axiom,![X2]:addition(X2,zero)=X2,file('/tmp/SRASS.s.p', additive_identity)).
% fof(6, axiom,![X2]:![X3]:![X4]:multiplication(X2,addition(X3,X4))=addition(multiplication(X2,X3),multiplication(X2,X4)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(7, axiom,![X2]:![X3]:![X4]:multiplication(addition(X2,X3),X4)=addition(multiplication(X2,X4),multiplication(X3,X4)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(8, axiom,![X2]:![X3]:addition(X2,X3)=addition(X3,X2),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(11, axiom,![X2]:![X3]:![X4]:multiplication(X2,multiplication(X3,X4))=multiplication(multiplication(X2,X3),X4),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(17, conjecture,![X1]:![X5]:![X6]:![X7]:((((test(X7)&test(X6))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X6,X5),c(X7)),zero))=>leq(multiplication(multiplication(X6,addition(X1,X5)),c(X7)),zero)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X5]:![X6]:![X7]:((((test(X7)&test(X6))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X6,X5),c(X7)),zero))=>leq(multiplication(multiplication(X6,addition(X1,X5)),c(X7)),zero))),inference(assume_negation,[status(cth)],[17])).
% fof(23, plain,![X2]:![X3]:((~(leq(X2,X3))|addition(X2,X3)=X3)&(~(addition(X2,X3)=X3)|leq(X2,X3))),inference(fof_nnf,[status(thm)],[2])).
% fof(24, plain,![X4]:![X5]:((~(leq(X4,X5))|addition(X4,X5)=X5)&(~(addition(X4,X5)=X5)|leq(X4,X5))),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(27, plain,![X3]:addition(X3,zero)=X3,inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(33, plain,![X5]:![X6]:![X7]:multiplication(X5,addition(X6,X7))=addition(multiplication(X5,X6),multiplication(X5,X7)),inference(variable_rename,[status(thm)],[6])).
% cnf(34,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X5]:![X6]:![X7]:multiplication(addition(X5,X6),X7)=addition(multiplication(X5,X7),multiplication(X6,X7)),inference(variable_rename,[status(thm)],[7])).
% cnf(36,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X4]:![X5]:addition(X4,X5)=addition(X5,X4),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[37])).
% fof(43, plain,![X5]:![X6]:![X7]:multiplication(X5,multiplication(X6,X7))=multiplication(multiplication(X5,X6),X7),inference(variable_rename,[status(thm)],[11])).
% cnf(44,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[43])).
% fof(67, negated_conjecture,?[X1]:?[X5]:?[X6]:?[X7]:((((test(X7)&test(X6))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X6,X5),c(X7)),zero))&~(leq(multiplication(multiplication(X6,addition(X1,X5)),c(X7)),zero))),inference(fof_nnf,[status(thm)],[18])).
% fof(68, negated_conjecture,?[X8]:?[X9]:?[X10]:?[X11]:((((test(X11)&test(X10))&leq(multiplication(multiplication(X10,X8),c(X11)),zero))&leq(multiplication(multiplication(X10,X9),c(X11)),zero))&~(leq(multiplication(multiplication(X10,addition(X8,X9)),c(X11)),zero))),inference(variable_rename,[status(thm)],[67])).
% fof(69, negated_conjecture,((((test(esk5_0)&test(esk4_0))&leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero))&leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero))&~(leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero))),inference(skolemize,[status(esa)],[68])).
% cnf(70,negated_conjecture,(~leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[69])).
% cnf(71,negated_conjecture,(leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[69])).
% cnf(72,negated_conjecture,(leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[69])).
% cnf(108,negated_conjecture,(~leq(multiplication(esk4_0,multiplication(addition(esk2_0,esk3_0),c(esk5_0))),zero)),inference(rw,[status(thm)],[70,44,theory(equality)])).
% cnf(119,negated_conjecture,(leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero)),inference(rw,[status(thm)],[72,44,theory(equality)])).
% cnf(120,negated_conjecture,(addition(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero)=zero),inference(spm,[status(thm)],[26,119,theory(equality)])).
% cnf(122,negated_conjecture,(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0)))=zero),inference(rw,[status(thm)],[120,28,theory(equality)])).
% cnf(125,negated_conjecture,(leq(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero)),inference(rw,[status(thm)],[71,44,theory(equality)])).
% cnf(126,negated_conjecture,(addition(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero)=zero),inference(spm,[status(thm)],[26,125,theory(equality)])).
% cnf(128,negated_conjecture,(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0)))=zero),inference(rw,[status(thm)],[126,28,theory(equality)])).
% cnf(132,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[28,38,theory(equality)])).
% cnf(222,plain,(leq(zero,X1)),inference(spm,[status(thm)],[25,132,theory(equality)])).
% cnf(380,negated_conjecture,(addition(zero,multiplication(esk4_0,X1))=multiplication(esk4_0,addition(multiplication(esk2_0,c(esk5_0)),X1))),inference(spm,[status(thm)],[34,122,theory(equality)])).
% cnf(388,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,addition(multiplication(esk2_0,c(esk5_0)),X1))),inference(rw,[status(thm)],[380,132,theory(equality)])).
% cnf(13532,negated_conjecture,(multiplication(esk4_0,multiplication(addition(esk2_0,X1),c(esk5_0)))=multiplication(esk4_0,multiplication(X1,c(esk5_0)))),inference(spm,[status(thm)],[388,36,theory(equality)])).
% cnf(109125,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[108,13532,theory(equality)]),128,theory(equality)]),222,theory(equality)])).
% cnf(109126,negated_conjecture,($false),inference(cn,[status(thm)],[109125,theory(equality)])).
% cnf(109127,negated_conjecture,($false),109126,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4675
% # ...of these trivial : 876
% # ...subsumed : 2807
% # ...remaining for further processing: 992
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 5
% # Backward-rewritten : 224
% # Generated clauses : 54114
% # ...of the previous two non-trivial : 33562
% # Contextual simplify-reflections : 190
% # Paramodulations : 54094
% # Factorizations : 0
% # Equation resolutions : 20
% # Current number of processed clauses: 763
% # Positive orientable unit clauses: 451
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 309
% # Current number of unprocessed clauses: 24398
% # ...number of literals in the above : 45828
% # Clause-clause subsumption calls (NU) : 13866
% # Rec. Clause-clause subsumption calls : 13455
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 952
% # Indexed BW rewrite successes : 116
% # Backwards rewriting index: 724 leaves, 1.48+/-1.291 terms/leaf
% # Paramod-from index: 369 leaves, 1.47+/-0.982 terms/leaf
% # Paramod-into index: 569 leaves, 1.49+/-1.256 terms/leaf
% # -------------------------------------------------
% # User time : 1.294 s
% # System time : 0.051 s
% # Total time : 1.345 s
% # Maximum resident set size: 0 pages
% PrfWatch: 2.61 CPU 2.69 WC
% FINAL PrfWatch: 2.61 CPU 2.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP14651/KLE035+1.tptp
%
%------------------------------------------------------------------------------