TSTP Solution File: LCL771-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LCL771-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n006.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 13:50:01 EDT 2022
% Result : Unsatisfiable 0.81s 1.10s
% Output : Refutation 0.81s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL771-1 : TPTP v8.1.0. Released v4.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n006.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sat Jul 2 15:07:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.73/1.04 ============================== Prover9 ===============================
% 0.73/1.04 Prover9 (32) version 2009-11A, November 2009.
% 0.73/1.04 Process 8003 was started by sandbox on n006.cluster.edu,
% 0.73/1.04 Sat Jul 2 15:07:53 2022
% 0.73/1.04 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_7848_n006.cluster.edu".
% 0.73/1.04 ============================== end of head ===========================
% 0.73/1.04
% 0.73/1.04 ============================== INPUT =================================
% 0.73/1.04
% 0.73/1.04 % Reading from file /tmp/Prover9_7848_n006.cluster.edu
% 0.73/1.04
% 0.73/1.04 set(prolog_style_variables).
% 0.73/1.04 set(auto2).
% 0.73/1.04 % set(auto2) -> set(auto).
% 0.73/1.04 % set(auto) -> set(auto_inference).
% 0.73/1.04 % set(auto) -> set(auto_setup).
% 0.73/1.04 % set(auto_setup) -> set(predicate_elim).
% 0.73/1.04 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/1.04 % set(auto) -> set(auto_limits).
% 0.73/1.04 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/1.04 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/1.04 % set(auto) -> set(auto_denials).
% 0.73/1.04 % set(auto) -> set(auto_process).
% 0.73/1.04 % set(auto2) -> assign(new_constants, 1).
% 0.73/1.04 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/1.04 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/1.04 % set(auto2) -> assign(max_hours, 1).
% 0.73/1.04 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/1.04 % set(auto2) -> assign(max_seconds, 0).
% 0.73/1.04 % set(auto2) -> assign(max_minutes, 5).
% 0.73/1.04 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/1.04 % set(auto2) -> set(sort_initial_sos).
% 0.73/1.04 % set(auto2) -> assign(sos_limit, -1).
% 0.73/1.04 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/1.04 % set(auto2) -> assign(max_megs, 400).
% 0.73/1.04 % set(auto2) -> assign(stats, some).
% 0.73/1.04 % set(auto2) -> clear(echo_input).
% 0.73/1.04 % set(auto2) -> set(quiet).
% 0.73/1.04 % set(auto2) -> clear(print_initial_clauses).
% 0.73/1.04 % set(auto2) -> clear(print_given).
% 0.73/1.04 assign(lrs_ticks,-1).
% 0.73/1.04 assign(sos_limit,10000).
% 0.73/1.04 assign(order,kbo).
% 0.73/1.04 set(lex_order_vars).
% 0.73/1.04 clear(print_given).
% 0.73/1.04
% 0.73/1.04 % formulas(sos). % not echoed (428 formulas)
% 0.73/1.04
% 0.73/1.04 ============================== end of input ==========================
% 0.73/1.04
% 0.73/1.04 % From the command line: assign(max_seconds, 300).
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/1.04
% 0.73/1.04 % Formulas that are not ordinary clauses:
% 0.73/1.04
% 0.73/1.04 ============================== end of process non-clausal formulas ===
% 0.73/1.04
% 0.73/1.04 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/1.04
% 0.73/1.04 ============================== PREDICATE ELIMINATION =================
% 0.73/1.04 1 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom). [assumption].
% 0.73/1.04 2 -class_Orderings_Olinorder(A) | -c_HOL_Oord__class_Oless(B,B,A) # label(cls_linorder__neq__iff_1) # label(axiom). [assumption].
% 0.73/1.04 3 -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.73/1.04 4 -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.73/1.04 5 -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.73/1.04 6 -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.73/1.04 7 -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.73/1.04 8 -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.73/1.04 9 -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.73/1.04 10 -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.73/1.04 11 -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.73/1.06 12 -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.73/1.06 13 -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.73/1.06 14 -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.73/1.06 15 -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.73/1.06 Derived: -c_HOL_Oord__class_Oless(A,A,tc_nat). [resolve(1,a,2,a)].
% 0.73/1.06 Derived: A = B | c_HOL_Oord__class_Oless(B,A,tc_nat) | c_HOL_Oord__class_Oless(A,B,tc_nat). [resolve(1,a,3,a)].
% 0.73/1.06 Derived: -c_HOL_Oord__class_Oless(A,B,tc_nat) | -c_HOL_Oord__class_Oless(B,A,tc_nat). [resolve(1,a,7,a)].
% 0.73/1.06 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_ONil(tc_nat),tc_nat),tc_nat). [resolve(1,a,8,a)].
% 0.73/1.06 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,9,a)].
% 0.73/1.06 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,11,a)].
% 0.73/1.06 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,12,a)].
% 0.73/1.06 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,13,a)].
% 0.73/1.06 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,14,a)].
% 0.73/1.06 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_ONil(tc_nat),tc_nat). [resolve(1,a,15,a)].
% 0.73/1.06 16 class_Lattices_Olower__semilattice(tc_fun(A,B)) | -class_Lattices_Olattice(B) # label(clsarity_fun__Lattices_Olower__semilattice) # label(axiom). [assumption].
% 0.73/1.06 17 -class_Lattices_Olower__semilattice(A) | c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(B,C,A),D,A) | -c_HOL_Oord__class_Oless(C,D,A) # label(cls_less__infI2_0) # label(axiom). [assumption].
% 0.73/1.06 18 -class_Lattices_Olower__semilattice(A) | c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(B,C,A),D,A) | -c_HOL_Oord__class_Oless(B,D,A) # label(cls_less__infI1_0) # label(axiom). [assumption].
% 0.73/1.06 19 -class_Lattices_Olower__semilattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,C,A) = c_Lattices_Olower__semilattice__class_Oinf(C,B,A) # label(cls_inf__commute_0) # label(axiom). [assumption].
% 0.73/1.06 20 -class_Lattices_Olower__semilattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(C,D,A),A) = c_Lattices_Olower__semilattice__class_Oinf(C,c_Lattices_Olower__semilattice__class_Oinf(B,D,A),A) # label(cls_inf__left__commute_0) # label(axiom). [assumption].
% 0.73/1.06 21 -class_Lattices_Olower__semilattice(A) | c_Lattices_Olower__semilattice__class_Oinf(c_Lattices_Olower__semilattice__class_Oinf(B,C,A),D,A) = c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(C,D,A),A) # label(cls_inf__assoc_0) # label(axiom). [assumption].
% 0.73/1.06 22 -class_Lattices_Olower__semilattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(B,C,A),A) = c_Lattices_Olower__semilattice__class_Oinf(B,C,A) # label(cls_inf__left__idem_0) # label(axiom). [assumption].
% 0.73/1.06 23 -class_Lattices_Olower__semilattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,B,A) = B # label(cls_inf__idem_0) # label(axiom). [assumption].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,A)),E,tc_fun(D,A)) | -c_HOL_Oord__class_Oless(C,E,tc_fun(D,A)). [resolve(16,a,17,a)].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,A)),E,tc_fun(D,A)) | -c_HOL_Oord__class_Oless(B,E,tc_fun(D,A)). [resolve(16,a,18,a)].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,A)) = c_Lattices_Olower__semilattice__class_Oinf(C,B,tc_fun(D,A)). [resolve(16,a,19,a)].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(C,D,tc_fun(E,A)),tc_fun(E,A)) = c_Lattices_Olower__semilattice__class_Oinf(C,c_Lattices_Olower__semilattice__class_Oinf(B,D,tc_fun(E,A)),tc_fun(E,A)). [resolve(16,a,20,a)].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_Lattices_Olower__semilattice__class_Oinf(c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,A)),E,tc_fun(D,A)) = c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(C,E,tc_fun(D,A)),tc_fun(D,A)). [resolve(16,a,21,a)].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,A)),tc_fun(D,A)) = c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_fun(D,A)). [resolve(16,a,22,a)].
% 0.73/1.06 Derived: -class_Lattices_Olattice(A) | c_Lattices_Olower__semilattice__class_Oinf(B,B,tc_fun(C,A)) = B. [resolve(16,a,23,a)].
% 0.73/1.06 24 class_Lattices_Olower__semilattice(tc_nat) # label(clsarity_nat__Lattices_Olower__semilattice) # label(axiom). [assumption].
% 0.73/1.06 Derived: c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_nat),C,tc_nat) | -c_HOL_Oord__class_Oless(B,C,tc_nat). [resolve(24,a,17,a)].
% 0.73/1.06 Derived: c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_nat),C,tc_nat) | -c_HOL_Oord__class_Oless(A,C,tc_nat). [resolve(24,a,18,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_nat) = c_Lattices_Olower__semilattice__class_Oinf(B,A,tc_nat). [resolve(24,a,19,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_nat),tc_nat) = c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(A,C,tc_nat),tc_nat). [resolve(24,a,20,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_nat),C,tc_nat) = c_Lattices_Olower__semilattice__class_Oinf(A,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_nat),tc_nat). [resolve(24,a,21,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_nat),tc_nat) = c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_nat). [resolve(24,a,22,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,A,tc_nat) = A. [resolve(24,a,23,a)].
% 0.73/1.06 25 class_Lattices_Olower__semilattice(tc_bool) # label(clsarity_bool__Lattices_Olower__semilattice) # label(axiom). [assumption].
% 0.73/1.06 Derived: c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_bool),C,tc_bool) | -c_HOL_Oord__class_Oless(B,C,tc_bool). [resolve(25,a,17,a)].
% 0.73/1.06 Derived: c_HOL_Oord__class_Oless(c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_bool),C,tc_bool) | -c_HOL_Oord__class_Oless(A,C,tc_bool). [resolve(25,a,18,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_bool) = c_Lattices_Olower__semilattice__class_Oinf(B,A,tc_bool). [resolve(25,a,19,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_bool),tc_bool) = c_Lattices_Olower__semilattice__class_Oinf(B,c_Lattices_Olower__semilattice__class_Oinf(A,C,tc_bool),tc_bool). [resolve(25,a,20,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_bool),C,tc_bool) = c_Lattices_Olower__semilattice__class_Oinf(A,c_Lattices_Olower__semilattice__class_Oinf(B,C,tc_bool),tc_bool). [resolve(25,a,21,a)].
% 0.73/1.06 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_bool),tc_bool) = c_Lattices_Olower__semilattice__class_Oinf(A,B,tc_bool). [resolve(25,a,22,a)].
% 0.81/1.10 Derived: c_Lattices_Olower__semilattice__class_Oinf(A,A,tc_bool) = A. [resolve(25,a,23,a)].
% 0.81/1.10 26 A = B | -c_fequal(A,B,C) # label(cls_ATP__Linkup_Ofequal__imp__equal_0) # label(axiom). [assumption].
% 0.81/1.10 27 c_fequal(A,A,B) # label(cls_ATP__Linkup_Oequal__imp__fequal_0) # label(axiom). [assumption].
% 0.81/1.10 Derived: A = A. [resolve(26,b,27,a)].
% 0.81/1.10
% 0.81/1.10 ============================== end predicate elimination =============
% 0.81/1.10
% 0.81/1.10 Auto_denials: (non-Horn, no changes).
% 0.81/1.10
% 0.81/1.10 Term ordering decisions:
% 0.81/1.10 Function symbol KB weights: tc_Lambda_OdB=1. tc_nat=1. c_Lambda_OdB_OApp=1. t_a=1. tc_bool=1. c_Lambda_Obeta=1. c_InductTermi_OIT=1. t_b=1. v_rs=1. v_i=1. hAPP=1. tc_fun=1. c_List_Orev=1. c_Transitive__Closure_Ortranclp=1. c_Nat_Osize__class_Osize=1. c_Lambda_Olift=1. c_List_Oremdups=1. c_List_Obutlast=1. c_List_Olast=1. c_List_Orotate1=1. v_sko__List__Xlistsp__Xinduct__2=1. v_sko__List__Xlistsp__Xinducts__2=1. v_sko__List__Xlistsp__Xcases__1=1. v_sko__List__Xlistsp__Xcases__2=1. v_sko__List__Xlistsp__Xinduct__1=1. v_sko__List__Xlistsp__Xinducts__1=1. c_List_Olist_ONil=1. c_Lambda_OdB_OVar=1. c_Suc=1. tc_List_Olist=1. c_HOL_Ozero__class_Ozero=1. c_Lambda_OdB_OAbs=1. v_sko__List__Xconcat__Xinduct__2=1. v_sko__List__Xdistinct__Xinduct__2=1. v_sko__List__XdropWhile__Xinduct__2=1. v_sko__List__Xlist__Xinduct__2=1. v_sko__List__Xlistset__Xinduct__2=1. v_sko__List__Xmap__Xinduct__2=1. v_sko__List__Xremove1__Xinduct__2=1. v_sko__List__Xtake__Xinduct__2=1. v_sko__List__Xzip__Xinduct__2=1. v_sko__List__Xconcat__Xinduct__1=1. v_sko__List__Xdistinct__Xinduct__1=1. v_sko__List__XdropWhile__Xinduct__1=1. v_sko__List__Xlist__Xinduct__1=1. v_sko__List__Xlistset__Xinduct__1=1. v_sko__List__Xmap__Xinduct__1=1. v_sko__List__Xremove1__Xinduct__1=1. v_sko__List__Xtake__Xinduct__1=1. v_sko__List__Xzip__Xinduct__1=1. c_List_Olist_OCons=1. c_List_Oappend=1. c_Lattices_Olower__semilattice__class_Oinf=1. c_List_Oreplicate=1. c_List_Ofilter=1. c_Lambda_Osubst=1. c_Lambda_Oliftn=1. c_List_Orotate=1. c_Lambda_Osubstn=1. c_List_Oremove1=1. c_ListBeta_Osko__ListBeta__Xhead__Var__reduction__1__1=1. c_List_Osko__List__XCons__eq__filter__iff__1__3=1. c_List_Osko__List__Xfilter__eq__Cons__iff__1__3=1. c_List_Osko__List__Xin__listsp__conv__set__1__1=1. c_List_Osublist=1. c_List_Omap=1. c_List_Olist__update=1. c_COMBC=1. c_ListApplication_Osko__ListApplication__XApp__eq__foldl__conv__1__1=1. c_List_Ofiltermap=1. c_List_Ofoldl=1. c_Lambda_OdB_OdB__case=1. c_List_Ofoldr=1. c_Lambda_OdB_OdB__rec=1. c_Map_Omap__upds=1. c_List_Olist_Olist__case=1. c_List_Osko__List__XCons__eq__append__conv__1__1=1. c_List_Osko__List__Xappend__eq__Cons__conv__1__1=1. c_COMBB=1. c_List_Olist_Olist__rec=1.
% 0.81/1.10
% 0.81/1.10 ============================== PROOF =================================
% 0.81/1.10 % SZS status Unsatisfiable
% 0.81/1.10 % SZS output start Refutation
% 0.81/1.10
% 0.81/1.10 % Proof 1 at 0.11 (+ 0.00) seconds.
% 0.81/1.10 % Length of proof is 3.
% 0.81/1.10 % Level of proof is 1.
% 0.81/1.10 % Maximum clause weight is 5.000.
% 0.81/1.10 % Given clauses 0.
% 0.81/1.10
% 0.81/1.10 474 c_List_Olistsp(A,c_List_Olist_ONil(B),B) # label(cls_listsp_ONil_0) # label(axiom). [assumption].
% 0.81/1.10 480 -c_List_Olistsp(c_InductTermi_OIT,c_List_Olist_ONil(tc_Lambda_OdB),tc_Lambda_OdB) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.81/1.10 481 $F. [copy(480),unit_del(a,474)].
% 0.81/1.10
% 0.81/1.10 % SZS output end Refutation
% 0.81/1.10 ============================== end of proof ==========================
% 0.81/1.10
% 0.81/1.10 ============================== STATISTICS ============================
% 0.81/1.10
% 0.81/1.10 Given=0. Generated=389. Kept=312. proofs=1.
% 0.81/1.10 Usable=0. Sos=0. Demods=86. Limbo=312, Disabled=417. Hints=0.
% 0.81/1.10 Megabytes=1.02.
% 0.81/1.10 User_CPU=0.11, System_CPU=0.00, Wall_clock=0.
% 0.81/1.10
% 0.81/1.10 ============================== end of statistics =====================
% 0.81/1.10
% 0.81/1.10 ============================== end of search =========================
% 0.81/1.10
% 0.81/1.10 THEOREM PROVED
% 0.81/1.10 % SZS status Unsatisfiable
% 0.81/1.10
% 0.81/1.10 Exiting with 1 proof.
% 0.81/1.10
% 0.81/1.10 Process 8003 exit (max_proofs) Sat Jul 2 15:07:53 2022
% 0.81/1.10 Prover9 interrupted
%------------------------------------------------------------------------------