TSTP Solution File: REL002+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL002+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:38:58 EST 2010
% Result : Theorem 1.13s
% Output : Solution 1.13s
% 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/SystemOnTPTP22061/REL002+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP22061/REL002+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP22061/REL002+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 22193
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]: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]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(6, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% 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]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(12, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(14, conjecture,![X1]:join(X1,top)=top,file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:join(X1,top)=top),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,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[3])).
% cnf(21,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[20])).
% 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(34, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),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(42, negated_conjecture,?[X1]:~(join(X1,top)=top),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:~(join(X2,top)=top),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(join(esk1_0,top)=top),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(esk1_0,top)!=top),inference(split_conjunct,[status(thm)],[44])).
% cnf(47,negated_conjecture,(join(top,esk1_0)!=top),inference(rw,[status(thm)],[45,17,theory(equality)])).
% cnf(54,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[35,27,theory(equality)])).
% cnf(92,plain,(join(X1,join(X2,complement(join(X1,X2))))=top),inference(spm,[status(thm)],[21,19,theory(equality)])).
% cnf(97,plain,(join(top,X2)=join(X1,join(complement(X1),X2))),inference(spm,[status(thm)],[19,21,theory(equality)])).
% cnf(128,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[54,39,theory(equality)])).
% cnf(136,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[128,27,theory(equality)])).
% cnf(140,plain,(one=converse(one)),inference(spm,[status(thm)],[39,136,theory(equality)])).
% cnf(157,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[136,140,theory(equality)])).
% cnf(287,plain,(join(X1,top)=join(top,complement(complement(X1)))),inference(spm,[status(thm)],[97,21,theory(equality)])).
% cnf(705,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[37,17,theory(equality)])).
% cnf(713,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[705,157,theory(equality)])).
% cnf(731,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[713,140,theory(equality)]),157,theory(equality)])).
% cnf(741,plain,(join(complement(X1),join(complement(X1),complement(complement(X1))))=top),inference(spm,[status(thm)],[92,731,theory(equality)])).
% cnf(752,plain,(join(complement(X1),top)=top),inference(rw,[status(thm)],[741,21,theory(equality)])).
% cnf(773,plain,(join(top,complement(X1))=top),inference(rw,[status(thm)],[752,17,theory(equality)])).
% cnf(784,plain,(top=join(X1,top)),inference(rw,[status(thm)],[287,773,theory(equality)])).
% cnf(795,plain,(top=join(top,X1)),inference(spm,[status(thm)],[17,784,theory(equality)])).
% cnf(846,negated_conjecture,($false),inference(rw,[status(thm)],[47,795,theory(equality)])).
% cnf(847,negated_conjecture,($false),inference(cn,[status(thm)],[846,theory(equality)])).
% cnf(848,negated_conjecture,($false),847,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 89
% # ...of these trivial : 27
% # ...subsumed : 16
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 17
% # Generated clauses : 464
% # ...of the previous two non-trivial : 360
% # Contextual simplify-reflections : 0
% # Paramodulations : 464
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 27
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 197
% # ...number of literals in the above : 197
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 48
% # Indexed BW rewrite successes : 42
% # Backwards rewriting index: 56 leaves, 1.25+/-0.634 terms/leaf
% # Paramod-from index: 28 leaves, 1.11+/-0.309 terms/leaf
% # Paramod-into index: 49 leaves, 1.20+/-0.494 terms/leaf
% # -------------------------------------------------
% # User time : 0.016 s
% # System time : 0.006 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP22061/REL002+1.tptp
%
%------------------------------------------------------------------------------