%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS215+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 : hopewell.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:49:29 EDT 2012
% Result : Theorem 0.44s
% Output : Solution 0.44s
% 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/SystemOnTPTP3821/KRS215+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP3821/KRS215+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP3821/KRS215+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 3919
% 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 : 881
% # ...of these trivial : 128
% # ...subsumed : 25
% # ...remaining for further processing: 728
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 1
% # Generated clauses : 5077
% # ...of the previous two non-trivial : 3465
% # Contextual simplify-reflections : 0
% # Paramodulations : 5069
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 724
% # Positive orientable unit clauses: 193
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 524
% # Current number of unprocessed clauses: 2601
% # ...number of literals in the above : 6854
% # Clause-clause subsumption calls (NU) : 62865
% # Rec. Clause-clause subsumption calls : 54395
% # Non-unit clause-clause subsumptions: 14
% # Unit Clause-clause subsumption calls : 4995
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 462
% # BW rewrite match successes : 2
% # Backwards rewriting index : 2393 nodes, 422 leaves, 1.75+/-3.239 terms/leaf
% # Paramod-from index : 941 nodes, 184 leaves, 1.30+/-1.214 terms/leaf
% # Paramod-into index : 1576 nodes, 281 leaves, 1.20+/-0.994 terms/leaf
% # Paramod-neg-atom index : 545 nodes, 98 leaves, 1.55+/-3.679 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)=>model(X5,X4))<=>status(X3,X4,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(3, axiom,![X6]:![X7]:(model(X6,X7)<~>model(X6,not(X7))),file('/tmp/SRASS.s.p', completeness)).
% fof(5, axiom,?[X7]:![X6]:model(X6,X7),file('/tmp/SRASS.s.p', tautology)).
% fof(7, axiom,?[X7]:![X6]:~(model(X6,X7)),file('/tmp/SRASS.s.p', contradiction)).
% fof(10, axiom,?[X5]:?[X3]:?[X4]:((model(X5,X3)&~(model(X5,X4)))&?[X8]:model(X8,X4)),file('/tmp/SRASS.s.p', non_thm_spt)).
% fof(11, axiom,![X3]:![X4]:(?[X5]:(model(X5,X3)&model(X5,not(X4)))<=>status(X3,X4,csa)),file('/tmp/SRASS.s.p', csa)).
% fof(33, conjecture,nota(csa,thm),file('/tmp/SRASS.s.p', nota_csa_thm)).
% fof(34, negated_conjecture,~(nota(csa,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(36, plain,![X6]:![X7]:~((model(X6,X7)<=>model(X6,not(X7)))),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(39, plain,?[X7]:![X6]:~(model(X6,X7)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(42, plain,?[X5]:?[X3]:?[X4]:((model(X5,X3)&~(model(X5,X4)))&?[X8]:model(X8,X4)),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(50, negated_conjecture,~(nota(csa,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)&~(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(66,plain,(model(X1,X2)|~model(X1,X3)|~status(X3,X2,thm)),inference(split_conjunct,[status(thm)],[65])).
% cnf(67,plain,(status(X1,X2,thm)|~model(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[65])).
% fof(69, plain,![X6]:![X7]:((~(model(X6,X7))|~(model(X6,not(X7))))&(model(X6,X7)|model(X6,not(X7)))),inference(fof_nnf,[status(thm)],[36])).
% fof(70, plain,(![X6]:![X7]:(~(model(X6,X7))|~(model(X6,not(X7))))&![X6]:![X7]:(model(X6,X7)|model(X6,not(X7)))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,(![X8]:![X9]:(~(model(X8,X9))|~(model(X8,not(X9))))&![X10]:![X11]:(model(X10,X11)|model(X10,not(X11)))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,![X8]:![X9]:![X10]:![X11]:((~(model(X8,X9))|~(model(X8,not(X9))))&(model(X10,X11)|model(X10,not(X11)))),inference(shift_quantors,[status(thm)],[71])).
% cnf(73,plain,(model(X1,not(X2))|model(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% fof(81, plain,?[X8]:![X9]:model(X9,X8),inference(variable_rename,[status(thm)],[5])).
% fof(82, plain,![X9]:model(X9,esk4_0),inference(skolemize,[status(esa)],[81])).
% cnf(83,plain,(model(X1,esk4_0)),inference(split_conjunct,[status(thm)],[82])).
% fof(88, plain,?[X8]:![X9]:~(model(X9,X8)),inference(variable_rename,[status(thm)],[39])).
% fof(89, plain,![X9]:~(model(X9,esk8_0)),inference(skolemize,[status(esa)],[88])).
% cnf(90,plain,(~model(X1,esk8_0)),inference(split_conjunct,[status(thm)],[89])).
% fof(106, plain,?[X9]:?[X10]:?[X11]:((model(X9,X10)&~(model(X9,X11)))&?[X12]:model(X12,X11)),inference(variable_rename,[status(thm)],[42])).
% fof(107, plain,((model(esk19_0,esk20_0)&~(model(esk19_0,esk21_0)))&model(esk22_0,esk21_0)),inference(skolemize,[status(esa)],[106])).
% cnf(108,plain,(model(esk22_0,esk21_0)),inference(split_conjunct,[status(thm)],[107])).
% fof(111, plain,![X3]:![X4]:((![X5]:(~(model(X5,X3))|~(model(X5,not(X4))))|status(X3,X4,csa))&(~(status(X3,X4,csa))|?[X5]:(model(X5,X3)&model(X5,not(X4))))),inference(fof_nnf,[status(thm)],[11])).
% fof(112, plain,(![X3]:![X4]:(![X5]:(~(model(X5,X3))|~(model(X5,not(X4))))|status(X3,X4,csa))&![X3]:![X4]:(~(status(X3,X4,csa))|?[X5]:(model(X5,X3)&model(X5,not(X4))))),inference(shift_quantors,[status(thm)],[111])).
% fof(113, plain,(![X6]:![X7]:(![X8]:(~(model(X8,X6))|~(model(X8,not(X7))))|status(X6,X7,csa))&![X9]:![X10]:(~(status(X9,X10,csa))|?[X11]:(model(X11,X9)&model(X11,not(X10))))),inference(variable_rename,[status(thm)],[112])).
% fof(114, plain,(![X6]:![X7]:(![X8]:(~(model(X8,X6))|~(model(X8,not(X7))))|status(X6,X7,csa))&![X9]:![X10]:(~(status(X9,X10,csa))|(model(esk23_2(X9,X10),X9)&model(esk23_2(X9,X10),not(X10))))),inference(skolemize,[status(esa)],[113])).
% fof(115, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(model(X8,X6))|~(model(X8,not(X7))))|status(X6,X7,csa))&(~(status(X9,X10,csa))|(model(esk23_2(X9,X10),X9)&model(esk23_2(X9,X10),not(X10))))),inference(shift_quantors,[status(thm)],[114])).
% fof(116, plain,![X6]:![X7]:![X8]:![X9]:![X10]:(((~(model(X8,X6))|~(model(X8,not(X7))))|status(X6,X7,csa))&((model(esk23_2(X9,X10),X9)|~(status(X9,X10,csa)))&(model(esk23_2(X9,X10),not(X10))|~(status(X9,X10,csa))))),inference(distribute,[status(thm)],[115])).
% cnf(119,plain,(status(X1,X2,csa)|~model(X3,not(X2))|~model(X3,X1)),inference(split_conjunct,[status(thm)],[116])).
% cnf(325,negated_conjecture,(~nota(csa,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(328,plain,(status(X1,not(X2),thm)|model(esk3_2(X1,not(X2)),X2)),inference(spm,[status(thm)],[67,73,theory(equality)])).
% cnf(735,plain,(status(X1,not(esk8_0),thm)),inference(spm,[status(thm)],[90,328,theory(equality)])).
% cnf(2442,plain,(model(X1,not(esk8_0))|~model(X1,X2)),inference(spm,[status(thm)],[66,735,theory(equality)])).
% cnf(2479,plain,(model(X1,not(esk8_0))),inference(spm,[status(thm)],[2442,83,theory(equality)])).
% cnf(2517,plain,(status(X1,esk8_0,csa)|~model(X2,X1)),inference(spm,[status(thm)],[119,2479,theory(equality)])).
% cnf(2545,plain,(status(esk21_0,esk8_0,csa)),inference(spm,[status(thm)],[2517,108,theory(equality)])).
% cnf(2565,plain,(nota(csa,X1)|status(esk21_0,esk8_0,X1)),inference(spm,[status(thm)],[59,2545,theory(equality)])).
% cnf(7266,negated_conjecture,(status(esk21_0,esk8_0,thm)),inference(spm,[status(thm)],[325,2565,theory(equality)])).
% cnf(7267,negated_conjecture,(model(X1,esk8_0)|~model(X1,esk21_0)),inference(spm,[status(thm)],[66,7266,theory(equality)])).
% cnf(7277,negated_conjecture,(~model(X1,esk21_0)),inference(sr,[status(thm)],[7267,90,theory(equality)])).
% cnf(7338,plain,($false),inference(sr,[status(thm)],[108,7277,theory(equality)])).
% cnf(7339,plain,($false),7338,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.14 CPU 0.14 WC
% FINAL PrfWatch: 0.14 CPU 0.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP3821/KRS215+1.tptp
%
%------------------------------------------------------------------------------