TSTP Solution File: MGT053+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT053+1 : TPTP v5.0.0. Released v2.4.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 16:14:34 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP16499/MGT053+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP16499/MGT053+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP16499/MGT053+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 16631
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:(dissimilar(X1,X2,X3)<=>(organization(X1)&~((is_aligned(X1,X2)<=>is_aligned(X1,X3))))),file('/tmp/SRASS.s.p', definition_2)).
% fof(8, conjecture,![X1]:![X6]:![X7]:(dissimilar(X1,X6,X7)<=>dissimilar(X1,X7,X6)),file('/tmp/SRASS.s.p', lemma_7)).
% fof(9, negated_conjecture,~(![X1]:![X6]:![X7]:(dissimilar(X1,X6,X7)<=>dissimilar(X1,X7,X6))),inference(assume_negation,[status(cth)],[8])).
% fof(10, plain,![X1]:![X2]:![X3]:((~(dissimilar(X1,X2,X3))|(organization(X1)&((~(is_aligned(X1,X2))|~(is_aligned(X1,X3)))&(is_aligned(X1,X2)|is_aligned(X1,X3)))))&((~(organization(X1))|((~(is_aligned(X1,X2))|is_aligned(X1,X3))&(~(is_aligned(X1,X3))|is_aligned(X1,X2))))|dissimilar(X1,X2,X3))),inference(fof_nnf,[status(thm)],[1])).
% fof(11, plain,![X4]:![X5]:![X6]:((~(dissimilar(X4,X5,X6))|(organization(X4)&((~(is_aligned(X4,X5))|~(is_aligned(X4,X6)))&(is_aligned(X4,X5)|is_aligned(X4,X6)))))&((~(organization(X4))|((~(is_aligned(X4,X5))|is_aligned(X4,X6))&(~(is_aligned(X4,X6))|is_aligned(X4,X5))))|dissimilar(X4,X5,X6))),inference(variable_rename,[status(thm)],[10])).
% fof(12, plain,![X4]:![X5]:![X6]:(((organization(X4)|~(dissimilar(X4,X5,X6)))&(((~(is_aligned(X4,X5))|~(is_aligned(X4,X6)))|~(dissimilar(X4,X5,X6)))&((is_aligned(X4,X5)|is_aligned(X4,X6))|~(dissimilar(X4,X5,X6)))))&((((~(is_aligned(X4,X5))|is_aligned(X4,X6))|~(organization(X4)))|dissimilar(X4,X5,X6))&(((~(is_aligned(X4,X6))|is_aligned(X4,X5))|~(organization(X4)))|dissimilar(X4,X5,X6)))),inference(distribute,[status(thm)],[11])).
% cnf(13,plain,(dissimilar(X1,X2,X3)|is_aligned(X1,X2)|~organization(X1)|~is_aligned(X1,X3)),inference(split_conjunct,[status(thm)],[12])).
% cnf(14,plain,(dissimilar(X1,X2,X3)|is_aligned(X1,X3)|~organization(X1)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(15,plain,(is_aligned(X1,X3)|is_aligned(X1,X2)|~dissimilar(X1,X2,X3)),inference(split_conjunct,[status(thm)],[12])).
% cnf(16,plain,(~dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[12])).
% cnf(17,plain,(organization(X1)|~dissimilar(X1,X2,X3)),inference(split_conjunct,[status(thm)],[12])).
% fof(42, negated_conjecture,?[X1]:?[X6]:?[X7]:((~(dissimilar(X1,X6,X7))|~(dissimilar(X1,X7,X6)))&(dissimilar(X1,X6,X7)|dissimilar(X1,X7,X6))),inference(fof_nnf,[status(thm)],[9])).
% fof(43, negated_conjecture,?[X8]:?[X9]:?[X10]:((~(dissimilar(X8,X9,X10))|~(dissimilar(X8,X10,X9)))&(dissimilar(X8,X9,X10)|dissimilar(X8,X10,X9))),inference(variable_rename,[status(thm)],[42])).
% fof(44, negated_conjecture,((~(dissimilar(esk1_0,esk2_0,esk3_0))|~(dissimilar(esk1_0,esk3_0,esk2_0)))&(dissimilar(esk1_0,esk2_0,esk3_0)|dissimilar(esk1_0,esk3_0,esk2_0))),inference(skolemize,[status(esa)],[43])).
% cnf(45,negated_conjecture,(dissimilar(esk1_0,esk3_0,esk2_0)|dissimilar(esk1_0,esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(46,negated_conjecture,(~dissimilar(esk1_0,esk3_0,esk2_0)|~dissimilar(esk1_0,esk2_0,esk3_0)),inference(split_conjunct,[status(thm)],[44])).
% cnf(50,negated_conjecture,(organization(esk1_0)|dissimilar(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[17,45,theory(equality)])).
% cnf(51,negated_conjecture,(is_aligned(esk1_0,esk2_0)|is_aligned(esk1_0,esk3_0)|dissimilar(esk1_0,esk2_0,esk3_0)),inference(spm,[status(thm)],[15,45,theory(equality)])).
% cnf(52,negated_conjecture,(dissimilar(esk1_0,esk2_0,esk3_0)|~is_aligned(esk1_0,esk2_0)|~is_aligned(esk1_0,esk3_0)),inference(spm,[status(thm)],[16,45,theory(equality)])).
% cnf(57,negated_conjecture,(~is_aligned(esk1_0,esk2_0)|~is_aligned(esk1_0,esk3_0)),inference(csr,[status(thm)],[52,16])).
% cnf(58,negated_conjecture,(organization(esk1_0)),inference(csr,[status(thm)],[50,17])).
% cnf(59,negated_conjecture,(is_aligned(esk1_0,X1)|dissimilar(esk1_0,X2,X1)|~is_aligned(esk1_0,X2)),inference(spm,[status(thm)],[14,58,theory(equality)])).
% cnf(60,negated_conjecture,(is_aligned(esk1_0,X1)|dissimilar(esk1_0,X1,X2)|~is_aligned(esk1_0,X2)),inference(spm,[status(thm)],[13,58,theory(equality)])).
% cnf(61,negated_conjecture,(is_aligned(esk1_0,esk2_0)|is_aligned(esk1_0,esk3_0)),inference(csr,[status(thm)],[51,15])).
% cnf(72,negated_conjecture,(is_aligned(esk1_0,esk2_0)|~dissimilar(esk1_0,esk2_0,esk3_0)|~is_aligned(esk1_0,esk3_0)),inference(spm,[status(thm)],[46,59,theory(equality)])).
% cnf(77,negated_conjecture,(is_aligned(esk1_0,esk3_0)|~dissimilar(esk1_0,esk2_0,esk3_0)|~is_aligned(esk1_0,esk2_0)),inference(spm,[status(thm)],[46,60,theory(equality)])).
% cnf(81,negated_conjecture,(is_aligned(esk1_0,esk2_0)|~dissimilar(esk1_0,esk2_0,esk3_0)),inference(csr,[status(thm)],[72,15])).
% cnf(83,negated_conjecture,(is_aligned(esk1_0,esk2_0)|~is_aligned(esk1_0,esk3_0)),inference(spm,[status(thm)],[81,60,theory(equality)])).
% cnf(84,negated_conjecture,(is_aligned(esk1_0,esk2_0)),inference(csr,[status(thm)],[83,61])).
% cnf(86,negated_conjecture,($false|~is_aligned(esk1_0,esk3_0)),inference(rw,[status(thm)],[57,84,theory(equality)])).
% cnf(87,negated_conjecture,(~is_aligned(esk1_0,esk3_0)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(89,negated_conjecture,(is_aligned(esk1_0,esk3_0)|~dissimilar(esk1_0,esk2_0,esk3_0)|$false),inference(rw,[status(thm)],[77,84,theory(equality)])).
% cnf(90,negated_conjecture,(is_aligned(esk1_0,esk3_0)|~dissimilar(esk1_0,esk2_0,esk3_0)),inference(cn,[status(thm)],[89,theory(equality)])).
% cnf(91,negated_conjecture,(~dissimilar(esk1_0,esk2_0,esk3_0)),inference(sr,[status(thm)],[90,87,theory(equality)])).
% cnf(92,negated_conjecture,(is_aligned(esk1_0,esk3_0)|~is_aligned(esk1_0,esk2_0)),inference(spm,[status(thm)],[91,59,theory(equality)])).
% cnf(95,negated_conjecture,(is_aligned(esk1_0,esk3_0)|$false),inference(rw,[status(thm)],[92,84,theory(equality)])).
% cnf(96,negated_conjecture,(is_aligned(esk1_0,esk3_0)),inference(cn,[status(thm)],[95,theory(equality)])).
% cnf(97,negated_conjecture,($false),inference(sr,[status(thm)],[96,87,theory(equality)])).
% cnf(98,negated_conjecture,($false),97,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 49
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 49
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 3
% # Generated clauses : 34
% # ...of the previous two non-trivial : 17
% # Contextual simplify-reflections : 5
% # Paramodulations : 29
% # Factorizations : 2
% # Equation resolutions : 2
% # Current number of processed clauses: 25
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 15
% # Clause-clause subsumption calls (NU) : 24
% # Rec. Clause-clause subsumption calls : 24
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 1
% # Backwards rewriting index: 18 leaves, 1.61+/-0.951 terms/leaf
% # Paramod-from index: 7 leaves, 1.57+/-0.495 terms/leaf
% # Paramod-into index: 15 leaves, 1.47+/-0.618 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.005 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.17 WC
% FINAL PrfWatch: 0.11 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP16499/MGT053+1.tptp
%
%------------------------------------------------------------------------------