TSTP Solution File: KLE055+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE055+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 : art06.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:51 EST 2010
% Result : Theorem 0.97s
% Output : Solution 0.97s
% 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/SystemOnTPTP23452/KLE055+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23452/KLE055+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23452/KLE055+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 23548
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 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(6, axiom,![X4]:addition(X4,multiplication(domain(X4),X4))=multiplication(domain(X4),X4),file('/tmp/SRASS.s.p', domain1)).
% fof(7, axiom,![X1]:multiplication(X1,one)=X1,file('/tmp/SRASS.s.p', multiplicative_right_identity)).
% fof(11, axiom,![X1]:![X2]:![X3]:multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3)),file('/tmp/SRASS.s.p', right_distributivity)).
% fof(17, axiom,![X1]:![X2]:(leq(X1,X2)<=>addition(X1,X2)=X2),file('/tmp/SRASS.s.p', order)).
% fof(18, conjecture,![X4]:(addition(X4,one)=one=>addition(X4,domain(X4))=domain(X4)),file('/tmp/SRASS.s.p', goals)).
% fof(19, negated_conjecture,~(![X4]:(addition(X4,one)=one=>addition(X4,domain(X4))=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(30, plain,![X5]:addition(X5,multiplication(domain(X5),X5))=multiplication(domain(X5),X5),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(addition(X1,multiplication(domain(X1),X1))=multiplication(domain(X1),X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:multiplication(X2,one)=X2,inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(multiplication(X1,one)=X1),inference(split_conjunct,[status(thm)],[32])).
% fof(40, plain,![X4]:![X5]:![X6]:multiplication(X4,addition(X5,X6))=addition(multiplication(X4,X5),multiplication(X4,X6)),inference(variable_rename,[status(thm)],[11])).
% cnf(41,plain,(multiplication(X1,addition(X2,X3))=addition(multiplication(X1,X2),multiplication(X1,X3))),inference(split_conjunct,[status(thm)],[40])).
% 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]:(addition(X4,one)=one&~(addition(X4,domain(X4))=domain(X4))),inference(fof_nnf,[status(thm)],[19])).
% fof(56, negated_conjecture,?[X5]:(addition(X5,one)=one&~(addition(X5,domain(X5))=domain(X5))),inference(variable_rename,[status(thm)],[55])).
% fof(57, negated_conjecture,(addition(esk1_0,one)=one&~(addition(esk1_0,domain(esk1_0))=domain(esk1_0))),inference(skolemize,[status(esa)],[56])).
% cnf(58,negated_conjecture,(addition(esk1_0,domain(esk1_0))!=domain(esk1_0)),inference(split_conjunct,[status(thm)],[57])).
% cnf(59,negated_conjecture,(addition(esk1_0,one)=one),inference(split_conjunct,[status(thm)],[57])).
% cnf(72,negated_conjecture,(addition(one,esk1_0)=one),inference(rw,[status(thm)],[59,21,theory(equality)])).
% cnf(77,plain,(addition(X1,addition(X2,X3))=addition(X3,addition(X1,X2))),inference(spm,[status(thm)],[21,23,theory(equality)])).
% cnf(82,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[23,25,theory(equality)])).
% cnf(450,plain,(leq(X1,addition(X1,X2))),inference(spm,[status(thm)],[53,82,theory(equality)])).
% cnf(854,plain,(leq(X1,addition(X3,addition(X1,X2)))),inference(spm,[status(thm)],[450,77,theory(equality)])).
% cnf(1945,plain,(leq(X1,addition(X2,multiplication(domain(X1),X1)))),inference(spm,[status(thm)],[854,31,theory(equality)])).
% cnf(3542,plain,(leq(X1,multiplication(domain(X1),addition(X2,X1)))),inference(spm,[status(thm)],[1945,41,theory(equality)])).
% cnf(4136,negated_conjecture,(leq(esk1_0,multiplication(domain(esk1_0),one))),inference(spm,[status(thm)],[3542,72,theory(equality)])).
% cnf(4175,negated_conjecture,(leq(esk1_0,domain(esk1_0))),inference(rw,[status(thm)],[4136,33,theory(equality)])).
% cnf(4192,negated_conjecture,(addition(esk1_0,domain(esk1_0))=domain(esk1_0)),inference(spm,[status(thm)],[54,4175,theory(equality)])).
% cnf(4193,negated_conjecture,($false),inference(sr,[status(thm)],[4192,58,theory(equality)])).
% cnf(4194,negated_conjecture,($false),4193,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 342
% # ...of these trivial : 79
% # ...subsumed : 157
% # ...remaining for further processing: 106
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 2294
% # ...of the previous two non-trivial : 1279
% # Contextual simplify-reflections : 0
% # Paramodulations : 2293
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 100
% # Positive orientable unit clauses: 73
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 1
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 927
% # ...number of literals in the above : 1243
% # Clause-clause subsumption calls (NU) : 496
% # Rec. Clause-clause subsumption calls : 496
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 81
% # Indexed BW rewrite successes : 50
% # Backwards rewriting index: 111 leaves, 1.41+/-0.962 terms/leaf
% # Paramod-from index: 63 leaves, 1.24+/-0.635 terms/leaf
% # Paramod-into index: 92 leaves, 1.41+/-0.991 terms/leaf
% # -------------------------------------------------
% # User time : 0.052 s
% # System time : 0.006 s
% # Total time : 0.058 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.17 CPU 0.26 WC
% FINAL PrfWatch: 0.17 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP23452/KLE055+1.tptp
%
%------------------------------------------------------------------------------