%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : KRS188+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:46:45 EDT 2012
% Result : Theorem 71.60s
% Output : Solution 71.60s
% 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/SystemOnTPTP29543/KRS188+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% not found
% Adding ~C to TBU ... ~isa_wec_thm:
% ---- Iteration 1 (0 axioms selected)
% Looking for TBU SAT ... WARNING: TreeLimitedRun lost 58.92s, total lost is 58.92s
% 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 ... wec: CSA axiom wec found
% ---- Iteration 2 (3 axioms selected)
% Looking for TBU SAT ...
% no
% Looking for TBU UNS ...
% yes - theorem proved
% ---- Selection completed
% Selected axioms are ... :wec:thm:isa (3)
% Unselected axioms are ... :tautology:satisfiable:contradiction:sat_non_taut_pair:mixed_pair:non_thm_spt:unp:sap:esa:sat:eqv:tac:eth:tau:wtc:wth:cax:sca:tca:wca:mighta:nota:nevera:xora:csa:uns:noc:completeness:not (29)
% SZS status THM for /tmp/SystemOnTPTP29543/KRS188+1.tptp
% Looking for THM ... found
% SZS output start Solution for /tmp/SystemOnTPTP29543/KRS188+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 30372
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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 : 4
% # Removed by relevancy pruning : 0
% # Initial clauses : 13
% # Removed in clause preprocessing : 0
% # Initial clauses in saturation : 13
% # Processed clauses : 35
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 34
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 51
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 0
% # Paramodulations : 51
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 34
% # Positive orientable unit clauses: 2
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 30
% # Current number of unprocessed clauses: 25
% # ...number of literals in the above : 136
% # Clause-clause subsumption calls (NU) : 91
% # Rec. Clause-clause subsumption calls : 60
% # Non-unit clause-clause subsumptions: 1
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # BW rewrite match attempts : 11
% # BW rewrite match successes : 0
% # Backwards rewriting index : 253 nodes, 48 leaves, 1.58+/-1.812 terms/leaf
% # Paramod-from index : 54 nodes, 10 leaves, 1.10+/-0.300 terms/leaf
% # Paramod-into index : 153 nodes, 26 leaves, 1.04+/-0.192 terms/leaf
% # Paramod-neg-atom index : 86 nodes, 16 leaves, 1.38+/-1.218 terms/leaf
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)=>model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1))))<=>status(X1,X2,wec)),file('/tmp/SRASS.s.p', wec)).
% 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,![X6]:![X7]:(![X1]:![X2]:(status(X1,X2,X6)=>status(X1,X2,X7))<=>isa(X6,X7)),file('/tmp/SRASS.s.p', isa)).
% fof(4, conjecture,isa(wec,thm),file('/tmp/SRASS.s.p', isa_wec_thm)).
% fof(5, negated_conjecture,~(isa(wec,thm)),inference(assume_negation,[status(cth)],[4])).
% fof(6, plain,![X1]:![X2]:(((?[X3]:model(X3,X1)&![X4]:(model(X4,X1)=>model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1))))<=>status(X1,X2,wec)),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(7, negated_conjecture,~(isa(wec,thm)),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(8, plain,![X1]:![X2]:((((![X3]:~(model(X3,X1))|?[X4]:(model(X4,X1)&~(model(X4,X2))))|![X5]:(~(model(X5,X2))|model(X5,X1)))|status(X1,X2,wec))&(~(status(X1,X2,wec))|((?[X3]:model(X3,X1)&![X4]:(~(model(X4,X1))|model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1)))))),inference(fof_nnf,[status(thm)],[6])).
% fof(9, plain,(![X1]:![X2]:(((![X3]:~(model(X3,X1))|?[X4]:(model(X4,X1)&~(model(X4,X2))))|![X5]:(~(model(X5,X2))|model(X5,X1)))|status(X1,X2,wec))&![X1]:![X2]:(~(status(X1,X2,wec))|((?[X3]:model(X3,X1)&![X4]:(~(model(X4,X1))|model(X4,X2)))&?[X5]:(model(X5,X2)&~(model(X5,X1)))))),inference(shift_quantors,[status(thm)],[8])).
% fof(10, plain,(![X6]:![X7]:(((![X8]:~(model(X8,X6))|?[X9]:(model(X9,X6)&~(model(X9,X7))))|![X10]:(~(model(X10,X7))|model(X10,X6)))|status(X6,X7,wec))&![X11]:![X12]:(~(status(X11,X12,wec))|((?[X13]:model(X13,X11)&![X14]:(~(model(X14,X11))|model(X14,X12)))&?[X15]:(model(X15,X12)&~(model(X15,X11)))))),inference(variable_rename,[status(thm)],[9])).
% fof(11, plain,(![X6]:![X7]:(((![X8]:~(model(X8,X6))|(model(esk1_2(X6,X7),X6)&~(model(esk1_2(X6,X7),X7))))|![X10]:(~(model(X10,X7))|model(X10,X6)))|status(X6,X7,wec))&![X11]:![X12]:(~(status(X11,X12,wec))|((model(esk2_2(X11,X12),X11)&![X14]:(~(model(X14,X11))|model(X14,X12)))&(model(esk3_2(X11,X12),X12)&~(model(esk3_2(X11,X12),X11)))))),inference(skolemize,[status(esa)],[10])).
% fof(12, plain,![X6]:![X7]:![X8]:![X10]:![X11]:![X12]:![X14]:((((~(model(X8,X6))|(model(esk1_2(X6,X7),X6)&~(model(esk1_2(X6,X7),X7))))|(~(model(X10,X7))|model(X10,X6)))|status(X6,X7,wec))&(~(status(X11,X12,wec))|((model(esk2_2(X11,X12),X11)&(~(model(X14,X11))|model(X14,X12)))&(model(esk3_2(X11,X12),X12)&~(model(esk3_2(X11,X12),X11)))))),inference(shift_quantors,[status(thm)],[11])).
% fof(13, plain,![X6]:![X7]:![X8]:![X10]:![X11]:![X12]:![X14]:(((((model(esk1_2(X6,X7),X6)|~(model(X8,X6)))|(~(model(X10,X7))|model(X10,X6)))|status(X6,X7,wec))&(((~(model(esk1_2(X6,X7),X7))|~(model(X8,X6)))|(~(model(X10,X7))|model(X10,X6)))|status(X6,X7,wec)))&(((model(esk2_2(X11,X12),X11)|~(status(X11,X12,wec)))&((~(model(X14,X11))|model(X14,X12))|~(status(X11,X12,wec))))&((model(esk3_2(X11,X12),X12)|~(status(X11,X12,wec)))&(~(model(esk3_2(X11,X12),X11))|~(status(X11,X12,wec)))))),inference(distribute,[status(thm)],[12])).
% cnf(16,plain,(model(X3,X2)|~status(X1,X2,wec)|~model(X3,X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(20, 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(21, 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)],[20])).
% fof(22, 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)],[21])).
% fof(23, plain,(![X4]:![X5]:((model(esk4_2(X4,X5),X4)&~(model(esk4_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)],[22])).
% fof(24, plain,![X4]:![X5]:![X7]:![X8]:![X9]:(((model(esk4_2(X4,X5),X4)&~(model(esk4_2(X4,X5),X5)))|status(X4,X5,thm))&(~(status(X7,X8,thm))|(~(model(X9,X7))|model(X9,X8)))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X7]:![X8]:![X9]:(((model(esk4_2(X4,X5),X4)|status(X4,X5,thm))&(~(model(esk4_2(X4,X5),X5))|status(X4,X5,thm)))&(~(status(X7,X8,thm))|(~(model(X9,X7))|model(X9,X8)))),inference(distribute,[status(thm)],[24])).
% cnf(27,plain,(status(X1,X2,thm)|~model(esk4_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[25])).
% cnf(28,plain,(status(X1,X2,thm)|model(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(29, plain,![X6]:![X7]:((?[X1]:?[X2]:(status(X1,X2,X6)&~(status(X1,X2,X7)))|isa(X6,X7))&(~(isa(X6,X7))|![X1]:![X2]:(~(status(X1,X2,X6))|status(X1,X2,X7)))),inference(fof_nnf,[status(thm)],[3])).
% fof(30, plain,(![X6]:![X7]:(?[X1]:?[X2]:(status(X1,X2,X6)&~(status(X1,X2,X7)))|isa(X6,X7))&![X6]:![X7]:(~(isa(X6,X7))|![X1]:![X2]:(~(status(X1,X2,X6))|status(X1,X2,X7)))),inference(shift_quantors,[status(thm)],[29])).
% fof(31, plain,(![X8]:![X9]:(?[X10]:?[X11]:(status(X10,X11,X8)&~(status(X10,X11,X9)))|isa(X8,X9))&![X12]:![X13]:(~(isa(X12,X13))|![X14]:![X15]:(~(status(X14,X15,X12))|status(X14,X15,X13)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,(![X8]:![X9]:((status(esk5_2(X8,X9),esk6_2(X8,X9),X8)&~(status(esk5_2(X8,X9),esk6_2(X8,X9),X9)))|isa(X8,X9))&![X12]:![X13]:(~(isa(X12,X13))|![X14]:![X15]:(~(status(X14,X15,X12))|status(X14,X15,X13)))),inference(skolemize,[status(esa)],[31])).
% fof(33, plain,![X8]:![X9]:![X12]:![X13]:![X14]:![X15]:(((status(esk5_2(X8,X9),esk6_2(X8,X9),X8)&~(status(esk5_2(X8,X9),esk6_2(X8,X9),X9)))|isa(X8,X9))&(~(isa(X12,X13))|(~(status(X14,X15,X12))|status(X14,X15,X13)))),inference(shift_quantors,[status(thm)],[32])).
% fof(34, plain,![X8]:![X9]:![X12]:![X13]:![X14]:![X15]:(((status(esk5_2(X8,X9),esk6_2(X8,X9),X8)|isa(X8,X9))&(~(status(esk5_2(X8,X9),esk6_2(X8,X9),X9))|isa(X8,X9)))&(~(isa(X12,X13))|(~(status(X14,X15,X12))|status(X14,X15,X13)))),inference(distribute,[status(thm)],[33])).
% cnf(36,plain,(isa(X1,X2)|~status(esk5_2(X1,X2),esk6_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[34])).
% cnf(37,plain,(isa(X1,X2)|status(esk5_2(X1,X2),esk6_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[34])).
% cnf(38,negated_conjecture,(~isa(wec,thm)),inference(split_conjunct,[status(thm)],[7])).
% cnf(42,plain,(model(X1,esk6_2(wec,X2))|isa(wec,X2)|~model(X1,esk5_2(wec,X2))),inference(spm,[status(thm)],[16,37,theory(equality)])).
% cnf(56,plain,(status(X1,esk6_2(wec,X2),thm)|isa(wec,X2)|~model(esk4_2(X1,esk6_2(wec,X2)),esk5_2(wec,X2))),inference(spm,[status(thm)],[27,42,theory(equality)])).
% cnf(87,plain,(isa(wec,X1)|status(esk5_2(wec,X1),esk6_2(wec,X1),thm)),inference(spm,[status(thm)],[56,28,theory(equality)])).
% cnf(90,plain,(isa(wec,thm)),inference(spm,[status(thm)],[36,87,theory(equality)])).
% cnf(91,plain,($false),inference(sr,[status(thm)],[90,38,theory(equality)])).
% cnf(92,plain,($false),91,['proof']).
% # SZS output end CNFRefutation
% PrfWatch: 0.01 CPU 0.05 WC
% FINAL PrfWatch: 0.01 CPU 0.05 WC
% SZS output end Solution for /tmp/SystemOnTPTP29543/KRS188+1.tptp
%
%------------------------------------------------------------------------------