TSTP Solution File: REL004+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL004+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:23 EST 2010
% Result : Theorem 2.56s
% Output : Solution 2.56s
% 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/SystemOnTPTP22759/REL004+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22759/REL004+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22759/REL004+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 22891
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.009 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(2, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% 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]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(5, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% 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(10, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(11, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(13, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(14, conjecture,![X1]:converse(complement(X1))=complement(converse(X1)),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:converse(complement(X1))=complement(converse(X1))),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),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,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),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(34, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(composition(X1,one)=X1),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]:~(converse(complement(X1))=complement(converse(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:~(converse(complement(X2))=complement(converse(X2))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(converse(complement(esk1_0))=complement(converse(esk1_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(converse(complement(esk1_0))!=complement(converse(esk1_0))),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[41,35,theory(equality)]),['unfolding']).
% cnf(50,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[19,17,theory(equality)])).
% cnf(53,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[25,17,theory(equality)])).
% cnf(78,plain,(converse(top)=join(X1,converse(complement(converse(X1))))),inference(spm,[status(thm)],[50,37,theory(equality)])).
% cnf(101,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[53,39,theory(equality)])).
% cnf(105,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[101,17,theory(equality)])).
% cnf(108,plain,(one=converse(one)),inference(spm,[status(thm)],[39,105,theory(equality)])).
% cnf(121,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[105,108,theory(equality)])).
% cnf(129,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[37,29,theory(equality)])).
% cnf(131,plain,(join(X1,join(X2,X3))=join(X3,join(X1,X2))),inference(spm,[status(thm)],[27,29,theory(equality)])).
% cnf(135,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[29,37,theory(equality)])).
% cnf(205,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,37,theory(equality)])).
% cnf(271,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[135,37,theory(equality)])).
% cnf(415,plain,(join(X1,join(X2,complement(join(X2,X1))))=top),inference(spm,[status(thm)],[129,27,theory(equality)])).
% cnf(691,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[23,27,theory(equality)])).
% cnf(699,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[691,121,theory(equality)])).
% cnf(717,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[699,108,theory(equality)]),121,theory(equality)])).
% cnf(726,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[129,717,theory(equality)])).
% cnf(734,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[717,205,theory(equality)])).
% cnf(737,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[726,37,theory(equality)])).
% cnf(747,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[29,734,theory(equality)])).
% cnf(758,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[737,27,theory(equality)])).
% cnf(769,plain,(top=join(X1,top)),inference(rw,[status(thm)],[271,758,theory(equality)])).
% cnf(780,plain,(top=join(top,X1)),inference(spm,[status(thm)],[27,769,theory(equality)])).
% cnf(807,plain,(top=converse(top)),inference(spm,[status(thm)],[78,780,theory(equality)])).
% cnf(857,plain,(join(X1,converse(complement(converse(X1))))=top),inference(rw,[status(thm)],[78,807,theory(equality)])).
% cnf(927,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[21,27,theory(equality)])).
% cnf(939,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[927,37,theory(equality)])).
% cnf(953,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[939,717,theory(equality)]),205,theory(equality)])).
% cnf(960,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[953,27,theory(equality)])).
% cnf(1016,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[747,960,theory(equality)])).
% cnf(1042,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[27,1016,theory(equality)])).
% cnf(1052,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[960,1016,theory(equality)])).
% cnf(1078,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[717,1052,theory(equality)])).
% cnf(1100,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[29,1078,theory(equality)])).
% cnf(1105,plain,(join(X1,X2)=join(X2,join(X1,X2))),inference(spm,[status(thm)],[131,1078,theory(equality)])).
% cnf(1574,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[1100,927,theory(equality)])).
% cnf(1942,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[1574,27,theory(equality)])).
% cnf(1976,plain,(join(X1,complement(join(X2,complement(X1))))=X1),inference(spm,[status(thm)],[1942,1105,theory(equality)])).
% cnf(2024,plain,(join(X1,X3)=join(X1,join(complement(join(X2,complement(X1))),X3))),inference(spm,[status(thm)],[29,1976,theory(equality)])).
% cnf(2036,plain,(join(complement(X1),complement(join(X2,X1)))=complement(X1)),inference(spm,[status(thm)],[1976,1052,theory(equality)])).
% cnf(65036,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[2024,927,theory(equality)])).
% cnf(65383,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[65036,1052,theory(equality)])).
% cnf(66692,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[65383,1052,theory(equality)])).
% cnf(67408,plain,(join(join(X1,complement(join(X1,X2))),complement(top))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(spm,[status(thm)],[66692,415,theory(equality)])).
% cnf(67684,plain,(join(X1,complement(join(X1,X2)))=join(join(X1,complement(join(X1,X2))),complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[67408,205,theory(equality)]),29,theory(equality)]),1042,theory(equality)])).
% cnf(67685,plain,(join(X1,complement(join(X1,X2)))=join(X1,complement(X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[67684,29,theory(equality)]),27,theory(equality)]),2036,theory(equality)])).
% cnf(68000,plain,(join(X1,complement(top))=join(X1,complement(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[67685,857,theory(equality)])).
% cnf(68297,plain,(X1=join(X1,complement(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[68000,205,theory(equality)]),1042,theory(equality)])).
% cnf(68376,plain,(converse(converse(X1))=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(spm,[status(thm)],[50,68297,theory(equality)])).
% cnf(68553,plain,(X1=join(X1,converse(complement(converse(complement(converse(converse(X1)))))))),inference(rw,[status(thm)],[68376,17,theory(equality)])).
% cnf(68554,plain,(X1=join(X1,converse(complement(converse(complement(X1)))))),inference(rw,[status(thm)],[68553,17,theory(equality)])).
% cnf(68740,plain,(join(complement(X1),converse(complement(converse(X1))))=complement(X1)),inference(spm,[status(thm)],[68554,1052,theory(equality)])).
% cnf(69049,plain,(join(complement(converse(complement(converse(X1)))),complement(complement(X1)))=complement(converse(complement(converse(X1))))),inference(spm,[status(thm)],[2036,68740,theory(equality)])).
% cnf(69153,plain,(X1=complement(converse(complement(converse(X1))))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[69049,1052,theory(equality)]),27,theory(equality)]),68297,theory(equality)])).
% cnf(69205,plain,(complement(X1)=converse(complement(converse(X1)))),inference(spm,[status(thm)],[1052,69153,theory(equality)])).
% cnf(69382,plain,(converse(complement(X1))=complement(converse(X1))),inference(spm,[status(thm)],[17,69205,theory(equality)])).
% cnf(69652,negated_conjecture,($false),inference(rw,[status(thm)],[45,69382,theory(equality)])).
% cnf(69653,negated_conjecture,($false),inference(cn,[status(thm)],[69652,theory(equality)])).
% cnf(69654,negated_conjecture,($false),69653,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1632
% # ...of these trivial : 1062
% # ...subsumed : 171
% # ...remaining for further processing: 399
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 139
% # Generated clauses : 34923
% # ...of the previous two non-trivial : 16304
% # Contextual simplify-reflections : 0
% # Paramodulations : 34923
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 260
% # Positive orientable unit clauses: 252
% # Positive unorientable unit clauses: 8
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 9676
% # ...number of literals in the above : 9676
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 57
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1414
% # Indexed BW rewrite successes : 261
% # Backwards rewriting index: 282 leaves, 1.91+/-1.663 terms/leaf
% # Paramod-from index: 150 leaves, 1.76+/-1.556 terms/leaf
% # Paramod-into index: 257 leaves, 1.84+/-1.560 terms/leaf
% # -------------------------------------------------
% # User time : 0.674 s
% # System time : 0.031 s
% # Total time : 0.705 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.54 CPU 1.62 WC
% FINAL PrfWatch: 1.54 CPU 1.62 WC
% SZS output end Solution for /tmp/SystemOnTPTP22759/REL004+1.tptp
%
%------------------------------------------------------------------------------