%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL023+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 : 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:49:57 EST 2010
% Result : Theorem 9.86s
% Output : Solution 9.86s
% 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/SystemOnTPTP30382/REL023+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30382/REL023+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30382/REL023+2.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 30514
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.76 CPU 4.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.61 CPU 6.03 WC
% PrfWatch: 7.61 CPU 8.03 WC
% # 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(4, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(5, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(11, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(12, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(13, axiom,![X1]:![X2]:X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2))),file('/tmp/SRASS.s.p', maddux3_a_kind_of_de_Morgan)).
% fof(14, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(15, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(16, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(17, conjecture,![X1]:![X2]:![X3]:join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3)))=composition(X1,meet(X2,X3)),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3)))=composition(X1,meet(X2,X3))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[21])).
% fof(25, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(26,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[27])).
% fof(31, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[31])).
% fof(39, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[13])).
% cnf(44,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:?[X3]:~(join(composition(meet(X1,converse(X2)),meet(X2,X3)),composition(X1,meet(X2,X3)))=composition(X1,meet(X2,X3))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:~(join(composition(meet(X4,converse(X5)),meet(X5,X6)),composition(X4,meet(X5,X6)))=composition(X4,meet(X5,X6))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,~(join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0)))=composition(esk1_0,meet(esk2_0,esk3_0))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(composition(meet(esk1_0,converse(esk2_0)),meet(esk2_0,esk3_0)),composition(esk1_0,meet(esk2_0,esk3_0)))!=composition(esk1_0,meet(esk2_0,esk3_0))),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[48,42,theory(equality)]),['unfolding']).
% cnf(59,negated_conjecture,(join(composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk2_0),complement(esk3_0)))),composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0)))))!=composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,42,theory(equality)]),42,theory(equality)]),42,theory(equality)]),42,theory(equality)]),['unfolding']).
% cnf(60,negated_conjecture,(join(composition(esk1_0,complement(join(complement(esk3_0),complement(esk2_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk3_0),complement(esk2_0)))))!=composition(esk1_0,complement(join(complement(esk2_0),complement(esk3_0))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[59,20,theory(equality)]),20,theory(equality)]),20,theory(equality)])).
% cnf(61,negated_conjecture,(join(composition(esk1_0,complement(join(complement(esk3_0),complement(esk2_0)))),composition(complement(join(complement(esk1_0),complement(converse(esk2_0)))),complement(join(complement(esk3_0),complement(esk2_0)))))!=composition(esk1_0,complement(join(complement(esk3_0),complement(esk2_0))))),inference(rw,[status(thm)],[60,20,theory(equality)])).
% cnf(70,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[32,46,theory(equality)])).
% cnf(72,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,50,theory(equality)])).
% cnf(113,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[40,20,theory(equality)])).
% cnf(130,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[44,20,theory(equality)])).
% cnf(292,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[70,28,theory(equality)])).
% cnf(304,plain,(one=converse(one)),inference(spm,[status(thm)],[46,292,theory(equality)])).
% cnf(335,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[292,304,theory(equality)])).
% cnf(349,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[113,335,theory(equality)])).
% cnf(361,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[349,304,theory(equality)]),335,theory(equality)])).
% cnf(390,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[130,361,theory(equality)])).
% cnf(399,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[361,72,theory(equality)])).
% cnf(403,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[390,50,theory(equality)]),72,theory(equality)])).
% cnf(415,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,399,theory(equality)])).
% cnf(421,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[403,20,theory(equality)])).
% cnf(460,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[415,421,theory(equality)])).
% cnf(480,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[421,460,theory(equality)])).
% cnf(502,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[361,480,theory(equality)])).
% cnf(526,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,502,theory(equality)])).
% cnf(574,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[526,130,theory(equality)])).
% cnf(1174,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[574,20,theory(equality)])).
% cnf(1187,plain,(composition(X1,X3)=join(composition(X1,X3),composition(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[26,1174,theory(equality)])).
% cnf(275188,negated_conjecture,($false),inference(rw,[status(thm)],[61,1187,theory(equality)])).
% cnf(275189,negated_conjecture,($false),inference(cn,[status(thm)],[275188,theory(equality)])).
% cnf(275190,negated_conjecture,($false),275189,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 4134
% # ...of these trivial : 2747
% # ...subsumed : 643
% # ...remaining for further processing: 744
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 200
% # Generated clauses : 122731
% # ...of the previous two non-trivial : 62671
% # Contextual simplify-reflections : 0
% # Paramodulations : 122731
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 544
% # Positive orientable unit clauses: 540
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 44495
% # ...number of literals in the above : 44495
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 30
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5118
% # Indexed BW rewrite successes : 287
% # Backwards rewriting index: 358 leaves, 3.58+/-6.406 terms/leaf
% # Paramod-from index: 214 leaves, 2.55+/-3.286 terms/leaf
% # Paramod-into index: 345 leaves, 3.51+/-6.424 terms/leaf
% # -------------------------------------------------
% # User time : 4.391 s
% # System time : 0.156 s
% # Total time : 4.547 s
% # Maximum resident set size: 0 pages
% PrfWatch: 8.82 CPU 9.26 WC
% FINAL PrfWatch: 8.82 CPU 9.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP30382/REL023+2.tptp
%
%------------------------------------------------------------------------------