TSTP Solution File: SYN743-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN743-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n016.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:17 EDT 2022
% Result : Unknown 9.66s 9.92s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYN743-1 : TPTP v8.1.0. Released v2.5.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n016.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 : Mon Jul 11 19:23:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.45/0.99 ============================== Prover9 ===============================
% 0.45/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.45/0.99 Process 8635 was started by sandbox on n016.cluster.edu,
% 0.45/0.99 Mon Jul 11 19:23:29 2022
% 0.45/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_8482_n016.cluster.edu".
% 0.45/0.99 ============================== end of head ===========================
% 0.45/0.99
% 0.45/0.99 ============================== INPUT =================================
% 0.45/0.99
% 0.45/0.99 % Reading from file /tmp/Prover9_8482_n016.cluster.edu
% 0.45/0.99
% 0.45/0.99 set(prolog_style_variables).
% 0.45/0.99 set(auto2).
% 0.45/0.99 % set(auto2) -> set(auto).
% 0.45/0.99 % set(auto) -> set(auto_inference).
% 0.45/0.99 % set(auto) -> set(auto_setup).
% 0.45/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.45/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.45/0.99 % set(auto) -> set(auto_limits).
% 0.45/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.45/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.45/0.99 % set(auto) -> set(auto_denials).
% 0.45/0.99 % set(auto) -> set(auto_process).
% 0.45/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.45/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.45/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.45/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.45/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.45/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.45/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.45/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.45/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.45/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.45/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.45/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.45/0.99 % set(auto2) -> assign(stats, some).
% 0.45/0.99 % set(auto2) -> clear(echo_input).
% 0.45/0.99 % set(auto2) -> set(quiet).
% 0.45/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.45/0.99 % set(auto2) -> clear(print_given).
% 0.45/0.99 assign(lrs_ticks,-1).
% 0.45/0.99 assign(sos_limit,10000).
% 0.45/0.99 assign(order,kbo).
% 0.45/0.99 set(lex_order_vars).
% 0.45/0.99 clear(print_given).
% 0.45/0.99
% 0.45/0.99 % formulas(sos). % not echoed (31 formulas)
% 0.45/0.99
% 0.45/0.99 ============================== end of input ==========================
% 0.45/0.99
% 0.45/0.99 % From the command line: assign(max_seconds, 300).
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.45/0.99
% 0.45/0.99 % Formulas that are not ordinary clauses:
% 0.45/0.99
% 0.45/0.99 ============================== end of process non-clausal formulas ===
% 0.45/0.99
% 0.45/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.45/0.99
% 0.45/0.99 ============================== PREDICATE ELIMINATION =================
% 0.45/0.99 1 -ssRr(A,B) | -ssPv2(B) | -ssPv4(A) | ssPv6(A) | ssPv8(A) # label(clause4) # label(negated_conjecture). [assumption].
% 0.45/0.99 2 -ssRr(A,B) | ssPv1(B) | ssPv2(A) | ssPv3(A) | ssPv7(A) # label(clause2) # label(negated_conjecture). [assumption].
% 0.45/0.99 3 -ssRr(A,B) | -ssPv7(B) | ssPv2(A) | ssPv4(A) | ssPv6(A) # label(clause3) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv4(A) | ssPv6(A) | ssPv8(A) | -ssRr(B,C) | ssPv1(C) | ssPv3(B) | ssPv7(B). [resolve(1,b,2,c)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv4(A) | ssPv6(A) | ssPv8(A) | -ssRr(B,C) | -ssPv7(C) | ssPv4(B) | ssPv6(B). [resolve(1,b,3,c)].
% 0.45/0.99 4 -ssRr(A,B) | -ssPv3(B) | -ssPv2(A) | ssPv6(A) | ssPv8(A) # label(clause5) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv3(B) | ssPv6(A) | ssPv8(A) | -ssRr(A,C) | ssPv1(C) | ssPv3(A) | ssPv7(A). [resolve(4,c,2,c)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv3(B) | ssPv6(A) | ssPv8(A) | -ssRr(A,C) | -ssPv7(C) | ssPv4(A) | ssPv6(A). [resolve(4,c,3,c)].
% 0.45/0.99 5 -ssRr(A,B) | -ssPv7(B) | -ssPv3(A) | ssPv1(A) | ssPv2(A) # label(clause7) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssPv3(A) | ssPv1(A) | -ssRr(C,A) | -ssPv4(C) | ssPv6(C) | ssPv8(C). [resolve(5,e,1,b)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv7(B) | -ssPv3(A) | ssPv1(A) | -ssRr(A,C) | -ssPv3(C) | ssPv6(A) | ssPv8(A). [resolve(5,e,4,c)].
% 0.45/0.99 6 -ssRr(A,B) | -ssRr(A,C) | ssPv7(B) | ssPv2(C) | ssPv6(A) | ssPv8(A) # label(clause10) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | ssPv7(B) | ssPv6(A) | ssPv8(A) | -ssRr(D,C) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(6,d,1,b)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | ssPv7(B) | ssPv6(A) | ssPv8(A) | -ssRr(C,D) | -ssPv3(D) | ssPv6(C) | ssPv8(C). [resolve(6,d,4,c)].
% 0.45/0.99 7 -ssRr(A,B) | -ssRr(A,C) | -ssPv6(A) | ssPv2(B) | ssPv1(C) | ssPv8(A) # label(clause12) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv6(A) | ssPv1(C) | ssPv8(A) | -ssRr(D,B) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(7,d,1,b)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv6(A) | ssPv1(C) | ssPv8(A) | -ssRr(B,D) | -ssPv3(D) | ssPv6(B) | ssPv8(B). [resolve(7,d,4,c)].
% 0.45/0.99 8 -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv8(B) | ssPv2(C) | ssPv5(A) # label(clause13) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv8(B) | ssPv5(A) | -ssRr(D,C) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(8,e,1,b)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv4(A) | ssPv8(B) | ssPv5(A) | -ssRr(C,D) | -ssPv3(D) | ssPv6(C) | ssPv8(C). [resolve(8,e,4,c)].
% 0.45/0.99 9 -ssRr(A,B) | -ssRr(A,C) | -ssPv3(A) | ssPv7(B) | ssPv6(C) | ssPv2(A) # label(clause15) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv3(A) | ssPv7(B) | ssPv6(C) | -ssRr(D,A) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(9,f,1,b)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv3(A) | ssPv7(B) | ssPv6(C) | -ssRr(A,D) | -ssPv3(D) | ssPv6(A) | ssPv8(A). [resolve(9,f,4,c)].
% 0.45/0.99 10 -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | -ssPv6(A) | ssPv2(B) | ssPv1(C) # label(clause16) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | -ssPv6(A) | ssPv1(C) | -ssRr(D,B) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(10,e,1,b)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | -ssPv6(A) | ssPv1(C) | -ssRr(B,D) | -ssPv3(D) | ssPv6(B) | ssPv8(B). [resolve(10,e,4,c)].
% 0.45/0.99 11 -ssRr(A,B) | -ssPv2(B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) # label(clause18) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(B,D) | ssPv1(D) | ssPv3(B) | ssPv7(B). [resolve(11,b,2,c)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(B,D) | -ssPv7(D) | ssPv4(B) | ssPv6(B). [resolve(11,b,3,c)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(B,D) | -ssPv7(D) | -ssPv3(B) | ssPv1(B). [resolve(11,b,5,e)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(D,E) | -ssRr(D,B) | ssPv7(E) | ssPv6(D) | ssPv8(D). [resolve(11,b,6,d)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(D,B) | -ssRr(D,E) | -ssPv6(D) | ssPv1(E) | ssPv8(D). [resolve(11,b,7,d)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(D,E) | -ssRr(D,B) | -ssPv4(D) | ssPv8(E) | ssPv5(D). [resolve(11,b,8,e)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(B,D) | -ssRr(B,E) | -ssPv3(B) | ssPv7(D) | ssPv6(E). [resolve(11,b,9,f)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssPv5(A) | ssPv5(C) | ssPv4(A) | -ssRr(D,B) | -ssRr(D,E) | -ssPv5(D) | -ssPv6(D) | ssPv1(E). [resolve(11,b,10,e)].
% 0.45/0.99 12 -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssPv2(A) | ssPv7(C) | ssPv3(A) # label(clause20) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | ssPv7(C) | ssPv3(A) | -ssRr(A,D) | ssPv1(D) | ssPv3(A) | ssPv7(A). [resolve(12,d,2,c)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | ssPv7(C) | ssPv3(A) | -ssRr(A,D) | -ssPv7(D) | ssPv4(A) | ssPv6(A). [resolve(12,d,3,c)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | ssPv7(C) | ssPv3(A) | -ssRr(D,E) | -ssRr(D,A) | ssPv7(E) | ssPv6(D) | ssPv8(D). [resolve(12,d,6,d)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | ssPv7(C) | ssPv3(A) | -ssRr(D,A) | -ssRr(D,E) | -ssPv6(D) | ssPv1(E) | ssPv8(D). [resolve(12,d,7,d)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | ssPv7(C) | ssPv3(A) | -ssRr(D,E) | -ssRr(D,A) | -ssPv4(D) | ssPv8(E) | ssPv5(D). [resolve(12,d,8,e)].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | ssPv7(C) | ssPv3(A) | -ssRr(D,A) | -ssRr(D,E) | -ssPv5(D) | -ssPv6(D) | ssPv1(E). [resolve(12,d,10,e)].
% 0.45/0.99 13 -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssPv7(A) | ssPv6(C) | ssPv2(A) # label(clause21) # label(negated_conjecture). [assumption].
% 0.45/0.99 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssPv7(A) | ssPv6(C) | -ssRr(D,A) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(13,f,1,b)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssPv7(A) | ssPv6(C) | -ssRr(A,D) | -ssPv3(D) | ssPv6(A) | ssPv8(A). [resolve(13,f,4,c)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssPv7(A) | ssPv6(C) | -ssRr(D,A) | -ssRr(D,E) | -ssPv5(D) | ssPv5(E) | ssPv4(D). [resolve(13,f,11,b)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssPv7(A) | ssPv6(C) | -ssRr(A,D) | -ssPv5(D) | -ssRr(A,E) | ssPv7(E) | ssPv3(A). [resolve(13,f,12,d)].
% 0.45/1.00 14 -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssPv4(C) | -ssPv5(A) | ssPv2(A) # label(clause23) # label(negated_conjecture). [assumption].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssPv4(C) | -ssPv5(A) | -ssRr(D,A) | -ssPv4(D) | ssPv6(D) | ssPv8(D). [resolve(14,f,1,b)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssPv4(C) | -ssPv5(A) | -ssRr(A,D) | -ssPv3(D) | ssPv6(A) | ssPv8(A). [resolve(14,f,4,c)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssPv4(C) | -ssPv5(A) | -ssRr(D,A) | -ssRr(D,E) | -ssPv5(D) | ssPv5(E) | ssPv4(D). [resolve(14,f,11,b)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssPv8(B) | -ssRr(A,C) | -ssPv4(C) | -ssPv5(A) | -ssRr(A,D) | -ssPv5(D) | -ssRr(A,E) | ssPv7(E) | ssPv3(A). [resolve(14,f,12,d)].
% 0.45/1.00 15 -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv2(A) | ssPv8(B) | ssPv7(C) | ssPv1(D) # label(clause24) # label(negated_conjecture). [assumption].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(A,E) | ssPv1(E) | ssPv3(A) | ssPv7(A). [resolve(15,d,2,c)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(A,E) | -ssPv7(E) | ssPv4(A) | ssPv6(A). [resolve(15,d,3,c)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(A,E) | -ssPv7(E) | -ssPv3(A) | ssPv1(A). [resolve(15,d,5,e)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(E,F) | -ssRr(E,A) | ssPv7(F) | ssPv6(E) | ssPv8(E). [resolve(15,d,6,d)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(E,A) | -ssRr(E,F) | -ssPv6(E) | ssPv1(F) | ssPv8(E). [resolve(15,d,7,d)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(E,F) | -ssRr(E,A) | -ssPv4(E) | ssPv8(F) | ssPv5(E). [resolve(15,d,8,e)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(A,E) | -ssRr(A,F) | -ssPv3(A) | ssPv7(E) | ssPv6(F). [resolve(15,d,9,f)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(E,A) | -ssRr(E,F) | -ssPv5(E) | -ssPv6(E) | ssPv1(F). [resolve(15,d,10,e)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(A,E) | -ssPv4(E) | -ssRr(A,F) | -ssPv7(A) | ssPv6(F). [resolve(15,d,13,f)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv8(B) | ssPv7(C) | ssPv1(D) | -ssRr(A,E) | -ssPv8(E) | -ssRr(A,F) | -ssPv4(F) | -ssPv5(A). [resolve(15,d,14,f)].
% 0.45/1.00 16 -ssRr(A,B) | -ssPv2(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) # label(clause26) # label(negated_conjecture). [assumption].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(B,E) | ssPv1(E) | ssPv3(B) | ssPv7(B). [resolve(16,b,2,c)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(B,E) | -ssPv7(E) | ssPv4(B) | ssPv6(B). [resolve(16,b,3,c)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(B,E) | -ssPv7(E) | -ssPv3(B) | ssPv1(B). [resolve(16,b,5,e)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(E,F) | -ssRr(E,B) | ssPv7(F) | ssPv6(E) | ssPv8(E). [resolve(16,b,6,d)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(E,B) | -ssRr(E,F) | -ssPv6(E) | ssPv1(F) | ssPv8(E). [resolve(16,b,7,d)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(E,F) | -ssRr(E,B) | -ssPv4(E) | ssPv8(F) | ssPv5(E). [resolve(16,b,8,e)].
% 0.45/1.00 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(B,E) | -ssRr(B,F) | -ssPv3(B) | ssPv7(E) | ssPv6(F). [resolve(16,b,9,f)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(E,B) | -ssRr(E,F) | -ssPv5(E) | -ssPv6(E) | ssPv1(F). [resolve(16,b,10,e)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(B,E) | -ssPv4(E) | -ssRr(B,F) | -ssPv7(B) | ssPv6(F). [resolve(16,b,13,f)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssRr(A,C) | -ssRr(A,D) | ssPv4(C) | ssPv1(D) | ssPv3(A) | -ssRr(B,E) | -ssPv8(E) | -ssRr(B,F) | -ssPv4(F) | -ssPv5(B). [resolve(16,b,14,f)].
% 0.45/1.01 17 -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssPv2(C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) # label(clause27) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(C,E) | ssPv1(E) | ssPv3(C) | ssPv7(C). [resolve(17,d,2,c)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(C,E) | -ssPv7(E) | ssPv4(C) | ssPv6(C). [resolve(17,d,3,c)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(C,E) | -ssPv7(E) | -ssPv3(C) | ssPv1(C). [resolve(17,d,5,e)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(E,F) | -ssRr(E,C) | ssPv7(F) | ssPv6(E) | ssPv8(E). [resolve(17,d,6,d)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(E,C) | -ssRr(E,F) | -ssPv6(E) | ssPv1(F) | ssPv8(E). [resolve(17,d,7,d)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(E,F) | -ssRr(E,C) | -ssPv4(E) | ssPv8(F) | ssPv5(E). [resolve(17,d,8,e)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(C,E) | -ssRr(C,F) | -ssPv3(C) | ssPv7(E) | ssPv6(F). [resolve(17,d,9,f)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(E,C) | -ssRr(E,F) | -ssPv5(E) | -ssPv6(E) | ssPv1(F). [resolve(17,d,10,e)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(C,E) | -ssPv4(E) | -ssRr(C,F) | -ssPv7(C) | ssPv6(F). [resolve(17,d,13,f)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv5(B) | -ssRr(A,C) | -ssRr(A,D) | ssPv6(D) | ssPv6(A) | -ssRr(C,E) | -ssPv8(E) | -ssRr(C,F) | -ssPv4(F) | -ssPv5(C). [resolve(17,d,14,f)].
% 0.45/1.01 18 -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv2(C) | ssPv1(D) # label(clause28) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(E,C) | -ssPv4(E) | ssPv6(E) | ssPv8(E). [resolve(18,f,1,b)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(C,E) | -ssPv3(E) | ssPv6(C) | ssPv8(C). [resolve(18,f,4,c)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(E,C) | -ssRr(E,F) | -ssPv5(E) | ssPv5(F) | ssPv4(E). [resolve(18,f,11,b)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(C,E) | -ssPv5(E) | -ssRr(C,F) | ssPv7(F) | ssPv3(C). [resolve(18,f,12,d)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(C,E) | -ssRr(C,F) | -ssRr(C,V6) | ssPv8(E) | ssPv7(F) | ssPv1(V6). [resolve(18,f,15,d)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(E,C) | -ssRr(E,F) | -ssRr(E,V6) | ssPv4(F) | ssPv1(V6) | ssPv3(E). [resolve(18,f,16,b)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv4(B) | -ssRr(A,C) | -ssRr(A,D) | -ssPv6(A) | ssPv1(D) | -ssRr(E,F) | -ssPv5(F) | -ssRr(E,C) | -ssRr(E,V6) | ssPv6(V6) | ssPv6(E). [resolve(18,f,17,d)].
% 0.45/1.01 19 -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | ssPv2(D) # label(clause31) # label(negated_conjecture). [assumption].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(E,D) | -ssPv4(E) | ssPv6(E) | ssPv8(E). [resolve(19,g,1,b)].
% 0.45/1.01 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(D,E) | -ssPv3(E) | ssPv6(D) | ssPv8(D). [resolve(19,g,4,c)].
% 9.66/9.92 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssPv5(E) | ssPv5(F) | ssPv4(E). [resolve(19,g,11,b)].
% 9.66/9.92 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(D,E) | -ssPv5(E) | -ssRr(D,F) | ssPv7(F) | ssPv3(D). [resolve(19,g,12,d)].
% 9.66/9.92 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(D,E) | -ssRr(D,F) | -ssRr(D,V6) | ssPv8(E) | ssPv7(F) | ssPv1(V6). [resolve(19,g,15,d)].
% 9.66/9.92 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(E,D) | -ssRr(E,F) | -ssRr(E,V6) | ssPv4(F) | ssPv1(V6) | ssPv3(E). [resolve(19,g,16,b)].
% 9.66/9.92 Derived: -ssRr(A,B) | -ssPv7(B) | -ssRr(A,C) | -ssPv4(C) | -ssRr(A,D) | -ssPv4(A) | -ssRr(E,F) | -ssPv5(F) | -ssRr(E,D) | -ssRr(E,V6) | ssPv6(V6) | ssPv6(E). [resolve(19,g,17,d)].
% 9.66/9.92
% 9.66/9.92 ============================== end predicate elimination =============
% 9.66/9.92
% 9.66/9.92 Auto_denials: (non-Horn, no changes).
% 9.66/9.92
% 9.66/9.92 Term ordering decisions:
% 9.66/9.92
% 9.66/9.92 % Assigning unary symbol skf1 kb_weight 0 and highest precedence (9).
% 9.66/9.92 Function symbol KB weights: skf1=0.
% 9.66/9.92
% 9.66/9.92 ============================== end of process initial clauses ========
% 9.66/9.92
% 9.66/9.92 ============================== CLAUSES FOR SEARCH ====================
% 9.66/9.92
% 9.66/9.92 ============================== end of clauses for search =============
% 9.66/9.92
% 9.66/9.92 ============================== SEARCH ================================
% 9.66/9.92
% 9.66/9.92 % Starting search at 0.27 seconds.
% 9.66/9.92
% 9.66/9.92 ============================== STATISTICS ============================
% 9.66/9.92
% 9.66/9.92 Given=7240. Generated=37735. Kept=7687. proofs=0.
% 9.66/9.92 Usable=7222. Sos=0. Demods=0. Limbo=0, Disabled=578. Hints=0.
% 9.66/9.92 Megabytes=5.20.
% 9.66/9.92 User_CPU=8.92, System_CPU=0.02, Wall_clock=8.
% 9.66/9.92
% 9.66/9.92 ============================== end of statistics =====================
% 9.66/9.92
% 9.66/9.92 ============================== end of search =========================
% 9.66/9.92
% 9.66/9.92 SEARCH FAILED
% 9.66/9.92
% 9.66/9.92 Exiting with failure.
% 9.66/9.92
% 9.66/9.92 Process 8635 exit (sos_empty) Mon Jul 11 19:23:37 2022
% 9.66/9.92 Prover9 interrupted
%------------------------------------------------------------------------------