TSTP Solution File: KRS186+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS186+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 : gettysburg.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:46:30 EDT 2012
% Result : Theorem 71.18s
% Output : Solution 71.26s
% 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/SystemOnTPTP20432/KRS186+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~isa_eqv_thm:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ... WARNING: TreeLimitedRun lost 58.56s, total lost is 58.56s
% yes
% Looking for TBU model ...
% not found
% Looking for CSA axiom ... isa:
% CSA axiom isa found
% Looking for CSA axiom ... thm: CSA axiom thm found
% Looking for CSA axiom ... eqv:
% CSA axiom eqv found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ... yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :eqv:thm:isa (3)
% Unselected axioms are ... :tautology:satisfiable:contradiction:sat_non_taut_pair:mixed_pair:non_thm_spt:unp:sap:esa:sat:tac:wec:eth:tau:wtc:wth:cax:sca:tca:wca:mighta:nota:nevera:xora:csa:uns:noc:completeness:not (29)
% SZS status THM for /tmp/SystemOnTPTP20432/KRS186+1.tptp
% Looking for THM ...
% found
% SZS output start Solution for /tmp/SystemOnTPTP20432/KRS186+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 21340
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Auto-Ordering is analysing problem.
% # Problem is type GUNFGFFSF22MS
% # 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 GUNFGFFSF22MS
% # 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 : 4
% # Removed by relevancy pruning : 0
% # Initial clauses : 12
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 12
% # Processed clauses : 28
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 27
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 57
% # ...of the previous two non-trivial : 45
% # Contextual simplify-reflections : 0
% # Paramodulations : 55
% # Factorizations : 2
% # Equation resolutions : 0
% # Current number of processed clauses: 27
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 1
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 29
% # ...number of literals in the above : 134
% # Clause-clause subsumption calls (NU) : 36
% # Rec. Clause-clause subsumption calls : 27
% # Non-unit clause-clause subsumptions: 1
% # Unit Clause-clause subsumption calls : 4
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 12
% # BW rewrite match successes : 0
% # Backwards rewriting index : 190 nodes, 34 leaves, 1.68+/-1.727 terms/leaf
% # Paramod-from index : 54 nodes, 10 leaves, 1.30+/-0.458 terms/leaf
% # Paramod-into index : 126 nodes, 21 leaves, 1.19+/-0.393 terms/leaf
% # Paramod-neg-atom index : 64 nodes, 11 leaves, 1.36+/-1.150 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)<=>model(X4,X2)))<=>status(X1,X2,eqv)),file('/tmp/SRASS.s.p', eqv)).
% fof(2, axiom,![X1]:![X2]:(![X3]:(model(X3,X1)=>model(X3,X2))<=>status(X1,X2,thm)),file('/tmp/SRASS.s.p', thm)).
% fof(3, axiom,![X5]:![X6]:(![X1]:![X2]:(status(X1,X2,X5)=>status(X1,X2,X6))<=>isa(X5,X6)),file('/tmp/SRASS.s.p', isa)).
% fof(4, conjecture,isa(eqv,thm),file('/tmp/SRASS.s.p', isa_eqv_thm)).
% fof(5, negated_conjecture,~(isa(eqv,thm)),inference(assume_negation,[status(cth)],[4])).
% fof(6, negated_conjecture,~(isa(eqv,thm)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(7, plain,![X1]:![X2]:(((![X3]:~(model(X3,X1))|?[X4]:((~(model(X4,X1))|~(model(X4,X2)))&(model(X4,X1)|model(X4,X2))))|status(X1,X2,eqv))&(~(status(X1,X2,eqv))|(?[X3]:model(X3,X1)&![X4]:((~(model(X4,X1))|model(X4,X2))&(~(model(X4,X2))|model(X4,X1)))))),inference(fof_nnf,[status(thm)],[1])).
% fof(8, plain,(![X1]:![X2]:((![X3]:~(model(X3,X1))|?[X4]:((~(model(X4,X1))|~(model(X4,X2)))&(model(X4,X1)|model(X4,X2))))|status(X1,X2,eqv))&![X1]:![X2]:(~(status(X1,X2,eqv))|(?[X3]:model(X3,X1)&(![X4]:(~(model(X4,X1))|model(X4,X2))&![X4]:(~(model(X4,X2))|model(X4,X1)))))),inference(shift_quantors,[status(thm)],[7])).
% fof(9, plain,(![X5]:![X6]:((![X7]:~(model(X7,X5))|?[X8]:((~(model(X8,X5))|~(model(X8,X6)))&(model(X8,X5)|model(X8,X6))))|status(X5,X6,eqv))&![X9]:![X10]:(~(status(X9,X10,eqv))|(?[X11]:model(X11,X9)&(![X12]:(~(model(X12,X9))|model(X12,X10))&![X13]:(~(model(X13,X10))|model(X13,X9)))))),inference(variable_rename,[status(thm)],[8])).
% fof(10, plain,(![X5]:![X6]:((![X7]:~(model(X7,X5))|((~(model(esk1_2(X5,X6),X5))|~(model(esk1_2(X5,X6),X6)))&(model(esk1_2(X5,X6),X5)|model(esk1_2(X5,X6),X6))))|status(X5,X6,eqv))&![X9]:![X10]:(~(status(X9,X10,eqv))|(model(esk2_2(X9,X10),X9)&(![X12]:(~(model(X12,X9))|model(X12,X10))&![X13]:(~(model(X13,X10))|model(X13,X9)))))),inference(skolemize,[status(esa)],[9])).
% fof(11, plain,![X5]:![X6]:![X7]:![X9]:![X10]:![X12]:![X13]:(((~(model(X7,X5))|((~(model(esk1_2(X5,X6),X5))|~(model(esk1_2(X5,X6),X6)))&(model(esk1_2(X5,X6),X5)|model(esk1_2(X5,X6),X6))))|status(X5,X6,eqv))&(~(status(X9,X10,eqv))|(model(esk2_2(X9,X10),X9)&((~(model(X12,X9))|model(X12,X10))&(~(model(X13,X10))|model(X13,X9)))))),inference(shift_quantors,[status(thm)],[10])).
% fof(12, plain,![X5]:![X6]:![X7]:![X9]:![X10]:![X12]:![X13]:(((((~(model(esk1_2(X5,X6),X5))|~(model(esk1_2(X5,X6),X6)))|~(model(X7,X5)))|status(X5,X6,eqv))&(((model(esk1_2(X5,X6),X5)|model(esk1_2(X5,X6),X6))|~(model(X7,X5)))|status(X5,X6,eqv)))&((model(esk2_2(X9,X10),X9)|~(status(X9,X10,eqv)))&(((~(model(X12,X9))|model(X12,X10))|~(status(X9,X10,eqv)))&((~(model(X13,X10))|model(X13,X9))|~(status(X9,X10,eqv)))))),inference(distribute,[status(thm)],[11])).
% cnf(14,plain,(model(X3,X2)|~status(X1,X2,eqv)|~model(X3,X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(18, plain,![X1]:![X2]:((?[X3]:(model(X3,X1)&~(model(X3,X2)))|status(X1,X2,thm))&(~(status(X1,X2,thm))|![X3]:(~(model(X3,X1))|model(X3,X2)))),inference(fof_nnf,[status(thm)],[2])).
% fof(19, plain,(![X1]:![X2]:(?[X3]:(model(X3,X1)&~(model(X3,X2)))|status(X1,X2,thm))&![X1]:![X2]:(~(status(X1,X2,thm))|![X3]:(~(model(X3,X1))|model(X3,X2)))),inference(shift_quantors,[status(thm)],[18])).
% fof(20, plain,(![X4]:![X5]:(?[X6]:(model(X6,X4)&~(model(X6,X5)))|status(X4,X5,thm))&![X7]:![X8]:(~(status(X7,X8,thm))|![X9]:(~(model(X9,X7))|model(X9,X8)))),inference(variable_rename,[status(thm)],[19])).
% fof(21, plain,(![X4]:![X5]:((model(esk3_2(X4,X5),X4)&~(model(esk3_2(X4,X5),X5)))|status(X4,X5,thm))&![X7]:![X8]:(~(status(X7,X8,thm))|![X9]:(~(model(X9,X7))|model(X9,X8)))),inference(skolemize,[status(esa)],[20])).
% fof(22, plain,![X4]:![X5]:![X7]:![X8]:![X9]:(((model(esk3_2(X4,X5),X4)&~(model(esk3_2(X4,X5),X5)))|status(X4,X5,thm))&(~(status(X7,X8,thm))|(~(model(X9,X7))|model(X9,X8)))),inference(shift_quantors,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X7]:![X8]:![X9]:(((model(esk3_2(X4,X5),X4)|status(X4,X5,thm))&(~(model(esk3_2(X4,X5),X5))|status(X4,X5,thm)))&(~(status(X7,X8,thm))|(~(model(X9,X7))|model(X9,X8)))),inference(distribute,[status(thm)],[22])).
% cnf(25,plain,(status(X1,X2,thm)|~model(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(status(X1,X2,thm)|model(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X5]:![X6]:((?[X1]:?[X2]:(status(X1,X2,X5)&~(status(X1,X2,X6)))|isa(X5,X6))&(~(isa(X5,X6))|![X1]:![X2]:(~(status(X1,X2,X5))|status(X1,X2,X6)))),inference(fof_nnf,[status(thm)],[3])).
% fof(28, plain,(![X5]:![X6]:(?[X1]:?[X2]:(status(X1,X2,X5)&~(status(X1,X2,X6)))|isa(X5,X6))&![X5]:![X6]:(~(isa(X5,X6))|![X1]:![X2]:(~(status(X1,X2,X5))|status(X1,X2,X6)))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,(![X7]:![X8]:(?[X9]:?[X10]:(status(X9,X10,X7)&~(status(X9,X10,X8)))|isa(X7,X8))&![X11]:![X12]:(~(isa(X11,X12))|![X13]:![X14]:(~(status(X13,X14,X11))|status(X13,X14,X12)))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,(![X7]:![X8]:((status(esk4_2(X7,X8),esk5_2(X7,X8),X7)&~(status(esk4_2(X7,X8),esk5_2(X7,X8),X8)))|isa(X7,X8))&![X11]:![X12]:(~(isa(X11,X12))|![X13]:![X14]:(~(status(X13,X14,X11))|status(X13,X14,X12)))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X7]:![X8]:![X11]:![X12]:![X13]:![X14]:(((status(esk4_2(X7,X8),esk5_2(X7,X8),X7)&~(status(esk4_2(X7,X8),esk5_2(X7,X8),X8)))|isa(X7,X8))&(~(isa(X11,X12))|(~(status(X13,X14,X11))|status(X13,X14,X12)))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X7]:![X8]:![X11]:![X12]:![X13]:![X14]:(((status(esk4_2(X7,X8),esk5_2(X7,X8),X7)|isa(X7,X8))&(~(status(esk4_2(X7,X8),esk5_2(X7,X8),X8))|isa(X7,X8)))&(~(isa(X11,X12))|(~(status(X13,X14,X11))|status(X13,X14,X12)))),inference(distribute,[status(thm)],[31])).
% cnf(34,plain,(isa(X1,X2)|~status(esk4_2(X1,X2),esk5_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,plain,(isa(X1,X2)|status(esk4_2(X1,X2),esk5_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(36,negated_conjecture,(~isa(eqv,thm)),inference(split_conjunct,[status(thm)],[6])).
% cnf(40,plain,(model(X1,esk5_2(eqv,X2))|isa(eqv,X2)|~model(X1,esk4_2(eqv,X2))),inference(spm,[status(thm)],[14,35,theory(equality)])).
% cnf(49,plain,(status(X1,esk5_2(eqv,X2),thm)|isa(eqv,X2)|~model(esk3_2(X1,esk5_2(eqv,X2)),esk4_2(eqv,X2))),inference(spm,[status(thm)],[25,40,theory(equality)])).
% cnf(95,plain,(isa(eqv,X1)|status(esk4_2(eqv,X1),esk5_2(eqv,X1),thm)),inference(spm,[status(thm)],[49,26,theory(equality)])).
% cnf(98,plain,(isa(eqv,thm)),inference(spm,[status(thm)],[34,95,theory(equality)])).
% cnf(99,plain,($false),inference(sr,[status(thm)],[98,36,theory(equality)])).
% cnf(100,plain,($false),99,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.00 CPU 0.07 WC
% FINAL PrfWatch: 0.00 CPU 0.07 WC
% SZS output end Solution for /tmp/SystemOnTPTP20432/KRS186+1.tptp
%
%------------------------------------------------------------------------------