TSTP Solution File: KRS263+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS263+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Fri Jun 15 10:58:11 EDT 2012
% Result : Theorem 78.88s
% Output : Solution 78.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/SystemOnTPTP27547/KRS263+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~mighta_wtc_thm:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ... WARNING: TreeLimitedRun lost 61.06s, total lost is 61.06s
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... mighta:
% CSA axiom mighta found
% Looking for CSA axiom ... thm:
% CSA axiom thm found
% Looking for CSA axiom ... wtc:
% CSA axiom wtc found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... tautology:
% CSA axiom tautology found
% Looking for CSA axiom ... satisfiable:
% CSA axiom satisfiable found
% Looking for CSA axiom ... contradiction:
% CSA axiom contradiction found
% ---- Iteration 3 (6 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :contradiction:satisfiable:tautology:wtc:thm:mighta (6)
% Unselected axioms are ... :sat_non_taut_pair:mixed_pair:non_thm_spt:unp:sap:esa:sat:eqv:tac:wec:eth:tau:wth:cax:sca:tca:wca:isa:nota:nevera:xora:csa:uns:noc:completeness:not (26)
% SZS status THM for /tmp/SystemOnTPTP27547/KRS263+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP27547/KRS263+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.5/eproof_ram --print-statistics -xAuto -tAuto --cpu-limit=600 --memory-limit=Auto --tstp-format /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 600s
% TreeLimitedRun: WC time limit is 1200s
% TreeLimitedRun: PID is 28945
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GHNFNFFSF22MS
% # Auto-mode selected ordering type KBO6
% # Auto-mode selected ordering precedence scheme <invfreqconjmax>
% # Auto-mode selected weight ordering scheme <invfreqrank>
% #
% # Auto-Heuristic is analysing problem.
% # Problem is type GHNFNFFSF22MS
% # Auto-Mode selected heuristic G_E___107_C45_F1_PI_AE_Q4_CS_SP_S0Y
% # and selection function SelectMaxLComplexAvoidPosPred.
% #
% # No equality, disabling AC handling.
% #
% # Initializing proof state
% # Proof found!
% # SZS status Theorem
% # Parsed axioms : 7
% # Removed by relevancy pruning : 0
% # Initial clauses : 15
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 15
% # Processed clauses : 56
% # ...of these trivial : 2
% # ...subsumed : 8
% # ...remaining for further processing: 46
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 2
% # Generated clauses : 91
% # ...of the previous two non-trivial : 61
% # Contextual simplify-reflections : 2
% # Paramodulations : 91
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 43
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 6
% # Non-unit-clauses : 31
% # Current number of unprocessed clauses: 15
% # ...number of literals in the above : 50
% # Clause-clause subsumption calls (NU) : 104
% # Rec. Clause-clause subsumption calls : 91
% # Non-unit clause-clause subsumptions: 4
% # Unit Clause-clause subsumption calls : 50
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 13
% # BW rewrite match successes : 3
% # Backwards rewriting index : 291 nodes, 54 leaves, 1.72+/-1.297 terms/leaf
% # Paramod-from index : 79 nodes, 16 leaves, 1.06+/-0.242 terms/leaf
% # Paramod-into index : 199 nodes, 35 leaves, 1.26+/-0.553 terms/leaf
% # Paramod-neg-atom index : 108 nodes, 20 leaves, 1.25+/-0.698 terms/leaf
% # SZS output start CNFRefutation.
% fof(2, axiom,?[X1]:(?[X3]:model(X3,X1)&?[X4]:~(model(X4,X1))),file('/tmp/SRASS.s.p', satisfiable)).
% fof(3, axiom,?[X1]:![X2]:model(X2,X1),file('/tmp/SRASS.s.p', tautology)).
% fof(4, axiom,![X5]:![X6]:(((?[X3]:model(X3,X5)&?[X4]:~(model(X4,X5)))&![X7]:model(X7,X6))<=>status(X5,X6,wtc)),file('/tmp/SRASS.s.p', wtc)).
% fof(5, axiom,![X5]:![X6]:(![X3]:(model(X3,X5)=>model(X3,X6))<=>status(X5,X6,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(6, axiom,![X8]:![X9]:(?[X5]:?[X6]:(status(X5,X6,X8)&status(X5,X6,X9))<=>mighta(X8,X9)),file('/tmp/SRASS.s.p', mighta)).
% fof(7, conjecture,mighta(wtc,thm),file('/tmp/SRASS.s.p', mighta_wtc_thm)).
% fof(8, negated_conjecture,~(mighta(wtc,thm)),inference(assume_negation,[status(cth)],[7])).
% fof(10, plain,?[X1]:(?[X3]:model(X3,X1)&?[X4]:~(model(X4,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(11, plain,![X5]:![X6]:(((?[X3]:model(X3,X5)&?[X4]:~(model(X4,X5)))&![X7]:model(X7,X6))<=>status(X5,X6,wtc)),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(12, negated_conjecture,~(mighta(wtc,thm)),inference(fof_simplification,[status(thm)],[8,theory(equality)])).
% fof(16, plain,?[X5]:(?[X6]:model(X6,X5)&?[X7]:~(model(X7,X5))),inference(variable_rename,[status(thm)],[10])).
% fof(17, plain,(model(esk3_0,esk2_0)&~(model(esk4_0,esk2_0))),inference(skolemize,[status(esa)],[16])).
% cnf(18,plain,(~model(esk4_0,esk2_0)),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,plain,(model(esk3_0,esk2_0)),inference(split_conjunct,[status(thm)],[17])).
% fof(20, plain,?[X3]:![X4]:model(X4,X3),inference(variable_rename,[status(thm)],[3])).
% fof(21, plain,![X4]:model(X4,esk5_0),inference(skolemize,[status(esa)],[20])).
% cnf(22,plain,(model(X1,esk5_0)),inference(split_conjunct,[status(thm)],[21])).
% fof(23, plain,![X5]:![X6]:((((![X3]:~(model(X3,X5))|![X4]:model(X4,X5))|?[X7]:~(model(X7,X6)))|status(X5,X6,wtc))&(~(status(X5,X6,wtc))|((?[X3]:model(X3,X5)&?[X4]:~(model(X4,X5)))&![X7]:model(X7,X6)))),inference(fof_nnf,[status(thm)],[11])).
% fof(24, plain,(![X5]:![X6]:(((![X3]:~(model(X3,X5))|![X4]:model(X4,X5))|?[X7]:~(model(X7,X6)))|status(X5,X6,wtc))&![X5]:![X6]:(~(status(X5,X6,wtc))|((?[X3]:model(X3,X5)&?[X4]:~(model(X4,X5)))&![X7]:model(X7,X6)))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,(![X8]:![X9]:(((![X10]:~(model(X10,X8))|![X11]:model(X11,X8))|?[X12]:~(model(X12,X9)))|status(X8,X9,wtc))&![X13]:![X14]:(~(status(X13,X14,wtc))|((?[X15]:model(X15,X13)&?[X16]:~(model(X16,X13)))&![X17]:model(X17,X14)))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,(![X8]:![X9]:(((![X10]:~(model(X10,X8))|![X11]:model(X11,X8))|~(model(esk6_2(X8,X9),X9)))|status(X8,X9,wtc))&![X13]:![X14]:(~(status(X13,X14,wtc))|((model(esk7_2(X13,X14),X13)&~(model(esk8_2(X13,X14),X13)))&![X17]:model(X17,X14)))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:![X17]:((((~(model(X10,X8))|model(X11,X8))|~(model(esk6_2(X8,X9),X9)))|status(X8,X9,wtc))&(~(status(X13,X14,wtc))|((model(esk7_2(X13,X14),X13)&~(model(esk8_2(X13,X14),X13)))&model(X17,X14)))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X8]:![X9]:![X10]:![X11]:![X13]:![X14]:![X17]:((((~(model(X10,X8))|model(X11,X8))|~(model(esk6_2(X8,X9),X9)))|status(X8,X9,wtc))&(((model(esk7_2(X13,X14),X13)|~(status(X13,X14,wtc)))&(~(model(esk8_2(X13,X14),X13))|~(status(X13,X14,wtc))))&(model(X17,X14)|~(status(X13,X14,wtc))))),inference(distribute,[status(thm)],[27])).
% cnf(32,plain,(status(X1,X2,wtc)|model(X3,X1)|~model(esk6_2(X1,X2),X2)|~model(X4,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(33, plain,![X5]:![X6]:((?[X3]:(model(X3,X5)&~(model(X3,X6)))|status(X5,X6,thm))&(~(status(X5,X6,thm))|![X3]:(~(model(X3,X5))|model(X3,X6)))),inference(fof_nnf,[status(thm)],[5])).
% fof(34, plain,(![X5]:![X6]:(?[X3]:(model(X3,X5)&~(model(X3,X6)))|status(X5,X6,thm))&![X5]:![X6]:(~(status(X5,X6,thm))|![X3]:(~(model(X3,X5))|model(X3,X6)))),inference(shift_quantors,[status(thm)],[33])).
% fof(35, plain,(![X7]:![X8]:(?[X9]:(model(X9,X7)&~(model(X9,X8)))|status(X7,X8,thm))&![X10]:![X11]:(~(status(X10,X11,thm))|![X12]:(~(model(X12,X10))|model(X12,X11)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, plain,(![X7]:![X8]:((model(esk9_2(X7,X8),X7)&~(model(esk9_2(X7,X8),X8)))|status(X7,X8,thm))&![X10]:![X11]:(~(status(X10,X11,thm))|![X12]:(~(model(X12,X10))|model(X12,X11)))),inference(skolemize,[status(esa)],[35])).
% fof(37, plain,![X7]:![X8]:![X10]:![X11]:![X12]:(((model(esk9_2(X7,X8),X7)&~(model(esk9_2(X7,X8),X8)))|status(X7,X8,thm))&(~(status(X10,X11,thm))|(~(model(X12,X10))|model(X12,X11)))),inference(shift_quantors,[status(thm)],[36])).
% fof(38, plain,![X7]:![X8]:![X10]:![X11]:![X12]:(((model(esk9_2(X7,X8),X7)|status(X7,X8,thm))&(~(model(esk9_2(X7,X8),X8))|status(X7,X8,thm)))&(~(status(X10,X11,thm))|(~(model(X12,X10))|model(X12,X11)))),inference(distribute,[status(thm)],[37])).
% cnf(40,plain,(status(X1,X2,thm)|~model(esk9_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[38])).
% fof(42, plain,![X8]:![X9]:((![X5]:![X6]:(~(status(X5,X6,X8))|~(status(X5,X6,X9)))|mighta(X8,X9))&(~(mighta(X8,X9))|?[X5]:?[X6]:(status(X5,X6,X8)&status(X5,X6,X9)))),inference(fof_nnf,[status(thm)],[6])).
% fof(43, plain,(![X8]:![X9]:(![X5]:![X6]:(~(status(X5,X6,X8))|~(status(X5,X6,X9)))|mighta(X8,X9))&![X8]:![X9]:(~(mighta(X8,X9))|?[X5]:?[X6]:(status(X5,X6,X8)&status(X5,X6,X9)))),inference(shift_quantors,[status(thm)],[42])).
% fof(44, plain,(![X10]:![X11]:(![X12]:![X13]:(~(status(X12,X13,X10))|~(status(X12,X13,X11)))|mighta(X10,X11))&![X14]:![X15]:(~(mighta(X14,X15))|?[X16]:?[X17]:(status(X16,X17,X14)&status(X16,X17,X15)))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,(![X10]:![X11]:(![X12]:![X13]:(~(status(X12,X13,X10))|~(status(X12,X13,X11)))|mighta(X10,X11))&![X14]:![X15]:(~(mighta(X14,X15))|(status(esk10_2(X14,X15),esk11_2(X14,X15),X14)&status(esk10_2(X14,X15),esk11_2(X14,X15),X15)))),inference(skolemize,[status(esa)],[44])).
% fof(46, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((~(status(X12,X13,X10))|~(status(X12,X13,X11)))|mighta(X10,X11))&(~(mighta(X14,X15))|(status(esk10_2(X14,X15),esk11_2(X14,X15),X14)&status(esk10_2(X14,X15),esk11_2(X14,X15),X15)))),inference(shift_quantors,[status(thm)],[45])).
% fof(47, plain,![X10]:![X11]:![X12]:![X13]:![X14]:![X15]:(((~(status(X12,X13,X10))|~(status(X12,X13,X11)))|mighta(X10,X11))&((status(esk10_2(X14,X15),esk11_2(X14,X15),X14)|~(mighta(X14,X15)))&(status(esk10_2(X14,X15),esk11_2(X14,X15),X15)|~(mighta(X14,X15))))),inference(distribute,[status(thm)],[46])).
% cnf(50,plain,(mighta(X1,X2)|~status(X3,X4,X2)|~status(X3,X4,X1)),inference(split_conjunct,[status(thm)],[47])).
% cnf(51,negated_conjecture,(~mighta(wtc,thm)),inference(split_conjunct,[status(thm)],[12])).
% cnf(53,plain,(status(X1,esk5_0,thm)),inference(spm,[status(thm)],[40,22,theory(equality)])).
% cnf(63,plain,(status(X1,esk5_0,wtc)|model(X2,X1)|~model(X3,X1)),inference(spm,[status(thm)],[32,22,theory(equality)])).
% cnf(67,plain,(mighta(X1,thm)|~status(X2,esk5_0,X1)),inference(spm,[status(thm)],[50,53,theory(equality)])).
% cnf(151,plain,(status(esk2_0,esk5_0,wtc)|model(X1,esk2_0)),inference(spm,[status(thm)],[63,19,theory(equality)])).
% cnf(164,plain,(mighta(wtc,thm)|model(X1,esk2_0)),inference(spm,[status(thm)],[67,151,theory(equality)])).
% cnf(167,plain,(model(X1,esk2_0)),inference(sr,[status(thm)],[164,51,theory(equality)])).
% cnf(178,plain,($false),inference(rw,[status(thm)],[18,167,theory(equality)])).
% cnf(179,plain,($false),inference(cn,[status(thm)],[178,theory(equality)])).
% cnf(180,plain,($false),179,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.03 CPU 0.14 WC
% FINAL PrfWatch: 0.03 CPU 0.14 WC
% SZS output end Solution for /tmp/SystemOnTPTP27547/KRS263+1.tptp
% WARNING: TreeLimitedRun lost 0.04s, total lost is 61.10s
%
%------------------------------------------------------------------------------