TSTP Solution File: REL018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL018+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 : art09.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:41:45 EST 2010
% Result : Theorem 1.16s
% Output : Solution 1.16s
% 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/SystemOnTPTP3651/REL018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP3651/REL018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3651/REL018+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 3747
% 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]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(2, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(3, 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(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]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(6, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(7, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(8, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(9, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(10, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(11, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% 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]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:(composition(X1,top)=X1=>composition(complement(X1),top)=complement(X1)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:(composition(X1,top)=X1=>composition(complement(X1),top)=complement(X1))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:(composition(X1,top)=X1&~(composition(complement(X1),top)=complement(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:(composition(X2,top)=X2&~(composition(complement(X2),top)=complement(X2))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(composition(esk1_0,top)=esk1_0&~(composition(complement(esk1_0),top)=complement(esk1_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(composition(complement(esk1_0),top)!=complement(esk1_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(composition(esk1_0,top)=esk1_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,39,theory(equality)]),['unfolding']).
% cnf(48,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(49,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[35,31,theory(equality)])).
% cnf(52,plain,(join(converse(X1),X2)=converse(join(X1,converse(X2)))),inference(spm,[status(thm)],[33,31,theory(equality)])).
% cnf(53,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[33,31,theory(equality)])).
% cnf(63,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[48,37,theory(equality)])).
% cnf(67,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[63,31,theory(equality)])).
% cnf(70,plain,(one=converse(one)),inference(spm,[status(thm)],[37,67,theory(equality)])).
% cnf(81,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[67,70,theory(equality)])).
% cnf(100,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[19,29,theory(equality)])).
% cnf(105,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[29,19,theory(equality)])).
% cnf(182,plain,(complement(top)=zero),inference(rw,[status(thm)],[47,19,theory(equality)])).
% cnf(251,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[53,19,theory(equality)])).
% cnf(287,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[105,19,theory(equality)])).
% cnf(390,plain,(join(composition(X1,X2),X2)=composition(join(X1,one),X2)),inference(spm,[status(thm)],[23,81,theory(equality)])).
% cnf(690,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[25,27,theory(equality)])).
% cnf(698,negated_conjecture,(join(complement(top),composition(converse(esk1_0),complement(esk1_0)))=complement(top)),inference(spm,[status(thm)],[690,46,theory(equality)])).
% cnf(700,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[690,81,theory(equality)])).
% cnf(719,negated_conjecture,(join(zero,composition(converse(esk1_0),complement(esk1_0)))=complement(top)),inference(rw,[status(thm)],[698,182,theory(equality)])).
% cnf(720,negated_conjecture,(join(zero,composition(converse(esk1_0),complement(esk1_0)))=zero),inference(rw,[status(thm)],[719,182,theory(equality)])).
% cnf(721,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[700,70,theory(equality)]),81,theory(equality)])).
% cnf(732,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[100,721,theory(equality)])).
% cnf(741,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[721,182,theory(equality)])).
% cnf(744,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[732,19,theory(equality)])).
% cnf(754,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[29,741,theory(equality)])).
% cnf(765,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[744,27,theory(equality)])).
% cnf(776,plain,(top=join(X1,top)),inference(rw,[status(thm)],[287,765,theory(equality)])).
% cnf(787,plain,(top=join(top,X1)),inference(spm,[status(thm)],[27,776,theory(equality)])).
% cnf(808,plain,(top=converse(top)),inference(spm,[status(thm)],[251,787,theory(equality)])).
% cnf(851,plain,(composition(top,converse(X1))=converse(composition(X1,top))),inference(spm,[status(thm)],[35,808,theory(equality)])).
% cnf(922,negated_conjecture,(converse(esk1_0)=composition(top,converse(esk1_0))),inference(spm,[status(thm)],[851,46,theory(equality)])).
% cnf(937,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,27,theory(equality)])).
% cnf(949,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[937,19,theory(equality)])).
% cnf(963,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[949,721,theory(equality)]),182,theory(equality)])).
% cnf(970,negated_conjecture,(composition(converse(esk1_0),X1)=composition(top,composition(converse(esk1_0),X1))),inference(spm,[status(thm)],[17,922,theory(equality)])).
% cnf(980,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[963,27,theory(equality)])).
% cnf(1039,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[754,980,theory(equality)])).
% cnf(1057,plain,(converse(converse(X1))=join(converse(zero),X1)),inference(spm,[status(thm)],[52,1039,theory(equality)])).
% cnf(1064,plain,(complement(zero)=top),inference(spm,[status(thm)],[19,1039,theory(equality)])).
% cnf(1065,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[27,1039,theory(equality)])).
% cnf(1072,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[980,1039,theory(equality)])).
% cnf(1079,plain,(X1=join(converse(zero),X1)),inference(rw,[status(thm)],[1057,31,theory(equality)])).
% cnf(1100,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[721,1072,theory(equality)])).
% cnf(1122,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[29,1100,theory(equality)])).
% cnf(1177,plain,(zero=converse(zero)),inference(spm,[status(thm)],[1065,1079,theory(equality)])).
% cnf(1550,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1122,937,theory(equality)])).
% cnf(1697,negated_conjecture,(composition(converse(esk1_0),complement(esk1_0))=zero),inference(rw,[status(thm)],[720,1039,theory(equality)])).
% cnf(1698,negated_conjecture,(composition(zero,X1)=composition(converse(esk1_0),composition(complement(esk1_0),X1))),inference(spm,[status(thm)],[17,1697,theory(equality)])).
% cnf(1890,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1550,27,theory(equality)])).
% cnf(1912,plain,(join(complement(X1),complement(join(X1,X2)))=complement(X1)),inference(spm,[status(thm)],[1890,1072,theory(equality)])).
% cnf(2554,negated_conjecture,(composition(top,zero)=zero),inference(spm,[status(thm)],[970,1697,theory(equality)])).
% cnf(2567,negated_conjecture,(join(zero,composition(X1,zero))=composition(join(top,X1),zero)),inference(spm,[status(thm)],[23,2554,theory(equality)])).
% cnf(2572,negated_conjecture,(composition(X1,zero)=composition(join(top,X1),zero)),inference(rw,[status(thm)],[2567,1039,theory(equality)])).
% cnf(2573,negated_conjecture,(composition(X1,zero)=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[2572,787,theory(equality)]),2554,theory(equality)])).
% cnf(2604,negated_conjecture,(converse(zero)=composition(converse(zero),X1)),inference(spm,[status(thm)],[48,2573,theory(equality)])).
% cnf(2618,negated_conjecture,(zero=composition(converse(zero),X1)),inference(rw,[status(thm)],[2604,1177,theory(equality)])).
% cnf(2619,negated_conjecture,(zero=composition(zero,X1)),inference(rw,[status(thm)],[2618,1177,theory(equality)])).
% cnf(3887,negated_conjecture,(composition(converse(esk1_0),composition(complement(esk1_0),X1))=zero),inference(rw,[status(thm)],[1698,2619,theory(equality)])).
% cnf(3890,negated_conjecture,(join(complement(composition(complement(esk1_0),X1)),composition(converse(converse(esk1_0)),complement(zero)))=complement(composition(complement(esk1_0),X1))),inference(spm,[status(thm)],[690,3887,theory(equality)])).
% cnf(3903,negated_conjecture,(join(complement(composition(complement(esk1_0),X1)),esk1_0)=complement(composition(complement(esk1_0),X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3890,31,theory(equality)]),1064,theory(equality)]),46,theory(equality)])).
% cnf(9469,negated_conjecture,(join(esk1_0,complement(composition(complement(esk1_0),X1)))=complement(composition(complement(esk1_0),X1))),inference(rw,[status(thm)],[3903,27,theory(equality)])).
% cnf(9474,negated_conjecture,(join(complement(esk1_0),complement(complement(composition(complement(esk1_0),X1))))=complement(esk1_0)),inference(spm,[status(thm)],[1912,9469,theory(equality)])).
% cnf(9500,negated_conjecture,(join(complement(esk1_0),composition(complement(esk1_0),X1))=complement(esk1_0)),inference(rw,[status(thm)],[9474,1072,theory(equality)])).
% cnf(11668,plain,(join(X2,composition(X1,X2))=composition(join(X1,one),X2)),inference(rw,[status(thm)],[390,27,theory(equality)])).
% cnf(11736,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[11668,787,theory(equality)])).
% cnf(11883,plain,(converse(composition(top,converse(X1)))=join(X1,converse(composition(top,converse(X1))))),inference(spm,[status(thm)],[53,11736,theory(equality)])).
% cnf(11948,plain,(composition(X1,top)=join(X1,converse(composition(top,converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[11883,49,theory(equality)]),808,theory(equality)])).
% cnf(11949,plain,(composition(X1,top)=join(X1,composition(X1,top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[11948,49,theory(equality)]),808,theory(equality)])).
% cnf(12760,negated_conjecture,(composition(complement(esk1_0),top)=complement(esk1_0)),inference(spm,[status(thm)],[9500,11949,theory(equality)])).
% cnf(12826,negated_conjecture,($false),inference(sr,[status(thm)],[12760,45,theory(equality)])).
% cnf(12827,negated_conjecture,($false),12826,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 718
% # ...of these trivial : 353
% # ...subsumed : 140
% # ...remaining for further processing: 225
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 61
% # Generated clauses : 6672
% # ...of the previous two non-trivial : 3677
% # Contextual simplify-reflections : 0
% # Paramodulations : 6672
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 164
% # Positive orientable unit clauses: 158
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2357
% # ...number of literals in the above : 2357
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 19
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 340
% # Indexed BW rewrite successes : 159
% # Backwards rewriting index: 248 leaves, 1.38+/-0.903 terms/leaf
% # Paramod-from index: 126 leaves, 1.32+/-0.793 terms/leaf
% # Paramod-into index: 221 leaves, 1.38+/-0.897 terms/leaf
% # -------------------------------------------------
% # User time : 0.139 s
% # System time : 0.011 s
% # Total time : 0.150 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.37 CPU 0.46 WC
% FINAL PrfWatch: 0.37 CPU 0.46 WC
% SZS output end Solution for /tmp/SystemOnTPTP3651/REL018+1.tptp
%
%------------------------------------------------------------------------------