TSTP Solution File: REL001+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : REL001+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:52 EST 2010
% Result : Theorem 1.14s
% Output : Solution 1.14s
% 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/SystemOnTPTP21712/REL001+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP21712/REL001+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP21712/REL001+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 21844
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 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(4, axiom,![X1]:converse(converse(X1))=X1,file('/tmp/SRASS.s.p', converse_idempotence)).
% fof(5, axiom,![X1]:![X2]:meet(X1,X2)=complement(join(complement(X1),complement(X2))),file('/tmp/SRASS.s.p', maddux4_definiton_of_meet)).
% fof(6, axiom,![X1]:zero=meet(X1,complement(X1)),file('/tmp/SRASS.s.p', def_zero)).
% fof(7, 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(10, axiom,![X1]:top=join(X1,complement(X1)),file('/tmp/SRASS.s.p', def_top)).
% fof(11, axiom,![X1]:![X2]:converse(composition(X1,X2))=composition(converse(X2),converse(X1)),file('/tmp/SRASS.s.p', converse_multiplicativity)).
% fof(12, axiom,![X1]:![X2]:join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2),file('/tmp/SRASS.s.p', converse_cancellativity)).
% fof(13, axiom,![X1]:composition(X1,one)=X1,file('/tmp/SRASS.s.p', composition_identity)).
% fof(14, conjecture,![X1]:join(zero,X1)=X1,file('/tmp/SRASS.s.p', goals)).
% fof(15, negated_conjecture,~(![X1]:join(zero,X1)=X1),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(22, plain,![X2]:converse(converse(X2))=X2,inference(variable_rename,[status(thm)],[4])).
% cnf(23,plain,(converse(converse(X1))=X1),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X3]:![X4]:meet(X3,X4)=complement(join(complement(X3),complement(X4))),inference(variable_rename,[status(thm)],[5])).
% cnf(25,plain,(meet(X1,X2)=complement(join(complement(X1),complement(X2)))),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X2]:zero=meet(X2,complement(X2)),inference(variable_rename,[status(thm)],[6])).
% cnf(27,plain,(zero=meet(X1,complement(X1))),inference(split_conjunct,[status(thm)],[26])).
% fof(28, plain,![X3]:![X4]:X3=join(complement(join(complement(X3),complement(X4))),complement(join(complement(X3),X4))),inference(variable_rename,[status(thm)],[7])).
% cnf(29,plain,(X1=join(complement(join(complement(X1),complement(X2))),complement(join(complement(X1),X2)))),inference(split_conjunct,[status(thm)],[28])).
% fof(34, plain,![X2]:top=join(X2,complement(X2)),inference(variable_rename,[status(thm)],[10])).
% cnf(35,plain,(top=join(X1,complement(X1))),inference(split_conjunct,[status(thm)],[34])).
% fof(36, plain,![X3]:![X4]:converse(composition(X3,X4))=composition(converse(X4),converse(X3)),inference(variable_rename,[status(thm)],[11])).
% cnf(37,plain,(converse(composition(X1,X2))=composition(converse(X2),converse(X1))),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X3]:![X4]:join(composition(converse(X3),complement(composition(X3,X4))),complement(X4))=complement(X4),inference(variable_rename,[status(thm)],[12])).
% cnf(39,plain,(join(composition(converse(X1),complement(composition(X1,X2))),complement(X2))=complement(X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(40, plain,![X2]:composition(X2,one)=X2,inference(variable_rename,[status(thm)],[13])).
% cnf(41,plain,(composition(X1,one)=X1),inference(split_conjunct,[status(thm)],[40])).
% fof(42, negated_conjecture,?[X1]:~(join(zero,X1)=X1),inference(fof_nnf,[status(thm)],[15])).
% fof(43, negated_conjecture,?[X2]:~(join(zero,X2)=X2),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,~(join(zero,esk1_0)=esk1_0),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(join(zero,esk1_0)!=esk1_0),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,plain,(complement(join(complement(X1),complement(complement(X1))))=zero),inference(rw,[status(thm)],[27,25,theory(equality)]),['unfolding']).
% cnf(53,plain,(composition(converse(X1),X2)=converse(composition(converse(X2),X1))),inference(spm,[status(thm)],[37,23,theory(equality)])).
% cnf(101,plain,(converse(converse(X1))=composition(converse(one),X1)),inference(spm,[status(thm)],[53,41,theory(equality)])).
% cnf(105,plain,(X1=composition(converse(one),X1)),inference(rw,[status(thm)],[101,23,theory(equality)])).
% cnf(108,plain,(one=converse(one)),inference(spm,[status(thm)],[41,105,theory(equality)])).
% cnf(121,plain,(composition(one,X1)=X1),inference(rw,[status(thm)],[105,108,theory(equality)])).
% cnf(205,plain,(complement(top)=zero),inference(rw,[status(thm)],[46,35,theory(equality)])).
% cnf(688,plain,(join(complement(X2),composition(converse(X1),complement(composition(X1,X2))))=complement(X2)),inference(rw,[status(thm)],[39,17,theory(equality)])).
% cnf(694,plain,(join(complement(X1),composition(converse(one),complement(X1)))=complement(X1)),inference(spm,[status(thm)],[688,121,theory(equality)])).
% cnf(711,plain,(join(complement(X1),complement(X1))=complement(X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[694,108,theory(equality)]),121,theory(equality)])).
% cnf(725,plain,(join(zero,zero)=zero),inference(spm,[status(thm)],[711,205,theory(equality)])).
% cnf(738,plain,(join(zero,X1)=join(zero,join(zero,X1))),inference(spm,[status(thm)],[19,725,theory(equality)])).
% cnf(1004,plain,(join(complement(join(complement(X1),X2)),complement(join(complement(X1),complement(X2))))=X1),inference(rw,[status(thm)],[29,17,theory(equality)])).
% cnf(1016,plain,(join(complement(join(complement(X1),complement(X1))),complement(top))=X1),inference(spm,[status(thm)],[1004,35,theory(equality)])).
% cnf(1032,plain,(join(complement(complement(X1)),zero)=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1016,711,theory(equality)]),205,theory(equality)])).
% cnf(1041,plain,(join(zero,complement(complement(X1)))=X1),inference(rw,[status(thm)],[1032,17,theory(equality)])).
% cnf(1069,plain,(join(zero,X1)=X1),inference(spm,[status(thm)],[738,1041,theory(equality)])).
% cnf(1105,negated_conjecture,($false),inference(rw,[status(thm)],[45,1069,theory(equality)])).
% cnf(1106,negated_conjecture,($false),inference(cn,[status(thm)],[1105,theory(equality)])).
% cnf(1107,negated_conjecture,($false),1106,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 111
% # ...of these trivial : 40
% # ...subsumed : 9
% # ...remaining for further processing: 62
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 30
% # Generated clauses : 567
% # ...of the previous two non-trivial : 352
% # Contextual simplify-reflections : 0
% # Paramodulations : 567
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 32
% # Positive orientable unit clauses: 31
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 0
% # Non-unit-clauses : 0
% # Current number of unprocessed clauses: 157
% # ...number of literals in the above : 157
% # Clause-clause subsumption calls (NU) : 0
% # Rec. Clause-clause subsumption calls : 0
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 40
% # Indexed BW rewrite successes : 31
% # Backwards rewriting index: 61 leaves, 1.26+/-0.650 terms/leaf
% # Paramod-from index: 30 leaves, 1.10+/-0.396 terms/leaf
% # Paramod-into index: 53 leaves, 1.21+/-0.490 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.006 s
% # Total time : 0.024 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.20 WC
% FINAL PrfWatch: 0.12 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP21712/REL001+1.tptp
%
%------------------------------------------------------------------------------