TSTP Solution File: KLE150+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE150+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 : 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 08:14:40 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP30771/KLE150+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30771/KLE150+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30771/KLE150+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 30867
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(3, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(4, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(6, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(7, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(9, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', distributivity2)).
% fof(13, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(16, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(18, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', idempotence)).
% fof(19, conjecture,![X4]:(leq(strong_iteration(multiplication(X4,zero)),addition(one,multiplication(X4,zero)))&leq(addition(one,multiplication(X4,zero)),strong_iteration(multiplication(X4,zero)))),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:(leq(strong_iteration(multiplication(X4,zero)),addition(one,multiplication(X4,zero)))&leq(addition(one,multiplication(X4,zero)),strong_iteration(multiplication(X4,zero))))),inference(assume_negation,[status(cth)],[19])).
% fof(24, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[2])).
% cnf(25,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[3])).
% cnf(27,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(29,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(33,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[7])).
% fof(35, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[34])).
% cnf(36,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[35])).
% fof(40, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(41,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[40])).
% fof(50, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[13])).
% cnf(51,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[50])).
% fof(56, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[16])).
% cnf(57,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(60, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[18])).
% cnf(61,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[60])).
% fof(62, negated_conjecture,?[X4]:(~(leq(strong_iteration(multiplication(X4,zero)),addition(one,multiplication(X4,zero))))|~(leq(addition(one,multiplication(X4,zero)),strong_iteration(multiplication(X4,zero))))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:(~(leq(strong_iteration(multiplication(X5,zero)),addition(one,multiplication(X5,zero))))|~(leq(addition(one,multiplication(X5,zero)),strong_iteration(multiplication(X5,zero))))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,(~(leq(strong_iteration(multiplication(esk1_0,zero)),addition(one,multiplication(esk1_0,zero))))|~(leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero))))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(~leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero)))|~leq(strong_iteration(multiplication(esk1_0,zero)),addition(one,multiplication(esk1_0,zero)))),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[29,57,theory(equality)])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[25,57,theory(equality)])).
% cnf(84,plain,(leq(X1,X1)),inference(spm,[status(thm)],[36,61,theory(equality)])).
% cnf(89,plain,(addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2)))))=strong_iteration(multiplication(X1,X2))),inference(spm,[status(thm)],[76,51,theory(equality)])).
% cnf(189,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[41,33,theory(equality)])).
% cnf(672,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[189,57,theory(equality)])).
% cnf(673,plain,(multiplication(addition(X1,one),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[66,672,theory(equality)])).
% cnf(718,plain,(multiplication(addition(one,X1),zero)=multiplication(X1,zero)),inference(spm,[status(thm)],[673,57,theory(equality)])).
% cnf(1294,plain,(addition(one,multiplication(addition(one,X1),multiplication(zero,strong_iteration(multiplication(X1,zero)))))=strong_iteration(multiplication(X1,zero))),inference(spm,[status(thm)],[89,718,theory(equality)])).
% cnf(1316,plain,(addition(one,multiplication(X1,zero))=strong_iteration(multiplication(X1,zero))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1294,27,theory(equality)]),718,theory(equality)])).
% cnf(1483,negated_conjecture,($false|~leq(addition(one,multiplication(esk1_0,zero)),strong_iteration(multiplication(esk1_0,zero)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[65,1316,theory(equality)]),84,theory(equality)])).
% cnf(1484,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1483,1316,theory(equality)]),84,theory(equality)])).
% cnf(1485,negated_conjecture,($false),inference(cn,[status(thm)],[1484,theory(equality)])).
% cnf(1486,negated_conjecture,($false),1485,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 177
% # ...of these trivial : 39
% # ...subsumed : 49
% # ...remaining for further processing: 89
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 6
% # Generated clauses : 853
% # ...of the previous two non-trivial : 512
% # Contextual simplify-reflections : 0
% # Paramodulations : 852
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 81
% # Positive orientable unit clauses: 57
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 350
% # ...number of literals in the above : 527
% # Clause-clause subsumption calls (NU) : 164
% # Rec. Clause-clause subsumption calls : 164
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 56
% # Indexed BW rewrite successes : 12
% # Backwards rewriting index: 98 leaves, 1.41+/-0.957 terms/leaf
% # Paramod-from index: 50 leaves, 1.18+/-0.433 terms/leaf
% # Paramod-into index: 79 leaves, 1.41+/-0.988 terms/leaf
% # -------------------------------------------------
% # User time : 0.028 s
% # System time : 0.004 s
% # Total time : 0.032 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP30771/KLE150+2.tptp
%
%------------------------------------------------------------------------------