TSTP Solution File: REL050+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL050+3 : TPTP v5.0.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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 22:04:29 EST 2010
% Result : Theorem 1.56s
% Output : Solution 1.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/SystemOnTPTP13628/REL050+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP13628/REL050+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP13628/REL050+3.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 13724
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.012 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]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(16, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(17, conjecture,![X1]:complement(composition(X1,top))=composition(complement(composition(X1,top)),top),file('/tmp/SRASS.s.p', goals)).
% fof(18, negated_conjecture,~(![X1]:complement(composition(X1,top))=composition(complement(composition(X1,top)),top)),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[1])).
% cnf(20,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[19])).
% fof(21, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[2])).
% cnf(22,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[3])).
% cnf(24,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[23])).
% 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,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[5])).
% cnf(28,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[27])).
% fof(29, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[6])).
% cnf(30,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[7])).
% cnf(32,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[31])).
% fof(33, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[8])).
% cnf(34,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[33])).
% fof(35, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[9])).
% cnf(36,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[35])).
% fof(37, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(38,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[37])).
% fof(39, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[11])).
% cnf(40,plain,(meet(X1,X2)=complement(join(complement(X1),complement(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(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]:~(complement(composition(X1,top))=composition(complement(composition(X1,top)),top)),inference(fof_nnf,[status(thm)],[18])).
% fof(52, negated_conjecture,?[X2]:~(complement(composition(X2,top))=composition(complement(composition(X2,top)),top)),inference(variable_rename,[status(thm)],[51])).
% fof(53, negated_conjecture,~(complement(composition(esk1_0,top))=composition(complement(composition(esk1_0,top)),top)),inference(skolemize,[status(esa)],[52])).
% cnf(54,negated_conjecture,(complement(composition(esk1_0,top))!=composition(complement(composition(esk1_0,top)),top)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[50,40,theory(equality)]),['unfolding']).
% cnf(60,plain,(converse(X1)=composition(converse(one),converse(X1))),inference(spm,[status(thm)],[38,42,theory(equality)])).
% cnf(63,plain,(converse(top)=join(converse(X1),converse(complement(X1)))),inference(spm,[status(thm)],[36,22,theory(equality)])).
% cnf(69,plain,(complement(top)=zero),inference(rw,[status(thm)],[55,22,theory(equality)])).
% cnf(110,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[28,30,theory(equality)])).
% cnf(127,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[24,30,theory(equality)])).
% cnf(140,plain,(join(complement(join(X2,complement(X1))),complement(join(complement(X1),complement(X2))))=X1),inference(spm,[status(thm)],[127,30,theory(equality)])).
% cnf(290,plain,(composition(converse(one),X1)=X1),inference(spm,[status(thm)],[60,34,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)],[110,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(398,plain,(join(one,converse(complement(one)))=converse(top)),inference(spm,[status(thm)],[63,302,theory(equality)])).
% cnf(410,plain,(join(complement(complement(X1)),complement(join(complement(X1),complement(complement(X1)))))=X1),inference(spm,[status(thm)],[127,359,theory(equality)])).
% cnf(419,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[359,69,theory(equality)])).
% cnf(423,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[410,22,theory(equality)]),69,theory(equality)])).
% cnf(435,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[32,419,theory(equality)])).
% cnf(441,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[423,30,theory(equality)])).
% cnf(474,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[435,441,theory(equality)])).
% cnf(489,plain,(X1=join(X1,zero)),inference(spm,[status(thm)],[30,474,theory(equality)])).
% cnf(495,plain,(complement(complement(X1))=X1),inference(rw,[status(thm)],[441,474,theory(equality)])).
% cnf(524,plain,(join(X1,X1)=X1),inference(spm,[status(thm)],[359,495,theory(equality)])).
% cnf(548,plain,(join(X1,X2)=join(X1,join(X1,X2))),inference(spm,[status(thm)],[32,524,theory(equality)])).
% cnf(596,plain,(join(converse(X1),converse(top))=converse(top)),inference(spm,[status(thm)],[548,63,theory(equality)])).
% cnf(598,plain,(join(complement(join(complement(X1),X2)),X1)=X1),inference(spm,[status(thm)],[548,127,theory(equality)])).
% cnf(604,plain,(join(X1,top)=top),inference(spm,[status(thm)],[548,22,theory(equality)])).
% cnf(628,plain,(top=join(top,X1)),inference(spm,[status(thm)],[30,604,theory(equality)])).
% cnf(723,plain,(join(X1,converse(top))=converse(top)),inference(spm,[status(thm)],[596,34,theory(equality)])).
% cnf(734,plain,(converse(top)=top),inference(spm,[status(thm)],[628,723,theory(equality)])).
% cnf(755,plain,(join(one,converse(complement(one)))=top),inference(rw,[status(thm)],[398,734,theory(equality)])).
% cnf(756,plain,(join(converse(X1),converse(complement(X1)))=top),inference(rw,[status(thm)],[63,734,theory(equality)])).
% cnf(764,plain,(composition(top,X1)=join(composition(one,X1),composition(converse(complement(one)),X1))),inference(spm,[status(thm)],[26,755,theory(equality)])).
% cnf(769,plain,(composition(top,X1)=join(X1,composition(converse(complement(one)),X1))),inference(rw,[status(thm)],[764,333,theory(equality)])).
% cnf(835,plain,(join(X1,converse(complement(converse(X1))))=top),inference(spm,[status(thm)],[756,34,theory(equality)])).
% cnf(1189,plain,(join(X1,complement(join(complement(X1),X2)))=X1),inference(rw,[status(thm)],[598,30,theory(equality)])).
% cnf(1201,plain,(join(X1,X3)=join(X1,join(complement(join(complement(X1),X2)),X3))),inference(spm,[status(thm)],[32,1189,theory(equality)])).
% cnf(1436,plain,(composition(top,top)=top),inference(spm,[status(thm)],[628,769,theory(equality)])).
% cnf(1440,plain,(join(X1,composition(top,X1))=composition(top,X1)),inference(spm,[status(thm)],[548,769,theory(equality)])).
% cnf(1453,plain,(composition(top,X1)=composition(top,composition(top,X1))),inference(spm,[status(thm)],[20,1436,theory(equality)])).
% cnf(1747,plain,(join(complement(composition(top,X1)),composition(converse(top),complement(composition(top,X1))))=complement(composition(top,X1))),inference(spm,[status(thm)],[110,1453,theory(equality)])).
% cnf(1764,plain,(composition(top,complement(composition(top,X1)))=complement(composition(top,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1747,734,theory(equality)]),1440,theory(equality)])).
% cnf(2055,plain,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),converse(top))),inference(spm,[status(thm)],[38,1764,theory(equality)])).
% cnf(2072,plain,(converse(complement(composition(top,X1)))=composition(converse(complement(composition(top,X1))),top)),inference(rw,[status(thm)],[2055,734,theory(equality)])).
% cnf(25611,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),complement(complement(X1)))))),inference(spm,[status(thm)],[1201,140,theory(equality)])).
% cnf(25729,plain,(join(X1,X2)=join(X1,complement(join(complement(X2),X1)))),inference(rw,[status(thm)],[25611,495,theory(equality)])).
% cnf(25876,plain,(join(X1,complement(join(X2,X1)))=join(X1,complement(X2))),inference(spm,[status(thm)],[25729,495,theory(equality)])).
% cnf(26310,plain,(join(converse(complement(X1)),complement(top))=join(converse(complement(X1)),complement(converse(X1)))),inference(spm,[status(thm)],[25876,756,theory(equality)])).
% cnf(26353,plain,(join(converse(complement(converse(X1))),complement(top))=join(converse(complement(converse(X1))),complement(X1))),inference(spm,[status(thm)],[25876,835,theory(equality)])).
% cnf(26489,plain,(converse(complement(X1))=join(converse(complement(X1)),complement(converse(X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[26310,69,theory(equality)]),489,theory(equality)])).
% cnf(26551,plain,(converse(complement(converse(X1)))=join(converse(complement(converse(X1))),complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[26353,69,theory(equality)]),489,theory(equality)])).
% cnf(27608,plain,(join(complement(converse(X1)),converse(complement(X1)))=converse(complement(X1))),inference(rw,[status(thm)],[26489,30,theory(equality)])).
% cnf(27698,plain,(join(complement(X1),converse(complement(converse(X1))))=converse(complement(converse(X1)))),inference(rw,[status(thm)],[26551,30,theory(equality)])).
% cnf(27699,plain,(converse(converse(complement(converse(X1))))=join(converse(complement(X1)),converse(converse(complement(converse(X1)))))),inference(spm,[status(thm)],[36,27698,theory(equality)])).
% cnf(27750,plain,(complement(converse(X1))=join(converse(complement(X1)),converse(converse(complement(converse(X1)))))),inference(rw,[status(thm)],[27699,34,theory(equality)])).
% cnf(27751,plain,(complement(converse(X1))=converse(complement(X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27750,34,theory(equality)]),30,theory(equality)]),27608,theory(equality)])).
% cnf(27856,plain,(composition(complement(composition(converse(X1),top)),top)=converse(complement(composition(top,X1)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[2072,27751,theory(equality)]),38,theory(equality)]),734,theory(equality)])).
% cnf(27857,plain,(composition(complement(composition(converse(X1),top)),top)=complement(composition(converse(X1),top))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[27856,27751,theory(equality)]),38,theory(equality)]),734,theory(equality)])).
% cnf(29501,plain,(composition(complement(composition(X1,top)),top)=complement(composition(X1,top))),inference(spm,[status(thm)],[27857,34,theory(equality)])).
% cnf(29750,negated_conjecture,($false),inference(rw,[status(thm)],[54,29501,theory(equality)])).
% cnf(29751,negated_conjecture,($false),inference(cn,[status(thm)],[29750,theory(equality)])).
% cnf(29752,negated_conjecture,($false),29751,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 911
% # ...of these trivial : 530
% # ...subsumed : 99
% # ...remaining for further processing: 282
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 122
% # Generated clauses : 14736
% # ...of the previous two non-trivial : 6296
% # Contextual simplify-reflections : 0
% # Paramodulations : 14736
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 160
% # Positive orientable unit clauses: 156
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 3392
% # ...number of literals in the above : 3392
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 17
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 734
% # Indexed BW rewrite successes : 194
% # Backwards rewriting index: 188 leaves, 1.77+/-1.421 terms/leaf
% # Paramod-from index: 106 leaves, 1.53+/-1.319 terms/leaf
% # Paramod-into index: 186 leaves, 1.71+/-1.407 terms/leaf
% # -------------------------------------------------
% # User time : 0.306 s
% # System time : 0.018 s
% # Total time : 0.324 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.75 CPU 0.84 WC
% FINAL PrfWatch: 0.75 CPU 0.84 WC
% SZS output end Solution for /tmp/SystemOnTPTP13628/REL050+3.tptp
%
%------------------------------------------------------------------------------