TSTP Solution File: KLE085+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KLE085+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:23 EST 2010
% Result : Theorem 0.90s
% Output : Solution 0.90s
% 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/SystemOnTPTP16563/KLE085+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP16563/KLE085+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16563/KLE085+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 16659
% 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(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(antidomain(antidomain(X4)),antidomain(X4))=one,file('/tmp/SRASS.s.p', domain3)).
% fof(8, axiom,![X4]:domain(X4)=antidomain(antidomain(X4)),file('/tmp/SRASS.s.p', domain4)).
% fof(21, conjecture,![X4]:addition(domain(X4),one)=one,file('/tmp/SRASS.s.p', goals)).
% fof(22, negated_conjecture,~(![X4]:addition(domain(X4),one)=one),inference(assume_negation,[status(cth)],[21])).
% fof(23, plain,![X3]:![X4]:addition(X3,X4)=addition(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(24,plain,(addition(X1,X2)=addition(X2,X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:addition(X6,addition(X5,X4))=addition(addition(X6,X5),X4),inference(variable_rename,[status(thm)],[2])).
% cnf(26,plain,(addition(X1,addition(X2,X3))=addition(addition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:addition(X2,X2)=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(28,plain,(addition(X1,X1)=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(33, plain,![X5]:addition(antidomain(antidomain(X5)),antidomain(X5))=one,inference(variable_rename,[status(thm)],[6])).
% cnf(34,plain,(addition(antidomain(antidomain(X1)),antidomain(X1))=one),inference(split_conjunct,[status(thm)],[33])).
% fof(37, plain,![X5]:domain(X5)=antidomain(antidomain(X5)),inference(variable_rename,[status(thm)],[8])).
% cnf(38,plain,(domain(X1)=antidomain(antidomain(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(65, negated_conjecture,?[X4]:~(addition(domain(X4),one)=one),inference(fof_nnf,[status(thm)],[22])).
% fof(66, negated_conjecture,?[X5]:~(addition(domain(X5),one)=one),inference(variable_rename,[status(thm)],[65])).
% fof(67, negated_conjecture,~(addition(domain(esk1_0),one)=one),inference(skolemize,[status(esa)],[66])).
% cnf(68,negated_conjecture,(addition(domain(esk1_0),one)!=one),inference(split_conjunct,[status(thm)],[67])).
% cnf(69,negated_conjecture,(addition(antidomain(antidomain(esk1_0)),one)!=one),inference(rw,[status(thm)],[68,38,theory(equality)]),['unfolding']).
% cnf(76,negated_conjecture,(addition(one,antidomain(antidomain(esk1_0)))!=one),inference(rw,[status(thm)],[69,24,theory(equality)])).
% cnf(90,plain,(addition(X1,X2)=addition(X1,addition(X1,X2))),inference(spm,[status(thm)],[26,28,theory(equality)])).
% cnf(120,plain,(addition(antidomain(X1),antidomain(antidomain(X1)))=one),inference(rw,[status(thm)],[34,24,theory(equality)])).
% cnf(288,plain,(addition(antidomain(X1),one)=one),inference(spm,[status(thm)],[90,120,theory(equality)])).
% cnf(349,plain,(addition(one,antidomain(X1))=one),inference(rw,[status(thm)],[288,24,theory(equality)])).
% cnf(356,negated_conjecture,($false),inference(rw,[status(thm)],[76,349,theory(equality)])).
% cnf(357,negated_conjecture,($false),inference(cn,[status(thm)],[356,theory(equality)])).
% cnf(358,negated_conjecture,($false),357,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 36
% # ...of these trivial : 2
% # ...subsumed : 0
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 164
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections : 0
% # Paramodulations : 164
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 32
% # Positive orientable unit clauses: 29
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 78
% # ...number of literals in the above : 87
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 1
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 12
% # Indexed BW rewrite successes : 7
% # Backwards rewriting index: 45 leaves, 1.27+/-0.772 terms/leaf
% # Paramod-from index: 28 leaves, 1.11+/-0.409 terms/leaf
% # Paramod-into index: 41 leaves, 1.20+/-0.505 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.003 s
% # Total time : 0.017 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP16563/KLE085+1.tptp
%
%------------------------------------------------------------------------------