TSTP Solution File: KRS257+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS257+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 : richmond.cs.miami.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Core(TM)2 CPU 6600 @ 2.40GHz @ 2400MHz
% Memory : 1003MB
% OS : Linux 2.6.32.26-175.fc12.x86_64
% CPULimit : 300s
% DateTime : Fri Jun 15 10:56:49 EDT 2012
% Result : Theorem 0.33s
% Output : Solution 0.33s
% 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/SystemOnTPTP19247/KRS257+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP19247/KRS257+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19247/KRS257+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 19345
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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 : 267
% # ...of these trivial : 37
% # ...subsumed : 5
% # ...remaining for further processing: 225
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 1078
% # ...of the previous two non-trivial : 747
% # Contextual simplify-reflections : 0
% # Paramodulations : 1078
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 225
% # Positive orientable unit clauses: 49
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 170
% # Current number of unprocessed clauses: 589
% # ...number of literals in the above : 1599
% # Clause-clause subsumption calls (NU) : 3692
% # Rec. Clause-clause subsumption calls : 2753
% # Non-unit clause-clause subsumptions: 3
% # Unit Clause-clause subsumption calls : 369
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 67
% # BW rewrite match successes : 0
% # Backwards rewriting index : 1395 nodes, 224 leaves, 1.48+/-3.221 terms/leaf
% # Paramod-from index : 334 nodes, 60 leaves, 1.12+/-0.412 terms/leaf
% # Paramod-into index : 778 nodes, 124 leaves, 1.06+/-0.304 terms/leaf
% # Paramod-neg-atom index : 322 nodes, 55 leaves, 1.76+/-4.710 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,sat)),file('/tmp/SRASS.s.p', sat)).
% fof(3, axiom,![X3]:![X4]:(![X5]:(model(X5,X3)=>model(X5,X4))<=>status(X3,X4,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(4, axiom,?[X6]:![X7]:model(X7,X6),file('/tmp/SRASS.s.p', tautology)).
% fof(9, axiom,?[X5]:?[X3]:?[X4]:((model(X5,X3)&~(model(X5,X4)))&?[X8]:model(X8,X4)),file('/tmp/SRASS.s.p', non_thm_spt)).
% fof(33, conjecture,mighta(sat,thm),file('/tmp/SRASS.s.p', mighta_sat_thm)).
% fof(34, negated_conjecture,~(mighta(sat,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(39, plain,?[X5]:?[X3]:?[X4]:((model(X5,X3)&~(model(X5,X4)))&?[X8]:model(X8,X4)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(50, negated_conjecture,~(mighta(sat,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,sat))&(~(status(X3,X4,sat))|?[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,sat))&![X3]:![X4]:(~(status(X3,X4,sat))|?[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,sat))&![X9]:![X10]:(~(status(X9,X10,sat))|?[X11]:(model(X11,X9)&model(X11,X10)))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,(![X6]:![X7]:(![X8]:(~(model(X8,X6))|~(model(X8,X7)))|status(X6,X7,sat))&![X9]:![X10]:(~(status(X9,X10,sat))|(model(esk3_2(X9,X10),X9)&model(esk3_2(X9,X10),X10)))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(model(X8,X6))|~(model(X8,X7)))|status(X6,X7,sat))&(~(status(X9,X10,sat))|(model(esk3_2(X9,X10),X9)&model(esk3_2(X9,X10),X10)))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(model(X8,X6))|~(model(X8,X7)))|status(X6,X7,sat))&((model(esk3_2(X9,X10),X9)|~(status(X9,X10,sat)))&(model(esk3_2(X9,X10),X10)|~(status(X9,X10,sat))))),inference(distribute,[status(thm)],[64])).
% cnf(68,plain,(status(X1,X2,sat)|~model(X3,X2)|~model(X3,X1)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, 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)],[3])).
% fof(70, 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)],[69])).
% fof(71, 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)],[70])).
% fof(72, plain,(![X6]:![X7]:((model(esk4_2(X6,X7),X6)&~(model(esk4_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)],[71])).
% fof(73, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((model(esk4_2(X6,X7),X6)&~(model(esk4_2(X6,X7),X7)))|status(X6,X7,thm))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X6]:![X7]:![X9]:![X10]:![X11]:(((model(esk4_2(X6,X7),X6)|status(X6,X7,thm))&(~(model(esk4_2(X6,X7),X7))|status(X6,X7,thm)))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(distribute,[status(thm)],[73])).
% cnf(76,plain,(status(X1,X2,thm)|~model(esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[74])).
% fof(78, plain,?[X8]:![X9]:model(X9,X8),inference(variable_rename,[status(thm)],[4])).
% fof(79, plain,![X9]:model(X9,esk5_0),inference(skolemize,[status(esa)],[78])).
% cnf(80,plain,(model(X1,esk5_0)),inference(split_conjunct,[status(thm)],[79])).
% fof(103, plain,?[X9]:?[X10]:?[X11]:((model(X9,X10)&~(model(X9,X11)))&?[X12]:model(X12,X11)),inference(variable_rename,[status(thm)],[39])).
% fof(104, plain,((model(esk20_0,esk21_0)&~(model(esk20_0,esk22_0)))&model(esk23_0,esk22_0)),inference(skolemize,[status(esa)],[103])).
% cnf(105,plain,(model(esk23_0,esk22_0)),inference(split_conjunct,[status(thm)],[104])).
% cnf(325,negated_conjecture,(~mighta(sat,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(327,plain,(status(X1,esk5_0,thm)),inference(spm,[status(thm)],[76,80,theory(equality)])).
% cnf(372,plain,(status(X1,esk5_0,sat)|~model(X2,X1)),inference(spm,[status(thm)],[68,80,theory(equality)])).
% cnf(725,plain,(mighta(X1,thm)|~status(X2,esk5_0,X1)),inference(spm,[status(thm)],[59,327,theory(equality)])).
% cnf(797,plain,(status(esk22_0,esk5_0,sat)),inference(spm,[status(thm)],[372,105,theory(equality)])).
% cnf(1797,plain,(mighta(sat,thm)),inference(spm,[status(thm)],[725,797,theory(equality)])).
% cnf(1801,plain,($false),inference(sr,[status(thm)],[1797,325,theory(equality)])).
% cnf(1802,plain,($false),1801,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.04 CPU 0.08 WC
% FINAL PrfWatch: 0.04 CPU 0.08 WC
% SZS output end Solution for /tmp/SystemOnTPTP19247/KRS257+1.tptp
%
%------------------------------------------------------------------------------