%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS233+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 : hancock.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:53:10 EDT 2012
% Result : Theorem 47.45s
% Output : Solution 47.45s
% 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/SystemOnTPTP19971/KRS233+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19971/KRS233+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19971/KRS233+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 20071
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 3.32 CPU 2.01 WC
% PrfWatch: 6.92 CPU 4.02 WC
% PrfWatch: 10.26 CPU 6.02 WC
% PrfWatch: 13.30 CPU 8.03 WC
% PrfWatch: 16.43 CPU 10.03 WC
% PrfWatch: 19.56 CPU 12.04 WC
% PrfWatch: 22.87 CPU 14.05 WC
% PrfWatch: 26.13 CPU 16.05 WC
% PrfWatch: 29.29 CPU 18.06 WC
% PrfWatch: 32.49 CPU 20.06 WC
% PrfWatch: 35.58 CPU 22.07 WC
% PrfWatch: 38.55 CPU 24.08 WC
% PrfWatch: 41.55 CPU 26.08 WC
% PrfWatch: 44.67 CPU 28.09 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 : 44385
% # ...of these trivial : 4115
% # ...subsumed : 25872
% # ...remaining for further processing: 14398
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 639
% # Backward-rewritten : 244
% # Generated clauses : 1903777
% # ...of the previous two non-trivial : 1337653
% # Contextual simplify-reflections : 10105
% # Paramodulations : 1903026
% # Factorizations : 740
% # Equation resolutions : 0
% # Current number of processed clauses: 13504
% # Positive orientable unit clauses: 1304
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1505
% # Non-unit-clauses : 10695
% # Current number of unprocessed clauses: 1231909
% # ...number of literals in the above : 5032317
% # Clause-clause subsumption calls (NU) : 18258460
% # Rec. Clause-clause subsumption calls : 10927140
% # Non-unit clause-clause subsumptions: 34879
% # Unit Clause-clause subsumption calls : 1280103
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 2284
% # BW rewrite match successes : 214
% # Backwards rewriting index : 18986 nodes, 4951 leaves, 2.15+/-4.759 terms/leaf
% # Paramod-from index : 8561 nodes, 2423 leaves, 1.41+/-2.334 terms/leaf
% # Paramod-into index : 14751 nodes, 3769 leaves, 1.32+/-1.933 terms/leaf
% # Paramod-neg-atom index : 4689 nodes, 1277 leaves, 2.83+/-4.198 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)=>~(status(X3,X4,X2)))<=>nevera(X1,X2)),file('/tmp/SRASS.s.p', nevera)).
% 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(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,nevera(csa,thm),file('/tmp/SRASS.s.p', nevera_csa_thm)).
% fof(34, negated_conjecture,~(nevera(csa,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(35, plain,![X1]:![X2]:(![X3]:![X4]:(status(X3,X4,X1)=>~(status(X3,X4,X2)))<=>nevera(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(50, negated_conjecture,~(nevera(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))|nevera(X1,X2))&(~(nevera(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))|nevera(X1,X2))&![X1]:![X2]:(~(nevera(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))|nevera(X5,X6))&![X9]:![X10]:(~(nevera(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(variable_rename,[status(thm)],[52])).
% fof(54, plain,(![X5]:![X6]:((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)&status(esk1_2(X5,X6),esk2_2(X5,X6),X6))|nevera(X5,X6))&![X9]:![X10]:(~(nevera(X9,X10))|![X11]:![X12]:(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(skolemize,[status(esa)],[53])).
% fof(55, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)&status(esk1_2(X5,X6),esk2_2(X5,X6),X6))|nevera(X5,X6))&(~(nevera(X9,X10))|(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(shift_quantors,[status(thm)],[54])).
% fof(56, plain,![X5]:![X6]:![X9]:![X10]:![X11]:![X12]:(((status(esk1_2(X5,X6),esk2_2(X5,X6),X5)|nevera(X5,X6))&(status(esk1_2(X5,X6),esk2_2(X5,X6),X6)|nevera(X5,X6)))&(~(nevera(X9,X10))|(~(status(X11,X12,X9))|~(status(X11,X12,X10))))),inference(distribute,[status(thm)],[55])).
% cnf(58,plain,(nevera(X1,X2)|status(esk1_2(X1,X2),esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[56])).
% cnf(59,plain,(nevera(X1,X2)|status(esk1_2(X1,X2),esk2_2(X1,X2),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])).
% 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(74,plain,(~model(X1,not(X2))|~model(X1,X2)),inference(split_conjunct,[status(thm)],[72])).
% 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(117,plain,(model(esk23_2(X1,X2),not(X2))|~status(X1,X2,csa)),inference(split_conjunct,[status(thm)],[116])).
% cnf(118,plain,(model(esk23_2(X1,X2),X1)|~status(X1,X2,csa)),inference(split_conjunct,[status(thm)],[116])).
% cnf(325,negated_conjecture,(~nevera(csa,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(432,plain,(model(X1,esk2_2(X2,thm))|nevera(X2,thm)|~model(X1,esk1_2(X2,thm))),inference(spm,[status(thm)],[66,58,theory(equality)])).
% cnf(483,plain,(model(esk23_2(esk1_2(csa,X1),esk2_2(csa,X1)),esk1_2(csa,X1))|nevera(csa,X1)),inference(spm,[status(thm)],[118,59,theory(equality)])).
% cnf(484,plain,(model(esk23_2(esk1_2(csa,X1),esk2_2(csa,X1)),not(esk2_2(csa,X1)))|nevera(csa,X1)),inference(spm,[status(thm)],[117,59,theory(equality)])).
% cnf(13574,plain,(model(esk23_2(esk1_2(csa,thm),esk2_2(csa,thm)),esk2_2(csa,thm))|nevera(csa,thm)),inference(spm,[status(thm)],[432,483,theory(equality)])).
% cnf(13579,plain,(model(esk23_2(esk1_2(csa,thm),esk2_2(csa,thm)),esk2_2(csa,thm))),inference(sr,[status(thm)],[13574,325,theory(equality)])).
% cnf(13730,plain,(nevera(csa,X1)|~model(esk23_2(esk1_2(csa,X1),esk2_2(csa,X1)),esk2_2(csa,X1))),inference(spm,[status(thm)],[74,484,theory(equality)])).
% cnf(2589447,plain,(nevera(csa,thm)),inference(spm,[status(thm)],[13730,13579,theory(equality)])).
% cnf(2589459,plain,($false),inference(sr,[status(thm)],[2589447,325,theory(equality)])).
% cnf(2589460,plain,($false),2589459,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 47.08 CPU 29.70 WC
% FINAL PrfWatch: 47.08 CPU 29.70 WC
% SZS output end Solution for /tmp/SystemOnTPTP19971/KRS233+1.tptp
%
%------------------------------------------------------------------------------