TSTP Solution File: REL003+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL003+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Wed Dec 29 21:39:09 EST 2010
% Result : Theorem 1.11s
% Output : Solution 1.11s
% 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/SystemOnTPTP22410/REL003+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22410/REL003+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22410/REL003+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 22542
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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(3, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(4, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(14, conjecture,![X1]:![X2]:((join(X1,X2)=X2=>join(converse(X1),converse(X2))=converse(X2))&(join(converse(X1),converse(X2))=converse(X2)=>join(X1,X2)=X2)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:((join(X1,X2)=X2=>join(converse(X1),converse(X2))=converse(X2))&(join(converse(X1),converse(X2))=converse(X2)=>join(X1,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(20, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(42, negated_conjecture,?[X1]:?[X2]:((join(X1,X2)=X2&~(join(converse(X1),converse(X2))=converse(X2)))|(join(converse(X1),converse(X2))=converse(X2)&~(join(X1,X2)=X2))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:((join(X3,X4)=X4&~(join(converse(X3),converse(X4))=converse(X4)))|(join(converse(X3),converse(X4))=converse(X4)&~(join(X3,X4)=X4))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((join(esk1_0,esk2_0)=esk2_0&~(join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)))|(join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)&~(join(esk1_0,esk2_0)=esk2_0))),inference(skolemize,[status(esa)],[43])).
% fof(45, negated_conjecture,(((join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)|join(esk1_0,esk2_0)=esk2_0)&(~(join(esk1_0,esk2_0)=esk2_0)|join(esk1_0,esk2_0)=esk2_0))&((join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)|~(join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)))&(~(join(esk1_0,esk2_0)=esk2_0)|~(join(converse(esk1_0),converse(esk2_0))=converse(esk2_0))))),inference(distribute,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(converse(esk1_0),converse(esk2_0))!=converse(esk2_0)|join(esk1_0,esk2_0)!=esk2_0),inference(split_conjunct,[status(thm)],[45])).
% cnf(49,negated_conjecture,(join(esk1_0,esk2_0)=esk2_0|join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(51,negated_conjecture,(join(esk2_0,esk1_0)!=esk2_0|join(converse(esk1_0),converse(esk2_0))!=converse(esk2_0)),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(52,negated_conjecture,(join(esk2_0,esk1_0)!=esk2_0|join(converse(esk2_0),converse(esk1_0))!=converse(esk2_0)),inference(rw,[status(thm)],[51,17,theory(equality)])).
% cnf(57,negated_conjecture,(converse(join(esk2_0,esk1_0))!=converse(esk2_0)|join(esk2_0,esk1_0)!=esk2_0),inference(rw,[status(thm)],[52,23,theory(equality)])).
% cnf(72,negated_conjecture,(join(esk2_0,esk1_0)=esk2_0|join(converse(esk1_0),converse(esk2_0))=converse(esk2_0)),inference(rw,[status(thm)],[49,17,theory(equality)])).
% cnf(73,negated_conjecture,(join(esk2_0,esk1_0)=esk2_0|converse(join(esk2_0,esk1_0))=converse(esk2_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[72,17,theory(equality)]),23,theory(equality)])).
% cnf(74,negated_conjecture,(converse(converse(esk2_0))=join(esk2_0,esk1_0)|join(esk2_0,esk1_0)=esk2_0),inference(spm,[status(thm)],[21,73,theory(equality)])).
% cnf(77,negated_conjecture,(esk2_0=join(esk2_0,esk1_0)|join(esk2_0,esk1_0)=esk2_0),inference(rw,[status(thm)],[74,21,theory(equality)])).
% cnf(78,negated_conjecture,(esk2_0=join(esk2_0,esk1_0)),inference(cn,[status(thm)],[77,theory(equality)])).
% cnf(140,negated_conjecture,($false|join(esk2_0,esk1_0)!=esk2_0),inference(rw,[status(thm)],[57,78,theory(equality)])).
% cnf(141,negated_conjecture,($false|$false),inference(rw,[status(thm)],[140,78,theory(equality)])).
% cnf(142,negated_conjecture,($false),inference(cn,[status(thm)],[141,theory(equality)])).
% cnf(143,negated_conjecture,($false),142,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 16
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 2
% # Generated clauses : 54
% # ...of the previous two non-trivial : 50
% # Contextual simplify-reflections : 0
% # Paramodulations : 54
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 13
% # Positive orientable unit clauses: 12
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 43
% # ...number of literals in the above : 43
% # 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 : 2
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 32 leaves, 1.25+/-0.750 terms/leaf
% # Paramod-from index: 13 leaves, 1.08+/-0.266 terms/leaf
% # Paramod-into index: 26 leaves, 1.19+/-0.482 terms/leaf
% # -------------------------------------------------
% # User time : 0.008 s
% # System time : 0.005 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP22410/REL003+1.tptp
%
%------------------------------------------------------------------------------