TSTP Solution File: KRS014-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS014-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:24:46 EDT 2022
% Result : Unknown 1.22s 1.50s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS014-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n028.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 17:53:15 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.43/1.01 ============================== Prover9 ===============================
% 0.43/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.01 Process 4499 was started by sandbox on n028.cluster.edu,
% 0.43/1.01 Tue Jun 7 17:53:16 2022
% 0.43/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4049_n028.cluster.edu".
% 0.43/1.01 ============================== end of head ===========================
% 0.43/1.01
% 0.43/1.01 ============================== INPUT =================================
% 0.43/1.01
% 0.43/1.01 % Reading from file /tmp/Prover9_4049_n028.cluster.edu
% 0.43/1.01
% 0.43/1.01 set(prolog_style_variables).
% 0.43/1.01 set(auto2).
% 0.43/1.01 % set(auto2) -> set(auto).
% 0.43/1.01 % set(auto) -> set(auto_inference).
% 0.43/1.01 % set(auto) -> set(auto_setup).
% 0.43/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.01 % set(auto) -> set(auto_limits).
% 0.43/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.01 % set(auto) -> set(auto_denials).
% 0.43/1.01 % set(auto) -> set(auto_process).
% 0.43/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.01 % set(auto2) -> assign(stats, some).
% 0.43/1.01 % set(auto2) -> clear(echo_input).
% 0.43/1.01 % set(auto2) -> set(quiet).
% 0.43/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.01 % set(auto2) -> clear(print_given).
% 0.43/1.01 assign(lrs_ticks,-1).
% 0.43/1.01 assign(sos_limit,10000).
% 0.43/1.01 assign(order,kbo).
% 0.43/1.01 set(lex_order_vars).
% 0.43/1.01 clear(print_given).
% 0.43/1.01
% 0.43/1.01 % formulas(sos). % not echoed (18 formulas)
% 0.43/1.01
% 0.43/1.01 ============================== end of input ==========================
% 0.43/1.01
% 0.43/1.01 % From the command line: assign(max_seconds, 300).
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.01
% 0.43/1.01 % Formulas that are not ordinary clauses:
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01 1 s2exact(A) | -e(A) # label(clause_4) # label(axiom). [assumption].
% 0.43/1.01 2 e(exists) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.43/1.01 Derived: s2exact(exists). [resolve(1,b,2,a)].
% 0.43/1.01 3 r1exact(A) | -e(A) # label(clause_5) # label(axiom). [assumption].
% 0.43/1.01 Derived: r1exact(exists). [resolve(3,b,2,a)].
% 0.43/1.01 4 s(A,B) | -e(A) | -r(A,B) # label(clause_2) # label(axiom). [assumption].
% 0.43/1.01 Derived: s(exists,A) | -r(exists,A). [resolve(4,b,2,a)].
% 0.43/1.01 5 r(A,B) | -e(A) | -s(A,B) # label(clause_3) # label(axiom). [assumption].
% 0.43/1.01 Derived: r(exists,A) | -s(exists,A). [resolve(5,b,2,a)].
% 0.43/1.01 6 e(A) | s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | -s2exact(A) # label(clause_6) # label(axiom). [assumption].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | -s2exact(A) | s(A,B) | -r(A,B). [resolve(6,a,4,b)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | -s2exact(A) | r(A,B) | -s(A,B). [resolve(6,a,5,b)].
% 0.43/1.01 7 e(A) | -r1exact(A) | -s2exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) # label(clause_7) # label(axiom). [assumption].
% 0.43/1.01 Derived: -r1exact(A) | -s2exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B). [resolve(7,a,4,b)].
% 0.43/1.01 Derived: -r1exact(A) | -s2exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B). [resolve(7,a,5,b)].
% 0.43/1.01 8 s2exact(A) | equalish(B,C) | -s(A,B) | -s(A,C) | -equalish(u2r1(B,C,A),C) # label(clause_16) # label(axiom). [assumption].
% 0.43/1.01 9 -s2exact(A) | -equalish(u2r3(A),u2r2(A)) # label(clause_13) # label(axiom). [assumption].
% 0.43/1.01 10 s(A,u2r2(A)) | -s2exact(A) # label(clause_14) # label(axiom). [assumption].
% 0.43/1.01 11 s(A,u2r3(A)) | -s2exact(A) # label(clause_15) # label(axiom). [assumption].
% 0.43/1.01 12 equalish(A,u2r3(B)) | equalish(A,u2r2(B)) | -s2exact(B) | -s(B,A) # label(clause_12) # label(axiom). [assumption].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),B) | -equalish(u2r3(C),u2r2(C)). [resolve(8,a,9,a)].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),B) | s(C,u2r2(C)). [resolve(8,a,10,b)].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),B) | s(C,u2r3(C)). [resolve(8,a,11,b)].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),B) | equalish(D,u2r3(C)) | equalish(D,u2r2(C)) | -s(C,D). [resolve(8,a,12,c)].
% 0.43/1.01 13 s2exact(A) | equalish(B,C) | -s(A,B) | -s(A,C) | -equalish(u2r1(B,C,A),B) # label(clause_17) # label(axiom). [assumption].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),A) | -equalish(u2r3(C),u2r2(C)). [resolve(13,a,9,a)].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),A) | s(C,u2r2(C)). [resolve(13,a,10,b)].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),A) | s(C,u2r3(C)). [resolve(13,a,11,b)].
% 0.43/1.01 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u2r1(A,B,C),A) | equalish(D,u2r3(C)) | equalish(D,u2r2(C)) | -s(C,D). [resolve(13,a,12,c)].
% 0.43/1.01 14 s2exact(A) | equalish(B,C) | s(A,u2r1(B,C,A)) | -s(A,B) | -s(A,C) # label(clause_18) # label(axiom). [assumption].
% 0.43/1.01 Derived: equalish(A,B) | s(C,u2r1(A,B,C)) | -s(C,A) | -s(C,B) | -equalish(u2r3(C),u2r2(C)). [resolve(14,a,9,a)].
% 0.43/1.01 Derived: equalish(A,B) | s(C,u2r1(A,B,C)) | -s(C,A) | -s(C,B) | s(C,u2r2(C)). [resolve(14,a,10,b)].
% 0.43/1.01 Derived: equalish(A,B) | s(C,u2r1(A,B,C)) | -s(C,A) | -s(C,B) | s(C,u2r3(C)). [resolve(14,a,11,b)].
% 0.43/1.01 Derived: equalish(A,B) | s(C,u2r1(A,B,C)) | -s(C,A) | -s(C,B) | equalish(D,u2r3(C)) | equalish(D,u2r2(C)) | -s(C,D). [resolve(14,a,12,c)].
% 0.43/1.01 15 s2exact(exists). [resolve(1,b,2,a)].
% 0.43/1.01 Derived: -equalish(u2r3(exists),u2r2(exists)). [resolve(15,a,9,a)].
% 0.43/1.01 Derived: s(exists,u2r2(exists)). [resolve(15,a,10,b)].
% 0.43/1.01 Derived: s(exists,u2r3(exists)). [resolve(15,a,11,b)].
% 0.43/1.01 Derived: equalish(A,u2r3(exists)) | equalish(A,u2r2(exists)) | -s(exists,A). [resolve(15,a,12,c)].
% 0.43/1.01 16 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | -s2exact(A) | s(A,B) | -r(A,B). [resolve(6,a,4,b)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(16,d,8,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(16,d,13,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(16,d,14,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | -r1exact(exists) | s(exists,A) | -r(exists,A). [resolve(16,d,15,a)].
% 0.43/1.01 17 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | -s2exact(A) | r(A,B) | -s(A,B). [resolve(6,a,5,b)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(17,d,8,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(17,d,13,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(17,d,14,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | -r1exact(exists) | r(exists,A) | -s(exists,A). [resolve(17,d,15,a)].
% 0.43/1.01 18 -r1exact(A) | -s2exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B). [resolve(7,a,4,b)].
% 0.43/1.01 Derived: -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(18,b,8,a)].
% 0.43/1.01 Derived: -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(18,b,13,a)].
% 0.43/1.01 Derived: -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(18,b,14,a)].
% 0.43/1.01 Derived: -r1exact(exists) | -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A). [resolve(18,b,15,a)].
% 0.43/1.01 19 -r1exact(A) | -s2exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B). [resolve(7,a,5,b)].
% 0.43/1.01 Derived: -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(19,b,8,a)].
% 0.43/1.01 Derived: -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(19,b,13,a)].
% 0.43/1.01 Derived: -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(19,b,14,a)].
% 0.43/1.01 Derived: -r1exact(exists) | -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A). [resolve(19,b,15,a)].
% 0.43/1.01 20 r1exact(A) | -r(A,B) | -equalish(u1r1(B,A),B) # label(clause_10) # label(axiom). [assumption].
% 0.43/1.01 21 r(A,u1r2(A)) | -r1exact(A) # label(clause_9) # label(axiom). [assumption].
% 0.43/1.01 22 equalish(A,u1r2(B)) | -r1exact(B) | -r(B,A) # label(clause_8) # label(axiom). [assumption].
% 0.43/1.01 Derived: -r(A,B) | -equalish(u1r1(B,A),B) | r(A,u1r2(A)). [resolve(20,a,21,b)].
% 0.43/1.01 Derived: -r(A,B) | -equalish(u1r1(B,A),B) | equalish(C,u1r2(A)) | -r(A,C). [resolve(20,a,22,b)].
% 0.43/1.01 23 r1exact(A) | r(A,u1r1(B,A)) | -r(A,B) # label(clause_11) # label(axiom). [assumption].
% 0.43/1.01 Derived: r(A,u1r1(B,A)) | -r(A,B) | r(A,u1r2(A)). [resolve(23,a,21,b)].
% 0.43/1.01 Derived: r(A,u1r1(B,A)) | -r(A,B) | equalish(C,u1r2(A)) | -r(A,C). [resolve(23,a,22,b)].
% 0.43/1.01 24 r1exact(exists). [resolve(3,b,2,a)].
% 0.43/1.01 Derived: r(exists,u1r2(exists)). [resolve(24,a,21,b)].
% 0.43/1.01 Derived: equalish(A,u1r2(exists)) | -r(exists,A). [resolve(24,a,22,b)].
% 0.43/1.01 25 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(16,d,8,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(25,c,20,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(25,c,23,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),C). [resolve(25,c,24,a)].
% 0.43/1.01 26 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(16,d,13,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(26,c,20,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | r(A,u1r1(E,A)) | -r(A,E). [resolve(26,c,23,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),B). [resolve(26,c,24,a)].
% 0.43/1.01 27 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(16,d,14,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(27,c,20,a)].
% 0.43/1.01 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(27,c,23,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | equalish(B,C) | s(exists,u2r1(B,C,exists)) | -s(exists,B) | -s(exists,C). [resolve(27,c,24,a)].
% 0.43/1.01 28 s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | -r1exact(exists) | s(exists,A) | -r(exists,A). [resolve(16,d,15,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | -r(exists,B) | -equalish(u1r1(B,exists),B). [resolve(28,c,20,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | r(exists,u1r1(B,exists)) | -r(exists,B). [resolve(28,c,23,a)].
% 0.43/1.01 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | s(exists,A) | -r(exists,A). [resolve(28,c,24,a)].
% 0.43/1.02 29 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(17,d,8,a)].
% 0.43/1.02 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(29,c,20,a)].
% 0.43/1.02 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(29,c,23,a)].
% 0.43/1.02 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),C). [resolve(29,c,24,a)].
% 0.43/1.02 30 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(17,d,13,a)].
% 0.43/1.02 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(30,c,20,a)].
% 0.43/1.02 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | r(A,u1r1(E,A)) | -r(A,E). [resolve(30,c,23,a)].
% 0.43/1.02 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),B). [resolve(30,c,24,a)].
% 0.43/1.02 31 s(A,u0r1(A)) | r(A,u0r1(A)) | -r1exact(A) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(17,d,14,a)].
% 0.43/1.02 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(31,c,20,a)].
% 0.43/1.02 Derived: s(A,u0r1(A)) | r(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(31,c,23,a)].
% 0.43/1.02 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | equalish(B,C) | s(exists,u2r1(B,C,exists)) | -s(exists,B) | -s(exists,C). [resolve(31,c,24,a)].
% 0.43/1.02 32 s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | -r1exact(exists) | r(exists,A) | -s(exists,A). [resolve(17,d,15,a)].
% 0.43/1.02 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | -r(exists,B) | -equalish(u1r1(B,exists),B). [resolve(32,c,20,a)].
% 0.43/1.02 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | r(exists,u1r1(B,exists)) | -r(exists,B). [resolve(32,c,23,a)].
% 0.43/1.02 Derived: s(exists,u0r1(exists)) | r(exists,u0r1(exists)) | r(exists,A) | -s(exists,A). [resolve(32,c,24,a)].
% 0.43/1.02 33 -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(18,b,8,a)].
% 0.43/1.02 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(33,a,20,a)].
% 0.43/1.02 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(33,a,23,a)].
% 0.43/1.02 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),C). [resolve(33,a,24,a)].
% 0.43/1.02 34 -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(18,b,13,a)].
% 0.43/1.02 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(34,a,20,a)].
% 0.43/1.02 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | r(A,u1r1(E,A)) | -r(A,E). [resolve(34,a,23,a)].
% 0.43/1.02 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),B). [resolve(34,a,24,a)].
% 0.43/1.02 35 -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(18,b,14,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(35,a,20,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | s(A,B) | -r(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(35,a,23,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | equalish(B,C) | s(exists,u2r1(B,C,exists)) | -s(exists,B) | -s(exists,C). [resolve(35,a,24,a)].
% 0.74/1.06 36 -r1exact(exists) | -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A). [resolve(18,b,15,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | -r(exists,B) | -equalish(u1r1(B,exists),B). [resolve(36,a,20,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A) | r(exists,u1r1(B,exists)) | -r(exists,B). [resolve(36,a,23,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | s(exists,A) | -r(exists,A). [resolve(36,a,24,a)].
% 0.74/1.06 37 -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D). [resolve(19,b,8,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(37,a,20,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(37,a,23,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),C). [resolve(37,a,24,a)].
% 0.74/1.06 38 -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C). [resolve(19,b,13,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(38,a,20,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | -s(A,C) | -s(A,D) | -equalish(u2r1(C,D,A),C) | r(A,u1r1(E,A)) | -r(A,E). [resolve(38,a,23,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | equalish(B,C) | -s(exists,B) | -s(exists,C) | -equalish(u2r1(B,C,exists),B). [resolve(38,a,24,a)].
% 0.74/1.06 39 -r1exact(A) | -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D). [resolve(19,b,14,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | -r(A,E) | -equalish(u1r1(E,A),E). [resolve(39,a,20,a)].
% 0.74/1.06 Derived: -r(A,u0r1(A)) | -s(A,u0r1(A)) | r(A,B) | -s(A,B) | equalish(C,D) | s(A,u2r1(C,D,A)) | -s(A,C) | -s(A,D) | r(A,u1r1(E,A)) | -r(A,E). [resolve(39,a,23,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | equalish(B,C) | s(exists,u2r1(B,C,exists)) | -s(exists,B) | -s(exists,C). [resolve(39,a,24,a)].
% 0.74/1.06 40 -r1exact(exists) | -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A). [resolve(19,b,15,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | -r(exists,B) | -equalish(u1r1(B,exists),B). [resolve(40,a,20,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A) | r(exists,u1r1(B,exists)) | -r(exists,B). [resolve(40,a,23,a)].
% 0.74/1.06 Derived: -r(exists,u0r1(exists)) | -s(exists,u0r1(exists)) | r(exists,A) | -s(exists,A). [resolve(40,a,24,a)].
% 0.74/1.06
% 0.74/1.06 ============================== end predicate elimination =============
% 0.74/1.06
% 0.74/1.06 Auto_denials: (non-Horn, no changes).
% 0.74/1.06
% 0.74/1.06 Term ordering decisions:
% 0.74/1.06 Function symbol KB weights: exists=1. u1r1=1. u0r1=1. u2r2=1. u2r3=1. u1r2=1. u2r1=1.
% 0.74/1.06
% 0.74/1.06 ============================== end of process initial clauses ========
% 0.74/1.06
% 0.74/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.06
% 0.74/1.06 ============================== end of clauses for search =============
% 1.22/1.50
% 1.22/1.50 ============================== SEARCH ================================
% 1.22/1.50
% 1.22/1.50 % Starting search at 0.06 seconds.
% 1.22/1.50
% 1.22/1.50 ============================== STATISTICS ============================
% 1.22/1.50
% 1.22/1.50 Given=398. Generated=1379. Kept=413. proofs=0.
% 1.22/1.50 Usable=398. Sos=0. Demods=0. Limbo=0, Disabled=127. Hints=0.
% 1.22/1.50 Megabytes=0.51.
% 1.22/1.50 User_CPU=0.50, System_CPU=0.00, Wall_clock=0.
% 1.22/1.50
% 1.22/1.50 ============================== end of statistics =====================
% 1.22/1.50
% 1.22/1.50 ============================== end of search =========================
% 1.22/1.50
% 1.22/1.50 SEARCH FAILED
% 1.22/1.50
% 1.22/1.50 Exiting with failure.
% 1.22/1.50
% 1.22/1.50 Process 4499 exit (sos_empty) Tue Jun 7 17:53:16 2022
% 1.22/1.50 Prover9 interrupted
%------------------------------------------------------------------------------