TSTP Solution File: KLE070+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE070+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 : art09.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:52:32 EST 2010
% Result : Theorem 1.01s
% Output : Solution 1.01s
% 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/SystemOnTPTP6392/KLE070+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP6392/KLE070+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6392/KLE070+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 6488
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 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(2, axiom,![X3]:![X2]:![X1]:addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3),file('/tmp/SRASS.s.p', additive_associativity)).
% fof(3, axiom,![X1]:addition(X1,X1)=X1,file('/tmp/SRASS.s.p', additive_idempotence)).
% fof(5, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(10, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(15, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(17, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(18, conjecture,![X4]:![X5]:addition(domain(X4),multiplication(domain(X4),domain(X5)))=domain(X4),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:![X5]:addition(domain(X4),multiplication(domain(X4),domain(X5)))=domain(X4)),inference(assume_negation,[status(cth)],[18])).
% fof(20, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(21,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(23,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(29,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(38, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[10])).
% cnf(39,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[38])).
% fof(47, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[47])).
% fof(51, plain,![X1]:![X2]:((~(leq(X1,X2))|addition(X1,X2)=X2)&(~(addition(X1,X2)=X2)|leq(X1,X2))),inference(fof_nnf,[status(thm)],[17])).
% fof(52, plain,![X3]:![X4]:((~(leq(X3,X4))|addition(X3,X4)=X4)&(~(addition(X3,X4)=X4)|leq(X3,X4))),inference(variable_rename,[status(thm)],[51])).
% cnf(53,plain,(leq(X1,X2)|addition(X1,X2)!=X2),inference(split_conjunct,[status(thm)],[52])).
% cnf(54,plain,(addition(X1,X2)=X2|~leq(X1,X2)),inference(split_conjunct,[status(thm)],[52])).
% fof(55, negated_conjecture,?[X4]:?[X5]:~(addition(domain(X4),multiplication(domain(X4),domain(X5)))=domain(X4)),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X6]:?[X7]:~(addition(domain(X6),multiplication(domain(X6),domain(X7)))=domain(X6)),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(addition(domain(esk1_0),multiplication(domain(esk1_0),domain(esk2_0)))=domain(esk1_0)),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(addition(domain(esk1_0),multiplication(domain(esk1_0),domain(esk2_0)))!=domain(esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(64,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[39,21,theory(equality)])).
% cnf(78,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,25,theory(equality)])).
% cnf(523,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,78,theory(equality)])).
% cnf(579,plain,(leq(X1,addition(X2,X1))),inference(spm,[status(thm)],[523,21,theory(equality)])).
% cnf(593,plain,(leq(multiplication(X1,X2),multiplication(X1,addition(X3,X2)))),inference(spm,[status(thm)],[579,29,theory(equality)])).
% cnf(5308,plain,(leq(multiplication(X1,domain(X2)),multiplication(X1,one))),inference(spm,[status(thm)],[593,64,theory(equality)])).
% cnf(5341,plain,(leq(multiplication(X1,domain(X2)),X1)),inference(rw,[status(thm)],[5308,48,theory(equality)])).
% cnf(5359,plain,(addition(multiplication(X1,domain(X2)),X1)=X1),inference(spm,[status(thm)],[54,5341,theory(equality)])).
% cnf(5403,plain,(addition(X1,multiplication(X1,domain(X2)))=X1),inference(rw,[status(thm)],[5359,21,theory(equality)])).
% cnf(5491,negated_conjecture,($false),inference(rw,[status(thm)],[58,5403,theory(equality)])).
% cnf(5492,negated_conjecture,($false),inference(cn,[status(thm)],[5491,theory(equality)])).
% cnf(5493,negated_conjecture,($false),5492,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 368
% # ...of these trivial : 90
% # ...subsumed : 171
% # ...remaining for further processing: 107
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 3015
% # ...of the previous two non-trivial : 1709
% # Contextual simplify-reflections : 0
% # Paramodulations : 3014
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 102
% # Positive orientable unit clauses: 81
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 0
% # Non-unit-clauses : 18
% # Current number of unprocessed clauses: 1338
% # ...number of literals in the above : 1624
% # Clause-clause subsumption calls (NU) : 611
% # Rec. Clause-clause subsumption calls : 611
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 108
% # Indexed BW rewrite successes : 46
% # Backwards rewriting index: 109 leaves, 1.57+/-1.168 terms/leaf
% # Paramod-from index: 61 leaves, 1.41+/-0.894 terms/leaf
% # Paramod-into index: 97 leaves, 1.55+/-1.140 terms/leaf
% # -------------------------------------------------
% # User time : 0.065 s
% # System time : 0.006 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.21 CPU 0.29 WC
% FINAL PrfWatch: 0.21 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP6392/KLE070+1.tptp
%
%------------------------------------------------------------------------------