TSTP Solution File: KRS033+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS033+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:01:00 EDT 2022
% Result : Timeout 299.86s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS033+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n022.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 : 300
% 0.13/0.33 % DateTime : Wed Jul 27 03:34:05 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.83/2.01 ----- Otter 3.3f, August 2004 -----
% 1.83/2.01 The process was started by sandbox on n022.cluster.edu,
% 1.83/2.01 Wed Jul 27 03:34:05 2022
% 1.83/2.01 The command was "./otter". The process ID is 31399.
% 1.83/2.01
% 1.83/2.01 set(prolog_style_variables).
% 1.83/2.01 set(auto).
% 1.83/2.01 dependent: set(auto1).
% 1.83/2.01 dependent: set(process_input).
% 1.83/2.01 dependent: clear(print_kept).
% 1.83/2.01 dependent: clear(print_new_demod).
% 1.83/2.01 dependent: clear(print_back_demod).
% 1.83/2.01 dependent: clear(print_back_sub).
% 1.83/2.01 dependent: set(control_memory).
% 1.83/2.01 dependent: assign(max_mem, 12000).
% 1.83/2.01 dependent: assign(pick_given_ratio, 4).
% 1.83/2.01 dependent: assign(stats_level, 1).
% 1.83/2.01 dependent: assign(max_seconds, 10800).
% 1.83/2.01 clear(print_given).
% 1.83/2.01
% 1.83/2.01 formula_list(usable).
% 1.83/2.01 all A (A=A).
% 1.83/2.01 all A B (A=B&cSatisfiable(A)->cSatisfiable(B)).
% 1.83/2.01 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.83/2.01 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.83/2.01 all A B (A=B&cp(A)->cp(B)).
% 1.83/2.01 all A B (A=B&cp1(A)->cp1(B)).
% 1.83/2.01 all A B (A=B&cp2(A)->cp2(B)).
% 1.83/2.01 all A B (A=B&cp3(A)->cp3(B)).
% 1.83/2.01 all A B (A=B&cp4(A)->cp4(B)).
% 1.83/2.01 all A B (A=B&cp5(A)->cp5(B)).
% 1.83/2.01 all A B C (A=B&rr(A,C)->rr(B,C)).
% 1.83/2.01 all A B C (A=B&rr(C,A)->rr(C,B)).
% 1.83/2.01 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.83/2.01 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.83/2.01 all X (cowlThing(X)& -cowlNothing(X)).
% 1.83/2.01 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.83/2.01 all X (cSatisfiable(X)<-> (exists Y (rr(X,Y)&cp3(Y)&cp(Y)))& (exists Y (rr(X,Y)&cp2(Y)&cp(Y)))& (exists Y (rr(X,Y)&cp(Y)&cp1(Y)))& (all Y0 Y1 Y2 Y3 Y4 (rr(X,Y0)&rr(X,Y1)&rr(X,Y2)&rr(X,Y3)&rr(X,Y4)->Y0=Y1|Y0=Y2|Y0=Y3|Y0=Y4|Y1=Y2|Y1=Y3|Y1=Y4|Y2=Y3|Y2=Y4|Y3=Y4))& (exists Y (rr(X,Y)&cp4(Y)))& (exists Y (rr(X,Y)&cp3(Y)))& (exists Y (rr(X,Y)&cp1(Y)))& (exists Y (rr(X,Y)&cp4(Y)&cp(Y)))& (exists Y (rr(X,Y)&cp2(Y)))).
% 1.83/2.01 all X (cp1(X)-> -(cp4(X)|cp3(X)|cp2(X)|cp5(X))).
% 1.83/2.01 all X (cp2(X)-> -(cp4(X)|cp3(X)|cp5(X))).
% 1.83/2.01 all X (cp3(X)-> -(cp4(X)|cp5(X))).
% 1.83/2.01 all X (cp4(X)-> -cp5(X)).
% 1.83/2.01 cSatisfiable(i2003_11_14_17_15_37698).
% 1.83/2.01 end_of_list.
% 1.83/2.01
% 1.83/2.01 -------> usable clausifies to:
% 1.83/2.01
% 1.83/2.01 list(usable).
% 1.83/2.01 0 [] A=A.
% 1.83/2.01 0 [] A!=B| -cSatisfiable(A)|cSatisfiable(B).
% 1.83/2.01 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.83/2.01 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.83/2.01 0 [] A!=B| -cp(A)|cp(B).
% 1.83/2.01 0 [] A!=B| -cp1(A)|cp1(B).
% 1.83/2.01 0 [] A!=B| -cp2(A)|cp2(B).
% 1.83/2.01 0 [] A!=B| -cp3(A)|cp3(B).
% 1.83/2.01 0 [] A!=B| -cp4(A)|cp4(B).
% 1.83/2.01 0 [] A!=B| -cp5(A)|cp5(B).
% 1.83/2.01 0 [] A!=B| -rr(A,C)|rr(B,C).
% 1.83/2.01 0 [] A!=B| -rr(C,A)|rr(C,B).
% 1.83/2.01 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.83/2.01 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.83/2.01 0 [] cowlThing(X).
% 1.83/2.01 0 [] -cowlNothing(X).
% 1.83/2.01 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.83/2.01 0 [] xsd_string(X)|xsd_integer(X).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f1(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp3($f1(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp($f1(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f2(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp2($f2(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp($f2(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f3(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp($f3(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp1($f3(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)| -rr(X,Y0)| -rr(X,Y1)| -rr(X,Y2)| -rr(X,Y3)| -rr(X,Y4)|Y0=Y1|Y0=Y2|Y0=Y3|Y0=Y4|Y1=Y2|Y1=Y3|Y1=Y4|Y2=Y3|Y2=Y4|Y3=Y4.
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f4(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp4($f4(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f5(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp3($f5(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f6(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp1($f6(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f7(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp4($f7(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp($f7(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|rr(X,$f8(X)).
% 1.83/2.01 0 [] -cSatisfiable(X)|cp2($f8(X)).
% 1.83/2.01 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|rr(X,$f13(X))| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.01 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|rr(X,$f12(X))| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.01 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|rr(X,$f11(X))| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.01 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|rr(X,$f10(X))| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|rr(X,$f9(X))| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f13(X)!=$f12(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f13(X)!=$f11(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f13(X)!=$f10(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f13(X)!=$f9(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f12(X)!=$f11(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f12(X)!=$f10(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f12(X)!=$f9(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f11(X)!=$f10(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f11(X)!=$f9(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] cSatisfiable(X)| -rr(X,Y)| -cp3(Y)| -cp(Y)| -rr(X,X1)| -cp2(X1)| -cp(X1)| -rr(X,X2)| -cp(X2)| -cp1(X2)|$f10(X)!=$f9(X)| -rr(X,X3)| -cp4(X3)| -rr(X,X4)| -cp3(X4)| -rr(X,X5)| -cp1(X5)| -rr(X,X6)| -cp4(X6)| -cp(X6)| -rr(X,X7)| -cp2(X7).
% 1.83/2.05 0 [] -cp1(X)| -cp4(X).
% 1.83/2.05 0 [] -cp1(X)| -cp3(X).
% 1.83/2.05 0 [] -cp1(X)| -cp2(X).
% 1.83/2.05 0 [] -cp1(X)| -cp5(X).
% 1.83/2.05 0 [] -cp2(X)| -cp4(X).
% 1.83/2.05 0 [] -cp2(X)| -cp3(X).
% 1.83/2.05 0 [] -cp2(X)| -cp5(X).
% 1.83/2.05 0 [] -cp3(X)| -cp4(X).
% 1.83/2.05 0 [] -cp3(X)| -cp5(X).
% 1.83/2.05 0 [] -cp4(X)| -cp5(X).
% 1.83/2.05 0 [] cSatisfiable(i2003_11_14_17_15_37698).
% 1.83/2.05 end_of_list.
% 1.83/2.05
% 1.83/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=22.
% 1.83/2.05
% 1.83/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.83/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.83/2.05 deletion, with positive clauses in sos and nonpositive
% 1.83/2.05 clauses in usable.
% 1.83/2.05
% 1.83/2.05 dependent: set(knuth_bendix).
% 1.83/2.05 dependent: set(anl_eq).
% 1.83/2.05 dependent: set(para_from).
% 1.83/2.05 dependent: set(para_into).
% 1.83/2.05 dependent: clear(para_from_right).
% 1.83/2.05 dependent: clear(para_into_right).
% 1.83/2.05 dependent: set(para_from_vars).
% 1.83/2.05 dependent: set(eq_units_both_ways).
% 1.83/2.05 dependent: set(dynamic_demod_all).
% 1.83/2.05 dependent: set(dynamic_demod).
% 1.83/2.05 dependent: set(order_eq).
% 1.83/2.05 dependent: set(back_demod).
% 1.83/2.05 dependent: set(lrpo).
% 1.83/2.05 dependent: set(hyper_res).
% 1.83/2.05 dependent: set(unit_deletion).
% 1.83/2.05 dependent: set(factor).
% 1.83/2.05
% 1.83/2.05 ------------> process usable:
% 1.83/2.05 ** KEPT (pick-wt=7): 1 [] A!=B| -cSatisfiable(A)|cSatisfiable(B).
% 1.83/2.05 ** KEPT (pick-wt=7): 2 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.83/2.05 ** KEPT (pick-wt=7): 3 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.83/2.05 ** KEPT (pick-wt=7): 4 [] A!=B| -cp(A)|cp(B).
% 1.83/2.05 ** KEPT (pick-wt=7): 5 [] A!=B| -cp1(A)|cp1(B).
% 1.91/2.08 ** KEPT (pick-wt=7): 6 [] A!=B| -cp2(A)|cp2(B).
% 1.91/2.08 ** KEPT (pick-wt=7): 7 [] A!=B| -cp3(A)|cp3(B).
% 1.91/2.08 ** KEPT (pick-wt=7): 8 [] A!=B| -cp4(A)|cp4(B).
% 1.91/2.08 ** KEPT (pick-wt=7): 9 [] A!=B| -cp5(A)|cp5(B).
% 1.91/2.08 ** KEPT (pick-wt=9): 10 [] A!=B| -rr(A,C)|rr(B,C).
% 1.91/2.08 ** KEPT (pick-wt=9): 11 [] A!=B| -rr(C,A)|rr(C,B).
% 1.91/2.08 ** KEPT (pick-wt=7): 12 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.91/2.08 ** KEPT (pick-wt=7): 13 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.91/2.08 ** KEPT (pick-wt=2): 14 [] -cowlNothing(A).
% 1.91/2.08 ** KEPT (pick-wt=4): 15 [] -xsd_string(A)| -xsd_integer(A).
% 1.91/2.08 ** KEPT (pick-wt=6): 16 [] -cSatisfiable(A)|rr(A,$f1(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 17 [] -cSatisfiable(A)|cp3($f1(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 18 [] -cSatisfiable(A)|cp($f1(A)).
% 1.91/2.08 ** KEPT (pick-wt=6): 19 [] -cSatisfiable(A)|rr(A,$f2(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 20 [] -cSatisfiable(A)|cp2($f2(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 21 [] -cSatisfiable(A)|cp($f2(A)).
% 1.91/2.08 ** KEPT (pick-wt=6): 22 [] -cSatisfiable(A)|rr(A,$f3(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 23 [] -cSatisfiable(A)|cp($f3(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 24 [] -cSatisfiable(A)|cp1($f3(A)).
% 1.91/2.08 ** KEPT (pick-wt=47): 25 [] -cSatisfiable(A)| -rr(A,B)| -rr(A,C)| -rr(A,D)| -rr(A,E)| -rr(A,F)|B=C|B=D|B=E|B=F|C=D|C=E|C=F|D=E|D=F|E=F.
% 1.91/2.08 ** KEPT (pick-wt=6): 26 [] -cSatisfiable(A)|rr(A,$f4(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 27 [] -cSatisfiable(A)|cp4($f4(A)).
% 1.91/2.08 ** KEPT (pick-wt=6): 28 [] -cSatisfiable(A)|rr(A,$f5(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 29 [] -cSatisfiable(A)|cp3($f5(A)).
% 1.91/2.08 ** KEPT (pick-wt=6): 30 [] -cSatisfiable(A)|rr(A,$f6(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 31 [] -cSatisfiable(A)|cp1($f6(A)).
% 1.91/2.08 ** KEPT (pick-wt=6): 32 [] -cSatisfiable(A)|rr(A,$f7(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 33 [] -cSatisfiable(A)|cp4($f7(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 34 [] -cSatisfiable(A)|cp($f7(A)).
% 1.91/2.08 ** KEPT (pick-wt=6): 35 [] -cSatisfiable(A)|rr(A,$f8(A)).
% 1.91/2.08 ** KEPT (pick-wt=5): 36 [] -cSatisfiable(A)|cp2($f8(A)).
% 1.91/2.08 ** KEPT (pick-wt=34): 38 [copy,37,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|rr(A,$f13(A))| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=34): 40 [copy,39,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|rr(A,$f12(A))| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=34): 42 [copy,41,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|rr(A,$f11(A))| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=34): 44 [copy,43,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|rr(A,$f10(A))| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=34): 46 [copy,45,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|rr(A,$f9(A))| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=35): 48 [copy,47,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|$f13(A)!=$f12(A)| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=35): 50 [copy,49,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|$f13(A)!=$f11(A)| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=35): 52 [copy,51,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp,factor_simp] cSatisfiable(A)| -rr(A,B)| -cp3(B)| -cp(B)| -rr(A,C)| -cp2(C)| -cp(C)| -rr(A,D)| -cp(D)| -cp1(D)|$f13(A)!=$f10(A)| -rr(A,E)| -cp4(E)| -cp(E).
% 1.91/2.08 ** KEPT (pick-wt=35): 54 [copy,53,factor_simp,factor_simp,factor_simp,factor_Alarm clock
% 299.86/300.03 Otter interrupted
% 299.86/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------