TSTP Solution File: KLE035+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE035+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 : 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:46:11 EST 2010
% Result : Theorem 4.67s
% Output : Solution 4.67s
% 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/SystemOnTPTP15000/KLE035+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP15000/KLE035+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP15000/KLE035+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 15132
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X3]:![X4]:(leq(X3,X4)<=>addition(X3,X4)=X4),file('/tmp/SRASS.s.p', order)).
% fof(5, axiom,![X3]:addition(X3,zero)=X3,file('/tmp/SRASS.s.p', additive_identity)).
% fof(8, axiom,![X3]:![X4]:![X5]:multiplication(X3,addition(X4,X5))=addition(multiplication(X3,X4),multiplication(X3,X5)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(9, axiom,![X3]:![X4]:![X5]:multiplication(addition(X3,X4),X5)=addition(multiplication(X3,X5),multiplication(X4,X5)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(10, axiom,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(13, axiom,![X3]:![X4]:![X5]:multiplication(X3,multiplication(X4,X5))=multiplication(multiplication(X3,X4),X5),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(19, conjecture,![X1]:![X2]:![X6]:![X7]:((((test(X7)&test(X6))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X6,X2),c(X7)),zero))=>leq(multiplication(multiplication(X6,addition(X1,X2)),c(X7)),zero)),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X1]:![X2]:![X6]:![X7]:((((test(X7)&test(X6))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X6,X2),c(X7)),zero))=>leq(multiplication(multiplication(X6,addition(X1,X2)),c(X7)),zero))),inference(assume_negation,[status(cth)],[19])).
% fof(31, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(fof_nnf,[status(thm)],[4])).
% fof(32, plain,![X5]:![X6]:((~(leq(X5,X6))|addition(X5,X6)=X6)&(~(addition(X5,X6)=X6)|leq(X5,X6))),inference(variable_rename,[status(thm)],[31])).
% cnf(33,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[32])).
% fof(35, plain,![X4]:addition(X4,zero)=X4,inference(variable_rename,[status(thm)],[5])).
% cnf(36,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[35])).
% fof(41, plain,![X6]:![X7]:![X8]:multiplication(X6,addition(X7,X8))=addition(multiplication(X6,X7),multiplication(X6,X8)),inference(variable_rename,[status(thm)],[8])).
% cnf(42,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X6]:![X7]:![X8]:multiplication(addition(X6,X7),X8)=addition(multiplication(X6,X8),multiplication(X7,X8)),inference(variable_rename,[status(thm)],[9])).
% cnf(44,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X5]:![X6]:addition(X5,X6)=addition(X6,X5),inference(variable_rename,[status(thm)],[10])).
% cnf(46,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[45])).
% fof(51, plain,![X6]:![X7]:![X8]:multiplication(X6,multiplication(X7,X8))=multiplication(multiplication(X6,X7),X8),inference(variable_rename,[status(thm)],[13])).
% cnf(52,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[51])).
% fof(75, negated_conjecture,?[X1]:?[X2]:?[X6]:?[X7]:((((test(X7)&test(X6))&leq(multiplication(multiplication(X6,X1),c(X7)),zero))&leq(multiplication(multiplication(X6,X2),c(X7)),zero))&~(leq(multiplication(multiplication(X6,addition(X1,X2)),c(X7)),zero))),inference(fof_nnf,[status(thm)],[20])).
% fof(76, 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)],[75])).
% fof(77, 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)],[76])).
% cnf(78,negated_conjecture,(~leq(multiplication(multiplication(esk4_0,addition(esk2_0,esk3_0)),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[77])).
% cnf(79,negated_conjecture,(leq(multiplication(multiplication(esk4_0,esk3_0),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[77])).
% cnf(80,negated_conjecture,(leq(multiplication(multiplication(esk4_0,esk2_0),c(esk5_0)),zero)),inference(split_conjunct,[status(thm)],[77])).
% cnf(113,negated_conjecture,(~leq(multiplication(esk4_0,multiplication(addition(esk2_0,esk3_0),c(esk5_0))),zero)),inference(rw,[status(thm)],[78,52,theory(equality)])).
% cnf(124,negated_conjecture,(leq(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero)),inference(rw,[status(thm)],[80,52,theory(equality)])).
% cnf(125,negated_conjecture,(addition(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0))),zero)=zero),inference(spm,[status(thm)],[34,124,theory(equality)])).
% cnf(126,negated_conjecture,(multiplication(esk4_0,multiplication(esk2_0,c(esk5_0)))=zero),inference(rw,[status(thm)],[125,36,theory(equality)])).
% cnf(127,negated_conjecture,(leq(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero)),inference(rw,[status(thm)],[79,52,theory(equality)])).
% cnf(128,negated_conjecture,(addition(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0))),zero)=zero),inference(spm,[status(thm)],[34,127,theory(equality)])).
% cnf(129,negated_conjecture,(multiplication(esk4_0,multiplication(esk3_0,c(esk5_0)))=zero),inference(rw,[status(thm)],[128,36,theory(equality)])).
% cnf(131,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[36,46,theory(equality)])).
% cnf(229,plain,(leq(zero,X1)),inference(spm,[status(thm)],[33,131,theory(equality)])).
% cnf(423,negated_conjecture,(addition(zero,multiplication(esk4_0,X1))=multiplication(esk4_0,addition(multiplication(esk2_0,c(esk5_0)),X1))),inference(spm,[status(thm)],[42,126,theory(equality)])).
% cnf(430,negated_conjecture,(multiplication(esk4_0,X1)=multiplication(esk4_0,addition(multiplication(esk2_0,c(esk5_0)),X1))),inference(rw,[status(thm)],[423,131,theory(equality)])).
% cnf(19923,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)],[430,44,theory(equality)])).
% cnf(148981,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[113,19923,theory(equality)]),129,theory(equality)]),229,theory(equality)])).
% cnf(148982,negated_conjecture,($false),inference(cn,[status(thm)],[148981,theory(equality)])).
% cnf(148983,negated_conjecture,($false),148982,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 5923
% # ...of these trivial : 951
% # ...subsumed : 3802
% # ...remaining for further processing: 1170
% # Other redundant clauses eliminated : 6
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 11
% # Backward-rewritten : 248
% # Generated clauses : 69951
% # ...of the previous two non-trivial : 44473
% # Contextual simplify-reflections : 355
% # Paramodulations : 69896
% # Factorizations : 2
% # Equation resolutions : 29
% # Current number of processed clauses: 911
% # Positive orientable unit clauses: 442
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 465
% # Current number of unprocessed clauses: 32573
% # ...number of literals in the above : 75693
% # Clause-clause subsumption calls (NU) : 21845
% # Rec. Clause-clause subsumption calls : 21219
% # Unit Clause-clause subsumption calls : 339
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1190
% # Indexed BW rewrite successes : 126
% # Backwards rewriting index: 759 leaves, 1.53+/-1.348 terms/leaf
% # Paramod-from index: 392 leaves, 1.52+/-1.113 terms/leaf
% # Paramod-into index: 587 leaves, 1.57+/-1.375 terms/leaf
% # -------------------------------------------------
% # User time : 1.806 s
% # System time : 0.086 s
% # Total time : 1.892 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.65 CPU 3.73 WC
% FINAL PrfWatch: 3.65 CPU 3.73 WC
% SZS output end Solution for /tmp/SystemOnTPTP15000/KLE035+2.tptp
%
%------------------------------------------------------------------------------