TSTP Solution File: MGT052+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : MGT052+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 : art04.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 16:09:43 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP24910/MGT052+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP24910/MGT052+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24910/MGT052+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 25006
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 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]:![X3]:~(dissimilar(X1,X3,X3)),file('/tmp/SRASS.s.p', background_assumption_1)).
% fof(9, negated_conjecture,~(![X1]:![X3]:~(dissimilar(X1,X3,X3))),inference(assume_negation,[status(cth)],[8])).
% fof(10, negated_conjecture,~(![X1]:![X3]:~(dissimilar(X1,X3,X3))),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(11, 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(12, 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)],[11])).
% fof(13, 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)],[12])).
% cnf(16,plain,(is_aligned(X1,X3)|is_aligned(X1,X2)|~dissimilar(X1,X2,X3)),inference(split_conjunct,[status(thm)],[13])).
% cnf(17,plain,(~dissimilar(X1,X2,X3)|~is_aligned(X1,X3)|~is_aligned(X1,X2)),inference(split_conjunct,[status(thm)],[13])).
% fof(43, negated_conjecture,?[X1]:?[X3]:dissimilar(X1,X3,X3),inference(fof_nnf,[status(thm)],[10])).
% fof(44, negated_conjecture,?[X4]:?[X5]:dissimilar(X4,X5,X5),inference(variable_rename,[status(thm)],[43])).
% fof(45, negated_conjecture,dissimilar(esk1_0,esk2_0,esk2_0),inference(skolemize,[status(esa)],[44])).
% cnf(46,negated_conjecture,(dissimilar(esk1_0,esk2_0,esk2_0)),inference(split_conjunct,[status(thm)],[45])).
% cnf(50,negated_conjecture,(is_aligned(esk1_0,esk2_0)),inference(spm,[status(thm)],[16,46,theory(equality)])).
% cnf(51,negated_conjecture,(~is_aligned(esk1_0,esk2_0)),inference(spm,[status(thm)],[17,46,theory(equality)])).
% cnf(62,negated_conjecture,($false),inference(sr,[status(thm)],[50,51,theory(equality)])).
% cnf(63,negated_conjecture,($false),62,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 39
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 39
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 15
% # ...of the previous two non-trivial : 6
% # Contextual simplify-reflections : 0
% # Paramodulations : 13
% # Factorizations : 0
% # Equation resolutions : 2
% # Current number of processed clauses: 19
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 14
% # Current number of unprocessed clauses: 1
% # ...number of literals in the above : 3
% # Clause-clause subsumption calls (NU) : 11
% # Rec. Clause-clause subsumption calls : 11
% # Unit Clause-clause subsumption calls : 2
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 2
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 13 leaves, 1.62+/-0.836 terms/leaf
% # Paramod-from index: 6 leaves, 1.50+/-0.500 terms/leaf
% # Paramod-into index: 10 leaves, 1.50+/-0.500 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.004 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.17 WC
% FINAL PrfWatch: 0.10 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP24910/MGT052+1.tptp
%
%------------------------------------------------------------------------------