%------------------------------------------------------------------------------
% File     : SRASS---0.1
% Problem  : REL031+2 : TPTP v5.0.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s

% Computer : art03.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 21:49:43 EST 2010

% Result   : Theorem 98.65s
% Output   : Solution 100.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/SystemOnTPTP9152/REL031+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM       ... 
% not found
% Adding ~C to TBU       ... ~goals:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT   ... yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... maddux1_join_commutativity:
%  CSA axiom maddux1_join_commutativity found
% Looking for CSA axiom ... maddux2_join_associativity:
%  CSA axiom maddux2_join_associativity found
% Looking for CSA axiom ... composition_associativity:
%  CSA axiom composition_associativity found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ...
%  not found
% Looking for CSA axiom ... composition_identity:
%  CSA axiom composition_identity found
% Looking for CSA axiom ... composition_distributivity:
%  CSA axiom composition_distributivity found
% Looking for CSA axiom ... converse_idempotence:
%  CSA axiom converse_idempotence found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT   ... 
% yes
% Looking for TBU model ... not found
% Looking for CSA axiom ... converse_additivity:
%  CSA axiom converse_additivity found
% Looking for CSA axiom ... converse_multiplicativity:
%  CSA axiom converse_multiplicativity found
% Looking for CSA axiom ... converse_cancellativity:
%  CSA axiom converse_cancellativity found
% ---- Iteration 4 (9 axioms selected)
% Looking for TBU SAT   ... 
% no
% Looking for TBU UNS   ... 
% yes - theorem proved
% ---- Selection completed
% Selected axioms are   ... :converse_cancellativity:converse_multiplicativity:converse_additivity:converse_idempotence:composition_distributivity:composition_identity:composition_associativity:maddux2_join_associativity:maddux1_join_commutativity (9)
% Unselected axioms are ... :dedekind_law:modular_law_1:modular_law_2:maddux3_a_kind_of_de_Morgan:maddux4_definiton_of_meet:def_top:def_zero (7)
% SZS status THM for /tmp/SystemOnTPTP9152/REL031+2.tptp
% Looking for THM       ... 
% found
% SZS output start Solution for /tmp/SystemOnTPTP9152/REL031+2.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=600 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p 
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC  time limit is 1200s
% TreeLimitedRun: PID is 10919
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time     : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(3, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(4, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(6, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(7, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(8, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(9, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(10, conjecture,![X1]:![X2]:((join(composition(converse(X1),X1),one)=one&join(composition(converse(X2),X2),one)=one)=>join(composition(converse(composition(X1,X2)),composition(X1,X2)),one)=one),file('/tmp/SRASS.s.p', goals)).
% fof(11, negated_conjecture,~(![X1]:![X2]:((join(composition(converse(X1),X1),one)=one&join(composition(converse(X2),X2),one)=one)=>join(composition(converse(composition(X1,X2)),composition(X1,X2)),one)=one)),inference(assume_negation,[status(cth)],[10])).
% fof(14, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[2])).
% cnf(15,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[14])).
% fof(16, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[3])).
% cnf(17,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(19,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(21,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(23,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[7])).
% cnf(25,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[8])).
% cnf(27,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[9])).
% cnf(29,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, negated_conjecture,?[X1]:?[X2]:((join(composition(converse(X1),X1),one)=one&join(composition(converse(X2),X2),one)=one)&~(join(composition(converse(composition(X1,X2)),composition(X1,X2)),one)=one)),inference(fof_nnf,[status(thm)],[11])).
% fof(31, negated_conjecture,?[X3]:?[X4]:((join(composition(converse(X3),X3),one)=one&join(composition(converse(X4),X4),one)=one)&~(join(composition(converse(composition(X3,X4)),composition(X3,X4)),one)=one)),inference(variable_rename,[status(thm)],[30])).
% fof(32, negated_conjecture,((join(composition(converse(esk1_0),esk1_0),one)=one&join(composition(converse(esk2_0),esk2_0),one)=one)&~(join(composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)),one)=one)),inference(skolemize,[status(esa)],[31])).
% cnf(33,negated_conjecture,(join(composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)),one)!=one),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,negated_conjecture,(join(composition(converse(esk2_0),esk2_0),one)=one),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,negated_conjecture,(join(composition(converse(esk1_0),esk1_0),one)=one),inference(split_conjunct,[status(thm)],[32])).
% cnf(36,negated_conjecture,(join(one,composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)))!=one),inference(rw,[status(thm)],[33,29,theory(equality)])).
% cnf(37,negated_conjecture,(join(one,composition(converse(esk1_0),esk1_0))=one),inference(rw,[status(thm)],[35,29,theory(equality)])).
% cnf(38,negated_conjecture,(join(one,composition(converse(esk2_0),esk2_0))=one),inference(rw,[status(thm)],[34,29,theory(equality)])).
% cnf(39,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[15,19,theory(equality)])).
% cnf(40,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[15,19,theory(equality)])).
% cnf(44,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[17,19,theory(equality)])).
% cnf(50,plain,(converse(composition(composition(converse(X2),X1),X3))=composition(converse(X3),composition(converse(X1),X2))),inference(spm,[status(thm)],[39,39,theory(equality)])).
% cnf(54,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[39,23,theory(equality)])).
% cnf(58,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[54,19,theory(equality)])).
% cnf(61,plain,(one=converse(one)),inference(spm,[status(thm)],[23,58,theory(equality)])).
% cnf(71,plain,(join(converse(X1),one)=converse(join(X1,one))),inference(spm,[status(thm)],[17,61,theory(equality)])).
% cnf(72,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[58,61,theory(equality)])).
% cnf(93,negated_conjecture,(join(one,X1)=join(one,join(composition(converse(esk2_0),esk2_0),X1))),inference(spm,[status(thm)],[27,38,theory(equality)])).
% cnf(119,plain,(converse(join(X1,one))=join(one,converse(X1))),inference(rw,[status(thm)],[71,29,theory(equality)])).
% cnf(240,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[21,72,theory(equality)])).
% cnf(257,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[240,29,theory(equality)])).
% cnf(260,plain,(converse(composition(join(X2,one),converse(X1)))=join(X1,converse(composition(X2,converse(X1))))),inference(spm,[status(thm)],[44,257,theory(equality)])).
% cnf(268,plain,(composition(X1,join(one,converse(X2)))=join(X1,converse(composition(X2,converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[260,40,theory(equality)]),119,theory(equality)])).
% cnf(269,plain,(composition(X1,join(one,converse(X2)))=join(X1,composition(X1,converse(X2)))),inference(rw,[status(thm)],[268,40,theory(equality)])).
% cnf(449,plain,(join(X1,composition(X1,X2))=composition(X1,join(one,X2))),inference(spm,[status(thm)],[269,19,theory(equality)])).
% cnf(740,negated_conjecture,(join(one,composition(join(converse(esk2_0),X1),esk2_0))=join(one,composition(X1,esk2_0))),inference(spm,[status(thm)],[93,21,theory(equality)])).
% cnf(1544,plain,(composition(converse(composition(X1,X3)),X2)=composition(converse(X3),composition(converse(X1),X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[50,25,theory(equality)]),39,theory(equality)])).
% cnf(4297,negated_conjecture,(join(one,composition(composition(converse(esk2_0),join(one,X1)),esk2_0))=join(one,composition(composition(converse(esk2_0),X1),esk2_0))),inference(spm,[status(thm)],[740,449,theory(equality)])).
% cnf(4317,negated_conjecture,(join(one,composition(converse(esk2_0),composition(join(one,X1),esk2_0)))=join(one,composition(composition(converse(esk2_0),X1),esk2_0))),inference(rw,[status(thm)],[4297,25,theory(equality)])).
% cnf(4318,negated_conjecture,(join(one,composition(converse(esk2_0),composition(join(one,X1),esk2_0)))=join(one,composition(converse(esk2_0),composition(X1,esk2_0)))),inference(rw,[status(thm)],[4317,25,theory(equality)])).
% cnf(47894,negated_conjecture,(join(one,composition(converse(esk2_0),composition(one,esk2_0)))=join(one,composition(converse(esk2_0),composition(composition(converse(esk1_0),esk1_0),esk2_0)))),inference(spm,[status(thm)],[4318,37,theory(equality)])).
% cnf(48041,negated_conjecture,(one=join(one,composition(converse(esk2_0),composition(composition(converse(esk1_0),esk1_0),esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[47894,72,theory(equality)]),38,theory(equality)])).
% cnf(48042,negated_conjecture,(one=join(one,composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[48041,25,theory(equality)]),1544,theory(equality)])).
% cnf(48043,negated_conjecture,($false),inference(sr,[status(thm)],[48042,36,theory(equality)])).
% cnf(48044,negated_conjecture,($false),48043,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses                  : 1479
% # ...of these trivial                : 699
% # ...subsumed                        : 451
% # ...remaining for further processing: 329
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed                  : 1
% # Backward-rewritten                 : 45
% # Generated clauses                  : 24564
% # ...of the previous two non-trivial : 20349
% # Contextual simplify-reflections    : 0
% # Paramodulations                    : 24564
% # Factorizations                     : 0
% # Equation resolutions               : 0
% # Current number of processed clauses: 283
% #    Positive orientable unit clauses: 251
% #    Positive unorientable unit clauses: 31
% #    Negative unit clauses           : 1
% #    Non-unit-clauses                : 0
% # Current number of unprocessed clauses: 17634
% # ...number of literals in the above : 17634
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 690
% # Rewrite failures with RHS unbound  : 0
% # Indexed BW rewrite attempts        : 2006
% # Indexed BW rewrite successes       : 346
% # Backwards rewriting index:   428 leaves,   1.78+/-1.684 terms/leaf
% # Paramod-from index:          162 leaves,   1.79+/-1.484 terms/leaf
% # Paramod-into index:          367 leaves,   1.68+/-1.520 terms/leaf
% # -------------------------------------------------
% # User time              : 0.756 s
% # System time            : 0.029 s
% # Total time             : 0.785 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.63 CPU 1.72 WC
% FINAL PrfWatch: 1.63 CPU 1.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP9152/REL031+2.tptp
% 
%------------------------------------------------------------------------------