TSTP Solution File: SYN738-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN738-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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 : Thu Jul 21 11:22:15 EDT 2022
% Result : Unknown 264.63s 264.95s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN738-1 : TPTP v8.1.0. Released v2.5.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 12 05:40:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 13866 was started by sandbox on n012.cluster.edu,
% 0.44/0.99 Tue Jul 12 05:40:13 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13489_n012.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_13489_n012.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (21 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 1 -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv3(C) | ssPv5(A) # label(clause7) # label(negated_conjecture). [assumption].
% 0.44/0.99 2 -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssPv3(C) | -ssPv4(A) | -ssPv8(A) # label(clause16) # label(negated_conjecture). [assumption].
% 0.44/0.99 3 -ssRr(A,B) | -ssPv3(B) | -ssPv8(A) | ssPv4(A) | ssPv5(A) # label(clause2) # label(negated_conjecture). [assumption].
% 0.44/0.99 4 -ssRr(A,B) | -ssPv3(B) | -ssPv2(A) | ssPv1(A) | ssPv7(A) # label(clause4) # label(negated_conjecture). [assumption].
% 0.44/0.99 5 -ssRr(A,B) | -ssPv7(B) | -ssPv3(A) | -ssPv4(A) | ssPv6(A) # label(clause5) # label(negated_conjecture). [assumption].
% 0.44/0.99 6 -ssRr(A,B) | -ssPv3(B) | -ssRr(A,C) | ssPv5(C) | ssPv6(A) | ssPv8(A) # label(clause6) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(D,E) | -ssPv4(E) | -ssRr(D,C) | -ssPv4(D) | -ssPv8(D). [resolve(1,e,2,d)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(D,C) | -ssPv8(D) | ssPv4(D) | ssPv5(D). [resolve(1,e,3,b)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(D,C) | -ssPv2(D) | ssPv1(D) | ssPv7(D). [resolve(1,e,4,b)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(C,D) | -ssPv7(D) | -ssPv4(C) | ssPv6(C). [resolve(1,e,5,c)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(D,C) | -ssRr(D,E) | ssPv5(E) | ssPv6(D) | ssPv8(D). [resolve(1,e,6,b)].
% 0.44/0.99 7 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv3(A) | -ssPv8(A) | ssPv8(C) # label(clause10) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv8(A) | ssPv8(C) | -ssRr(D,E) | -ssRr(D,A) | -ssPv4(D) | ssPv5(E) | ssPv5(D). [resolve(7,d,1,e)].
% 0.44/0.99 8 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv3(A) | -ssPv8(A) | ssPv7(C) # label(clause11) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv8(A) | ssPv7(C) | -ssRr(D,E) | -ssRr(D,A) | -ssPv4(D) | ssPv5(E) | ssPv5(D). [resolve(8,d,1,e)].
% 0.44/0.99 9 -ssRr(A,B) | -ssPv3(B) | -ssRr(A,C) | -ssPv1(A) | -ssPv6(A) | ssPv7(C) # label(clause12) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(A) | -ssPv6(A) | ssPv7(C) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv5(E) | ssPv5(D). [resolve(9,b,1,e)].
% 0.44/0.99 10 -ssRr(A,B) | -ssPv3(B) | -ssRr(A,C) | -ssPv2(C) | -ssPv1(A) | ssPv8(A) # label(clause14) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv2(C) | -ssPv1(A) | ssPv8(A) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv5(E) | ssPv5(D). [resolve(10,b,1,e)].
% 0.44/0.99 11 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv3(D) | ssPv4(A) # label(clause17) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,F) | -ssPv4(F) | -ssRr(E,D) | -ssPv4(E) | -ssPv8(E). [resolve(11,f,2,d)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssPv8(E) | ssPv4(E) | ssPv5(E). [resolve(11,f,3,b)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssPv2(E) | ssPv1(E) | ssPv7(E). [resolve(11,f,4,b)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(D,E) | -ssPv7(E) | -ssPv4(D) | ssPv6(D). [resolve(11,f,5,c)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | ssPv5(F) | ssPv6(E) | ssPv8(E). [resolve(11,f,6,b)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(D,E) | -ssPv7(E) | -ssRr(D,F) | -ssPv8(D) | ssPv8(F). [resolve(11,f,7,d)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(D,E) | -ssPv7(E) | -ssRr(D,F) | -ssPv8(D) | ssPv7(F). [resolve(11,f,8,d)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv1(E) | -ssPv6(E) | ssPv7(F). [resolve(11,f,9,b)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv2(F) | -ssPv1(E) | ssPv8(E). [resolve(11,f,10,b)].
% 0.44/0.99 12 -ssRr(A,B) | -ssPv6(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv3(A) | ssPv8(C) | ssPv6(D) # label(clause18) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv6(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv6(D) | -ssRr(E,F) | -ssRr(E,A) | -ssPv4(E) | ssPv5(F) | ssPv5(E). [resolve(12,e,1,e)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv6(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv6(D) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssRr(E,A) | ssPv8(V6) | ssPv4(E). [resolve(12,e,11,f)].
% 0.44/0.99 13 -ssRr(A,B) | -ssPv6(B) | -ssRr(A,C) | -ssPv3(C) | -ssRr(A,D) | -ssPv4(A) | ssPv5(D) # label(clause20) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv6(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv5(D) | -ssRr(E,F) | -ssRr(E,C) | -ssPv4(E) | ssPv5(F) | ssPv5(E). [resolve(13,d,1,e)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssPv6(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv4(A) | ssPv5(D) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssRr(E,C) | ssPv8(V6) | ssPv4(E). [resolve(13,d,11,f)].
% 0.44/0.99 14 -ssRr(A,B) | -ssPv3(B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) # label(clause21) # label(negated_conjecture). [assumption].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssRr(E,B) | -ssPv4(E) | ssPv5(F) | ssPv5(E). [resolve(14,b,1,e)].
% 0.44/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssRr(E,B) | ssPv8(V6) | ssPv4(E). [resolve(14,b,11,f)].
% 0.44/0.99 15 -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(D,C) | -ssPv2(D) | ssPv1(D) | ssPv7(D). [resolve(1,e,4,b)].
% 0.44/0.99 16 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv1(A) | -ssPv2(A) | ssPv4(C) # label(clause13) # label(negated_conjecture). [assumption].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv5(B) | ssPv5(A) | -ssRr(D,C) | -ssPv2(D) | ssPv7(D) | -ssRr(D,E) | -ssPv7(E) | -ssRr(D,F) | -ssPv2(D) | ssPv4(F). [resolve(15,h,16,d)].
% 3.41/3.71 17 -ssRr(A,B) | -ssRr(A,C) | -ssPv1(A) | -ssPv6(A) | ssPv7(C) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv5(E) | ssPv5(D). [resolve(9,b,1,e)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv6(A) | ssPv7(C) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv5(E) | ssPv5(D) | -ssRr(F,V6) | -ssRr(F,V7) | -ssPv4(F) | ssPv5(V6) | ssPv5(F) | -ssRr(A,V7) | -ssPv2(A) | ssPv7(A). [resolve(17,c,15,h)].
% 3.41/3.71 18 -ssRr(A,B) | -ssRr(A,C) | -ssPv2(C) | -ssPv1(A) | ssPv8(A) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv5(E) | ssPv5(D). [resolve(10,b,1,e)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv2(C) | ssPv8(A) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv5(E) | ssPv5(D) | -ssRr(F,V6) | -ssRr(F,V7) | -ssPv4(F) | ssPv5(V6) | ssPv5(F) | -ssRr(A,V7) | -ssPv2(A) | ssPv7(A). [resolve(18,d,15,h)].
% 3.41/3.71 19 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssPv2(E) | ssPv1(E) | ssPv7(E). [resolve(11,f,4,b)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssPv2(E) | ssPv7(E) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssPv2(E) | ssPv4(V6). [resolve(19,i,16,d)].
% 3.41/3.71 20 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv1(E) | -ssPv6(E) | ssPv7(F). [resolve(11,f,9,b)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv6(E) | ssPv7(F) | -ssRr(V6,V7) | -ssPv7(V7) | -ssRr(V6,V8) | -ssRr(V6,V9) | ssPv8(V8) | ssPv4(V6) | -ssRr(E,V9) | -ssPv2(E) | ssPv7(E). [resolve(20,i,19,i)].
% 3.41/3.71 21 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv2(F) | -ssPv1(E) | ssPv8(E). [resolve(11,f,10,b)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(C) | ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv2(F) | ssPv8(E) | -ssRr(V6,V7) | -ssPv7(V7) | -ssRr(V6,V8) | -ssRr(V6,V9) | ssPv8(V8) | ssPv4(V6) | -ssRr(E,V9) | -ssPv2(E) | ssPv7(E). [resolve(21,j,19,i)].
% 3.41/3.71 22 -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssRr(E,B) | -ssPv4(E) | ssPv5(F) | ssPv5(E). [resolve(14,b,1,e)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssRr(E,B) | -ssPv4(E) | ssPv5(F) | ssPv5(E) | -ssRr(V6,V7) | -ssRr(V6,V8) | -ssPv4(V6) | ssPv5(V7) | ssPv5(V6) | -ssRr(C,V8) | -ssPv2(C) | ssPv7(C). [resolve(22,c,15,h)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssRr(E,B) | -ssPv4(E) | ssPv5(F) | ssPv5(E) | -ssRr(V6,V7) | -ssPv7(V7) | -ssRr(V6,V8) | -ssRr(V6,V9) | ssPv8(V8) | ssPv4(V6) | -ssRr(C,V9) | -ssPv2(C) | ssPv7(C). [resolve(22,c,19,i)].
% 3.41/3.71 23 -ssRr(A,B) | -ssRr(A,C) | -ssPv1(C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssRr(E,B) | ssPv8(V6) | ssPv4(E). [resolve(14,b,11,f)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssRr(E,B) | ssPv8(V6) | ssPv4(E) | -ssRr(V7,V8) | -ssRr(V7,V9) | -ssPv4(V7) | ssPv5(V8) | ssPv5(V7) | -ssRr(C,V9) | -ssPv2(C) | ssPv7(C). [resolve(23,c,15,h)].
% 3.41/3.71 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv7(A) | ssPv7(D) | -ssRr(E,F) | -ssPv7(F) | -ssRr(E,V6) | -ssRr(E,B) | ssPv8(V6) | ssPv4(E) | -ssRr(V7,V8) | -ssPv7(V8) | -ssRr(V7,V9) | -ssRr(V7,V10) | ssPv8(V9) | ssPv4(V7) | -ssRr(C,V10) | -ssPv2(C) | ssPv7(C). [resolve(23,c,19,i)].
% 3.41/3.71
% 3.41/3.71 ============================== end predicate elimination =============
% 3.41/3.71
% 3.41/3.71 Auto_denials: (non-Horn, no changes).
% 3.41/3.71
% 3.41/3.71 Term ordering decisions:
% 3.41/3.71
% 3.41/3.71 % Assigning unary symbol skf1 kb_weight 0 and highest precedence (8).
% 3.41/3.71 Function symbol KB weights: skf1=0.
% 3.41/3.71
% 3.41/3.71 ============================== end of process initial clauses ========
% 3.41/3.71
% 3.41/3.71 ============================== CLAUSES FOR SEARCH ====================
% 3.41/3.71
% 3.41/3.71 ============================== end of clauses for search =============
% 264.63/264.94
% 264.63/264.94 ============================== SEARCH ================================
% 264.63/264.94
% 264.63/264.94 % Starting search at 2.71 seconds.
% 264.63/264.94
% 264.63/264.94 ============================== STATISTICS ============================
% 264.63/264.94
% 264.63/264.94 Given=15905. Generated=236371. Kept=17950. proofs=0.
% 264.63/264.94 Usable=15905. Sos=0. Demods=0. Limbo=0, Disabled=2100. Hints=0.
% 264.63/264.94 Megabytes=15.09.
% 264.63/264.94 User_CPU=263.75, System_CPU=0.18, Wall_clock=264.
% 264.63/264.94
% 264.63/264.94 ============================== end of statistics =====================
% 264.63/264.94
% 264.63/264.94 ============================== end of search =========================
% 264.63/264.94
% 264.63/264.94 SEARCH FAILED
% 264.63/264.94
% 264.63/264.94 Exiting with failure.
% 264.63/264.94
% 264.63/264.94 Process 13866 exit (sos_empty) Tue Jul 12 05:44:37 2022
% 264.63/264.94 Prover9 interrupted
%------------------------------------------------------------------------------