TSTP Solution File: REL031+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL031+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 : 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 21:49:37 EST 2010
% Result : Theorem 1.43s
% Output : Solution 1.43s
% 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/SystemOnTPTP5330/REL031+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP5330/REL031+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5330/REL031+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 5426
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # 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(3, axiom,![X1]:![X2]:![X3]:composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3),file('/tmp/SRASS.s.p', composition_associativity)).
% fof(4, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(5, axiom,![X1]:![X2]:![X3]:composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3)),file('/tmp/SRASS.s.p', composition_distributivity)).
% fof(6, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(7, axiom,![X1]:![X2]:converse(join(X1,X2))=join(converse(X1),converse(X2)),file('/tmp/SRASS.s.p', converse_additivity)).
% fof(8, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(14, conjecture,![X1]:![X2]:((join(composition(converse(X1),X1),one)=one&join(composition(converse(X2),X2),one)=one)=>join(composition(converse(composition(X1,X2)),composition(X1,X2)),one)=one),file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:![X2]:((join(composition(converse(X1),X1),one)=one&join(composition(converse(X2),X2),one)=one)=>join(composition(converse(composition(X1,X2)),composition(X1,X2)),one)=one)),inference(assume_negation,[status(cth)],[14])).
% fof(16, plain,![X3]:![X4]:join(X3,X4)=join(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(join(X1,X2)=join(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:join(X4,join(X5,X6))=join(join(X4,X5),X6),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(join(X1,join(X2,X3))=join(join(X1,X2),X3)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:composition(X4,composition(X5,X6))=composition(composition(X4,X5),X6),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(composition(X1,composition(X2,X3))=composition(composition(X1,X2),X3)),inference(split_conjunct,[status(thm)],[20])).
% fof(22, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:composition(join(X4,X5),X6)=join(composition(X4,X6),composition(X5,X6)),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(composition(join(X1,X2),X3)=join(composition(X1,X3),composition(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:converse(join(X3,X4))=join(converse(X3),converse(X4)),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(converse(join(X1,X2))=join(converse(X1),converse(X2))),inference(split_conjunct,[status(thm)],[28])).
% fof(30, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[8])).
% cnf(31,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(42, negated_conjecture,?[X1]:?[X2]:((join(composition(converse(X1),X1),one)=one&join(composition(converse(X2),X2),one)=one)&~(join(composition(converse(composition(X1,X2)),composition(X1,X2)),one)=one)),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X3]:?[X4]:((join(composition(converse(X3),X3),one)=one&join(composition(converse(X4),X4),one)=one)&~(join(composition(converse(composition(X3,X4)),composition(X3,X4)),one)=one)),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((join(composition(converse(esk1_0),esk1_0),one)=one&join(composition(converse(esk2_0),esk2_0),one)=one)&~(join(composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)),one)=one)),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)),one)!=one),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(join(composition(converse(esk2_0),esk2_0),one)=one),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,negated_conjecture,(join(composition(converse(esk1_0),esk1_0),one)=one),inference(split_conjunct,[status(thm)],[44])).
% cnf(49,negated_conjecture,(join(one,composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)))!=one),inference(rw,[status(thm)],[45,17,theory(equality)])).
% cnf(50,negated_conjecture,(join(one,composition(converse(esk1_0),esk1_0))=one),inference(rw,[status(thm)],[47,17,theory(equality)])).
% cnf(51,negated_conjecture,(join(one,composition(converse(esk2_0),esk2_0))=one),inference(rw,[status(thm)],[46,17,theory(equality)])).
% cnf(55,plain,(join(X1,converse(X2))=converse(join(converse(X1),X2))),inference(spm,[status(thm)],[29,27,theory(equality)])).
% cnf(58,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[31,27,theory(equality)])).
% cnf(59,plain,(composition(X1,converse(X2))=converse(composition(X2,converse(X1)))),inference(spm,[status(thm)],[31,27,theory(equality)])).
% cnf(65,negated_conjecture,(join(one,X1)=join(one,join(composition(converse(esk2_0),esk2_0),X1))),inference(spm,[status(thm)],[19,51,theory(equality)])).
% cnf(76,plain,(composition(converse(composition(X2,X1)),X3)=composition(converse(X1),composition(converse(X2),X3))),inference(spm,[status(thm)],[21,31,theory(equality)])).
% cnf(142,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[58,23,theory(equality)])).
% cnf(150,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[142,27,theory(equality)])).
% cnf(154,plain,(one=converse(one)),inference(spm,[status(thm)],[23,150,theory(equality)])).
% cnf(171,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[150,154,theory(equality)])).
% cnf(389,plain,(join(X1,composition(X2,X1))=composition(join(one,X2),X1)),inference(spm,[status(thm)],[25,171,theory(equality)])).
% cnf(2754,negated_conjecture,(join(one,composition(join(converse(esk2_0),X1),esk2_0))=join(one,composition(X1,esk2_0))),inference(spm,[status(thm)],[65,25,theory(equality)])).
% cnf(23904,negated_conjecture,(join(X1,composition(composition(converse(esk1_0),esk1_0),X1))=composition(one,X1)),inference(spm,[status(thm)],[389,50,theory(equality)])).
% cnf(24051,negated_conjecture,(join(X1,composition(converse(esk1_0),composition(esk1_0,X1)))=composition(one,X1)),inference(rw,[status(thm)],[23904,21,theory(equality)])).
% cnf(24052,negated_conjecture,(join(X1,composition(converse(esk1_0),composition(esk1_0,X1)))=X1),inference(rw,[status(thm)],[24051,171,theory(equality)])).
% cnf(24780,negated_conjecture,(converse(converse(X1))=join(X1,converse(composition(converse(esk1_0),composition(esk1_0,converse(X1)))))),inference(spm,[status(thm)],[55,24052,theory(equality)])).
% cnf(24850,negated_conjecture,(X1=join(X1,converse(composition(converse(esk1_0),composition(esk1_0,converse(X1)))))),inference(rw,[status(thm)],[24780,27,theory(equality)])).
% cnf(24851,negated_conjecture,(X1=join(X1,composition(X1,composition(converse(esk1_0),esk1_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[24850,58,theory(equality)]),59,theory(equality)]),21,theory(equality)])).
% cnf(25059,negated_conjecture,(join(one,composition(converse(esk2_0),esk2_0))=join(one,composition(composition(converse(esk2_0),composition(converse(esk1_0),esk1_0)),esk2_0))),inference(spm,[status(thm)],[2754,24851,theory(equality)])).
% cnf(25133,negated_conjecture,(one=join(one,composition(composition(converse(esk2_0),composition(converse(esk1_0),esk1_0)),esk2_0))),inference(rw,[status(thm)],[25059,51,theory(equality)])).
% cnf(25134,negated_conjecture,(one=join(one,composition(converse(composition(esk1_0,esk2_0)),composition(esk1_0,esk2_0)))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[25133,76,theory(equality)]),21,theory(equality)])).
% cnf(25135,negated_conjecture,($false),inference(sr,[status(thm)],[25134,49,theory(equality)])).
% cnf(25136,negated_conjecture,($false),25135,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 925
% # ...of these trivial : 557
% # ...subsumed : 103
% # ...remaining for further processing: 265
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 73
% # Generated clauses : 12878
% # ...of the previous two non-trivial : 6315
% # Contextual simplify-reflections : 0
% # Paramodulations : 12878
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 192
% # Positive orientable unit clauses: 185
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 1
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 4175
% # ...number of literals in the above : 4175
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 29
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 532
% # Indexed BW rewrite successes : 178
% # Backwards rewriting index: 277 leaves, 1.48+/-0.941 terms/leaf
% # Paramod-from index: 137 leaves, 1.42+/-0.843 terms/leaf
% # Paramod-into index: 244 leaves, 1.48+/-0.894 terms/leaf
% # -------------------------------------------------
% # User time : 0.257 s
% # System time : 0.012 s
% # Total time : 0.269 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.63 CPU 0.72 WC
% FINAL PrfWatch: 0.63 CPU 0.72 WC
% SZS output end Solution for /tmp/SystemOnTPTP5330/REL031+1.tptp
%
%------------------------------------------------------------------------------