%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS265+1 : TPTP v5.3.0. Bugfixed v5.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2800MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 10:58:22 EDT 2012
% Result : Theorem 0.83s
% Output : Solution 0.83s
% 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/SystemOnTPTP14955/KRS265+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14955/KRS265+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14955/KRS265+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=60 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 15069
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNFNFFMM21LS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreq>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHNFNFFMM21LS
% # Auto-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% # and selection function SelectNewComplexAHP.
% #
% # No equality, disabling AC handling.
% #
% # Initializing proof state
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 33
% # Removed by relevancy pruning : 0
% # Initial clauses : 109
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 109
% # Processed clauses : 120
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 118
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 396
% # ...of the previous two non-trivial : 385
% # Contextual simplify-reflections : 0
% # Paramodulations : 396
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 118
% # Positive orientable unit clauses: 14
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 98
% # Current number of unprocessed clauses: 374
% # ...number of literals in the above : 1046
% # Clause-clause subsumption calls (NU) : 2149
% # Rec. Clause-clause subsumption calls : 1337
% # Non-unit clause-clause subsumptions: 2
% # Unit Clause-clause subsumption calls : 176
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 56
% # BW rewrite match successes : 0
% # Backwards rewriting index : 1130 nodes, 174 leaves, 1.44+/-3.463 terms/leaf
% # Paramod-from index : 139 nodes, 23 leaves, 1.09+/-0.282 terms/leaf
% # Paramod-into index : 566 nodes, 84 leaves, 1.02+/-0.152 terms/leaf
% # Paramod-neg-atom index : 177 nodes, 29 leaves, 2.41+/-6.392 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&status(X3,X4,X2))<=>mighta(X1,X2)),file('/tmp/SRASS.s.p', mighta)).
% fof(2, axiom,![X3]:![X4]:(![X5]:(model(X5,X3)=>model(X5,X4))<=>status(X3,X4,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(3, axiom,![X3]:![X4]:(~(?[X5]:model(X5,X3))<=>status(X3,X4,cax)),file('/tmp/SRASS.s.p', cax)).
% fof(6, axiom,?[X6]:![X7]:~(model(X7,X6)),file('/tmp/SRASS.s.p', contradiction)).
% fof(33, conjecture,mighta(cax,thm),file('/tmp/SRASS.s.p', mighta_cax_thm)).
% fof(34, negated_conjecture,~(mighta(cax,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(36, plain,?[X6]:![X7]:~(model(X7,X6)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(50, negated_conjecture,~(mighta(cax,thm)),inference(fof_simplification,[status(thm)],[34,theory(equality)])).
% fof(51, plain,![X1]:![X2]:((![X3]:![X4]:(~(status(X3,X4,X1))|~(status(X3,X4,X2)))|mighta(X1,X2))&(~(mighta(X1,X2))|?[X3]:?[X4]:(status(X3,X4,X1)&status(X3,X4,X2)))),inference(fof_nnf,[status(thm)],[1])).
% fof(52, plain,(![X1]:![X2]:(![X3]:![X4]:(~(status(X3,X4,X1))|~(status(X3,X4,X2)))|mighta(X1,X2))&![X1]:![X2]:(~(mighta(X1,X2))|?[X3]:?[X4]:(status(X3,X4,X1)&status(X3,X4,X2)))),inference(shift_quantors,[status(thm)],[51])).
% fof(53, plain,(![X5]:![X6]:(![X7]:![X8]:(~(status(X7,X8,X5))|~(status(X7,X8,X6)))|mighta(X5,X6))&![X9]:![X10]:(~(mighta(X9,X10))|?[X11]:?[X12]:(status(X11,X12,X9)&status(X11,X12,X10)))),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,(![X5]:![X6]:(![X7]:![X8]:(~(status(X7,X8,X5))|~(status(X7,X8,X6)))|mighta(X5,X6))&![X9]:![X10]:(~(mighta(X9,X10))|(status(esk1_2(X9,X10),esk2_2(X9,X10),X9)&status(esk1_2(X9,X10),esk2_2(X9,X10),X10)))),inference(skolemize,[status(esa)],[53])).
% fof(55, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:(((~(status(X7,X8,X5))|~(status(X7,X8,X6)))|mighta(X5,X6))&(~(mighta(X9,X10))|(status(esk1_2(X9,X10),esk2_2(X9,X10),X9)&status(esk1_2(X9,X10),esk2_2(X9,X10),X10)))),inference(shift_quantors,[status(thm)],[54])).
% fof(56, plain,![X5]:![X6]:![X7]:![X8]:![X9]:![X10]:(((~(status(X7,X8,X5))|~(status(X7,X8,X6)))|mighta(X5,X6))&((status(esk1_2(X9,X10),esk2_2(X9,X10),X9)|~(mighta(X9,X10)))&(status(esk1_2(X9,X10),esk2_2(X9,X10),X10)|~(mighta(X9,X10))))),inference(distribute,[status(thm)],[55])).
% cnf(59,plain,(mighta(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(60, plain,![X3]:![X4]:((?[X5]:(model(X5,X3)&~(model(X5,X4)))|status(X3,X4,thm))&(~(status(X3,X4,thm))|![X5]:(~(model(X5,X3))|model(X5,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(61, plain,(![X3]:![X4]:(?[X5]:(model(X5,X3)&~(model(X5,X4)))|status(X3,X4,thm))&![X3]:![X4]:(~(status(X3,X4,thm))|![X5]:(~(model(X5,X3))|model(X5,X4)))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,(![X6]:![X7]:(?[X8]:(model(X8,X6)&~(model(X8,X7)))|status(X6,X7,thm))&![X9]:![X10]:(~(status(X9,X10,thm))|![X11]:(~(model(X11,X9))|model(X11,X10)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,(![X6]:![X7]:((model(esk3_2(X6,X7),X6)&~(model(esk3_2(X6,X7),X7)))|status(X6,X7,thm))&![X9]:![X10]:(~(status(X9,X10,thm))|![X11]:(~(model(X11,X9))|model(X11,X10)))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((model(esk3_2(X6,X7),X6)&~(model(esk3_2(X6,X7),X7)))|status(X6,X7,thm))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((model(esk3_2(X6,X7),X6)|status(X6,X7,thm))&(~(model(esk3_2(X6,X7),X7))|status(X6,X7,thm)))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(distribute,[status(thm)],[64])).
% cnf(67,plain,(status(X1,X2,thm)|~model(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[65])).
% cnf(68,plain,(status(X1,X2,thm)|model(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, plain,![X3]:![X4]:((?[X5]:model(X5,X3)|status(X3,X4,cax))&(~(status(X3,X4,cax))|![X5]:~(model(X5,X3)))),inference(fof_nnf,[status(thm)],[3])).
% fof(70, plain,(![X3]:(?[X5]:model(X5,X3)|![X4]:status(X3,X4,cax))&![X3]:(![X4]:~(status(X3,X4,cax))|![X5]:~(model(X5,X3)))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,(![X6]:(?[X7]:model(X7,X6)|![X8]:status(X6,X8,cax))&![X9]:(![X10]:~(status(X9,X10,cax))|![X11]:~(model(X11,X9)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,(![X6]:(model(esk4_1(X6),X6)|![X8]:status(X6,X8,cax))&![X9]:(![X10]:~(status(X9,X10,cax))|![X11]:~(model(X11,X9)))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X6]:![X8]:![X9]:![X10]:![X11]:((model(esk4_1(X6),X6)|status(X6,X8,cax))&(~(status(X9,X10,cax))|~(model(X11,X9)))),inference(shift_quantors,[status(thm)],[72])).
% cnf(75,plain,(status(X1,X2,cax)|model(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[73])).
% fof(83, plain,?[X8]:![X9]:~(model(X9,X8)),inference(variable_rename,[status(thm)],[36])).
% fof(84, plain,![X9]:~(model(X9,esk9_0)),inference(skolemize,[status(esa)],[83])).
% cnf(85,plain,(~model(X1,esk9_0)),inference(split_conjunct,[status(thm)],[84])).
% cnf(325,negated_conjecture,(~mighta(cax,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(350,plain,(status(esk9_0,X1,cax)),inference(spm,[status(thm)],[85,75,theory(equality)])).
% cnf(359,plain,(status(X1,X1,thm)),inference(spm,[status(thm)],[67,68,theory(equality)])).
% cnf(716,plain,(mighta(X1,thm)|~status(X2,X2,X1)),inference(spm,[status(thm)],[59,359,theory(equality)])).
% cnf(739,plain,(mighta(cax,thm)),inference(spm,[status(thm)],[716,350,theory(equality)])).
% cnf(740,plain,($false),inference(sr,[status(thm)],[739,325,theory(equality)])).
% cnf(741,plain,($false),740,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.09 CPU 0.20 WC
% FINAL PrfWatch: 0.09 CPU 0.20 WC
% SZS output end Solution for /tmp/SystemOnTPTP14955/KRS265+1.tptp
% WARNING: TreeLimitedRun lost 0.15s, total lost is 0.15s
%
%------------------------------------------------------------------------------