TSTP Solution File: KLE089+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE089+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 : art05.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:54:52 EST 2010
% Result : Theorem 1.00s
% Output : Solution 1.00s
% 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/SystemOnTPTP16822/KLE089+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16822/KLE089+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16822/KLE089+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 16918
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(7, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(10, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(12, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(21, conjecture,![X4]:![X5]:(multiplication(domain(X4),X5)=zero<=addition(domain(X4),antidomain(X5))=antidomain(X5)),file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(![X4]:![X5]:(multiplication(domain(X4),X5)=zero<=addition(domain(X4),antidomain(X5))=antidomain(X5))),inference(assume_negation,[status(cth)],[21])).
% fof(23, negated_conjecture,~(![X4]:![X5]:(addition(domain(X4),antidomain(X5))=antidomain(X5)=>multiplication(domain(X4),X5)=zero)),inference(fof_simplification,[status(thm)],[22,theory(equality)])).
% fof(24, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(25,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(29,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[28])).
% fof(36, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[7])).
% cnf(37,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[36])).
% fof(42, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[10])).
% cnf(43,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[42])).
% fof(46, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[12])).
% cnf(47,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[46])).
% fof(66, negated_conjecture,?[X4]:?[X5]:(addition(domain(X4),antidomain(X5))=antidomain(X5)&~(multiplication(domain(X4),X5)=zero)),inference(fof_nnf,[status(thm)],[23])).
% fof(67, negated_conjecture,?[X6]:?[X7]:(addition(domain(X6),antidomain(X7))=antidomain(X7)&~(multiplication(domain(X6),X7)=zero)),inference(variable_rename,[status(thm)],[66])).
% fof(68, negated_conjecture,(addition(domain(esk1_0),antidomain(esk2_0))=antidomain(esk2_0)&~(multiplication(domain(esk1_0),esk2_0)=zero)),inference(skolemize,[status(esa)],[67])).
% cnf(69,negated_conjecture,(multiplication(domain(esk1_0),esk2_0)!=zero),inference(split_conjunct,[status(thm)],[68])).
% cnf(70,negated_conjecture,(addition(domain(esk1_0),antidomain(esk2_0))=antidomain(esk2_0)),inference(split_conjunct,[status(thm)],[68])).
% cnf(71,negated_conjecture,(addition(antidomain(antidomain(esk1_0)),antidomain(esk2_0))=antidomain(esk2_0)),inference(rw,[status(thm)],[70,47,theory(equality)]),['unfolding']).
% cnf(72,negated_conjecture,(multiplication(antidomain(antidomain(esk1_0)),esk2_0)!=zero),inference(rw,[status(thm)],[69,47,theory(equality)]),['unfolding']).
% cnf(75,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[29,25,theory(equality)])).
% cnf(180,plain,(addition(zero,multiplication(X2,X1))=multiplication(addition(antidomain(X1),X2),X1)),inference(spm,[status(thm)],[37,43,theory(equality)])).
% cnf(203,negated_conjecture,(addition(antidomain(esk2_0),antidomain(antidomain(esk1_0)))=antidomain(esk2_0)),inference(rw,[status(thm)],[71,25,theory(equality)])).
% cnf(4815,plain,(multiplication(addition(antidomain(X1),X2),X1)=multiplication(X2,X1)),inference(rw,[status(thm)],[180,75,theory(equality)])).
% cnf(4855,negated_conjecture,(multiplication(antidomain(esk2_0),esk2_0)=multiplication(antidomain(antidomain(esk1_0)),esk2_0)),inference(spm,[status(thm)],[4815,203,theory(equality)])).
% cnf(4896,negated_conjecture,(zero=multiplication(antidomain(antidomain(esk1_0)),esk2_0)),inference(rw,[status(thm)],[4855,43,theory(equality)])).
% cnf(4897,negated_conjecture,($false),inference(sr,[status(thm)],[4896,72,theory(equality)])).
% cnf(4898,negated_conjecture,($false),4897,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 359
% # ...of these trivial : 64
% # ...subsumed : 170
% # ...remaining for further processing: 125
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 2658
% # ...of the previous two non-trivial : 1421
% # Contextual simplify-reflections : 0
% # Paramodulations : 2657
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 120
% # Positive orientable unit clauses: 92
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 1036
% # ...number of literals in the above : 1354
% # Clause-clause subsumption calls (NU) : 448
% # Rec. Clause-clause subsumption calls : 448
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 54
% # Indexed BW rewrite successes : 29
% # Backwards rewriting index: 137 leaves, 1.33+/-0.889 terms/leaf
% # Paramod-from index: 81 leaves, 1.20+/-0.576 terms/leaf
% # Paramod-into index: 123 leaves, 1.32+/-0.886 terms/leaf
% # -------------------------------------------------
% # User time : 0.060 s
% # System time : 0.006 s
% # Total time : 0.066 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.19 CPU 0.27 WC
% FINAL PrfWatch: 0.19 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP16822/KLE089+1.tptp
%
%------------------------------------------------------------------------------