TSTP Solution File: KRS200+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS200+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 : nashville.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:47:52 EDT 2012
% Result : Theorem 1.81s
% Output : Solution 1.81s
% 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/SystemOnTPTP18901/KRS200+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP18901/KRS200+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18901/KRS200+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 18999
% 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 : 3750
% # ...of these trivial : 410
% # ...subsumed : 773
% # ...remaining for further processing: 2567
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 95
% # Backward-rewritten : 137
% # Generated clauses : 65905
% # ...of the previous two non-trivial : 43958
% # Contextual simplify-reflections : 24
% # Paramodulations : 65749
% # Factorizations : 156
% # Equation resolutions : 0
% # Current number of processed clauses: 2335
% # Positive orientable unit clauses: 503
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 193
% # Non-unit-clauses : 1639
% # Current number of unprocessed clauses: 38536
% # ...number of literals in the above : 147856
% # Clause-clause subsumption calls (NU) : 369486
% # Rec. Clause-clause subsumption calls : 270559
% # Non-unit clause-clause subsumptions: 732
% # Unit Clause-clause subsumption calls : 87132
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 626
% # BW rewrite match successes : 84
% # Backwards rewriting index : 6590 nodes, 1306 leaves, 1.53+/-3.121 terms/leaf
% # Paramod-from index : 3337 nodes, 681 leaves, 1.15+/-1.175 terms/leaf
% # Paramod-into index : 5069 nodes, 975 leaves, 1.11+/-0.992 terms/leaf
% # Paramod-neg-atom index : 1299 nodes, 277 leaves, 2.02+/-2.868 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))<=>nota(X1,X2)),file('/tmp/SRASS.s.p', nota)).
% fof(2, axiom,![X3]:![X4]:((~(?[X5]:model(X5,X3))=>~(?[X6]:model(X6,X4)))<=>status(X3,X4,unp)),file('/tmp/SRASS.s.p', unp)).
% fof(3, axiom,![X3]:![X4]:(![X5]:(model(X5,X3)=>model(X5,X4))<=>status(X3,X4,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(6, axiom,?[X7]:![X8]:~(model(X8,X7)),file('/tmp/SRASS.s.p', contradiction)).
% fof(9, axiom,?[X5]:?[X3]:?[X4]:((model(X5,X3)&~(model(X5,X4)))&?[X6]:model(X6,X4)),file('/tmp/SRASS.s.p', non_thm_spt)).
% fof(33, conjecture,nota(unp,thm),file('/tmp/SRASS.s.p', nota_unp_thm)).
% fof(34, negated_conjecture,~(nota(unp,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(35, plain,![X1]:![X2]:(?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2)))<=>nota(X1,X2)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(37, plain,?[X7]:![X8]:~(model(X8,X7)),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(40, plain,?[X5]:?[X3]:?[X4]:((model(X5,X3)&~(model(X5,X4)))&?[X6]:model(X6,X4)),inference(fof_simplification,[status(thm)],[9,theory(equality)])).
% fof(50, negated_conjecture,~(nota(unp,thm)),inference(fof_simplification,[status(thm)],[34,theory(equality)])).
% fof(51, plain,![X1]:![X2]:((![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2))|nota(X1,X2))&(~(nota(X1,X2))|?[X3]:?[X4]:(status(X3,X4,X1)&~(status(X3,X4,X2))))),inference(fof_nnf,[status(thm)],[35])).
% fof(52, plain,(![X1]:![X2]:(![X3]:![X4]:(~(status(X3,X4,X1))|status(X3,X4,X2))|nota(X1,X2))&![X1]:![X2]:(~(nota(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))|nota(X5,X6))&![X9]:![X10]:(~(nota(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))|nota(X5,X6))&![X9]:![X10]:(~(nota(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))|nota(X5,X6))&(~(nota(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))|nota(X5,X6))&((status(esk1_2(X9,X10),esk2_2(X9,X10),X9)|~(nota(X9,X10)))&(~(status(esk1_2(X9,X10),esk2_2(X9,X10),X10))|~(nota(X9,X10))))),inference(distribute,[status(thm)],[55])).
% cnf(59,plain,(nota(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))&?[X6]:model(X6,X4))|status(X3,X4,unp))&(~(status(X3,X4,unp))|(?[X5]:model(X5,X3)|![X6]:~(model(X6,X4))))),inference(fof_nnf,[status(thm)],[2])).
% fof(61, plain,(![X3]:![X4]:((![X5]:~(model(X5,X3))&?[X6]:model(X6,X4))|status(X3,X4,unp))&![X3]:![X4]:(~(status(X3,X4,unp))|(?[X5]:model(X5,X3)|![X6]:~(model(X6,X4))))),inference(shift_quantors,[status(thm)],[60])).
% fof(62, plain,(![X7]:![X8]:((![X9]:~(model(X9,X7))&?[X10]:model(X10,X8))|status(X7,X8,unp))&![X11]:![X12]:(~(status(X11,X12,unp))|(?[X13]:model(X13,X11)|![X14]:~(model(X14,X12))))),inference(variable_rename,[status(thm)],[61])).
% fof(63, plain,(![X7]:![X8]:((![X9]:~(model(X9,X7))&model(esk3_2(X7,X8),X8))|status(X7,X8,unp))&![X11]:![X12]:(~(status(X11,X12,unp))|(model(esk4_2(X11,X12),X11)|![X14]:~(model(X14,X12))))),inference(skolemize,[status(esa)],[62])).
% fof(64, plain,![X7]:![X8]:![X9]:![X11]:![X12]:![X14]:(((~(model(X9,X7))&model(esk3_2(X7,X8),X8))|status(X7,X8,unp))&(~(status(X11,X12,unp))|(model(esk4_2(X11,X12),X11)|~(model(X14,X12))))),inference(shift_quantors,[status(thm)],[63])).
% fof(65, plain,![X7]:![X8]:![X9]:![X11]:![X12]:![X14]:(((~(model(X9,X7))|status(X7,X8,unp))&(model(esk3_2(X7,X8),X8)|status(X7,X8,unp)))&(~(status(X11,X12,unp))|(model(esk4_2(X11,X12),X11)|~(model(X14,X12))))),inference(distribute,[status(thm)],[64])).
% cnf(68,plain,(status(X1,X2,unp)|~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(esk5_2(X6,X7),X6)&~(model(esk5_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(esk5_2(X6,X7),X6)&~(model(esk5_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(esk5_2(X6,X7),X6)|status(X6,X7,thm))&(~(model(esk5_2(X6,X7),X7))|status(X6,X7,thm)))&(~(status(X9,X10,thm))|(~(model(X11,X9))|model(X11,X10)))),inference(distribute,[status(thm)],[73])).
% cnf(75,plain,(model(X1,X2)|~model(X1,X3)|~status(X3,X2,thm)),inference(split_conjunct,[status(thm)],[74])).
% fof(85, plain,?[X9]:![X10]:~(model(X10,X9)),inference(variable_rename,[status(thm)],[37])).
% fof(86, plain,![X10]:~(model(X10,esk10_0)),inference(skolemize,[status(esa)],[85])).
% cnf(87,plain,(~model(X1,esk10_0)),inference(split_conjunct,[status(thm)],[86])).
% fof(103, plain,?[X7]:?[X8]:?[X9]:((model(X7,X8)&~(model(X7,X9)))&?[X10]:model(X10,X9)),inference(variable_rename,[status(thm)],[40])).
% fof(104, plain,((model(esk21_0,esk22_0)&~(model(esk21_0,esk23_0)))&model(esk24_0,esk23_0)),inference(skolemize,[status(esa)],[103])).
% cnf(105,plain,(model(esk24_0,esk23_0)),inference(split_conjunct,[status(thm)],[104])).
% cnf(325,negated_conjecture,(~nota(unp,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(327,plain,(status(esk23_0,X1,unp)),inference(spm,[status(thm)],[68,105,theory(equality)])).
% cnf(724,plain,(nota(unp,X1)|status(esk23_0,X2,X1)),inference(spm,[status(thm)],[59,327,theory(equality)])).
% cnf(97901,plain,(model(X1,X2)|nota(unp,thm)|~model(X1,esk23_0)),inference(spm,[status(thm)],[75,724,theory(equality)])).
% cnf(97988,plain,(model(X1,X2)|~model(X1,esk23_0)),inference(sr,[status(thm)],[97901,325,theory(equality)])).
% cnf(98423,plain,(model(esk24_0,X1)),inference(spm,[status(thm)],[97988,105,theory(equality)])).
% cnf(98503,plain,($false),inference(spm,[status(thm)],[87,98423,theory(equality)])).
% cnf(98603,plain,($false),98503,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 1.53 CPU 0.93 WC
% FINAL PrfWatch: 1.53 CPU 0.93 WC
% SZS output end Solution for /tmp/SystemOnTPTP18901/KRS200+1.tptp
%
%------------------------------------------------------------------------------