TSTP Solution File: KRS176+1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : KRS176+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 03:25:17 EDT 2022

% Result   : Unknown 0.75s 1.06s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS176+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.34  % Computer : n018.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 16:52:51 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.75/1.01  ============================== Prover9 ===============================
% 0.75/1.01  Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.01  Process 1073 was started by sandbox2 on n018.cluster.edu,
% 0.75/1.01  Tue Jun  7 16:52:52 2022
% 0.75/1.01  The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_614_n018.cluster.edu".
% 0.75/1.01  ============================== end of head ===========================
% 0.75/1.01  
% 0.75/1.01  ============================== INPUT =================================
% 0.75/1.01  
% 0.75/1.01  % Reading from file /tmp/Prover9_614_n018.cluster.edu
% 0.75/1.01  
% 0.75/1.01  set(prolog_style_variables).
% 0.75/1.01  set(auto2).
% 0.75/1.01      % set(auto2) -> set(auto).
% 0.75/1.01      % set(auto) -> set(auto_inference).
% 0.75/1.01      % set(auto) -> set(auto_setup).
% 0.75/1.01      % set(auto_setup) -> set(predicate_elim).
% 0.75/1.01      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.01      % set(auto) -> set(auto_limits).
% 0.75/1.01      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.01      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.01      % set(auto) -> set(auto_denials).
% 0.75/1.01      % set(auto) -> set(auto_process).
% 0.75/1.01      % set(auto2) -> assign(new_constants, 1).
% 0.75/1.01      % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.01      % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.01      % set(auto2) -> assign(max_hours, 1).
% 0.75/1.01      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.01      % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.01      % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.01      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.01      % set(auto2) -> set(sort_initial_sos).
% 0.75/1.01      % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.01      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.01      % set(auto2) -> assign(max_megs, 400).
% 0.75/1.01      % set(auto2) -> assign(stats, some).
% 0.75/1.01      % set(auto2) -> clear(echo_input).
% 0.75/1.01      % set(auto2) -> set(quiet).
% 0.75/1.01      % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.01      % set(auto2) -> clear(print_given).
% 0.75/1.01  assign(lrs_ticks,-1).
% 0.75/1.01  assign(sos_limit,10000).
% 0.75/1.01  assign(order,kbo).
% 0.75/1.01  set(lex_order_vars).
% 0.75/1.01  clear(print_given).
% 0.75/1.01  
% 0.75/1.01  % formulas(sos).  % not echoed (19 formulas)
% 0.75/1.01  
% 0.75/1.01  ============================== end of input ==========================
% 0.75/1.01  
% 0.75/1.01  % From the command line: assign(max_seconds, 300).
% 0.75/1.01  
% 0.75/1.01  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.01  
% 0.75/1.01  % Formulas that are not ordinary clauses:
% 0.75/1.01  1 (all Ax all C ((-(exists I1 model(I1,Ax)) -> -(exists I2 model(I2,C))) <-> status(Ax,C,unp))) # label(unp) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  2 (all Ax all C (((exists I1 model(I1,Ax)) -> (exists I2 model(I2,C))) <-> status(Ax,C,sap))) # label(sap) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  3 (all Ax all C (((exists I1 model(I1,Ax)) <-> (exists I2 model(I2,C))) <-> status(Ax,C,esa))) # label(esa) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  4 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) <-> status(Ax,C,sat))) # label(sat) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  5 (all Ax all C ((all I1 (model(I1,Ax) -> model(I1,C))) <-> status(Ax,C,thm))) # label(thm) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  6 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) <-> model(I2,C))) <-> status(Ax,C,eqv))) # label(eqv) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  7 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 model(I2,C)) <-> status(Ax,C,tac))) # label(tac) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  8 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (model(I3,C) & -model(I3,Ax))) <-> status(Ax,C,wec))) # label(wec) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  9 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 (model(I3,Ax) <-> model(I3,C))) <-> status(Ax,C,eth))) # label(eth) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  10 (all Ax all C ((all I1 (model(I1,Ax) & model(I1,C))) <-> status(Ax,C,tau))) # label(tau) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  11 (all Ax all C ((exists I1 model(I1,Ax)) & (exists I2 -model(I2,Ax)) & (all I3 model(I3,C)) <-> status(Ax,C,wtc))) # label(wtc) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  12 (all Ax all C ((exists I1 model(I1,Ax)) & (all I2 (model(I2,Ax) -> model(I2,C))) & (exists I3 (model(I3,C) & -model(I3,Ax))) & (exists I4 -model(I4,C)) <-> status(Ax,C,wth))) # label(wth) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  13 (all Ax all C (-(exists I1 model(I1,Ax)) <-> status(Ax,C,cax))) # label(cax) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  14 (all Ax all C (-(exists I1 model(I1,Ax)) & (exists I2 model(I2,C)) <-> status(Ax,C,sca))) # label(sca) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  15 (all Ax all C (-(exists I1 model(I1,Ax)) & (all I2 model(I2,C)) <-> status(Ax,C,tca))) # label(tca) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  16 (all Ax all C (-(exists I1 model(I1,Ax)) & (exists I2 model(I2,C)) & (exists I3 -model(I3,C)) <-> status(Ax,C,wca))) # label(wca) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  17 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,not(C)))) <-> status(Ax,C,csa))) # label(csa) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  18 (all Ax all C ((all I1 model(I1,Ax)) & (all I2 model(I2,not(C))) <-> status(Ax,C,uns))) # label(uns) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  19 (all Ax all C ((exists I1 (model(I1,Ax) & model(I1,C))) & (exists I2 (model(I2,Ax) & model(I2,not(C)))) <-> status(Ax,C,noc))) # label(noc) # label(axiom) # label(non_clause).  [assumption].
% 0.75/1.01  
% 0.75/1.01  ============================== end of process non-clausal formulas ===
% 0.75/1.01  
% 0.75/1.01  ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01  
% 0.75/1.01  ============================== PREDICATE ELIMINATION =================
% 0.75/1.01  20 -model(A,B) | -status(B,C,cax) # label(cax) # label(axiom).  [clausify(13)].
% 0.75/1.01  21 model(f1(A,B),B) | status(A,B,unp) # label(unp) # label(axiom).  [clausify(1)].
% 0.75/1.01  22 model(f3(A,B),A) | status(A,B,sap) # label(sap) # label(axiom).  [clausify(2)].
% 0.75/1.01  23 model(f10(A,B),A) | status(A,B,thm) # label(thm) # label(axiom).  [clausify(5)].
% 0.75/1.01  24 model(f29(A,B),A) | status(A,B,cax) # label(cax) # label(axiom).  [clausify(13)].
% 0.75/1.01  25 model(f5(A,B),A) | model(f6(A,B),B) | status(A,B,esa) # label(esa) # label(axiom).  [clausify(3)].
% 0.75/1.01  Derived: -model(A,B) | model(f29(B,C),B).  [resolve(20,b,24,b)].
% 0.75/1.01  26 -model(A,B) | -status(B,C,sca) # label(sca) # label(axiom).  [clausify(14)].
% 0.75/1.01  27 -model(A,B) | -status(B,C,tca) # label(tca) # label(axiom).  [clausify(15)].
% 0.75/1.01  28 -model(A,B) | -status(B,C,wca) # label(wca) # label(axiom).  [clausify(16)].
% 0.75/1.01  29 -model(f17(A,B),A) | -status(A,B,wec) # label(wec) # label(axiom).  [clausify(8)].
% 0.75/1.01  30 -model(f20(A,B),A) | -status(A,B,eth) # label(eth) # label(axiom).  [clausify(9)].
% 0.75/1.01  31 -model(f24(A,B),A) | -status(A,B,wtc) # label(wtc) # label(axiom).  [clausify(11)].
% 0.75/1.01  32 -model(f27(A,B),A) | -status(A,B,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.01  33 -model(f28(A,B),B) | -status(A,B,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.01  34 -model(f36(A,B),B) | -status(A,B,wca) # label(wca) # label(axiom).  [clausify(16)].
% 0.75/1.01  35 -model(A,B) | status(B,C,unp) # label(unp) # label(axiom).  [clausify(1)].
% 0.75/1.01  36 -model(A,B) | status(C,B,sap) # label(sap) # label(axiom).  [clausify(2)].
% 0.75/1.01  37 model(A,B) | -status(C,B,tac) # label(tac) # label(axiom).  [clausify(7)].
% 0.75/1.01  38 model(A,B) | -status(B,C,tau) # label(tau) # label(axiom).  [clausify(10)].
% 0.75/1.01  39 model(A,B) | -status(C,B,tau) # label(tau) # label(axiom).  [clausify(10)].
% 0.75/1.01  40 model(A,B) | -status(C,B,wtc) # label(wtc) # label(axiom).  [clausify(11)].
% 0.75/1.01  41 model(A,B) | -status(C,B,tca) # label(tca) # label(axiom).  [clausify(15)].
% 0.75/1.01  42 model(A,B) | -status(B,C,uns) # label(uns) # label(axiom).  [clausify(18)].
% 0.75/1.01  43 model(A,not(B)) | -status(C,B,uns) # label(uns) # label(axiom).  [clausify(18)].
% 0.75/1.01  44 model(f9(A,B),A) | -status(A,B,sat) # label(sat) # label(axiom).  [clausify(4)].
% 0.75/1.01  45 model(f9(A,B),B) | -status(A,B,sat) # label(sat) # label(axiom).  [clausify(4)].
% 0.75/1.01  46 -model(f10(A,B),B) | status(A,B,thm) # label(thm) # label(axiom).  [clausify(5)].
% 0.75/1.01  47 model(f12(A,B),A) | -status(A,B,eqv) # label(eqv) # label(axiom).  [clausify(6)].
% 0.75/1.01  48 model(f14(A,B),A) | -status(A,B,tac) # label(tac) # label(axiom).  [clausify(7)].
% 0.75/1.01  49 model(f16(A,B),A) | -status(A,B,wec) # label(wec) # label(axiom).  [clausify(8)].
% 0.75/1.01  50 model(f17(A,B),B) | -status(A,B,wec) # label(wec) # label(axiom).  [clausify(8)].
% 0.75/1.01  51 model(f19(A,B),A) | -status(A,B,eth) # label(eth) # label(axiom).  [clausify(9)].
% 0.75/1.01  52 model(f23(A,B),A) | -status(A,B,wtc) # label(wtc) # label(axiom).  [clausify(11)].
% 0.75/1.01  53 model(f26(A,B),A) | -status(A,B,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.01  54 model(f27(A,B),B) | -status(A,B,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.01  55 model(f31(A,B),B) | -status(A,B,sca) # label(sca) # label(axiom).  [clausify(14)].
% 0.75/1.01  56 model(f35(A,B),B) | -status(A,B,wca) # label(wca) # label(axiom).  [clausify(16)].
% 0.75/1.01  57 model(f37(A,B),A) | -status(A,B,csa) # label(csa) # label(axiom).  [clausify(17)].
% 0.75/1.01  58 model(f40(A,B),A) | -status(A,B,noc) # label(noc) # label(axiom).  [clausify(19)].
% 0.75/1.01  59 model(f40(A,B),B) | -status(A,B,noc) # label(noc) # label(axiom).  [clausify(19)].
% 0.75/1.01  60 model(f41(A,B),A) | -status(A,B,noc) # label(noc) # label(axiom).  [clausify(19)].
% 0.75/1.01  61 -model(A,B) | -model(C,D) | status(B,D,esa) # label(esa) # label(axiom).  [clausify(3)].
% 0.75/1.01  62 -model(A,B) | -model(A,C) | status(B,C,sat) # label(sat) # label(axiom).  [clausify(4)].
% 0.75/1.01  Derived: -model(A,B) | -model(A,C) | model(f9(B,C),B).  [resolve(62,c,44,b)].
% 0.75/1.01  Derived: -model(A,B) | -model(A,C) | model(f9(B,C),C).  [resolve(62,c,45,b)].
% 0.75/1.01  63 -model(A,B) | model(A,C) | -status(B,C,thm) # label(thm) # label(axiom).  [clausify(5)].
% 0.75/1.01  Derived: -model(A,B) | model(A,C) | model(f10(B,C),B).  [resolve(63,c,23,b)].
% 0.75/1.01  Derived: -model(A,B) | model(A,C) | -model(f10(B,C),C).  [resolve(63,c,46,b)].
% 0.75/1.01  64 -model(A,B) | model(A,C) | -status(B,C,eqv) # label(eqv) # label(axiom).  [clausify(6)].
% 0.75/1.01  65 model(A,B) | -model(A,C) | -status(B,C,eqv) # label(eqv) # label(axiom).  [clausify(6)].
% 0.75/1.01  66 -model(A,B) | model(A,C) | -status(B,C,wec) # label(wec) # label(axiom).  [clausify(8)].
% 0.75/1.01  67 -model(A,B) | model(A,C) | -status(B,C,eth) # label(eth) # label(axiom).  [clausify(9)].
% 0.75/1.01  68 model(A,B) | -model(A,C) | -status(B,C,eth) # label(eth) # label(axiom).  [clausify(9)].
% 0.75/1.01  69 -model(A,B) | model(A,C) | -status(B,C,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.01  70 model(f37(A,B),not(B)) | -status(A,B,csa) # label(csa) # label(axiom).  [clausify(17)].
% 0.75/1.01  71 model(f41(A,B),not(B)) | -status(A,B,noc) # label(noc) # label(axiom).  [clausify(19)].
% 0.75/1.01  72 -model(A,B) | -model(A,not(C)) | status(B,C,csa) # label(csa) # label(axiom).  [clausify(17)].
% 0.75/1.01  Derived: -model(A,B) | -model(A,not(C)) | model(f37(B,C),B).  [resolve(72,c,57,b)].
% 0.75/1.01  Derived: -model(A,B) | -model(A,not(C)) | model(f37(B,C),not(C)).  [resolve(72,c,70,b)].
% 0.75/1.01  73 model(f2(A,B),A) | -model(C,B) | -status(A,B,unp) # label(unp) # label(axiom).  [clausify(1)].
% 0.75/1.01  Derived: model(f2(A,B),A) | -model(C,B) | model(f1(A,B),B).  [resolve(73,c,21,b)].
% 0.75/1.01  Derived: model(f2(A,B),A) | -model(C,B) | -model(D,A).  [resolve(73,c,35,b)].
% 0.75/1.01  74 -model(A,B) | model(f4(B,C),C) | -status(B,C,sap) # label(sap) # label(axiom).  [clausify(2)].
% 0.75/1.01  Derived: -model(A,B) | model(f4(B,C),C) | model(f3(B,C),B).  [resolve(74,c,22,b)].
% 0.75/1.01  Derived: -model(A,B) | model(f4(B,C),C) | -model(D,C).  [resolve(74,c,36,b)].
% 0.75/1.01  75 -model(A,B) | model(f7(B,C),C) | -status(B,C,esa) # label(esa) # label(axiom).  [clausify(3)].
% 0.75/1.01  Derived: -model(A,B) | model(f7(B,C),C) | model(f5(B,C),B) | model(f6(B,C),C).  [resolve(75,c,25,c)].
% 0.75/1.01  Derived: -model(A,B) | model(f7(B,C),C) | -model(D,B) | -model(E,C).  [resolve(75,c,61,c)].
% 0.75/1.01  76 model(f8(A,B),A) | -model(C,B) | -status(A,B,esa) # label(esa) # label(axiom).  [clausify(3)].
% 0.75/1.01  Derived: model(f8(A,B),A) | -model(C,B) | model(f5(A,B),A) | model(f6(A,B),B).  [resolve(76,c,25,c)].
% 0.75/1.01  Derived: model(f8(A,B),A) | -model(C,B) | -model(D,A) | -model(E,B).  [resolve(76,c,61,c)].
% 0.75/1.01  77 -model(A,B) | -model(f13(B,C),C) | status(B,C,tac) # label(tac) # label(axiom).  [clausify(7)].
% 0.75/1.01  Derived: -model(A,B) | -model(f13(B,C),C) | model(D,C).  [resolve(77,c,37,b)].
% 0.75/1.01  Derived: -model(A,B) | -model(f13(B,C),C) | model(f14(B,C),B).  [resolve(77,c,48,b)].
% 0.75/1.01  78 model(f30(A,B),A) | -model(C,B) | status(A,B,sca) # label(sca) # label(axiom).  [clausify(14)].
% 0.75/1.01  Derived: model(f30(A,B),A) | -model(C,B) | -model(D,A).  [resolve(78,c,26,b)].
% 0.75/1.01  Derived: model(f30(A,B),A) | -model(C,B) | model(f31(A,B),B).  [resolve(78,c,55,b)].
% 0.75/1.01  79 -model(f21(A,B),A) | -model(f21(A,B),B) | status(A,B,tau) # label(tau) # label(axiom).  [clausify(10)].
% 0.75/1.02  Derived: -model(f21(A,B),A) | -model(f21(A,B),B) | model(C,A).  [resolve(79,c,38,b)].
% 0.75/1.02  Derived: -model(f21(A,B),A) | -model(f21(A,B),B) | model(C,B).  [resolve(79,c,39,b)].
% 0.75/1.02  80 model(f32(A,B),A) | -model(f33(A,B),B) | status(A,B,tca) # label(tca) # label(axiom).  [clausify(15)].
% 0.75/1.02  Derived: model(f32(A,B),A) | -model(f33(A,B),B) | -model(C,A).  [resolve(80,c,27,b)].
% 0.75/1.02  Derived: model(f32(A,B),A) | -model(f33(A,B),B) | model(C,B).  [resolve(80,c,41,b)].
% 0.75/1.02  81 -model(A,B) | model(C,B) | -model(f22(B,D),D) | status(B,D,wtc) # label(wtc) # label(axiom).  [clausify(11)].
% 0.75/1.02  Derived: -model(A,B) | model(C,B) | -model(f22(B,D),D) | -model(f24(B,D),B).  [resolve(81,d,31,b)].
% 0.75/1.02  Derived: -model(A,B) | model(C,B) | -model(f22(B,D),D) | model(E,D).  [resolve(81,d,40,b)].
% 0.75/1.02  Derived: -model(A,B) | model(C,B) | -model(f22(B,D),D) | model(f23(B,D),B).  [resolve(81,d,52,b)].
% 0.75/1.02  82 model(f34(A,B),A) | -model(C,B) | model(D,B) | status(A,B,wca) # label(wca) # label(axiom).  [clausify(16)].
% 0.75/1.02  Derived: model(f34(A,B),A) | -model(C,B) | model(D,B) | -model(E,A).  [resolve(82,d,28,b)].
% 0.75/1.02  Derived: model(f34(A,B),A) | -model(C,B) | model(D,B) | -model(f36(A,B),B).  [resolve(82,d,34,b)].
% 0.75/1.02  Derived: model(f34(A,B),A) | -model(C,B) | model(D,B) | model(f35(A,B),B).  [resolve(82,d,56,b)].
% 0.75/1.02  83 -model(f38(A,B),A) | -model(f39(A,B),not(B)) | status(A,B,uns) # label(uns) # label(axiom).  [clausify(18)].
% 0.75/1.02  Derived: -model(f38(A,B),A) | -model(f39(A,B),not(B)) | model(C,A).  [resolve(83,c,42,b)].
% 0.75/1.02  Derived: -model(f38(A,B),A) | -model(f39(A,B),not(B)) | model(C,not(B)).  [resolve(83,c,43,b)].
% 0.75/1.02  84 -model(A,B) | model(f11(B,C),B) | model(f11(B,C),C) | status(B,C,eqv) # label(eqv) # label(axiom).  [clausify(6)].
% 0.75/1.02  Derived: -model(A,B) | model(f11(B,C),B) | model(f11(B,C),C) | model(f12(B,C),B).  [resolve(84,d,47,b)].
% 0.75/1.02  Derived: -model(A,B) | model(f11(B,C),B) | model(f11(B,C),C) | -model(D,B) | model(D,C).  [resolve(84,d,64,c)].
% 0.75/1.02  Derived: -model(A,B) | model(f11(B,C),B) | model(f11(B,C),C) | model(D,B) | -model(D,C).  [resolve(84,d,65,c)].
% 0.75/1.02  85 -model(A,B) | -model(f11(B,C),B) | -model(f11(B,C),C) | status(B,C,eqv) # label(eqv) # label(axiom).  [clausify(6)].
% 0.75/1.02  Derived: -model(A,B) | -model(f11(B,C),B) | -model(f11(B,C),C) | model(f12(B,C),B).  [resolve(85,d,47,b)].
% 0.75/1.02  Derived: -model(A,B) | -model(f11(B,C),B) | -model(f11(B,C),C) | -model(D,B) | model(D,C).  [resolve(85,d,64,c)].
% 0.75/1.02  Derived: -model(A,B) | -model(f11(B,C),B) | -model(f11(B,C),C) | model(D,B) | -model(D,C).  [resolve(85,d,65,c)].
% 0.75/1.02  86 -model(A,B) | -model(A,C) | -model(D,B) | -model(D,not(C)) | status(B,C,noc) # label(noc) # label(axiom).  [clausify(19)].
% 0.75/1.02  Derived: -model(A,B) | -model(A,C) | -model(D,B) | -model(D,not(C)) | model(f40(B,C),B).  [resolve(86,e,58,b)].
% 0.75/1.02  Derived: -model(A,B) | -model(A,C) | -model(D,B) | -model(D,not(C)) | model(f40(B,C),C).  [resolve(86,e,59,b)].
% 0.75/1.02  Derived: -model(A,B) | -model(A,C) | -model(D,B) | -model(D,not(C)) | model(f41(B,C),B).  [resolve(86,e,60,b)].
% 0.75/1.02  Derived: -model(A,B) | -model(A,C) | -model(D,B) | -model(D,not(C)) | model(f41(B,C),not(C)).  [resolve(86,e,71,b)].
% 0.75/1.02  87 -model(A,B) | model(f15(B,C),B) | -model(D,C) | model(D,B) | status(B,C,wec) # label(wec) # label(axiom).  [clausify(8)].
% 0.75/1.02  Derived: -model(A,B) | model(f15(B,C),B) | -model(D,C) | model(D,B) | -model(f17(B,C),B).  [resolve(87,e,29,b)].
% 0.75/1.02  Derived: -model(A,B) | model(f15(B,C),B) | -model(D,C) | model(D,B) | model(f16(B,C),B).  [resolve(87,e,49,b)].
% 0.75/1.02  Derived: -model(A,B) | model(f15(B,C),B) | -model(D,C) | model(D,B) | model(f17(B,C),C).  [resolve(87,e,50,b)].
% 0.75/1.02  Derived: -model(A,B) | model(f15(B,C),B) | -model(D,C) | model(D,B) | -model(E,B) | model(E,C).  [resolve(87,e,66,c)].
% 0.75/1.02  88 -model(A,B) | -model(f15(B,C),C) | -model(D,C) | model(D,B) | status(B,C,wec) # label(wec) # label(axiom).  [clausify(8)].
% 0.75/1.02  Derived: -model(A,B) | -model(f15(B,C),C) | -model(D,C) | model(D,B) | -model(f17(B,C),B).  [resolve(88,e,29,b)].
% 0.75/1.02  Derived: -model(A,B) | -model(f15(B,C),C) | -model(D,C) | model(D,B) | model(f16(B,C),B).  [resolve(88,e,49,b)].
% 0.75/1.02  Derived: -model(A,B) | -model(f15(B,C),C) | -model(D,C) | model(D,B) | model(f17(B,C),C).  [resolve(88,e,50,b)].
% 0.75/1.06  Derived: -model(A,B) | -model(f15(B,C),C) | -model(D,C) | model(D,B) | -model(E,B) | model(E,C).  [resolve(88,e,66,c)].
% 0.75/1.06  89 -model(A,B) | model(C,B) | model(f18(B,D),B) | model(f18(B,D),D) | status(B,D,eth) # label(eth) # label(axiom).  [clausify(9)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | model(f18(B,D),B) | model(f18(B,D),D) | -model(f20(B,D),B).  [resolve(89,e,30,b)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | model(f18(B,D),B) | model(f18(B,D),D) | model(f19(B,D),B).  [resolve(89,e,51,b)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | model(f18(B,D),B) | model(f18(B,D),D) | -model(E,B) | model(E,D).  [resolve(89,e,67,c)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | model(f18(B,D),B) | model(f18(B,D),D) | model(E,B) | -model(E,D).  [resolve(89,e,68,c)].
% 0.75/1.06  90 -model(A,B) | model(C,B) | -model(f18(B,D),B) | -model(f18(B,D),D) | status(B,D,eth) # label(eth) # label(axiom).  [clausify(9)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | -model(f18(B,D),B) | -model(f18(B,D),D) | -model(f20(B,D),B).  [resolve(90,e,30,b)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | -model(f18(B,D),B) | -model(f18(B,D),D) | model(f19(B,D),B).  [resolve(90,e,51,b)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | -model(f18(B,D),B) | -model(f18(B,D),D) | -model(E,B) | model(E,D).  [resolve(90,e,67,c)].
% 0.75/1.06  Derived: -model(A,B) | model(C,B) | -model(f18(B,D),B) | -model(f18(B,D),D) | model(E,B) | -model(E,D).  [resolve(90,e,68,c)].
% 0.75/1.06  91 -model(A,B) | model(f25(B,C),B) | -model(D,C) | model(D,B) | model(E,C) | status(B,C,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.06  Derived: -model(A,B) | model(f25(B,C),B) | -model(D,C) | model(D,B) | model(E,C) | -model(f27(B,C),B).  [resolve(91,f,32,b)].
% 0.75/1.06  Derived: -model(A,B) | model(f25(B,C),B) | -model(D,C) | model(D,B) | model(E,C) | -model(f28(B,C),C).  [resolve(91,f,33,b)].
% 0.75/1.06  Derived: -model(A,B) | model(f25(B,C),B) | -model(D,C) | model(D,B) | model(E,C) | model(f26(B,C),B).  [resolve(91,f,53,b)].
% 0.75/1.06  Derived: -model(A,B) | model(f25(B,C),B) | -model(D,C) | model(D,B) | model(E,C) | model(f27(B,C),C).  [resolve(91,f,54,b)].
% 0.75/1.06  Derived: -model(A,B) | model(f25(B,C),B) | -model(D,C) | model(D,B) | model(E,C) | -model(F,B) | model(F,C).  [resolve(91,f,69,c)].
% 0.75/1.06  92 -model(A,B) | -model(f25(B,C),C) | -model(D,C) | model(D,B) | model(E,C) | status(B,C,wth) # label(wth) # label(axiom).  [clausify(12)].
% 0.75/1.06  Derived: -model(A,B) | -model(f25(B,C),C) | -model(D,C) | model(D,B) | model(E,C) | -model(f27(B,C),B).  [resolve(92,f,32,b)].
% 0.75/1.06  Derived: -model(A,B) | -model(f25(B,C),C) | -model(D,C) | model(D,B) | model(E,C) | -model(f28(B,C),C).  [resolve(92,f,33,b)].
% 0.75/1.06  Derived: -model(A,B) | -model(f25(B,C),C) | -model(D,C) | model(D,B) | model(E,C) | model(f26(B,C),B).  [resolve(92,f,53,b)].
% 0.75/1.06  Derived: -model(A,B) | -model(f25(B,C),C) | -model(D,C) | model(D,B) | model(E,C) | model(f27(B,C),C).  [resolve(92,f,54,b)].
% 0.75/1.06  Derived: -model(A,B) | -model(f25(B,C),C) | -model(D,C) | model(D,B) | model(E,C) | -model(F,B) | model(F,C).  [resolve(92,f,69,c)].
% 0.75/1.06  
% 0.75/1.06  ============================== end predicate elimination =============
% 0.75/1.06  
% 0.75/1.06  Auto_denials:  (non-Horn, no changes).
% 0.75/1.06  
% 0.75/1.06  Term ordering decisions:
% 0.75/1.06  
% 0.75/1.06  % Assigning unary symbol not kb_weight 0 and highest precedence (43).
% 0.75/1.06  Function symbol KB weights:  f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1. f10=1. f11=1. f12=1. f13=1. f14=1. f15=1. f16=1. f17=1. f18=1. f19=1. f20=1. f21=1. f22=1. f23=1. f24=1. f25=1. f26=1. f27=1. f28=1. f29=1. f30=1. f31=1. f32=1. f33=1. f34=1. f35=1. f36=1. f37=1. f38=1. f39=1. f40=1. f41=1. not=0.
% 0.75/1.06  
% 0.75/1.06  ============================== end of process initial clauses ========
% 0.75/1.06  
% 0.75/1.06  ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.06  
% 0.75/1.06  ============================== end of clauses for search =============
% 0.75/1.06  
% 0.75/1.06  ============================== SEARCH ================================
% 0.75/1.06  
% 0.75/1.06  % Starting search at 0.04 seconds.
% 0.75/1.06  
% 0.75/1.06  ============================== STATISTICS ============================
% 0.75/1.06  
% 0.75/1.06  Given=110. Generated=485. Kept=168. proofs=0.
% 0.75/1.06  Usable=110. Sos=0. Demods=0. Limbo=0, Disabled=198. Hints=0.
% 0.75/1.06  Megabytes=0.33.
% 0.75/1.06  User_CPU=0.06, System_CPU=0.00, Wall_clock=0.
% 0.75/1.06  
% 0.75/1.06  ============================== end of statistics =====================
% 0.75/1.06  
% 0.75/1.06  ============================== end of search =========================
% 0.75/1.06  
% 0.75/1.06  SEARCH FAILED
% 0.75/1.06  
% 0.75/1.06  Exiting with failure.
% 0.75/1.06  
% 0.75/1.06  Process 1073 exit (sos_empty) Tue Jun  7 16:52:52 2022
% 0.75/1.06  Prover9 interrupted
%------------------------------------------------------------------------------