TSTP Solution File: KLE083+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE083+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 : art03.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:07 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/SystemOnTPTP17236/KLE083+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17236/KLE083+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17236/KLE083+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 17332
% 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(2, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(3, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% 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(11, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(15, axiom,![X4]:multiplication(antidomain(X4),X4)=zero,file('/tmp/SRASS.s.p', domain1)).
% fof(16, axiom,![X4]:addition(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(18, axiom,![X1]:addition(X1,zero)=X1,file('/tmp/SRASS.s.p', additive_identity)).
% fof(21, conjecture,![X4]:X4=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(![X4]:X4=multiplication(domain(X4),X4)),inference(assume_negation,[status(cth)],[21])).
% fof(25, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[2])).
% cnf(26,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(35, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),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(43, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(44,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[43])).
% fof(51, plain,![X5]:multiplication(antidomain(X5),X5)=zero,inference(variable_rename,[status(thm)],[15])).
% cnf(52,plain,(multiplication(antidomain(X1),X1)=zero),inference(split_conjunct,[status(thm)],[51])).
% fof(53, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[16])).
% cnf(54,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[53])).
% fof(57, plain,![X2]:addition(X2,zero)=X2,inference(variable_rename,[status(thm)],[18])).
% cnf(58,plain,(addition(X1,zero)=X1),inference(split_conjunct,[status(thm)],[57])).
% fof(65, negated_conjecture,?[X4]:~(X4=multiplication(domain(X4),X4)),inference(fof_nnf,[status(thm)],[22])).
% fof(66, negated_conjecture,?[X5]:~(X5=multiplication(domain(X5),X5)),inference(variable_rename,[status(thm)],[65])).
% fof(67, negated_conjecture,~(esk1_0=multiplication(domain(esk1_0),esk1_0)),inference(skolemize,[status(esa)],[66])).
% cnf(68,negated_conjecture,(esk1_0!=multiplication(domain(esk1_0),esk1_0)),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(multiplication(antidomain(antidomain(esk1_0)),esk1_0)!=esk1_0),inference(rw,[status(thm)],[68,26,theory(equality)]),['unfolding']).
% cnf(72,plain,(addition(zero,X1)=X1),inference(spm,[status(thm)],[58,28,theory(equality)])).
% cnf(119,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[54,28,theory(equality)])).
% cnf(178,plain,(addition(zero,multiplication(X2,X1))=multiplication(addition(antidomain(X1),X2),X1)),inference(spm,[status(thm)],[36,52,theory(equality)])).
% cnf(4442,plain,(multiplication(addition(antidomain(X1),X2),X1)=multiplication(X2,X1)),inference(rw,[status(thm)],[178,72,theory(equality)])).
% cnf(4482,plain,(multiplication(one,X1)=multiplication(antidomain(antidomain(X1)),X1)),inference(spm,[status(thm)],[4442,119,theory(equality)])).
% cnf(4521,plain,(X1=multiplication(antidomain(antidomain(X1)),X1)),inference(rw,[status(thm)],[4482,44,theory(equality)])).
% cnf(4548,negated_conjecture,($false),inference(rw,[status(thm)],[69,4521,theory(equality)])).
% cnf(4549,negated_conjecture,($false),inference(cn,[status(thm)],[4548,theory(equality)])).
% cnf(4550,negated_conjecture,($false),4549,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 334
% # ...of these trivial : 60
% # ...subsumed : 157
% # ...remaining for further processing: 117
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 2476
% # ...of the previous two non-trivial : 1309
% # Contextual simplify-reflections : 0
% # Paramodulations : 2475
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 112
% # Positive orientable unit clauses: 86
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 960
% # ...number of literals in the above : 1252
% # Clause-clause subsumption calls (NU) : 389
% # Rec. Clause-clause subsumption calls : 389
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 65
% # Indexed BW rewrite successes : 41
% # Backwards rewriting index: 121 leaves, 1.37+/-0.937 terms/leaf
% # Paramod-from index: 75 leaves, 1.21+/-0.595 terms/leaf
% # Paramod-into index: 107 leaves, 1.36+/-0.941 terms/leaf
% # -------------------------------------------------
% # User time : 0.053 s
% # System time : 0.008 s
% # Total time : 0.061 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/SystemOnTPTP17236/KLE083+1.tptp
%
%------------------------------------------------------------------------------