TSTP Solution File: SWV771-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV771-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n009.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 : Wed Jul 20 21:14:45 EDT 2022
% Result : Timeout 300.07s 300.32s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV771-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n009.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 15 01:34:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.85/1.14 ============================== Prover9 ===============================
% 0.85/1.14 Prover9 (32) version 2009-11A, November 2009.
% 0.85/1.14 Process 1564 was started by sandbox on n009.cluster.edu,
% 0.85/1.14 Wed Jun 15 01:34:23 2022
% 0.85/1.14 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1409_n009.cluster.edu".
% 0.85/1.14 ============================== end of head ===========================
% 0.85/1.14
% 0.85/1.14 ============================== INPUT =================================
% 0.85/1.14
% 0.85/1.14 % Reading from file /tmp/Prover9_1409_n009.cluster.edu
% 0.85/1.14
% 0.85/1.14 set(prolog_style_variables).
% 0.85/1.14 set(auto2).
% 0.85/1.14 % set(auto2) -> set(auto).
% 0.85/1.14 % set(auto) -> set(auto_inference).
% 0.85/1.14 % set(auto) -> set(auto_setup).
% 0.85/1.14 % set(auto_setup) -> set(predicate_elim).
% 0.85/1.14 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.85/1.14 % set(auto) -> set(auto_limits).
% 0.85/1.14 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.85/1.14 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.85/1.14 % set(auto) -> set(auto_denials).
% 0.85/1.14 % set(auto) -> set(auto_process).
% 0.85/1.14 % set(auto2) -> assign(new_constants, 1).
% 0.85/1.14 % set(auto2) -> assign(fold_denial_max, 3).
% 0.85/1.14 % set(auto2) -> assign(max_weight, "200.000").
% 0.85/1.14 % set(auto2) -> assign(max_hours, 1).
% 0.85/1.14 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.85/1.14 % set(auto2) -> assign(max_seconds, 0).
% 0.85/1.14 % set(auto2) -> assign(max_minutes, 5).
% 0.85/1.14 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.85/1.14 % set(auto2) -> set(sort_initial_sos).
% 0.85/1.14 % set(auto2) -> assign(sos_limit, -1).
% 0.85/1.14 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.85/1.14 % set(auto2) -> assign(max_megs, 400).
% 0.85/1.14 % set(auto2) -> assign(stats, some).
% 0.85/1.14 % set(auto2) -> clear(echo_input).
% 0.85/1.14 % set(auto2) -> set(quiet).
% 0.85/1.14 % set(auto2) -> clear(print_initial_clauses).
% 0.85/1.14 % set(auto2) -> clear(print_given).
% 0.85/1.14 assign(lrs_ticks,-1).
% 0.85/1.14 assign(sos_limit,10000).
% 0.85/1.14 assign(order,kbo).
% 0.85/1.14 set(lex_order_vars).
% 0.85/1.14 clear(print_given).
% 0.85/1.14
% 0.85/1.14 % formulas(sos). % not echoed (450 formulas)
% 0.85/1.14
% 0.85/1.14 ============================== end of input ==========================
% 0.85/1.14
% 0.85/1.14 % From the command line: assign(max_seconds, 300).
% 0.85/1.14
% 0.85/1.14 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.85/1.14
% 0.85/1.14 % Formulas that are not ordinary clauses:
% 0.85/1.14
% 0.85/1.14 ============================== end of process non-clausal formulas ===
% 0.85/1.14
% 0.85/1.14 ============================== PROCESS INITIAL CLAUSES ===============
% 0.85/1.14
% 0.85/1.14 ============================== PREDICATE ELIMINATION =================
% 0.85/1.14 1 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom). [assumption].
% 0.85/1.14 2 -class_Orderings_Olinorder(A) | c_List_Odistinct(B,C) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(D,E,B,C,A),C) # label(cls_distinct__insort_1) # label(axiom). [assumption].
% 0.85/1.14 3 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,C,A) | c_lessequals(C,B,A) # label(cls_linorder__not__le_0) # label(axiom). [assumption].
% 0.85/1.14 4 -class_Orderings_Olinorder(A) | -c_lessequals(B,C,A) | -c_HOL_Oord__class_Oless(C,B,A) # label(cls_linorder__not__le_1) # label(axiom). [assumption].
% 0.85/1.14 5 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | c_HOL_Oord__class_Oless(C,B,A) # label(cls_linorder__not__less_0) # label(axiom). [assumption].
% 0.85/1.14 6 -class_Orderings_Olinorder(A) | -c_HOL_Oord__class_Oless(B,C,A) | -c_lessequals(C,B,A) # label(cls_linorder__not__less_1) # label(axiom). [assumption].
% 0.85/1.14 7 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,B,A) | c_lessequals(B,B,A) # label(cls_linorder__antisym__conv1_1) # label(axiom). [assumption].
% 0.85/1.14 8 -class_Orderings_Olinorder(A) | -c_lessequals(B,B,A) | -c_HOL_Oord__class_Oless(B,B,A) # label(cls_linorder__antisym__conv2_1) # label(axiom). [assumption].
% 0.85/1.14 9 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,C,A) | c_lessequals(C,B,A) # label(cls_not__leE_0) # label(axiom). [assumption].
% 0.85/1.14 10 -class_Orderings_Olinorder(A) | -c_HOL_Oord__class_Oless(B,B,A) # label(cls_linorder__neq__iff_1) # label(axiom). [assumption].
% 0.85/1.14 11 -class_Orderings_Olinorder(A) | B = C | c_HOL_Oord__class_Oless(C,B,A) | c_HOL_Oord__class_Oless(B,C,A) # label(cls_not__less__iff__gr__or__eq_0) # label(axiom). [assumption].
% 0.85/1.14 12 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,C,A) | c_HOL_Oord__class_Oless(C,B,A) | C = B # label(cls_linorder__neqE_0) # label(axiom). [assumption].
% 0.85/1.14 13 -class_Orderings_Olinorder(A) | c_HOL_Oord__class_Oless(B,C,A) | C = B | c_HOL_Oord__class_Oless(C,B,A) # label(cls_linorder__less__linear_0) # label(axiom). [assumption].
% 0.85/1.14 14 -class_Orderings_Olinorder(A) | B = C | c_HOL_Oord__class_Oless(B,C,A) | c_HOL_Oord__class_Oless(C,B,A) # label(cls_linorder__antisym__conv3_0) # label(axiom). [assumption].
% 0.85/1.14 15 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oremdups(B,A),A) | -c_List_Olinorder__class_Osorted(B,A) # label(cls_sorted__remdups_0) # label(axiom). [assumption].
% 0.85/1.14 16 -class_Orderings_Olinorder(A) | B = C | -c_lessequals(B,C,A) | c_HOL_Oord__class_Oless(B,C,A) # label(cls_linorder__antisym__conv1_0) # label(axiom). [assumption].
% 0.85/1.14 17 -class_Orderings_Olinorder(A) | B = C | c_HOL_Oord__class_Oless(B,C,A) | -c_lessequals(B,C,A) # label(cls_linorder__antisym__conv2_0) # label(axiom). [assumption].
% 0.85/1.14 18 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_OdropWhile(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__dropWhile_0) # label(axiom). [assumption].
% 0.85/1.14 19 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oremove1(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__remove1_0) # label(axiom). [assumption].
% 0.85/1.14 20 -class_Orderings_Olinorder(A) | -c_HOL_Oord__class_Oless(B,C,A) | -c_HOL_Oord__class_Oless(C,B,A) # label(cls_not__less__iff__gr__or__eq_1) # label(axiom). [assumption].
% 0.85/1.14 21 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) | -c_lessequals(c_List_Osko__List__Xlinorder__class__Xsorted__append__1__1(B,C,A),c_List_Osko__List__Xlinorder__class__Xsorted__append__1__2(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) | -c_List_Olinorder__class_Osorted(B,A) # label(cls_sorted__append_5) # label(axiom). [assumption].
% 0.85/1.14 22 -class_Orderings_Olinorder(A) | c_List_Oset(B,A) != c_List_Oset(C,A) | -c_List_Odistinct(C,A) | -c_List_Olinorder__class_Osorted(C,A) | -c_List_Odistinct(B,A) | -c_List_Olinorder__class_Osorted(B,A) | B = C # label(cls_sorted__distinct__set__unique_0) # label(axiom). [assumption].
% 0.85/1.14 23 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_ONil(A),A) # label(cls_sorted_Osimps_I1_J_0) # label(axiom). [assumption].
% 0.85/1.14 24 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(C,B,A),A) # label(cls_sorted__append_1) # label(axiom). [assumption].
% 0.85/1.14 25 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) # label(cls_sorted__append_0) # label(axiom). [assumption].
% 0.85/1.14 26 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,D,E,A) = c_List_Olist_OCons(C,D,E) | c_in(c_List_Osko__List__Xlinorder__class__Xinsort__is__Cons__1__1(C,B,D,E,A),c_List_Oset(D,E),E) # label(cls_insort__is__Cons_0) # label(axiom). [assumption].
% 0.85/1.14 27 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) | c_in(c_List_Osko__List__Xlinorder__class__Xsorted__append__1__2(B,C,A),c_List_Oset(C,A),A) | -c_List_Olinorder__class_Osorted(C,A) | -c_List_Olinorder__class_Osorted(B,A) # label(cls_sorted__append_4) # label(axiom). [assumption].
% 0.85/1.14 28 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) | c_in(c_List_Osko__List__Xlinorder__class__Xsorted__append__1__1(B,C,A),c_List_Oset(B,A),A) | -c_List_Olinorder__class_Osorted(C,A) | -c_List_Olinorder__class_Osorted(B,A) # label(cls_sorted__append_3) # label(axiom). [assumption].
% 0.85/1.14 29 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A) | c_in(c_List_Osko__List__Xlinorder__class__Xsorted__Cons__1__1(B,C,A),c_List_Oset(C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__Cons_2) # label(axiom). [assumption].
% 0.85/1.14 30 -class_Orderings_Olinorder(A) | -c_in(B,c_List_Oset(C,D),D) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(E,B,C,D,A),D) # label(cls_distinct__insort_0) # label(axiom). [assumption].
% 0.85/1.14 31 -class_Orderings_Olinorder(A) | c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(B,C,D,E,A),E) | -c_List_Odistinct(D,E) | c_in(C,c_List_Oset(D,E),E) # label(cls_distinct__insort_2) # label(axiom). [assumption].
% 0.85/1.14 32 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,D,E,A) = c_List_Olist_OCons(C,D,E) | -c_lessequals(hAPP(B,C),hAPP(B,c_List_Osko__List__Xlinorder__class__Xinsort__is__Cons__1__1(C,B,D,E,A)),A) # label(cls_insort__is__Cons_1) # label(axiom). [assumption].
% 0.85/1.14 33 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A) | -c_lessequals(B,c_List_Osko__List__Xlinorder__class__Xsorted__Cons__1__1(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__Cons_3) # label(axiom). [assumption].
% 0.85/1.14 34 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,B,A),A) # label(cls_sorted__Cons_0) # label(axiom). [assumption].
% 0.85/1.14 35 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(D,c_List_Olist_OCons(B,C,A),A),A) # label(cls_sorted_Osimps_I3_J_1) # label(axiom). [assumption].
% 0.85/1.14 36 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_in(C,c_List_Oset(D,A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,D,A),A) # label(cls_sorted__Cons_1) # label(axiom). [assumption].
% 0.85/1.14 37 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_OtakeWhile(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__takeWhile_0) # label(axiom). [assumption].
% 0.85/1.14 38 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,c_List_Olist_OCons(D,E,F),F,A) = c_List_Olist_OCons(C,c_List_Olist_OCons(D,E,F),F) | -c_lessequals(hAPP(B,C),hAPP(B,D),A) # label(cls_insort__key_Osimps_I2_J_0) # label(axiom). [assumption].
% 0.85/1.14 39 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_in(C,c_List_Oset(D,A),A) | -c_in(B,c_List_Oset(E,A),A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(E,D,A),A) # label(cls_sorted__append_2) # label(axiom). [assumption].
% 0.85/1.14 40 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,c_List_Olist_OCons(D,E,F),F,A) = c_List_Olist_OCons(D,c_List_Olinorder__class_Oinsort__key(B,C,E,F,A),F) | c_lessequals(hAPP(B,C),hAPP(B,D),A) # label(cls_insort__key_Osimps_I2_J_1) # label(axiom). [assumption].
% 0.85/1.14 41 -class_Orderings_Olinorder(A) | c_List_Oset(c_List_Olinorder__class_Oinsort__key(B,C,D,E,A),E) = c_Set_Oinsert(C,c_List_Oset(D,E),E) # label(cls_set__insort_0) # label(axiom). [assumption].
% 0.85/1.14 42 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,A),A),A) # label(cls_sorted_Osimps_I3_J_0) # label(axiom). [assumption].
% 0.85/1.14 43 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,A),A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,D,A),A) | -c_lessequals(B,C,A) # label(cls_sorted_Osimps_I3_J_2) # label(axiom). [assumption].
% 0.85/1.14 44 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | c_lessequals(C,B,A) # label(cls_linorder__linear_0) # label(axiom). [assumption].
% 0.85/1.14 45 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Oinsort__key(B,C,c_List_Olist_ONil(D),D,A) = c_List_Olist_OCons(C,c_List_Olist_ONil(D),D) # label(cls_insort__key_Osimps_I1_J_0) # label(axiom). [assumption].
% 0.85/1.14 46 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_ONil(A),A),A) # label(cls_sorted_Osimps_I2_J_0) # label(axiom). [assumption].
% 0.85/1.14 Derived: c_List_Odistinct(A,B) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(C,D,A,B,tc_nat),B). [resolve(1,a,2,a)].
% 0.85/1.14 Derived: c_HOL_Oord__class_Oless(A,B,tc_nat) | c_lessequals(B,A,tc_nat). [resolve(1,a,3,a)].
% 0.85/1.14 Derived: -c_lessequals(A,B,tc_nat) | -c_HOL_Oord__class_Oless(B,A,tc_nat). [resolve(1,a,4,a)].
% 0.85/1.14 Derived: -c_HOL_Oord__class_Oless(A,A,tc_nat). [resolve(1,a,10,a)].
% 0.85/1.14 Derived: A = B | c_HOL_Oord__class_Oless(B,A,tc_nat) | c_HOL_Oord__class_Oless(A,B,tc_nat). [resolve(1,a,11,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Oremdups(A,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat). [resolve(1,a,15,a)].
% 0.85/1.14 Derived: A = B | -c_lessequals(A,B,tc_nat) | c_HOL_Oord__class_Oless(A,B,tc_nat). [resolve(1,a,16,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_OdropWhile(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(1,a,18,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Oremove1(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(1,a,19,a)].
% 0.85/1.14 Derived: -c_HOL_Oord__class_Oless(A,B,tc_nat) | -c_HOL_Oord__class_Oless(B,A,tc_nat). [resolve(1,a,20,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat) | -c_lessequals(c_List_Osko__List__Xlinorder__class__Xsorted__append__1__1(A,B,tc_nat),c_List_Osko__List__Xlinorder__class__Xsorted__append__1__2(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat). [resolve(1,a,21,a)].
% 0.85/1.14 Derived: c_List_Oset(A,tc_nat) != c_List_Oset(B,tc_nat) | -c_List_Odistinct(B,tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat) | -c_List_Odistinct(A,tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat) | A = B. [resolve(1,a,22,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_ONil(tc_nat),tc_nat). [resolve(1,a,23,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,A,tc_nat),tc_nat). [resolve(1,a,24,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat). [resolve(1,a,25,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Oinsort__key(A,B,C,D,tc_nat) = c_List_Olist_OCons(B,C,D) | c_in(c_List_Osko__List__Xlinorder__class__Xinsort__is__Cons__1__1(B,A,C,D,tc_nat),c_List_Oset(C,D),D). [resolve(1,a,26,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat) | c_in(c_List_Osko__List__Xlinorder__class__Xsorted__append__1__2(A,B,tc_nat),c_List_Oset(B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat). [resolve(1,a,27,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat) | c_in(c_List_Osko__List__Xlinorder__class__Xsorted__append__1__1(A,B,tc_nat),c_List_Oset(A,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat). [resolve(1,a,28,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,B,tc_nat),tc_nat) | c_in(c_List_Osko__List__Xlinorder__class__Xsorted__Cons__1__1(A,B,tc_nat),c_List_Oset(B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(1,a,29,a)].
% 0.85/1.14 Derived: -c_in(A,c_List_Oset(B,C),C) | -c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(D,A,B,C,tc_nat),C). [resolve(1,a,30,a)].
% 0.85/1.14 Derived: c_List_Odistinct(c_List_Olinorder__class_Oinsort__key(A,B,C,D,tc_nat),D) | -c_List_Odistinct(C,D) | c_in(B,c_List_Oset(C,D),D). [resolve(1,a,31,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Oinsort__key(A,B,C,D,tc_nat) = c_List_Olist_OCons(B,C,D) | -c_lessequals(hAPP(A,B),hAPP(A,c_List_Osko__List__Xlinorder__class__Xinsort__is__Cons__1__1(B,A,C,D,tc_nat)),tc_nat). [resolve(1,a,32,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,B,tc_nat),tc_nat) | -c_lessequals(A,c_List_Osko__List__Xlinorder__class__Xsorted__Cons__1__1(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(1,a,33,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,A,tc_nat),tc_nat). [resolve(1,a,34,a)].
% 0.85/1.14 Derived: c_lessequals(A,B,tc_nat) | -c_in(B,c_List_Oset(C,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,C,tc_nat),tc_nat). [resolve(1,a,36,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Osorted(c_List_OtakeWhile(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(1,a,37,a)].
% 0.85/1.14 Derived: c_List_Olinorder__class_Oinsort__key(A,B,c_List_Olist_OCons(C,D,E),E,tc_nat) = c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,E),E) | -c_lessequals(hAPP(A,B),hAPP(A,C),tc_nat). [resolve(1,a,38,a)].
% 1.39/1.64 Derived: c_lessequals(A,B,tc_nat) | -c_in(B,c_List_Oset(C,tc_nat),tc_nat) | -c_in(A,c_List_Oset(D,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(D,C,tc_nat),tc_nat). [resolve(1,a,39,a)].
% 1.39/1.64 Derived: c_List_Olinorder__class_Oinsort__key(A,B,c_List_Olist_OCons(C,D,E),E,tc_nat) = c_List_Olist_OCons(C,c_List_Olinorder__class_Oinsort__key(A,B,D,E,tc_nat),E) | c_lessequals(hAPP(A,B),hAPP(A,C),tc_nat). [resolve(1,a,40,a)].
% 1.39/1.64 Derived: c_List_Oset(c_List_Olinorder__class_Oinsort__key(A,B,C,D,tc_nat),D) = c_Set_Oinsert(B,c_List_Oset(C,D),D). [resolve(1,a,41,a)].
% 1.39/1.64 Derived: c_lessequals(A,B,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_OCons(B,C,tc_nat),tc_nat),tc_nat). [resolve(1,a,42,a)].
% 1.39/1.64 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_OCons(B,C,tc_nat),tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,tc_nat),tc_nat) | -c_lessequals(A,B,tc_nat). [resolve(1,a,43,a)].
% 1.39/1.64 Derived: c_lessequals(A,B,tc_nat) | c_lessequals(B,A,tc_nat). [resolve(1,a,44,a)].
% 1.39/1.64 Derived: c_List_Olinorder__class_Oinsort__key(A,B,c_List_Olist_ONil(C),C,tc_nat) = c_List_Olist_OCons(B,c_List_Olist_ONil(C),C). [resolve(1,a,45,a)].
% 1.39/1.64 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_ONil(tc_nat),tc_nat),tc_nat). [resolve(1,a,46,a)].
% 1.39/1.64 47 A = B | -c_fequal(A,B,C) # label(cls_ATP__Linkup_Ofequal__imp__equal_0) # label(axiom). [assumption].
% 1.39/1.64 48 c_fequal(A,A,B) # label(cls_ATP__Linkup_Oequal__imp__fequal_0) # label(axiom). [assumption].
% 1.39/1.64 Derived: A = A. [resolve(47,b,48,a)].
% 1.39/1.64
% 1.39/1.64 ============================== end predicate elimination =============
% 1.39/1.64
% 1.39/1.64 Auto_denials: (non-Horn, no changes).
% 1.39/1.64
% 1.39/1.64 Term ordering decisions:
% 1.39/1.64 Function symbol KB weights: tc_Message_Omsg=1. tc_bool=1. tc_nat=1. tc_Event_Oevent=1. c_Message_Oagent_OSpy=1. c_Event_Obad=1. tc_Message_Oagent=1. v_A=1. v_B=1. v_X=1. v_evs=1. tc_fun=1. c_List_Oset=1. hAPP=1. c_Event_Oknows=1. c_List_Orev=1. c_List_Obutlast=1. c_List_Oremdups=1. c_Event_Oevent_ONotes=1. c_Event_Oevent_OGets=1. c_List_Olast=1. c_Message_Omsg_OCrypt=1. c_List_Ohd=1. c_List_Orotate1=1. c_List_Otl=1. c_List_Olength__unique=1. c_List_Osko__List__Xrev__induct__1__2=1. c_Message_Osko__Message__Xanalz__insert__eq__I__1__1=1. c_List_Osko__List__Xrev__cases__1__1=1. c_List_Osko__List__Xrev__cases__1__2=1. c_List_Osko__List__Xrev__induct__1__1=1. c_List_Olist_ONil=1. c_Message_Oanalz=1. c_Message_Oparts=1. c_Message_Osynth=1. c_Event_Oused=1. c_Event_OinitState=1. c_Public_OshrK=1. c_List_Olist_OCons=1. c_List_Oappend=1. c_Set_Oinsert=1. c_List_OtakeWhile=1. c_List_Ofilter=1. c_Event_Oevent_OSays=1. c_List_Oreplicate=1. c_List_Oremove1=1. c_List_OdropWhile=1. c_List_Osko__List__Xsplit__list__first__prop__iff__1__5=1. c_List_Osko__List__Xsplit__list__last__prop__iff__1__5=1. c_List_Osplice=1. c_List_Olist__inter=1. c_List_Osko__List__Xlinorder__class__Xsorted__Cons__1__1=1. c_List_Osko__List__Xlinorder__class__Xsorted__append__1__1=1. c_List_Osko__List__Xlinorder__class__Xsorted__append__1__2=1. c_List_Osko__List__XtakeWhile__append2__1__1=1. c_List_Osko__List__XtakeWhile__eq__all__conv__1__1=1. c_Event_Osko__Event__Xknows__imp__Says__Gets__Notes__initState__1__1=1. c_List_Olist__update=1. c_List_Osko__List__XtakeWhile__cong__1__1=1. c_List_Oconcat__map=1. c_List_Olinorder__class_Oinsort__key=1. c_List_Osko__List__XCons__eq__append__conv__1__1=1. c_List_Osko__List__Xappend__eq__Cons__conv__1__1=1. c_List_Osko__List__Xlinorder__class__Xinsort__is__Cons__1__1=1.
% 1.39/1.64
% 1.39/1.64 ============================== end of process initial clauses ========
% 1.39/1.64
% 1.39/1.64 ============================== CLAUSES FOR SEARCH ====================
% 1.39/1.64
% 1.39/1.64 ============================== end of clauses for search =============
% 1.39/1.64
% 1.39/1.64 ============================== SEARCH ================================
% 1.39/1.64
% 1.39/1.64 % Starting search at 0.13 seconds.
% 1.39/1.64
% 1.39/1.64 Low Water (keep): wt=49.000, iters=3458
% 1.39/1.64
% 1.39/1.64 Low Water (keep): wt=47.000, iters=3445
% 1.39/1.64
% 1.39/1.64 Low Water (keep):Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------