TSTP Solution File: KLE052+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE052+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:50:03 EST 2010
% Result : Theorem 0.91s
% Output : Solution 0.91s
% 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/SystemOnTPTP4543/KLE052+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP4543/KLE052+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4543/KLE052+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 4639
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(6, axiom,![X1]:![X2]:![X3]:multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3)),file('/tmp/SRASS.s.p', left_distributivity)).
% fof(7, axiom,![X1]:![X2]:addition(X1,X2)=addition(X2,X1),file('/tmp/SRASS.s.p', additive_commutativity)).
% fof(14, axiom,![X1]:multiplication(one,X1)=X1,file('/tmp/SRASS.s.p', multiplicative_left_identity)).
% fof(16, axiom,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', domain3)).
% fof(18, conjecture,![X4]:multiplication(domain(X4),X4)=X4,file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:multiplication(domain(X4),X4)=X4),inference(assume_negation,[status(cth)],[18])).
% fof(24, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[3])).
% cnf(25,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[24])).
% fof(30, plain,![X4]:![X5]:![X6]:multiplication(addition(X4,X5),X6)=addition(multiplication(X4,X6),multiplication(X5,X6)),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(multiplication(addition(X1,X2),X3)=addition(multiplication(X1,X3),multiplication(X2,X3))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(45, plain,![X2]:multiplication(one,X2)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(multiplication(one,X1)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(49, plain,![X5]:addition(domain(X5),one)=one,inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(addition(domain(X1),one)=one),inference(split_conjunct,[status(thm)],[49])).
% fof(55, negated_conjecture,?[X4]:~(multiplication(domain(X4),X4)=X4),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X5]:~(multiplication(domain(X5),X5)=X5),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,~(multiplication(domain(esk1_0),esk1_0)=esk1_0),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(multiplication(domain(esk1_0),esk1_0)!=esk1_0),inference(split_conjunct,[status(thm)],[57])).
% cnf(64,plain,(addition(one,domain(X1))=one),inference(rw,[status(thm)],[50,33,theory(equality)])).
% cnf(176,plain,(addition(multiplication(X1,X2),X2)=multiplication(addition(X1,one),X2)),inference(spm,[status(thm)],[31,46,theory(equality)])).
% cnf(946,plain,(addition(X2,multiplication(X1,X2))=multiplication(addition(X1,one),X2)),inference(rw,[status(thm)],[176,33,theory(equality)])).
% cnf(972,plain,(X1=multiplication(domain(X1),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[25,946,theory(equality)]),33,theory(equality)]),64,theory(equality)]),46,theory(equality)])).
% cnf(1008,negated_conjecture,($false),inference(rw,[status(thm)],[58,972,theory(equality)])).
% cnf(1009,negated_conjecture,($false),inference(cn,[status(thm)],[1008,theory(equality)])).
% cnf(1010,negated_conjecture,($false),1009,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 100
% # ...of these trivial : 15
% # ...subsumed : 35
% # ...remaining for further processing: 50
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 541
% # ...of the previous two non-trivial : 314
% # Contextual simplify-reflections : 0
% # Paramodulations : 540
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 33
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 209
% # ...number of literals in the above : 283
% # Clause-clause subsumption calls (NU) : 74
% # Rec. Clause-clause subsumption calls : 74
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 38
% # Indexed BW rewrite successes : 23
% # Backwards rewriting index: 51 leaves, 1.45+/-1.072 terms/leaf
% # Paramod-from index: 29 leaves, 1.28+/-0.581 terms/leaf
% # Paramod-into index: 40 leaves, 1.48+/-1.000 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.17 WC
% FINAL PrfWatch: 0.12 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP4543/KLE052+1.tptp
%
%------------------------------------------------------------------------------