TSTP Solution File: REL008+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL008+4 : 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:40:59 EST 2010
% Result : Theorem 9.02s
% Output : Solution 9.02s
% 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/SystemOnTPTP24924/REL008+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24924/REL008+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24924/REL008+4.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 25056
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.01 WC
% PrfWatch: 3.94 CPU 4.02 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 5.93 CPU 6.03 WC
% PrfWatch: 7.93 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(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]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(11, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% 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]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(15, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:![X2]:![X3]:(join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3))=join(composition(X1,X2),composition(X1,X3))&join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3)))=composition(X1,join(X2,X3))),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:(join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3))=join(composition(X1,X2),composition(X1,X3))&join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3)))=composition(X1,join(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(29, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[31])).
% fof(39, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[39])).
% fof(41, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[12])).
% cnf(42,plain,(composition(X1,one)=X1),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,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[14])).
% cnf(46,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[45])).
% fof(47, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[15])).
% cnf(48,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[47])).
% fof(49, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[16])).
% cnf(50,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[49])).
% fof(51, negated_conjecture,?[X1]:?[X2]:?[X3]:(~(join(join(composition(X1,join(X2,X3)),composition(X1,X2)),composition(X1,X3))=join(composition(X1,X2),composition(X1,X3)))|~(join(join(composition(X1,X2),composition(X1,X3)),composition(X1,join(X2,X3)))=composition(X1,join(X2,X3)))),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X4]:?[X5]:?[X6]:(~(join(join(composition(X4,join(X5,X6)),composition(X4,X5)),composition(X4,X6))=join(composition(X4,X5),composition(X4,X6)))|~(join(join(composition(X4,X5),composition(X4,X6)),composition(X4,join(X5,X6)))=composition(X4,join(X5,X6)))),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,(~(join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0))=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)))|~(join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0)))=composition(esk1_0,join(esk2_0,esk3_0)))),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0)))!=composition(esk1_0,join(esk2_0,esk3_0))|join(join(composition(esk1_0,join(esk2_0,esk3_0)),composition(esk1_0,esk2_0)),composition(esk1_0,esk3_0))!=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,46,theory(equality)]),['unfolding']).
% cnf(59,negated_conjecture,(join(composition(esk1_0,esk3_0),join(composition(esk1_0,esk2_0),composition(esk1_0,join(esk2_0,esk3_0))))!=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))|join(join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0)),composition(esk1_0,join(esk2_0,esk3_0)))!=composition(esk1_0,join(esk2_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[54,20,theory(equality)]),20,theory(equality)])).
% cnf(68,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[30,42,theory(equality)])).
% cnf(70,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,48,theory(equality)])).
% cnf(78,plain,(join(join(X2,X1),X3)=join(X1,join(X2,X3))),inference(spm,[status(thm)],[22,20,theory(equality)])).
% cnf(84,plain,(join(X2,join(X1,X3))=join(X1,join(X2,X3))),inference(rw,[status(thm)],[78,22,theory(equality)])).
% cnf(96,plain,(converse(join(composition(X1,X3),composition(X2,X3)))=composition(converse(X3),converse(join(X1,X2)))),inference(spm,[status(thm)],[30,26,theory(equality)])).
% cnf(103,plain,(join(composition(converse(X3),converse(X1)),composition(converse(X3),converse(X2)))=composition(converse(X3),converse(join(X1,X2)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[96,40,theory(equality)]),30,theory(equality)]),30,theory(equality)])).
% cnf(104,plain,(join(composition(converse(X3),converse(X1)),composition(converse(X3),converse(X2)))=composition(converse(X3),join(converse(X1),converse(X2)))),inference(rw,[status(thm)],[103,40,theory(equality)])).
% cnf(111,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[32,20,theory(equality)])).
% cnf(128,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[44,20,theory(equality)])).
% cnf(290,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[68,28,theory(equality)])).
% cnf(302,plain,(one=converse(one)),inference(spm,[status(thm)],[42,290,theory(equality)])).
% cnf(333,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[290,302,theory(equality)])).
% cnf(347,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[111,333,theory(equality)])).
% cnf(359,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[347,302,theory(equality)]),333,theory(equality)])).
% cnf(383,negated_conjecture,(join(composition(esk1_0,esk3_0),join(composition(esk1_0,esk2_0),composition(esk1_0,join(esk2_0,esk3_0))))!=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))|join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0))))!=composition(esk1_0,join(esk2_0,esk3_0))),inference(rw,[status(thm)],[59,22,theory(equality)])).
% cnf(389,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[128,359,theory(equality)])).
% cnf(398,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[359,70,theory(equality)])).
% cnf(402,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[389,48,theory(equality)]),70,theory(equality)])).
% cnf(414,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[22,398,theory(equality)])).
% cnf(420,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[402,20,theory(equality)])).
% cnf(459,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[414,420,theory(equality)])).
% cnf(479,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[420,459,theory(equality)])).
% cnf(501,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[359,479,theory(equality)])).
% cnf(525,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[22,501,theory(equality)])).
% cnf(582,plain,(join(X1,join(X2,X1))=join(X2,X1)),inference(spm,[status(thm)],[525,20,theory(equality)])).
% cnf(4439,negated_conjecture,(join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0))))!=join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))|join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0))))!=composition(esk1_0,join(esk2_0,esk3_0))),inference(rw,[status(thm)],[383,84,theory(equality)])).
% cnf(6019,plain,(composition(X1,join(converse(X2),converse(X3)))=join(composition(X1,converse(X2)),composition(X1,converse(X3)))),inference(spm,[status(thm)],[104,28,theory(equality)])).
% cnf(251080,plain,(composition(X1,join(converse(X2),X3))=join(composition(X1,converse(X2)),composition(X1,X3))),inference(spm,[status(thm)],[6019,28,theory(equality)])).
% cnf(253455,plain,(composition(X1,join(X2,X3))=join(composition(X1,X2),composition(X1,X3))),inference(spm,[status(thm)],[251080,28,theory(equality)])).
% cnf(254728,negated_conjecture,($false|join(composition(esk1_0,esk2_0),join(composition(esk1_0,esk3_0),composition(esk1_0,join(esk2_0,esk3_0))))!=composition(esk1_0,join(esk2_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[4439,253455,theory(equality)]),582,theory(equality)]),525,theory(equality)])).
% cnf(254729,negated_conjecture,($false|join(composition(esk1_0,esk2_0),composition(esk1_0,esk3_0))!=composition(esk1_0,join(esk2_0,esk3_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[254728,253455,theory(equality)]),582,theory(equality)]),525,theory(equality)])).
% cnf(254730,negated_conjecture,($false|$false),inference(rw,[status(thm)],[254729,253455,theory(equality)])).
% cnf(254731,negated_conjecture,($false),inference(cn,[status(thm)],[254730,theory(equality)])).
% cnf(254732,negated_conjecture,($false),254731,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 3980
% # ...of these trivial : 2643
% # ...subsumed : 620
% # ...remaining for further processing: 717
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 192
% # Generated clauses : 113933
% # ...of the previous two non-trivial : 57780
% # Contextual simplify-reflections : 0
% # Paramodulations : 113933
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 525
% # Positive orientable unit clauses: 521
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 40277
% # ...number of literals in the above : 40277
% # 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 : 4859
% # Indexed BW rewrite successes : 296
% # Backwards rewriting index: 356 leaves, 3.48+/-6.188 terms/leaf
% # Paramod-from index: 210 leaves, 2.51+/-3.282 terms/leaf
% # Paramod-into index: 342 leaves, 3.42+/-6.218 terms/leaf
% # -------------------------------------------------
% # User time : 3.931 s
% # System time : 0.149 s
% # Total time : 4.080 s
% # Maximum resident set size: 0 pages
% PrfWatch: 7.98 CPU 8.11 WC
% FINAL PrfWatch: 7.98 CPU 8.11 WC
% SZS output end Solution for /tmp/SystemOnTPTP24924/REL008+4.tptp
%
%------------------------------------------------------------------------------