TSTP Solution File: KLE150+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE150+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 : art04.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:21 EST 2010
% Result : Theorem 0.98s
% Output : Solution 0.98s
% 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/SystemOnTPTP839/KLE150+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP839/KLE150+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP839/KLE150+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 935
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 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(3, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3),file('/tmp/SRASS.s.p', multiplicative_associativity)).
% fof(7, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% 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(10, axiom,![X1]:multiplication(zero,X1)=zero,file('/tmp/SRASS.s.p', left_annihilation)).
% fof(11, axiom,![X1]:strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one),file('/tmp/SRASS.s.p', infty_unfold1)).
% fof(19, conjecture,![X4]:strong_iteration(multiplication(X4,zero))=addition(one,multiplication(X4,zero)),file('/tmp/SRASS.s.p', goals)).
% fof(20, negated_conjecture,~(![X4]:strong_iteration(multiplication(X4,zero))=addition(one,multiplication(X4,zero))),inference(assume_negation,[status(cth)],[19])).
% fof(21, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(22,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(25, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(26,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X4]:![X5]:![X6]:multiplication(X4,multiplication(X5,X6))=multiplication(multiplication(X4,X5),X6),inference(variable_rename,[status(thm)],[5])).
% cnf(30,plain,(multiplication(X1,multiplication(X2,X3))=multiplication(multiplication(X1,X2),X3)),inference(split_conjunct,[status(thm)],[29])).
% fof(33, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(34,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(37, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[9])).
% cnf(38,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X2]:multiplication(zero,X2)=zero,inference(variable_rename,[status(thm)],[10])).
% cnf(40,plain,(multiplication(zero,X1)=zero),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:strong_iteration(X2)=addition(multiplication(X2,strong_iteration(X2)),one),inference(variable_rename,[status(thm)],[11])).
% cnf(42,plain,(strong_iteration(X1)=addition(multiplication(X1,strong_iteration(X1)),one)),inference(split_conjunct,[status(thm)],[41])).
% fof(62, negated_conjecture,?[X4]:~(strong_iteration(multiplication(X4,zero))=addition(one,multiplication(X4,zero))),inference(fof_nnf,[status(thm)],[20])).
% fof(63, negated_conjecture,?[X5]:~(strong_iteration(multiplication(X5,zero))=addition(one,multiplication(X5,zero))),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,~(strong_iteration(multiplication(esk1_0,zero))=addition(one,multiplication(esk1_0,zero))),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(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)],[26,22,theory(equality)])).
% cnf(76,plain,(addition(one,multiplication(X1,strong_iteration(X1)))=strong_iteration(X1)),inference(rw,[status(thm)],[42,22,theory(equality)])).
% cnf(106,plain,(addition(one,multiplication(X1,multiplication(X2,strong_iteration(multiplication(X1,X2)))))=strong_iteration(multiplication(X1,X2))),inference(spm,[status(thm)],[76,30,theory(equality)])).
% cnf(188,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[38,34,theory(equality)])).
% cnf(672,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[188,22,theory(equality)])).
% cnf(678,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)],[678,22,theory(equality)])).
% cnf(3941,plain,(addition(one,multiplication(addition(one,X1),multiplication(zero,strong_iteration(multiplication(X1,zero)))))=strong_iteration(multiplication(X1,zero))),inference(spm,[status(thm)],[106,718,theory(equality)])).
% cnf(3969,plain,(addition(one,multiplication(X1,zero))=strong_iteration(multiplication(X1,zero))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3941,40,theory(equality)]),718,theory(equality)])).
% cnf(4160,negated_conjecture,($false),inference(rw,[status(thm)],[65,3969,theory(equality)])).
% cnf(4161,negated_conjecture,($false),inference(cn,[status(thm)],[4160,theory(equality)])).
% cnf(4162,negated_conjecture,($false),4161,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 372
% # ...of these trivial : 83
% # ...subsumed : 122
% # ...remaining for further processing: 167
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 6
% # Generated clauses : 2570
% # ...of the previous two non-trivial : 1636
% # Contextual simplify-reflections : 0
% # Paramodulations : 2569
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 159
% # Positive orientable unit clauses: 122
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 34
% # Current number of unprocessed clauses: 1279
% # ...number of literals in the above : 1751
% # Clause-clause subsumption calls (NU) : 368
% # Rec. Clause-clause subsumption calls : 368
% # Unit Clause-clause subsumption calls : 41
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 164
% # Indexed BW rewrite successes : 58
% # Backwards rewriting index: 172 leaves, 1.44+/-0.947 terms/leaf
% # Paramod-from index: 95 leaves, 1.34+/-0.734 terms/leaf
% # Paramod-into index: 146 leaves, 1.45+/-0.973 terms/leaf
% # -------------------------------------------------
% # User time : 0.059 s
% # System time : 0.008 s
% # Total time : 0.067 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP839/KLE150+1.tptp
%
%------------------------------------------------------------------------------