TSTP Solution File: REL049+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL049+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 22:03:53 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP8268/REL049+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8268/REL049+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8268/REL049+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 8364
% 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(1, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(14, conjecture,![X1]:![X2]:![X3]:((join(X1,X2)=X2&join(X3,X2)=X2)=>join(join(X1,X3),X2)=X2),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:![X3]:((join(X1,X2)=X2&join(X3,X2)=X2)=>join(join(X1,X3),X2)=X2)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(42, negated_conjecture,?[X1]:?[X2]:?[X3]:((join(X1,X2)=X2&join(X3,X2)=X2)&~(join(join(X1,X3),X2)=X2)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X4]:?[X5]:?[X6]:((join(X4,X5)=X5&join(X6,X5)=X5)&~(join(join(X4,X6),X5)=X5)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((join(esk1_0,esk2_0)=esk2_0&join(esk3_0,esk2_0)=esk2_0)&~(join(join(esk1_0,esk3_0),esk2_0)=esk2_0)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(join(esk1_0,esk3_0),esk2_0)!=esk2_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(esk3_0,esk2_0)=esk2_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,negated_conjecture,(join(esk1_0,esk2_0)=esk2_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(49,negated_conjecture,(join(esk2_0,join(esk1_0,esk3_0))!=esk2_0),inference(rw,[status(thm)],[45,17,theory(equality)])).
% cnf(50,negated_conjecture,(join(esk2_0,esk1_0)=esk2_0),inference(rw,[status(thm)],[47,17,theory(equality)])).
% cnf(51,negated_conjecture,(join(esk2_0,esk3_0)=esk2_0),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(57,negated_conjecture,(join(esk2_0,X1)=join(esk2_0,join(esk1_0,X1))),inference(spm,[status(thm)],[19,50,theory(equality)])).
% cnf(288,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[49,57,theory(equality)]),51,theory(equality)])).
% cnf(289,negated_conjecture,($false),inference(cn,[status(thm)],[288,theory(equality)])).
% cnf(290,negated_conjecture,($false),289,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 42
% # ...of these trivial : 8
% # ...subsumed : 4
% # ...remaining for further processing: 30
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 133
% # ...of the previous two non-trivial : 97
% # Contextual simplify-reflections : 0
% # Paramodulations : 133
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 24
% # Positive orientable unit clauses: 23
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 68
% # ...number of literals in the above : 68
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 13
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 52 leaves, 1.13+/-0.440 terms/leaf
% # Paramod-from index: 24 leaves, 1.04+/-0.200 terms/leaf
% # Paramod-into index: 44 leaves, 1.05+/-0.208 terms/leaf
% # -------------------------------------------------
% # User time : 0.012 s
% # System time : 0.003 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP8268/REL049+1.tptp
%
%------------------------------------------------------------------------------