TSTP Solution File: KRS258+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS258+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 : antietam.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:57:24 EDT 2012
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP5003/KRS258+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP5003/KRS258+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP5003/KRS258+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 5101
% 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 : 2549
% # ...of these trivial : 165
% # ...subsumed : 489
% # ...remaining for further processing: 1895
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 3
% # Backward-rewritten : 9
% # Generated clauses : 24147
% # ...of the previous two non-trivial : 13777
% # Contextual simplify-reflections : 6
% # Paramodulations : 24141
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 1883
% # Positive orientable unit clauses: 378
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 269
% # Non-unit-clauses : 1236
% # Current number of unprocessed clauses: 10715
% # ...number of literals in the above : 27927
% # Clause-clause subsumption calls (NU) : 375414
% # Rec. Clause-clause subsumption calls : 301695
% # Non-unit clause-clause subsumptions: 445
% # Unit Clause-clause subsumption calls : 93911
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 523
% # BW rewrite match successes : 12
% # Backwards rewriting index : 5354 nodes, 1061 leaves, 1.62+/-2.822 terms/leaf
% # Paramod-from index : 2139 nodes, 439 leaves, 1.16+/-0.870 terms/leaf
% # Paramod-into index : 3704 nodes, 703 leaves, 1.10+/-0.695 terms/leaf
% # Paramod-neg-atom index : 1318 nodes, 283 leaves, 2.19+/-3.313 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)&![X6]:(model(X6,X3)<=>model(X6,X4)))<=>status(X3,X4,eqv)),file('/tmp/SRASS.s.p', eqv)).
% fof(4, axiom,?[X7]:![X8]:model(X8,X7),file('/tmp/SRASS.s.p', tautology)).
% fof(33, conjecture,mighta(eqv,thm),file('/tmp/SRASS.s.p', mighta_eqv_thm)).
% fof(34, negated_conjecture,~(mighta(eqv,thm)),inference(assume_negation,[status(cth)],[33])).
% fof(50, negated_conjecture,~(mighta(eqv,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))|?[X6]:((~(model(X6,X3))|~(model(X6,X4)))&(model(X6,X3)|model(X6,X4))))|status(X3,X4,eqv))&(~(status(X3,X4,eqv))|(?[X5]:model(X5,X3)&![X6]:((~(model(X6,X3))|model(X6,X4))&(~(model(X6,X4))|model(X6,X3)))))),inference(fof_nnf,[status(thm)],[3])).
% fof(70, plain,(![X3]:![X4]:((![X5]:~(model(X5,X3))|?[X6]:((~(model(X6,X3))|~(model(X6,X4)))&(model(X6,X3)|model(X6,X4))))|status(X3,X4,eqv))&![X3]:![X4]:(~(status(X3,X4,eqv))|(?[X5]:model(X5,X3)&(![X6]:(~(model(X6,X3))|model(X6,X4))&![X6]:(~(model(X6,X4))|model(X6,X3)))))),inference(shift_quantors,[status(thm)],[69])).
% fof(71, plain,(![X7]:![X8]:((![X9]:~(model(X9,X7))|?[X10]:((~(model(X10,X7))|~(model(X10,X8)))&(model(X10,X7)|model(X10,X8))))|status(X7,X8,eqv))&![X11]:![X12]:(~(status(X11,X12,eqv))|(?[X13]:model(X13,X11)&(![X14]:(~(model(X14,X11))|model(X14,X12))&![X15]:(~(model(X15,X12))|model(X15,X11)))))),inference(variable_rename,[status(thm)],[70])).
% fof(72, plain,(![X7]:![X8]:((![X9]:~(model(X9,X7))|((~(model(esk4_2(X7,X8),X7))|~(model(esk4_2(X7,X8),X8)))&(model(esk4_2(X7,X8),X7)|model(esk4_2(X7,X8),X8))))|status(X7,X8,eqv))&![X11]:![X12]:(~(status(X11,X12,eqv))|(model(esk5_2(X11,X12),X11)&(![X14]:(~(model(X14,X11))|model(X14,X12))&![X15]:(~(model(X15,X12))|model(X15,X11)))))),inference(skolemize,[status(esa)],[71])).
% fof(73, plain,![X7]:![X8]:![X9]:![X11]:![X12]:![X14]:![X15]:(((~(model(X9,X7))|((~(model(esk4_2(X7,X8),X7))|~(model(esk4_2(X7,X8),X8)))&(model(esk4_2(X7,X8),X7)|model(esk4_2(X7,X8),X8))))|status(X7,X8,eqv))&(~(status(X11,X12,eqv))|(model(esk5_2(X11,X12),X11)&((~(model(X14,X11))|model(X14,X12))&(~(model(X15,X12))|model(X15,X11)))))),inference(shift_quantors,[status(thm)],[72])).
% fof(74, plain,![X7]:![X8]:![X9]:![X11]:![X12]:![X14]:![X15]:(((((~(model(esk4_2(X7,X8),X7))|~(model(esk4_2(X7,X8),X8)))|~(model(X9,X7)))|status(X7,X8,eqv))&(((model(esk4_2(X7,X8),X7)|model(esk4_2(X7,X8),X8))|~(model(X9,X7)))|status(X7,X8,eqv)))&((model(esk5_2(X11,X12),X11)|~(status(X11,X12,eqv)))&(((~(model(X14,X11))|model(X14,X12))|~(status(X11,X12,eqv)))&((~(model(X15,X12))|model(X15,X11))|~(status(X11,X12,eqv)))))),inference(distribute,[status(thm)],[73])).
% cnf(79,plain,(status(X1,X2,eqv)|~model(X3,X1)|~model(esk4_2(X1,X2),X2)|~model(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[74])).
% fof(80, plain,?[X9]:![X10]:model(X10,X9),inference(variable_rename,[status(thm)],[4])).
% fof(81, plain,![X10]:model(X10,esk6_0),inference(skolemize,[status(esa)],[80])).
% cnf(82,plain,(model(X1,esk6_0)),inference(split_conjunct,[status(thm)],[81])).
% cnf(325,negated_conjecture,(~mighta(eqv,thm)),inference(split_conjunct,[status(thm)],[50])).
% cnf(359,plain,(status(X1,X1,thm)),inference(spm,[status(thm)],[67,68,theory(equality)])).
% cnf(579,plain,(status(X1,esk6_0,eqv)|~model(esk4_2(X1,esk6_0),X1)|~model(X2,X1)),inference(spm,[status(thm)],[79,82,theory(equality)])).
% cnf(716,plain,(mighta(X1,thm)|~status(X2,X2,X1)),inference(spm,[status(thm)],[59,359,theory(equality)])).
% cnf(37910,plain,(status(esk6_0,esk6_0,eqv)|~model(X1,esk6_0)),inference(spm,[status(thm)],[579,82,theory(equality)])).
% cnf(37919,plain,(status(esk6_0,esk6_0,eqv)|$false),inference(rw,[status(thm)],[37910,82,theory(equality)])).
% cnf(37920,plain,(status(esk6_0,esk6_0,eqv)),inference(cn,[status(thm)],[37919,theory(equality)])).
% cnf(38585,plain,(mighta(eqv,thm)),inference(spm,[status(thm)],[716,37920,theory(equality)])).
% cnf(38624,plain,($false),inference(sr,[status(thm)],[38585,325,theory(equality)])).
% cnf(38625,plain,($false),38624,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.60 CPU 0.40 WC
% FINAL PrfWatch: 0.60 CPU 0.40 WC
% SZS output end Solution for /tmp/SystemOnTPTP5003/KRS258+1.tptp
%
%------------------------------------------------------------------------------