TSTP Solution File: KRS009-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS009-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:45 EDT 2022
% Result : Unknown 0.71s 1.06s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS009-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n025.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jun 7 07:54:33 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.67/0.99 ============================== Prover9 ===============================
% 0.67/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.99 Process 29180 was started by sandbox2 on n025.cluster.edu,
% 0.67/0.99 Tue Jun 7 07:54:34 2022
% 0.67/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_28835_n025.cluster.edu".
% 0.67/0.99 ============================== end of head ===========================
% 0.67/0.99
% 0.67/0.99 ============================== INPUT =================================
% 0.67/0.99
% 0.67/0.99 % Reading from file /tmp/Prover9_28835_n025.cluster.edu
% 0.67/0.99
% 0.67/0.99 set(prolog_style_variables).
% 0.67/0.99 set(auto2).
% 0.67/0.99 % set(auto2) -> set(auto).
% 0.67/0.99 % set(auto) -> set(auto_inference).
% 0.67/0.99 % set(auto) -> set(auto_setup).
% 0.67/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.99 % set(auto) -> set(auto_limits).
% 0.67/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.99 % set(auto) -> set(auto_denials).
% 0.67/0.99 % set(auto) -> set(auto_process).
% 0.67/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.99 % set(auto2) -> assign(stats, some).
% 0.67/0.99 % set(auto2) -> clear(echo_input).
% 0.67/0.99 % set(auto2) -> set(quiet).
% 0.67/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.99 % set(auto2) -> clear(print_given).
% 0.67/0.99 assign(lrs_ticks,-1).
% 0.67/0.99 assign(sos_limit,10000).
% 0.67/0.99 assign(order,kbo).
% 0.67/0.99 set(lex_order_vars).
% 0.67/0.99 clear(print_given).
% 0.67/0.99
% 0.67/0.99 % formulas(sos). % not echoed (41 formulas)
% 0.67/0.99
% 0.67/0.99 ============================== end of input ==========================
% 0.67/0.99
% 0.67/0.99 % From the command line: assign(max_seconds, 300).
% 0.67/0.99
% 0.67/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.99
% 0.67/0.99 % Formulas that are not ordinary clauses:
% 0.67/0.99
% 0.67/0.99 ============================== end of process non-clausal formulas ===
% 0.67/0.99
% 0.67/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.99
% 0.67/0.99 ============================== PREDICATE ELIMINATION =================
% 0.67/0.99 1 s1most(A) | -e(A) # label(clause_21) # label(axiom). [assumption].
% 0.67/0.99 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.67/0.99 Derived: s1most(exist). [resolve(1,b,2,a)].
% 0.67/0.99 3 r1most(A) | -e(A) # label(clause_22) # label(axiom). [assumption].
% 0.67/0.99 Derived: r1most(exist). [resolve(3,b,2,a)].
% 0.67/0.99 4 t3least(A) | -e(A) # label(clause_23) # label(axiom). [assumption].
% 0.67/0.99 Derived: t3least(exist). [resolve(4,b,2,a)].
% 0.67/0.99 5 a(A) | -e(B) | -t(B,A) # label(clause_24) # label(axiom). [assumption].
% 0.67/0.99 Derived: a(A) | -t(exist,A). [resolve(5,b,2,a)].
% 0.67/0.99 6 e(A) | -a(u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) # label(clause_25) # label(axiom). [assumption].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) | a(B) | -t(A,B). [resolve(6,a,5,b)].
% 0.67/0.99 7 e(A) | t(A,u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) # label(clause_26) # label(axiom). [assumption].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) | a(B) | -t(A,B). [resolve(7,a,5,b)].
% 0.67/0.99 8 d(A) | -p1most(A) # label(clause_9) # label(axiom). [assumption].
% 0.67/0.99 9 p1most(A) | p(A,u3r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.67/0.99 10 p1most(A) | p(A,u3r2(A)) # label(clause_13) # label(axiom). [assumption].
% 0.67/0.99 11 p1most(A) | -d(A) # label(clause_8) # label(axiom). [assumption].
% 0.67/0.99 Derived: d(A) | p(A,u3r1(A)). [resolve(8,b,9,a)].
% 0.67/0.99 Derived: d(A) | p(A,u3r2(A)). [resolve(8,b,10,a)].
% 0.67/0.99 12 p1most(A) | -equalish(u3r2(A),u3r1(A)) # label(clause_11) # label(axiom). [assumption].
% 0.67/0.99 Derived: -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(12,a,8,b)].
% 0.67/0.99 13 equalish(A,B) | -p1most(C) | -p(C,A) | -p(C,B) # label(clause_10) # label(axiom). [assumption].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | p(C,u3r1(C)). [resolve(13,b,9,a)].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | p(C,u3r2(C)). [resolve(13,b,10,a)].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | -d(C). [resolve(13,b,11,a)].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | -equalish(u3r2(C),u3r1(C)). [resolve(13,b,12,a)].
% 0.67/0.99 14 equalish(A,B) | -r1most(C) | -r(C,A) | -r(C,B) # label(clause_34) # label(axiom). [assumption].
% 0.67/0.99 15 r1most(A) | r(A,u9r1(A)) # label(clause_36) # label(axiom). [assumption].
% 0.67/0.99 16 r1most(A) | r(A,u9r2(A)) # label(clause_37) # label(axiom). [assumption].
% 0.67/0.99 17 r1most(A) | -equalish(u9r2(A),u9r1(A)) # label(clause_35) # label(axiom). [assumption].
% 0.67/0.99 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | r(C,u9r1(C)). [resolve(14,b,15,a)].
% 0.67/0.99 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | r(C,u9r2(C)). [resolve(14,b,16,a)].
% 0.67/0.99 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -equalish(u9r2(C),u9r1(C)). [resolve(14,b,17,a)].
% 0.67/0.99 18 r1most(exist). [resolve(3,b,2,a)].
% 0.67/0.99 Derived: equalish(A,B) | -r(exist,A) | -r(exist,B). [resolve(18,a,14,b)].
% 0.67/0.99 19 -a(u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) | a(B) | -t(A,B). [resolve(6,a,5,b)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r1(A)). [resolve(19,c,15,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r2(A)). [resolve(19,c,16,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)). [resolve(19,c,17,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | -s1most(exist) | a(A) | -t(exist,A). [resolve(19,c,18,a)].
% 0.67/0.99 20 t(A,u7r1(A)) | -t3least(A) | -r1most(A) | -s1most(A) | a(B) | -t(A,B). [resolve(7,a,5,b)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r1(A)). [resolve(20,c,15,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r2(A)). [resolve(20,c,16,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)). [resolve(20,c,17,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | -s1most(exist) | a(A) | -t(exist,A). [resolve(20,c,18,a)].
% 0.67/0.99 21 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_38) # label(axiom). [assumption].
% 0.67/0.99 22 s1most(A) | s(A,u10r1(A)) # label(clause_40) # label(axiom). [assumption].
% 0.67/0.99 23 s1most(A) | s(A,u10r2(A)) # label(clause_41) # label(axiom). [assumption].
% 0.67/0.99 24 s1most(A) | -equalish(u10r2(A),u10r1(A)) # label(clause_39) # label(axiom). [assumption].
% 0.67/0.99 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u10r1(C)). [resolve(21,b,22,a)].
% 0.67/0.99 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u10r2(C)). [resolve(21,b,23,a)].
% 0.67/0.99 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u10r2(C),u10r1(C)). [resolve(21,b,24,a)].
% 0.67/0.99 25 s1most(exist). [resolve(1,b,2,a)].
% 0.67/0.99 Derived: equalish(A,B) | -s(exist,A) | -s(exist,B). [resolve(25,a,21,b)].
% 0.67/0.99 26 -a(u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r1(A)). [resolve(19,c,15,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r1(A)). [resolve(26,c,22,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r2(A)). [resolve(26,c,23,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(26,c,24,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r1(exist)). [resolve(26,c,25,a)].
% 0.67/0.99 27 -a(u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r2(A)). [resolve(19,c,16,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r1(A)). [resolve(27,c,22,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r2(A)). [resolve(27,c,23,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(27,c,24,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r2(exist)). [resolve(27,c,25,a)].
% 0.67/0.99 28 -a(u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)). [resolve(19,c,17,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r1(A)). [resolve(28,c,22,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r2(A)). [resolve(28,c,23,a)].
% 0.67/0.99 Derived: -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(28,c,24,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)). [resolve(28,c,25,a)].
% 0.67/0.99 29 -a(u7r1(exist)) | -t3least(exist) | -s1most(exist) | a(A) | -t(exist,A). [resolve(19,c,18,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r1(exist)). [resolve(29,c,22,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r2(exist)). [resolve(29,c,23,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)). [resolve(29,c,24,a)].
% 0.67/0.99 Derived: -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A). [resolve(29,c,25,a)].
% 0.67/0.99 30 t(A,u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r1(A)). [resolve(20,c,15,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r1(A)). [resolve(30,c,22,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r2(A)). [resolve(30,c,23,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(30,c,24,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r1(exist)). [resolve(30,c,25,a)].
% 0.67/0.99 31 t(A,u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | r(A,u9r2(A)). [resolve(20,c,16,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r1(A)). [resolve(31,c,22,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r2(A)). [resolve(31,c,23,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(31,c,24,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r2(exist)). [resolve(31,c,25,a)].
% 0.67/0.99 32 t(A,u7r1(A)) | -t3least(A) | -s1most(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)). [resolve(20,c,17,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r1(A)). [resolve(32,c,22,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r2(A)). [resolve(32,c,23,a)].
% 0.67/0.99 Derived: t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(32,c,24,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)). [resolve(32,c,25,a)].
% 0.67/0.99 33 t(exist,u7r1(exist)) | -t3least(exist) | -s1most(exist) | a(A) | -t(exist,A). [resolve(20,c,18,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r1(exist)). [resolve(33,c,22,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r2(exist)). [resolve(33,c,23,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)). [resolve(33,c,24,a)].
% 0.67/0.99 Derived: t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A). [resolve(33,c,25,a)].
% 0.67/0.99 34 p2least(A) | -c(A) # label(clause_2) # label(axiom). [assumption].
% 0.67/0.99 35 -p2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_4) # label(axiom). [assumption].
% 0.67/0.99 Derived: -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(34,a,35,a)].
% 0.67/0.99 36 c(A) | -p2least(A) # label(clause_3) # label(axiom). [assumption].
% 0.67/0.99 37 p(A,u1r1(A)) | -p2least(A) # label(clause_5) # label(axiom). [assumption].
% 0.67/0.99 Derived: p(A,u1r1(A)) | -c(A). [resolve(37,b,34,a)].
% 0.67/0.99 38 p(A,u1r2(A)) | -p2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.67/0.99 Derived: p(A,u1r2(A)) | -c(A). [resolve(38,b,34,a)].
% 0.67/0.99 39 p2least(A) | equalish(B,C) | -p(A,B) | -p(A,C) # label(clause_7) # label(axiom). [assumption].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(39,a,35,a)].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | c(C). [resolve(39,a,36,b)].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | p(C,u1r1(C)). [resolve(39,a,37,b)].
% 0.67/0.99 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | p(C,u1r2(C)). [resolve(39,a,38,b)].
% 0.67/1.00 40 t3least(A) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(A,B) | -t(A,C) | -t(A,D) # label(clause_33) # label(axiom). [assumption].
% 0.67/1.00 41 -t3least(A) | -equalish(u8r2(A),u8r1(A)) # label(clause_27) # label(axiom). [assumption].
% 0.67/1.00 42 -t3least(A) | -equalish(u8r3(A),u8r1(A)) # label(clause_28) # label(axiom). [assumption].
% 0.67/1.00 43 -t3least(A) | -equalish(u8r3(A),u8r2(A)) # label(clause_29) # label(axiom). [assumption].
% 0.67/1.00 44 t(A,u8r1(A)) | -t3least(A) # label(clause_30) # label(axiom). [assumption].
% 0.67/1.00 45 t(A,u8r2(A)) | -t3least(A) # label(clause_31) # label(axiom). [assumption].
% 0.67/1.00 46 t(A,u8r3(A)) | -t3least(A) # label(clause_32) # label(axiom). [assumption].
% 0.67/1.00 Derived: equalish(A,B) | equalish(A,C) | equalish(B,C) | -t(D,A) | -t(D,B) | -t(D,C) | -equalish(u8r2(D),u8r1(D)). [resolve(40,a,41,a)].
% 0.67/1.00 Derived: equalish(A,B) | equalish(A,C) | equalish(B,C) | -t(D,A) | -t(D,B) | -t(D,C) | -equalish(u8r3(D),u8r1(D)). [resolve(40,a,42,a)].
% 0.67/1.00 Derived: equalish(A,B) | equalish(A,C) | equalish(B,C) | -t(D,A) | -t(D,B) | -t(D,C) | -equalish(u8r3(D),u8r2(D)). [resolve(40,a,43,a)].
% 0.67/1.00 Derived: equalish(A,B) | equalish(A,C) | equalish(B,C) | -t(D,A) | -t(D,B) | -t(D,C) | t(D,u8r1(D)). [resolve(40,a,44,b)].
% 0.67/1.00 Derived: equalish(A,B) | equalish(A,C) | equalish(B,C) | -t(D,A) | -t(D,B) | -t(D,C) | t(D,u8r2(D)). [resolve(40,a,45,b)].
% 0.67/1.00 Derived: equalish(A,B) | equalish(A,C) | equalish(B,C) | -t(D,A) | -t(D,B) | -t(D,C) | t(D,u8r3(D)). [resolve(40,a,46,b)].
% 0.67/1.00 47 t3least(exist). [resolve(4,b,2,a)].
% 0.67/1.00 Derived: -equalish(u8r2(exist),u8r1(exist)). [resolve(47,a,41,a)].
% 0.67/1.00 Derived: -equalish(u8r3(exist),u8r1(exist)). [resolve(47,a,42,a)].
% 0.67/1.00 Derived: -equalish(u8r3(exist),u8r2(exist)). [resolve(47,a,43,a)].
% 0.67/1.00 Derived: t(exist,u8r1(exist)). [resolve(47,a,44,b)].
% 0.67/1.00 Derived: t(exist,u8r2(exist)). [resolve(47,a,45,b)].
% 0.67/1.00 Derived: t(exist,u8r3(exist)). [resolve(47,a,46,b)].
% 0.67/1.00 48 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r1(A)). [resolve(26,c,22,a)].
% 0.67/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(48,b,40,a)].
% 0.67/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | s(exist,u10r1(exist)). [resolve(48,b,47,a)].
% 0.67/1.00 49 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r2(A)). [resolve(26,c,23,a)].
% 0.67/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r2(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(49,b,40,a)].
% 0.67/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | s(exist,u10r2(exist)). [resolve(49,b,47,a)].
% 0.67/1.00 50 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(26,c,24,a)].
% 0.67/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | r(A,u9r1(A)) | -equalish(u10r2(A),u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(50,b,40,a)].
% 0.67/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | -equalish(u10r2(exist),u10r1(exist)). [resolve(50,b,47,a)].
% 0.67/1.00 51 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r1(exist)). [resolve(26,c,25,a)].
% 0.67/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(51,b,40,a)].
% 0.67/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)). [resolve(51,b,47,a)].
% 0.67/1.00 52 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r1(A)). [resolve(27,c,22,a)].
% 0.67/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(52,b,40,a)].
% 0.67/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | s(exist,u10r1(exist)). [resolve(52,b,47,a)].
% 0.67/1.00 53 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r2(A)). [resolve(27,c,23,a)].
% 0.67/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r2(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(53,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | s(exist,u10r2(exist)). [resolve(53,b,47,a)].
% 0.71/1.00 54 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(27,c,24,a)].
% 0.71/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | r(A,u9r2(A)) | -equalish(u10r2(A),u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(54,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | -equalish(u10r2(exist),u10r1(exist)). [resolve(54,b,47,a)].
% 0.71/1.00 55 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r2(exist)). [resolve(27,c,25,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(55,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)). [resolve(55,b,47,a)].
% 0.71/1.00 56 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r1(A)). [resolve(28,c,22,a)].
% 0.71/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(56,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | s(exist,u10r1(exist)). [resolve(56,b,47,a)].
% 0.71/1.00 57 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r2(A)). [resolve(28,c,23,a)].
% 0.71/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r2(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(57,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | s(exist,u10r2(exist)). [resolve(57,b,47,a)].
% 0.71/1.00 58 -a(u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(28,c,24,a)].
% 0.71/1.00 Derived: -a(u7r1(A)) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | -equalish(u10r2(A),u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(58,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | -equalish(u10r2(exist),u10r1(exist)). [resolve(58,b,47,a)].
% 0.71/1.00 59 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)). [resolve(28,c,25,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(59,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)). [resolve(59,b,47,a)].
% 0.71/1.00 60 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r1(exist)). [resolve(29,c,22,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(60,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r1(exist)). [resolve(60,b,47,a)].
% 0.71/1.00 61 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r2(exist)). [resolve(29,c,23,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r2(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(61,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r2(exist)). [resolve(61,b,47,a)].
% 0.71/1.00 62 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)). [resolve(29,c,24,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(62,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)). [resolve(62,b,47,a)].
% 0.71/1.00 63 -a(u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A). [resolve(29,c,25,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(63,b,40,a)].
% 0.71/1.00 Derived: -a(u7r1(exist)) | a(A) | -t(exist,A). [resolve(63,b,47,a)].
% 0.71/1.00 64 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r1(A)). [resolve(30,c,22,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(64,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | s(exist,u10r1(exist)). [resolve(64,b,47,a)].
% 0.71/1.00 65 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r2(A)). [resolve(30,c,23,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | r(A,u9r1(A)) | s(A,u10r2(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(65,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | s(exist,u10r2(exist)). [resolve(65,b,47,a)].
% 0.71/1.00 66 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(30,c,24,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | r(A,u9r1(A)) | -equalish(u10r2(A),u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(66,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | -equalish(u10r2(exist),u10r1(exist)). [resolve(66,b,47,a)].
% 0.71/1.00 67 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r1(exist)). [resolve(30,c,25,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(67,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r1(exist)). [resolve(67,b,47,a)].
% 0.71/1.00 68 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r1(A)). [resolve(31,c,22,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(68,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | s(exist,u10r1(exist)). [resolve(68,b,47,a)].
% 0.71/1.00 69 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r2(A)). [resolve(31,c,23,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | r(A,u9r2(A)) | s(A,u10r2(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(69,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | s(exist,u10r2(exist)). [resolve(69,b,47,a)].
% 0.71/1.00 70 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | r(A,u9r2(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(31,c,24,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | r(A,u9r2(A)) | -equalish(u10r2(A),u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(70,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | -equalish(u10r2(exist),u10r1(exist)). [resolve(70,b,47,a)].
% 0.71/1.00 71 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | r(exist,u9r2(exist)). [resolve(31,c,25,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(71,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | r(exist,u9r2(exist)). [resolve(71,b,47,a)].
% 0.71/1.00 72 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r1(A)). [resolve(32,c,22,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(72,b,40,a)].
% 0.71/1.00 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | s(exist,u10r1(exist)). [resolve(72,b,47,a)].
% 0.71/1.00 73 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r2(A)). [resolve(32,c,23,a)].
% 0.71/1.00 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | s(A,u10r2(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(73,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | s(exist,u10r2(exist)). [resolve(73,b,47,a)].
% 0.71/1.01 74 t(A,u7r1(A)) | -t3least(A) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | -equalish(u10r2(A),u10r1(A)). [resolve(32,c,24,a)].
% 0.71/1.01 Derived: t(A,u7r1(A)) | a(B) | -t(A,B) | -equalish(u9r2(A),u9r1(A)) | -equalish(u10r2(A),u10r1(A)) | equalish(C,D) | equalish(C,E) | equalish(D,E) | -t(A,C) | -t(A,D) | -t(A,E). [resolve(74,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | -equalish(u10r2(exist),u10r1(exist)). [resolve(74,b,47,a)].
% 0.71/1.01 75 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)). [resolve(32,c,25,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(75,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u9r2(exist),u9r1(exist)). [resolve(75,b,47,a)].
% 0.71/1.01 76 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r1(exist)). [resolve(33,c,22,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(76,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r1(exist)). [resolve(76,b,47,a)].
% 0.71/1.01 77 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | s(exist,u10r2(exist)). [resolve(33,c,23,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r2(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(77,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | s(exist,u10r2(exist)). [resolve(77,b,47,a)].
% 0.71/1.01 78 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)). [resolve(33,c,24,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(78,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | -equalish(u10r2(exist),u10r1(exist)). [resolve(78,b,47,a)].
% 0.71/1.01 79 t(exist,u7r1(exist)) | -t3least(exist) | a(A) | -t(exist,A). [resolve(33,c,25,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A) | equalish(B,C) | equalish(B,D) | equalish(C,D) | -t(exist,B) | -t(exist,C) | -t(exist,D). [resolve(79,b,40,a)].
% 0.71/1.01 Derived: t(exist,u7r1(exist)) | a(A) | -t(exist,A). [resolve(79,b,47,a)].
% 0.71/1.01 80 d(A) | -s(B,A) # label(clause_19) # label(axiom). [assumption].
% 0.71/1.01 81 a(A) | -d(A) # label(clause_15) # label(axiom). [assumption].
% 0.71/1.01 Derived: -s(A,B) | a(B). [resolve(80,a,81,b)].
% 0.71/1.01 82 c(A) | d(A) | -a(A) # label(clause_14) # label(axiom). [assumption].
% 0.71/1.01 83 d(A) | p(A,u3r1(A)). [resolve(8,b,9,a)].
% 0.71/1.01 Derived: p(A,u3r1(A)) | a(A). [resolve(83,a,81,b)].
% 0.71/1.01 84 d(A) | p(A,u3r2(A)). [resolve(8,b,10,a)].
% 0.71/1.01 Derived: p(A,u3r2(A)) | a(A). [resolve(84,a,81,b)].
% 0.71/1.01 85 -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(12,a,8,b)].
% 0.71/1.01 Derived: -equalish(u3r2(A),u3r1(A)) | a(A). [resolve(85,b,81,b)].
% 0.71/1.01 86 equalish(A,B) | -p(C,A) | -p(C,B) | -d(C). [resolve(13,b,11,a)].
% 0.71/1.01 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | -s(D,C). [resolve(86,d,80,a)].
% 0.71/1.01 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | p(C,u3r1(C)). [resolve(86,d,83,a)].
% 0.71/1.01 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | p(C,u3r2(C)). [resolve(86,d,84,a)].
% 0.71/1.01 87 c(A) | -r(B,A) # label(clause_17) # label(axiom). [assumption].
% 0.71/1.01 88 a(A) | -c(A) # label(clause_16) # label(axiom). [assumption].
% 0.71/1.01 Derived: -r(A,B) | a(B). [resolve(87,a,88,b)].
% 0.71/1.01 89 -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(34,a,35,a)].
% 0.71/1.01 Derived: -equalish(u1r2(A),u1r1(A)) | -r(B,A). [resolve(89,a,87,a)].
% 0.71/1.01 90 p(A,u1r1(A)) | -c(A). [resolve(37,b,34,a)].
% 0.71/1.01 Derived: p(A,u1r1(A)) | -r(B,A). [resolve(90,b,87,a)].
% 0.71/1.01 91 p(A,u1r2(A)) | -c(A). [resolve(38,b,34,a)].
% 0.71/1.01 Derived: p(A,u1r2(A)) | -r(B,A). [resolve(91,b,87,a)].
% 0.71/1.06 92 equalish(A,B) | -p(C,A) | -p(C,B) | c(C). [resolve(39,a,36,b)].
% 0.71/1.06 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | a(C). [resolve(92,d,88,b)].
% 0.71/1.06 Derived: equalish(A,B) | -p(C,A) | -p(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(92,d,89,a)].
% 0.71/1.06
% 0.71/1.06 ============================== end predicate elimination =============
% 0.71/1.06
% 0.71/1.06 Auto_denials: (non-Horn, no changes).
% 0.71/1.06
% 0.71/1.06 Term ordering decisions:
% 0.71/1.06 Function symbol KB weights: exist=1. u7r1=1. u10r1=1. u10r2=1. u9r1=1. u9r2=1. u3r1=1. u3r2=1. u1r1=1. u1r2=1. u8r1=1. u8r2=1. u8r3=1.
% 0.71/1.06
% 0.71/1.06 ============================== end of process initial clauses ========
% 0.71/1.06
% 0.71/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.71/1.06
% 0.71/1.06 ============================== end of clauses for search =============
% 0.71/1.06
% 0.71/1.06 ============================== SEARCH ================================
% 0.71/1.06
% 0.71/1.06 % Starting search at 0.06 seconds.
% 0.71/1.06
% 0.71/1.06 ============================== STATISTICS ============================
% 0.71/1.06
% 0.71/1.06 Given=177. Generated=1220. Kept=222. proofs=0.
% 0.71/1.06 Usable=54. Sos=0. Demods=0. Limbo=0, Disabled=366. Hints=0.
% 0.71/1.06 Megabytes=0.33.
% 0.71/1.06 User_CPU=0.08, System_CPU=0.00, Wall_clock=0.
% 0.71/1.06
% 0.71/1.06 ============================== end of statistics =====================
% 0.71/1.06
% 0.71/1.06 ============================== end of search =========================
% 0.71/1.06
% 0.71/1.06 SEARCH FAILED
% 0.71/1.06
% 0.71/1.06 Exiting with failure.
% 0.71/1.06
% 0.71/1.06 Process 29180 exit (sos_empty) Tue Jun 7 07:54:34 2022
% 0.71/1.06 Prover9 interrupted
%------------------------------------------------------------------------------