TSTP Solution File: SEU343+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU343+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n007.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 : 300s
% DateTime : Wed Jul 27 13:15:46 EDT 2022
% Result : Unknown 5.05s 5.27s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU343+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n007.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 : 300
% 0.12/0.33 % DateTime : Wed Jul 27 07:41:16 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/2.11 ----- Otter 3.3f, August 2004 -----
% 1.68/2.11 The process was started by sandbox on n007.cluster.edu,
% 1.68/2.11 Wed Jul 27 07:41:16 2022
% 1.68/2.11 The command was "./otter". The process ID is 1474.
% 1.68/2.11
% 1.68/2.11 set(prolog_style_variables).
% 1.68/2.11 set(auto).
% 1.68/2.11 dependent: set(auto1).
% 1.68/2.11 dependent: set(process_input).
% 1.68/2.11 dependent: clear(print_kept).
% 1.68/2.11 dependent: clear(print_new_demod).
% 1.68/2.11 dependent: clear(print_back_demod).
% 1.68/2.11 dependent: clear(print_back_sub).
% 1.68/2.11 dependent: set(control_memory).
% 1.68/2.11 dependent: assign(max_mem, 12000).
% 1.68/2.11 dependent: assign(pick_given_ratio, 4).
% 1.68/2.11 dependent: assign(stats_level, 1).
% 1.68/2.11 dependent: assign(max_seconds, 10800).
% 1.68/2.11 clear(print_given).
% 1.68/2.11
% 1.68/2.11 formula_list(usable).
% 1.68/2.11 all A (A=A).
% 1.68/2.11 all A (latt_str(A)-> (strict_latt_str(A)->A=latt_str_of(the_carrier(A),the_L_join(A),the_L_meet(A)))).
% 1.68/2.11 all A B (in(A,B)-> -in(B,A)).
% 1.68/2.11 all A B C (element(C,powerset(cartesian_product2(A,B)))->relation(C)).
% 1.68/2.11 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 1.68/2.11 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.68/2.11 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_union2(A,B,C)=subset_union2(A,C,B)).
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_intersection2(A,B,C)=subset_intersection2(A,C,B)).
% 1.68/2.11 all A (relation(A)&function(A)-> (all B C (apply_binary(A,B,C)=apply(A,ordered_pair(B,C))))).
% 1.68/2.11 all A B (strict_latt_str(B)&latt_str(B)-> (B=boole_lattice(A)<->the_carrier(B)=powerset(A)& (all C (element(C,powerset(A))-> (all D (element(D,powerset(A))->apply_binary(the_L_join(B),C,D)=subset_union2(A,C,D)&apply_binary(the_L_meet(B),C,D)=subset_intersection2(A,C,D))))))).
% 1.68/2.11 all A (-empty_carrier(A)&join_semilatt_str(A)-> (all B (element(B,the_carrier(A))-> (all C (element(C,the_carrier(A))->join(A,B,C)=apply_binary_as_element(the_carrier(A),the_carrier(A),the_carrier(A),the_L_join(A),B,C)))))).
% 1.68/2.11 all A (-empty_carrier(A)&meet_semilatt_str(A)-> (all B (element(B,the_carrier(A))-> (all C (element(C,the_carrier(A))->meet(A,B,C)=apply_binary_as_element(the_carrier(A),the_carrier(A),the_carrier(A),the_L_meet(A),B,C)))))).
% 1.68/2.11 all A B (ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A))).
% 1.68/2.11 all A B C (function(B)&quasi_total(B,cartesian_product2(A,A),A)&relation_of2(B,cartesian_product2(A,A),A)&function(C)&quasi_total(C,cartesian_product2(A,A),A)&relation_of2(C,cartesian_product2(A,A),A)->strict_latt_str(latt_str_of(A,B,C))&latt_str(latt_str_of(A,B,C))).
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 all A (strict_latt_str(boole_lattice(A))&latt_str(boole_lattice(A))).
% 1.68/2.11 all A B C (-empty_carrier(A)&join_semilatt_str(A)&element(B,the_carrier(A))&element(C,the_carrier(A))->element(join(A,B,C),the_carrier(A))).
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 all A B C D E F (-empty(A)& -empty(B)&function(D)&quasi_total(D,cartesian_product2(A,B),C)&relation_of2(D,cartesian_product2(A,B),C)&element(E,A)&element(F,B)->element(apply_binary_as_element(A,B,C,D,E,F),C)).
% 1.68/2.11 all A B C (-empty_carrier(A)&meet_semilatt_str(A)&element(B,the_carrier(A))&element(C,the_carrier(A))->element(meet(A,B,C),the_carrier(A))).
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_union2(A,B,C),powerset(A))).
% 1.68/2.11 $T.
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->element(subset_intersection2(A,B,C),powerset(A))).
% 1.68/2.11 all A (meet_semilatt_str(A)->one_sorted_str(A)).
% 1.68/2.11 $T.
% 1.68/2.11 all A (join_semilatt_str(A)->one_sorted_str(A)).
% 1.68/2.11 all A (latt_str(A)->meet_semilatt_str(A)&join_semilatt_str(A)).
% 1.68/2.11 $T.
% 1.68/2.11 $T.
% 1.68/2.11 all A B C (relation_of2_as_subset(C,A,B)->element(C,powerset(cartesian_product2(A,B)))).
% 1.68/2.11 all A (meet_semilatt_str(A)->function(the_L_meet(A))&quasi_total(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A))&relation_of2_as_subset(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A))).
% 1.68/2.11 $T.
% 1.68/2.11 all A (join_semilatt_str(A)->function(the_L_join(A))&quasi_total(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A))&relation_of2_as_subset(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A))).
% 1.68/2.11 exists A meet_semilatt_str(A).
% 1.68/2.11 exists A one_sorted_str(A).
% 1.68/2.11 exists A join_semilatt_str(A).
% 1.68/2.11 exists A latt_str(A).
% 1.68/2.11 all A B exists C relation_of2(C,A,B).
% 1.68/2.11 all A exists B element(B,A).
% 1.68/2.11 all A B exists C relation_of2_as_subset(C,A,B).
% 1.68/2.11 all A (-empty_carrier(boole_lattice(A))&strict_latt_str(boole_lattice(A))).
% 1.68/2.11 all A (-empty_carrier(A)&one_sorted_str(A)-> -empty(the_carrier(A))).
% 1.68/2.11 all A (-empty(powerset(A))).
% 1.68/2.11 empty(empty_set).
% 1.68/2.11 all A (-empty(singleton(A))).
% 1.68/2.11 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.68/2.11 all A B C (-empty(A)&function(B)&quasi_total(B,cartesian_product2(A,A),A)&relation_of2(B,cartesian_product2(A,A),A)&function(C)&quasi_total(C,cartesian_product2(A,A),A)&relation_of2(C,cartesian_product2(A,A),A)-> -empty_carrier(latt_str_of(A,B,C))&strict_latt_str(latt_str_of(A,B,C))).
% 1.68/2.11 all A B (-empty(unordered_pair(A,B))).
% 1.68/2.11 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.68/2.11 all A B (-empty(A)& -empty(B)-> -empty(cartesian_product2(A,B))).
% 1.68/2.11 all A B C (function(B)&quasi_total(B,cartesian_product2(A,A),A)&relation_of2(B,cartesian_product2(A,A),A)&function(C)&quasi_total(C,cartesian_product2(A,A),A)&relation_of2(C,cartesian_product2(A,A),A)-> (all D E F (latt_str_of(A,B,C)=latt_str_of(D,E,F)->A=D&B=E&C=F))).
% 1.68/2.11 all A B (set_union2(A,A)=A).
% 1.68/2.11 all A B (set_intersection2(A,A)=A).
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_union2(A,B,B)=B).
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_intersection2(A,B,B)=B).
% 1.68/2.11 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.68/2.11 exists A empty(A).
% 1.68/2.11 all A exists B (element(B,powerset(A))&empty(B)).
% 1.68/2.11 exists A (-empty(A)).
% 1.68/2.11 exists A (latt_str(A)&strict_latt_str(A)).
% 1.68/2.11 exists A (one_sorted_str(A)& -empty_carrier(A)).
% 1.68/2.11 all A (-empty_carrier(A)&one_sorted_str(A)-> (exists B (element(B,powerset(the_carrier(A)))& -empty(B)))).
% 1.68/2.11 exists A (latt_str(A)& -empty_carrier(A)&strict_latt_str(A)).
% 1.68/2.11 all A B C D E F (-empty(A)& -empty(B)&function(D)&quasi_total(D,cartesian_product2(A,B),C)&relation_of2(D,cartesian_product2(A,B),C)&element(E,A)&element(F,B)->apply_binary_as_element(A,B,C,D,E,F)=apply_binary(D,E,F)).
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_union2(A,B,C)=set_union2(B,C)).
% 1.68/2.11 all A B C (element(B,powerset(A))&element(C,powerset(A))->subset_intersection2(A,B,C)=set_intersection2(B,C)).
% 1.68/2.11 all A B C (relation_of2_as_subset(C,A,B)<->relation_of2(C,A,B)).
% 1.68/2.11 all A B subset(A,A).
% 1.68/2.11 all A (set_union2(A,empty_set)=A).
% 1.68/2.11 -(all A B (element(B,the_carrier(boole_lattice(A)))-> (all C (element(C,the_carrier(boole_lattice(A)))->join(boole_lattice(A),B,C)=set_union2(B,C)&meet(boole_lattice(A),B,C)=set_intersection2(B,C))))).
% 1.68/2.11 all A B (in(A,B)->element(A,B)).
% 1.68/2.11 all A (set_intersection2(A,empty_set)=empty_set).
% 1.68/2.11 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.68/2.11 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.68/2.11 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.68/2.11 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.68/2.11 all A (empty(A)->A=empty_set).
% 1.68/2.11 all A B (-(in(A,B)&empty(B))).
% 1.68/2.11 all A B (-(empty(A)&A!=B&empty(B))).
% 1.68/2.11 end_of_list.
% 1.68/2.11
% 1.68/2.11 -------> usable clausifies to:
% 1.68/2.11
% 1.68/2.11 list(usable).
% 1.68/2.11 0 [] A=A.
% 1.68/2.11 0 [] -latt_str(A)| -strict_latt_str(A)|A=latt_str_of(the_carrier(A),the_L_join(A),the_L_meet(A)).
% 1.68/2.11 0 [] -in(A,B)| -in(B,A).
% 1.68/2.11 0 [] -element(C,powerset(cartesian_product2(A,B)))|relation(C).
% 1.68/2.11 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.68/2.11 0 [] set_union2(A,B)=set_union2(B,A).
% 1.68/2.11 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_union2(A,B,C)=subset_union2(A,C,B).
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_intersection2(A,B,C)=subset_intersection2(A,C,B).
% 1.68/2.11 0 [] -relation(A)| -function(A)|apply_binary(A,B,C)=apply(A,ordered_pair(B,C)).
% 1.68/2.11 0 [] -strict_latt_str(B)| -latt_str(B)|B!=boole_lattice(A)|the_carrier(B)=powerset(A).
% 1.68/2.11 0 [] -strict_latt_str(B)| -latt_str(B)|B!=boole_lattice(A)| -element(C,powerset(A))| -element(D,powerset(A))|apply_binary(the_L_join(B),C,D)=subset_union2(A,C,D).
% 1.68/2.11 0 [] -strict_latt_str(B)| -latt_str(B)|B!=boole_lattice(A)| -element(C,powerset(A))| -element(D,powerset(A))|apply_binary(the_L_meet(B),C,D)=subset_intersection2(A,C,D).
% 1.68/2.11 0 [] -strict_latt_str(B)| -latt_str(B)|B=boole_lattice(A)|the_carrier(B)!=powerset(A)|element($f2(A,B),powerset(A)).
% 1.68/2.11 0 [] -strict_latt_str(B)| -latt_str(B)|B=boole_lattice(A)|the_carrier(B)!=powerset(A)|element($f1(A,B),powerset(A)).
% 1.68/2.11 0 [] -strict_latt_str(B)| -latt_str(B)|B=boole_lattice(A)|the_carrier(B)!=powerset(A)|apply_binary(the_L_join(B),$f2(A,B),$f1(A,B))!=subset_union2(A,$f2(A,B),$f1(A,B))|apply_binary(the_L_meet(B),$f2(A,B),$f1(A,B))!=subset_intersection2(A,$f2(A,B),$f1(A,B)).
% 1.68/2.11 0 [] empty_carrier(A)| -join_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|join(A,B,C)=apply_binary_as_element(the_carrier(A),the_carrier(A),the_carrier(A),the_L_join(A),B,C).
% 1.68/2.11 0 [] empty_carrier(A)| -meet_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|meet(A,B,C)=apply_binary_as_element(the_carrier(A),the_carrier(A),the_carrier(A),the_L_meet(A),B,C).
% 1.68/2.11 0 [] ordered_pair(A,B)=unordered_pair(unordered_pair(A,B),singleton(A)).
% 1.68/2.11 0 [] -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|strict_latt_str(latt_str_of(A,B,C)).
% 1.68/2.11 0 [] -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|latt_str(latt_str_of(A,B,C)).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] strict_latt_str(boole_lattice(A)).
% 1.68/2.11 0 [] latt_str(boole_lattice(A)).
% 1.68/2.11 0 [] empty_carrier(A)| -join_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|element(join(A,B,C),the_carrier(A)).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] empty(A)|empty(B)| -function(D)| -quasi_total(D,cartesian_product2(A,B),C)| -relation_of2(D,cartesian_product2(A,B),C)| -element(E,A)| -element(F,B)|element(apply_binary_as_element(A,B,C,D,E,F),C).
% 1.68/2.11 0 [] empty_carrier(A)| -meet_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|element(meet(A,B,C),the_carrier(A)).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_union2(A,B,C),powerset(A)).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|element(subset_intersection2(A,B,C),powerset(A)).
% 1.68/2.11 0 [] -meet_semilatt_str(A)|one_sorted_str(A).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] -join_semilatt_str(A)|one_sorted_str(A).
% 1.68/2.11 0 [] -latt_str(A)|meet_semilatt_str(A).
% 1.68/2.11 0 [] -latt_str(A)|join_semilatt_str(A).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] -relation_of2_as_subset(C,A,B)|element(C,powerset(cartesian_product2(A,B))).
% 1.68/2.11 0 [] -meet_semilatt_str(A)|function(the_L_meet(A)).
% 1.68/2.11 0 [] -meet_semilatt_str(A)|quasi_total(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 0 [] -meet_semilatt_str(A)|relation_of2_as_subset(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 0 [] $T.
% 1.68/2.11 0 [] -join_semilatt_str(A)|function(the_L_join(A)).
% 1.68/2.11 0 [] -join_semilatt_str(A)|quasi_total(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 0 [] -join_semilatt_str(A)|relation_of2_as_subset(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 0 [] meet_semilatt_str($c1).
% 1.68/2.11 0 [] one_sorted_str($c2).
% 1.68/2.11 0 [] join_semilatt_str($c3).
% 1.68/2.11 0 [] latt_str($c4).
% 1.68/2.11 0 [] relation_of2($f3(A,B),A,B).
% 1.68/2.11 0 [] element($f4(A),A).
% 1.68/2.11 0 [] relation_of2_as_subset($f5(A,B),A,B).
% 1.68/2.11 0 [] -empty_carrier(boole_lattice(A)).
% 1.68/2.11 0 [] strict_latt_str(boole_lattice(A)).
% 1.68/2.11 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.68/2.11 0 [] -empty(powerset(A)).
% 1.68/2.11 0 [] empty(empty_set).
% 1.68/2.11 0 [] -empty(singleton(A)).
% 1.68/2.11 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.68/2.11 0 [] empty(A)| -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)| -empty_carrier(latt_str_of(A,B,C)).
% 1.68/2.11 0 [] empty(A)| -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|strict_latt_str(latt_str_of(A,B,C)).
% 1.68/2.11 0 [] -empty(unordered_pair(A,B)).
% 1.68/2.11 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.68/2.11 0 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.68/2.11 0 [] -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|latt_str_of(A,B,C)!=latt_str_of(D,E,F)|A=D.
% 1.68/2.11 0 [] -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|latt_str_of(A,B,C)!=latt_str_of(D,E,F)|B=E.
% 1.68/2.11 0 [] -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|latt_str_of(A,B,C)!=latt_str_of(D,E,F)|C=F.
% 1.68/2.11 0 [] set_union2(A,A)=A.
% 1.68/2.11 0 [] set_intersection2(A,A)=A.
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_union2(A,B,B)=B.
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_intersection2(A,B,B)=B.
% 1.68/2.11 0 [] empty(A)|element($f6(A),powerset(A)).
% 1.68/2.11 0 [] empty(A)| -empty($f6(A)).
% 1.68/2.11 0 [] empty($c5).
% 1.68/2.11 0 [] element($f7(A),powerset(A)).
% 1.68/2.11 0 [] empty($f7(A)).
% 1.68/2.11 0 [] -empty($c6).
% 1.68/2.11 0 [] latt_str($c7).
% 1.68/2.11 0 [] strict_latt_str($c7).
% 1.68/2.11 0 [] one_sorted_str($c8).
% 1.68/2.11 0 [] -empty_carrier($c8).
% 1.68/2.11 0 [] empty_carrier(A)| -one_sorted_str(A)|element($f8(A),powerset(the_carrier(A))).
% 1.68/2.11 0 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f8(A)).
% 1.68/2.11 0 [] latt_str($c9).
% 1.68/2.11 0 [] -empty_carrier($c9).
% 1.68/2.11 0 [] strict_latt_str($c9).
% 1.68/2.11 0 [] empty(A)|empty(B)| -function(D)| -quasi_total(D,cartesian_product2(A,B),C)| -relation_of2(D,cartesian_product2(A,B),C)| -element(E,A)| -element(F,B)|apply_binary_as_element(A,B,C,D,E,F)=apply_binary(D,E,F).
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_union2(A,B,C)=set_union2(B,C).
% 1.68/2.11 0 [] -element(B,powerset(A))| -element(C,powerset(A))|subset_intersection2(A,B,C)=set_intersection2(B,C).
% 1.68/2.11 0 [] -relation_of2_as_subset(C,A,B)|relation_of2(C,A,B).
% 1.68/2.11 0 [] relation_of2_as_subset(C,A,B)| -relation_of2(C,A,B).
% 1.68/2.11 0 [] subset(A,A).
% 1.68/2.11 0 [] set_union2(A,empty_set)=A.
% 1.68/2.11 0 [] element($c11,the_carrier(boole_lattice($c12))).
% 1.68/2.11 0 [] element($c10,the_carrier(boole_lattice($c12))).
% 1.68/2.11 0 [] join(boole_lattice($c12),$c11,$c10)!=set_union2($c11,$c10)|meet(boole_lattice($c12),$c11,$c10)!=set_intersection2($c11,$c10).
% 1.68/2.11 0 [] -in(A,B)|element(A,B).
% 1.68/2.11 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.68/2.11 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.68/2.11 0 [] -element(A,powerset(B))|subset(A,B).
% 1.68/2.11 0 [] element(A,powerset(B))| -subset(A,B).
% 1.68/2.11 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.68/2.11 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.68/2.11 0 [] -empty(A)|A=empty_set.
% 1.68/2.11 0 [] -in(A,B)| -empty(B).
% 1.68/2.11 0 [] -empty(A)|A=B| -empty(B).
% 1.68/2.11 end_of_list.
% 1.68/2.11
% 1.68/2.11 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=8.
% 1.68/2.11
% 1.68/2.11 This ia a non-Horn set with equality. The strategy will be
% 1.68/2.11 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.68/2.11 deletion, with positive clauses in sos and nonpositive
% 1.68/2.11 clauses in usable.
% 1.68/2.11
% 1.68/2.11 dependent: set(knuth_bendix).
% 1.68/2.11 dependent: set(anl_eq).
% 1.68/2.11 dependent: set(para_from).
% 1.68/2.11 dependent: set(para_into).
% 1.68/2.11 dependent: clear(para_from_right).
% 1.68/2.11 dependent: clear(para_into_right).
% 1.68/2.11 dependent: set(para_from_vars).
% 1.68/2.11 dependent: set(eq_units_both_ways).
% 1.68/2.11 dependent: set(dynamic_demod_all).
% 1.68/2.11 dependent: set(dynamic_demod).
% 1.68/2.11 dependent: set(order_eq).
% 1.68/2.11 dependent: set(back_demod).
% 1.68/2.11 dependent: set(lrpo).
% 1.68/2.11 dependent: set(hyper_res).
% 1.68/2.11 dependent: set(unit_deletion).
% 1.68/2.11 dependent: set(factor).
% 1.68/2.11
% 1.68/2.11 ------------> process usable:
% 1.68/2.11 ** KEPT (pick-wt=13): 2 [copy,1,flip.3] -latt_str(A)| -strict_latt_str(A)|latt_str_of(the_carrier(A),the_L_join(A),the_L_meet(A))=A.
% 1.68/2.11 ** KEPT (pick-wt=6): 3 [] -in(A,B)| -in(B,A).
% 1.68/2.11 ** KEPT (pick-wt=8): 4 [] -element(A,powerset(cartesian_product2(B,C)))|relation(A).
% 1.68/2.11 ** KEPT (pick-wt=17): 5 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_union2(B,A,C)=subset_union2(B,C,A).
% 1.68/2.11 ** KEPT (pick-wt=17): 6 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_intersection2(B,A,C)=subset_intersection2(B,C,A).
% 1.68/2.11 ** KEPT (pick-wt=14): 8 [copy,7,flip.3] -relation(A)| -function(A)|apply(A,ordered_pair(B,C))=apply_binary(A,B,C).
% 1.68/2.11 ** KEPT (pick-wt=13): 9 [] -strict_latt_str(A)| -latt_str(A)|A!=boole_lattice(B)|the_carrier(A)=powerset(B).
% 1.68/2.11 ** KEPT (pick-wt=26): 10 [] -strict_latt_str(A)| -latt_str(A)|A!=boole_lattice(B)| -element(C,powerset(B))| -element(D,powerset(B))|apply_binary(the_L_join(A),C,D)=subset_union2(B,C,D).
% 1.68/2.11 ** KEPT (pick-wt=26): 11 [] -strict_latt_str(A)| -latt_str(A)|A!=boole_lattice(B)| -element(C,powerset(B))| -element(D,powerset(B))|apply_binary(the_L_meet(A),C,D)=subset_intersection2(B,C,D).
% 1.68/2.11 ** KEPT (pick-wt=19): 12 [] -strict_latt_str(A)| -latt_str(A)|A=boole_lattice(B)|the_carrier(A)!=powerset(B)|element($f2(B,A),powerset(B)).
% 1.68/2.11 ** KEPT (pick-wt=19): 13 [] -strict_latt_str(A)| -latt_str(A)|A=boole_lattice(B)|the_carrier(A)!=powerset(B)|element($f1(B,A),powerset(B)).
% 1.68/2.11 ** KEPT (pick-wt=49): 14 [] -strict_latt_str(A)| -latt_str(A)|A=boole_lattice(B)|the_carrier(A)!=powerset(B)|apply_binary(the_L_join(A),$f2(B,A),$f1(B,A))!=subset_union2(B,$f2(B,A),$f1(B,A))|apply_binary(the_L_meet(A),$f2(B,A),$f1(B,A))!=subset_intersection2(B,$f2(B,A),$f1(B,A)).
% 1.68/2.11 ** KEPT (pick-wt=28): 15 [] empty_carrier(A)| -join_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|join(A,B,C)=apply_binary_as_element(the_carrier(A),the_carrier(A),the_carrier(A),the_L_join(A),B,C).
% 1.68/2.11 ** KEPT (pick-wt=28): 16 [] empty_carrier(A)| -meet_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|meet(A,B,C)=apply_binary_as_element(the_carrier(A),the_carrier(A),the_carrier(A),the_L_meet(A),B,C).
% 1.68/2.11 ** KEPT (pick-wt=33): 17 [] -function(A)| -quasi_total(A,cartesian_product2(B,B),B)| -relation_of2(A,cartesian_product2(B,B),B)| -function(C)| -quasi_total(C,cartesian_product2(B,B),B)| -relation_of2(C,cartesian_product2(B,B),B)|strict_latt_str(latt_str_of(B,A,C)).
% 1.68/2.11 ** KEPT (pick-wt=33): 18 [] -function(A)| -quasi_total(A,cartesian_product2(B,B),B)| -relation_of2(A,cartesian_product2(B,B),B)| -function(C)| -quasi_total(C,cartesian_product2(B,B),B)| -relation_of2(C,cartesian_product2(B,B),B)|latt_str(latt_str_of(B,A,C)).
% 1.68/2.11 ** KEPT (pick-wt=19): 19 [] empty_carrier(A)| -join_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|element(join(A,B,C),the_carrier(A)).
% 1.68/2.11 ** KEPT (pick-wt=33): 20 [] empty(A)|empty(B)| -function(C)| -quasi_total(C,cartesian_product2(A,B),D)| -relation_of2(C,cartesian_product2(A,B),D)| -element(E,A)| -element(F,B)|element(apply_binary_as_element(A,B,D,C,E,F),D).
% 1.68/2.11 ** KEPT (pick-wt=19): 21 [] empty_carrier(A)| -meet_semilatt_str(A)| -element(B,the_carrier(A))| -element(C,the_carrier(A))|element(meet(A,B,C),the_carrier(A)).
% 1.68/2.11 ** KEPT (pick-wt=15): 22 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_union2(B,A,C),powerset(B)).
% 1.68/2.11 ** KEPT (pick-wt=15): 23 [] -element(A,powerset(B))| -element(C,powerset(B))|element(subset_intersection2(B,A,C),powerset(B)).
% 1.68/2.11 ** KEPT (pick-wt=4): 24 [] -meet_semilatt_str(A)|one_sorted_str(A).
% 1.68/2.11 ** KEPT (pick-wt=4): 25 [] -join_semilatt_str(A)|one_sorted_str(A).
% 1.68/2.11 ** KEPT (pick-wt=4): 26 [] -latt_str(A)|meet_semilatt_str(A).
% 1.68/2.11 ** KEPT (pick-wt=4): 27 [] -latt_str(A)|join_semilatt_str(A).
% 1.68/2.11 ** KEPT (pick-wt=10): 28 [] -relation_of2_as_subset(A,B,C)|element(A,powerset(cartesian_product2(B,C))).
% 1.68/2.11 ** KEPT (pick-wt=5): 29 [] -meet_semilatt_str(A)|function(the_L_meet(A)).
% 1.68/2.11 ** KEPT (pick-wt=12): 30 [] -meet_semilatt_str(A)|quasi_total(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 ** KEPT (pick-wt=12): 31 [] -meet_semilatt_str(A)|relation_of2_as_subset(the_L_meet(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 ** KEPT (pick-wt=5): 32 [] -join_semilatt_str(A)|function(the_L_join(A)).
% 1.68/2.11 ** KEPT (pick-wt=12): 33 [] -join_semilatt_str(A)|quasi_total(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 ** KEPT (pick-wt=12): 34 [] -join_semilatt_str(A)|relation_of2_as_subset(the_L_join(A),cartesian_product2(the_carrier(A),the_carrier(A)),the_carrier(A)).
% 1.68/2.11 ** KEPT (pick-wt=3): 35 [] -empty_carrier(boole_lattice(A)).
% 1.68/2.11 ** KEPT (pick-wt=7): 36 [] empty_carrier(A)| -one_sorted_str(A)| -empty(the_carrier(A)).
% 1.96/2.11 ** KEPT (pick-wt=3): 37 [] -empty(powerset(A)).
% 1.96/2.11 ** KEPT (pick-wt=3): 38 [] -empty(singleton(A)).
% 1.96/2.11 ** KEPT (pick-wt=6): 39 [] empty(A)| -empty(set_union2(A,B)).
% 1.96/2.11 ** KEPT (pick-wt=35): 40 [] empty(A)| -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)| -empty_carrier(latt_str_of(A,B,C)).
% 1.96/2.11 Following clause subsumed by 17 during input processing: 0 [] empty(A)| -function(B)| -quasi_total(B,cartesian_product2(A,A),A)| -relation_of2(B,cartesian_product2(A,A),A)| -function(C)| -quasi_total(C,cartesian_product2(A,A),A)| -relation_of2(C,cartesian_product2(A,A),A)|strict_latt_str(latt_str_of(A,B,C)).
% 1.96/2.11 ** KEPT (pick-wt=4): 41 [] -empty(unordered_pair(A,B)).
% 1.96/2.11 ** KEPT (pick-wt=6): 42 [] empty(A)| -empty(set_union2(B,A)).
% 1.96/2.11 ** KEPT (pick-wt=8): 43 [] empty(A)|empty(B)| -empty(cartesian_product2(A,B)).
% 1.96/2.11 ** KEPT (pick-wt=40): 44 [] -function(A)| -quasi_total(A,cartesian_product2(B,B),B)| -relation_of2(A,cartesian_product2(B,B),B)| -function(C)| -quasi_total(C,cartesian_product2(B,B),B)| -relation_of2(C,cartesian_product2(B,B),B)|latt_str_of(B,A,C)!=latt_str_of(D,E,F)|B=D.
% 1.96/2.11 ** KEPT (pick-wt=40): 45 [] -function(A)| -quasi_total(A,cartesian_product2(B,B),B)| -relation_of2(A,cartesian_product2(B,B),B)| -function(C)| -quasi_total(C,cartesian_product2(B,B),B)| -relation_of2(C,cartesian_product2(B,B),B)|latt_str_of(B,A,C)!=latt_str_of(D,E,F)|A=E.
% 1.96/2.11 ** KEPT (pick-wt=40): 46 [] -function(A)| -quasi_total(A,cartesian_product2(B,B),B)| -relation_of2(A,cartesian_product2(B,B),B)| -function(C)| -quasi_total(C,cartesian_product2(B,B),B)| -relation_of2(C,cartesian_product2(B,B),B)|latt_str_of(B,A,C)!=latt_str_of(D,E,F)|C=F.
% 1.96/2.11 ** KEPT (pick-wt=10): 48 [copy,47,factor_simp] -element(A,powerset(B))|subset_union2(B,A,A)=A.
% 1.96/2.11 ** KEPT (pick-wt=10): 50 [copy,49,factor_simp] -element(A,powerset(B))|subset_intersection2(B,A,A)=A.
% 1.96/2.11 ** KEPT (pick-wt=5): 51 [] empty(A)| -empty($f6(A)).
% 1.96/2.11 ** KEPT (pick-wt=2): 52 [] -empty($c6).
% 1.96/2.11 ** KEPT (pick-wt=2): 53 [] -empty_carrier($c8).
% 1.96/2.11 ** KEPT (pick-wt=10): 54 [] empty_carrier(A)| -one_sorted_str(A)|element($f8(A),powerset(the_carrier(A))).
% 1.96/2.11 ** KEPT (pick-wt=7): 55 [] empty_carrier(A)| -one_sorted_str(A)| -empty($f8(A)).
% 1.96/2.11 ** KEPT (pick-wt=2): 56 [] -empty_carrier($c9).
% 1.96/2.11 ** KEPT (pick-wt=36): 57 [] empty(A)|empty(B)| -function(C)| -quasi_total(C,cartesian_product2(A,B),D)| -relation_of2(C,cartesian_product2(A,B),D)| -element(E,A)| -element(F,B)|apply_binary_as_element(A,B,D,C,E,F)=apply_binary(C,E,F).
% 1.96/2.11 ** KEPT (pick-wt=16): 58 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_union2(B,A,C)=set_union2(A,C).
% 1.96/2.11 ** KEPT (pick-wt=16): 59 [] -element(A,powerset(B))| -element(C,powerset(B))|subset_intersection2(B,A,C)=set_intersection2(A,C).
% 1.96/2.11 ** KEPT (pick-wt=8): 60 [] -relation_of2_as_subset(A,B,C)|relation_of2(A,B,C).
% 1.96/2.11 ** KEPT (pick-wt=8): 61 [] relation_of2_as_subset(A,B,C)| -relation_of2(A,B,C).
% 1.96/2.11 ** KEPT (pick-wt=18): 62 [] join(boole_lattice($c12),$c11,$c10)!=set_union2($c11,$c10)|meet(boole_lattice($c12),$c11,$c10)!=set_intersection2($c11,$c10).
% 1.96/2.11 ** KEPT (pick-wt=6): 63 [] -in(A,B)|element(A,B).
% 1.96/2.11 ** KEPT (pick-wt=8): 64 [] -element(A,B)|empty(B)|in(A,B).
% 1.96/2.11 ** KEPT (pick-wt=7): 65 [] -element(A,powerset(B))|subset(A,B).
% 1.96/2.11 ** KEPT (pick-wt=7): 66 [] element(A,powerset(B))| -subset(A,B).
% 1.96/2.11 ** KEPT (pick-wt=10): 67 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.96/2.11 ** KEPT (pick-wt=9): 68 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.96/2.11 ** KEPT (pick-wt=5): 69 [] -empty(A)|A=empty_set.
% 1.96/2.11 ** KEPT (pick-wt=5): 70 [] -in(A,B)| -empty(B).
% 1.96/2.11 ** KEPT (pick-wt=7): 71 [] -empty(A)|A=B| -empty(B).
% 1.96/2.11
% 1.96/2.11 ------------> process sos:
% 1.96/2.11 ** KEPT (pick-wt=3): 97 [] A=A.
% 1.96/2.11 ** KEPT (pick-wt=7): 98 [] unordered_pair(A,B)=unordered_pair(B,A).
% 1.96/2.11 ** KEPT (pick-wt=7): 99 [] set_union2(A,B)=set_union2(B,A).
% 1.96/2.11 ** KEPT (pick-wt=7): 100 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.96/2.11 ** KEPT (pick-wt=10): 102 [copy,101,flip.1] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 5.05/5.27 ---> New Demodulator: 103 [new_demod,102] unordered_pair(unordered_pair(A,B),singleton(A))=ordered_pair(A,B).
% 5.05/5.27 ** KEPT (pick-wt=3): 104 [] strict_latt_str(boole_lattice(A)).
% 5.05/5.27 ** KEPT (pick-wt=3): 105 [] latt_str(boole_lattice(A)).
% 5.05/5.27 ** KEPT (pick-wt=2): 106 [] meet_semilatt_str($c1).
% 5.05/5.27 ** KEPT (pick-wt=2): 107 [] one_sorted_str($c2).
% 5.05/5.27 ** KEPT (pick-wt=2): 108 [] join_semilatt_str($c3).
% 5.05/5.27 ** KEPT (pick-wt=2): 109 [] latt_str($c4).
% 5.05/5.27 ** KEPT (pick-wt=6): 110 [] relation_of2($f3(A,B),A,B).
% 5.05/5.27 ** KEPT (pick-wt=4): 111 [] element($f4(A),A).
% 5.05/5.27 ** KEPT (pick-wt=6): 112 [] relation_of2_as_subset($f5(A,B),A,B).
% 5.05/5.27 Following clause subsumed by 104 during input processing: 0 [] strict_latt_str(boole_lattice(A)).
% 5.05/5.27 ** KEPT (pick-wt=2): 113 [] empty(empty_set).
% 5.05/5.27 ** KEPT (pick-wt=5): 114 [] set_union2(A,A)=A.
% 5.05/5.27 ---> New Demodulator: 115 [new_demod,114] set_union2(A,A)=A.
% 5.05/5.27 ** KEPT (pick-wt=5): 116 [] set_intersection2(A,A)=A.
% 5.05/5.27 ---> New Demodulator: 117 [new_demod,116] set_intersection2(A,A)=A.
% 5.05/5.27 ** KEPT (pick-wt=7): 118 [] empty(A)|element($f6(A),powerset(A)).
% 5.05/5.27 ** KEPT (pick-wt=2): 119 [] empty($c5).
% 5.05/5.27 ** KEPT (pick-wt=5): 120 [] element($f7(A),powerset(A)).
% 5.05/5.27 ** KEPT (pick-wt=3): 121 [] empty($f7(A)).
% 5.05/5.27 ** KEPT (pick-wt=2): 122 [] latt_str($c7).
% 5.05/5.27 ** KEPT (pick-wt=2): 123 [] strict_latt_str($c7).
% 5.05/5.27 ** KEPT (pick-wt=2): 124 [] one_sorted_str($c8).
% 5.05/5.27 ** KEPT (pick-wt=2): 125 [] latt_str($c9).
% 5.05/5.27 ** KEPT (pick-wt=2): 126 [] strict_latt_str($c9).
% 5.05/5.27 ** KEPT (pick-wt=3): 127 [] subset(A,A).
% 5.05/5.27 ** KEPT (pick-wt=5): 128 [] set_union2(A,empty_set)=A.
% 5.05/5.27 ---> New Demodulator: 129 [new_demod,128] set_union2(A,empty_set)=A.
% 5.05/5.27 ** KEPT (pick-wt=5): 130 [] element($c11,the_carrier(boole_lattice($c12))).
% 5.05/5.27 ** KEPT (pick-wt=5): 131 [] element($c10,the_carrier(boole_lattice($c12))).
% 5.05/5.27 ** KEPT (pick-wt=5): 132 [] set_intersection2(A,empty_set)=empty_set.
% 5.05/5.27 ---> New Demodulator: 133 [new_demod,132] set_intersection2(A,empty_set)=empty_set.
% 5.05/5.27 Following clause subsumed by 97 during input processing: 0 [copy,97,flip.1] A=A.
% 5.05/5.27 97 back subsumes 96.
% 5.05/5.27 97 back subsumes 74.
% 5.05/5.27 97 back subsumes 73.
% 5.05/5.27 Following clause subsumed by 98 during input processing: 0 [copy,98,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 5.05/5.27 Following clause subsumed by 99 during input processing: 0 [copy,99,flip.1] set_union2(A,B)=set_union2(B,A).
% 5.05/5.27 Following clause subsumed by 100 during input processing: 0 [copy,100,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 5.05/5.27 >>>> Starting back demodulation with 103.
% 5.05/5.27 >>>> Starting back demodulation with 115.
% 5.05/5.27 >> back demodulating 94 with 115.
% 5.05/5.27 >>>> Starting back demodulation with 117.
% 5.05/5.27 >> back demodulating 95 with 117.
% 5.05/5.27 >>>> Starting back demodulation with 129.
% 5.05/5.27 >>>> Starting back demodulation with 133.
% 5.05/5.27
% 5.05/5.27 ======= end of input processing =======
% 5.05/5.27
% 5.05/5.27 =========== start of search ===========
% 5.05/5.27
% 5.05/5.27
% 5.05/5.27 Resetting weight limit to 3.
% 5.05/5.27
% 5.05/5.27
% 5.05/5.27 Resetting weight limit to 3.
% 5.05/5.27
% 5.05/5.27 sos_size=240
% 5.05/5.27
% 5.05/5.27 Search stopped because sos empty.
% 5.05/5.27
% 5.05/5.27
% 5.05/5.27 Search stopped because sos empty.
% 5.05/5.27
% 5.05/5.27 ============ end of search ============
% 5.05/5.27
% 5.05/5.27 -------------- statistics -------------
% 5.05/5.27 clauses given 242
% 5.05/5.27 clauses generated 77996
% 5.05/5.27 clauses kept 376
% 5.05/5.27 clauses forward subsumed 327
% 5.05/5.27 clauses back subsumed 30
% 5.05/5.27 Kbytes malloced 5859
% 5.05/5.27
% 5.05/5.27 ----------- times (seconds) -----------
% 5.05/5.27 user CPU time 3.16 (0 hr, 0 min, 3 sec)
% 5.05/5.27 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 5.05/5.27 wall-clock time 5 (0 hr, 0 min, 5 sec)
% 5.05/5.27
% 5.05/5.27 Process 1474 finished Wed Jul 27 07:41:21 2022
% 5.05/5.27 Otter interrupted
% 5.05/5.27 PROOF NOT FOUND
%------------------------------------------------------------------------------