TSTP Solution File: REL013+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL013+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 : art07.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:37:23 EST 2010
% Result : Theorem 1.17s
% Output : Solution 1.17s
% 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/SystemOnTPTP1314/REL013+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1314/REL013+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1314/REL013+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 1411
% 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]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(2, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(3, axiom,![X1]:![X2]:join(X1,X2)=join(X2,X1),file('/tmp/SRASS.s.p', maddux1_join_commutativity)).
% fof(4, axiom,![X1]:![X2]:![X3]:join(X1,join(X2,X3))=join(join(X1,X2),X3),file('/tmp/SRASS.s.p', maddux2_join_associativity)).
% fof(5, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(6, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(7, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(8, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(9, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(10, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(11, 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(12, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(13, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(14, conjecture,![X1]:(composition(X1,zero)=zero&composition(zero,X1)=zero),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:(composition(X1,zero)=zero&composition(zero,X1)=zero)),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,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[9])).
% cnf(33,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[32])).
% fof(34, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:(~(composition(X1,zero)=zero)|~(composition(zero,X1)=zero)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:(~(composition(X2,zero)=zero)|~(composition(zero,X2)=zero)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,(~(composition(esk1_0,zero)=zero)|~(composition(zero,esk1_0)=zero)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(composition(zero,esk1_0)!=zero|composition(esk1_0,zero)!=zero),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[33,29,theory(equality)]),['unfolding']).
% cnf(47,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[27,25,theory(equality)])).
% cnf(52,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[35,25,theory(equality)])).
% cnf(62,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[47,31,theory(equality)])).
% cnf(66,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[62,25,theory(equality)])).
% cnf(69,plain,(one=converse(one)),inference(spm,[status(thm)],[31,66,theory(equality)])).
% cnf(80,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[66,69,theory(equality)])).
% cnf(98,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[41,23,theory(equality)])).
% cnf(103,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[23,41,theory(equality)])).
% cnf(223,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[52,41,theory(equality)])).
% cnf(248,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,41,theory(equality)])).
% cnf(318,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[103,41,theory(equality)])).
% cnf(893,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[39,21,theory(equality)])).
% cnf(901,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[893,80,theory(equality)])).
% cnf(913,plain,(join(zero,composition(converse(X1),complement(composition(X1,top))))=zero),inference(spm,[status(thm)],[893,248,theory(equality)])).
% cnf(918,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[901,69,theory(equality)]),80,theory(equality)])).
% cnf(925,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[98,918,theory(equality)])).
% cnf(933,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[918,248,theory(equality)])).
% cnf(936,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[925,41,theory(equality)])).
% cnf(944,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[23,933,theory(equality)])).
% cnf(955,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[936,21,theory(equality)])).
% cnf(968,plain,(top=join(X1,top)),inference(rw,[status(thm)],[318,955,theory(equality)])).
% cnf(983,plain,(top=join(top,X1)),inference(spm,[status(thm)],[21,968,theory(equality)])).
% cnf(1011,plain,(top=converse(top)),inference(spm,[status(thm)],[223,983,theory(equality)])).
% cnf(1071,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[223,1011,theory(equality)])).
% cnf(1095,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[37,21,theory(equality)])).
% cnf(1107,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[1095,41,theory(equality)])).
% cnf(1121,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1107,918,theory(equality)]),248,theory(equality)])).
% cnf(1149,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[1121,21,theory(equality)])).
% cnf(1369,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[944,1149,theory(equality)])).
% cnf(1394,plain,(converse(complement(converse(zero)))=top),inference(spm,[status(thm)],[1071,1369,theory(equality)])).
% cnf(1593,plain,(converse(top)=complement(converse(zero))),inference(spm,[status(thm)],[25,1394,theory(equality)])).
% cnf(1606,plain,(top=complement(converse(zero))),inference(rw,[status(thm)],[1593,1011,theory(equality)])).
% cnf(1617,plain,(join(complement(join(top,X1)),complement(join(top,complement(X1))))=converse(zero)),inference(spm,[status(thm)],[1095,1606,theory(equality)])).
% cnf(1626,plain,(zero=converse(zero)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[1617,983,theory(equality)]),248,theory(equality)]),983,theory(equality)]),248,theory(equality)]),1369,theory(equality)])).
% cnf(12086,plain,(composition(converse(X1),complement(composition(X1,top)))=zero),inference(rw,[status(thm)],[913,1369,theory(equality)])).
% cnf(12099,plain,(composition(top,complement(composition(top,top)))=zero),inference(spm,[status(thm)],[12086,1011,theory(equality)])).
% cnf(12167,plain,(join(zero,composition(X1,complement(composition(top,top))))=composition(join(top,X1),complement(composition(top,top)))),inference(spm,[status(thm)],[19,12099,theory(equality)])).
% cnf(12171,plain,(composition(X1,complement(composition(top,top)))=composition(join(top,X1),complement(composition(top,top)))),inference(rw,[status(thm)],[12167,1369,theory(equality)])).
% cnf(12172,plain,(composition(X1,complement(composition(top,top)))=zero),inference(rw,[status(thm)],[inference(rw,[status(thm)],[12171,983,theory(equality)]),12099,theory(equality)])).
% cnf(12203,plain,(zero=composition(X1,composition(X2,complement(composition(top,top))))),inference(spm,[status(thm)],[17,12172,theory(equality)])).
% cnf(12222,plain,(zero=composition(X1,zero)),inference(rw,[status(thm)],[12203,12172,theory(equality)])).
% cnf(12232,plain,(converse(zero)=composition(converse(zero),X1)),inference(spm,[status(thm)],[47,12222,theory(equality)])).
% cnf(12257,negated_conjecture,(composition(zero,esk1_0)!=zero|$false),inference(rw,[status(thm)],[45,12222,theory(equality)])).
% cnf(12258,negated_conjecture,(composition(zero,esk1_0)!=zero),inference(cn,[status(thm)],[12257,theory(equality)])).
% cnf(12264,plain,(zero=composition(converse(zero),X1)),inference(rw,[status(thm)],[12232,1626,theory(equality)])).
% cnf(12265,plain,(zero=composition(zero,X1)),inference(rw,[status(thm)],[12264,1626,theory(equality)])).
% cnf(12419,negated_conjecture,($false),inference(rw,[status(thm)],[12258,12265,theory(equality)])).
% cnf(12420,negated_conjecture,($false),inference(cn,[status(thm)],[12419,theory(equality)])).
% cnf(12421,negated_conjecture,($false),12420,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 593
% # ...of these trivial : 294
% # ...subsumed : 127
% # ...remaining for further processing: 172
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 70
% # Generated clauses : 6588
% # ...of the previous two non-trivial : 3903
% # Contextual simplify-reflections : 0
% # Paramodulations : 6588
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 101
% # Positive orientable unit clauses: 97
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 2185
% # ...number of literals in the above : 2185
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 16
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 366
% # Indexed BW rewrite successes : 169
% # Backwards rewriting index: 161 leaves, 1.52+/-1.087 terms/leaf
% # Paramod-from index: 73 leaves, 1.41+/-0.948 terms/leaf
% # Paramod-into index: 133 leaves, 1.52+/-1.030 terms/leaf
% # -------------------------------------------------
% # User time : 0.144 s
% # System time : 0.008 s
% # Total time : 0.152 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/SystemOnTPTP1314/REL013+1.tptp
%
%------------------------------------------------------------------------------