TSTP Solution File: KRS046+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS046+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:01 EDT 2022
% Result : Unknown 11.76s 12.01s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS046+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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 03:35:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.19 ----- Otter 3.3f, August 2004 -----
% 1.99/2.19 The process was started by sandbox2 on n020.cluster.edu,
% 1.99/2.19 Wed Jul 27 03:35:53 2022
% 1.99/2.19 The command was "./otter". The process ID is 6879.
% 1.99/2.19
% 1.99/2.19 set(prolog_style_variables).
% 1.99/2.19 set(auto).
% 1.99/2.19 dependent: set(auto1).
% 1.99/2.19 dependent: set(process_input).
% 1.99/2.19 dependent: clear(print_kept).
% 1.99/2.19 dependent: clear(print_new_demod).
% 1.99/2.19 dependent: clear(print_back_demod).
% 1.99/2.19 dependent: clear(print_back_sub).
% 1.99/2.19 dependent: set(control_memory).
% 1.99/2.19 dependent: assign(max_mem, 12000).
% 1.99/2.19 dependent: assign(pick_given_ratio, 4).
% 1.99/2.19 dependent: assign(stats_level, 1).
% 1.99/2.19 dependent: assign(max_seconds, 10800).
% 1.99/2.19 clear(print_given).
% 1.99/2.19
% 1.99/2.19 formula_list(usable).
% 1.99/2.19 all A (A=A).
% 1.99/2.19 all A B (A=B&cSatisfiable(A)->cSatisfiable(B)).
% 1.99/2.19 all A B (A=B&ca(A)->ca(B)).
% 1.99/2.19 all A B (A=B&ca_Vx2(A)->ca_Vx2(B)).
% 1.99/2.19 all A B (A=B&caxcomp(A)->caxcomp(B)).
% 1.99/2.19 all A B (A=B&cowlNothing(A)->cowlNothing(B)).
% 1.99/2.19 all A B (A=B&cowlThing(A)->cowlThing(B)).
% 1.99/2.19 all A B C (A=B&ra_Px1(A,C)->ra_Px1(B,C)).
% 1.99/2.19 all A B C (A=B&ra_Px1(C,A)->ra_Px1(C,B)).
% 1.99/2.19 all A B C (A=B&rf(A,C)->rf(B,C)).
% 1.99/2.19 all A B C (A=B&rf(C,A)->rf(C,B)).
% 1.99/2.19 all A B C (A=B&rinvF(A,C)->rinvF(B,C)).
% 1.99/2.19 all A B C (A=B&rinvF(C,A)->rinvF(C,B)).
% 1.99/2.19 all A B C (A=B&rinvR(A,C)->rinvR(B,C)).
% 1.99/2.19 all A B C (A=B&rinvR(C,A)->rinvR(C,B)).
% 1.99/2.19 all A B C (A=B&rr(A,C)->rr(B,C)).
% 1.99/2.19 all A B C (A=B&rr(C,A)->rr(C,B)).
% 1.99/2.19 all A B (A=B&xsd_integer(A)->xsd_integer(B)).
% 1.99/2.19 all A B (A=B&xsd_string(A)->xsd_string(B)).
% 1.99/2.19 all X (cowlThing(X)& -cowlNothing(X)).
% 1.99/2.19 all X (xsd_string(X)<-> -xsd_integer(X)).
% 1.99/2.19 all X (cSatisfiable(X)<-> (exists Y (rinvF(X,Y)&ca(Y)))&caxcomp(X)& (exists Y (rinvR(X,Y)&ca_Vx2(Y)))).
% 1.99/2.19 all X (ca(X)<-> -(exists Y ra_Px1(X,Y))).
% 1.99/2.19 all X (caxcomp(X)<-> (exists Y0 ra_Px1(X,Y0))).
% 1.99/2.19 all X (ca_Vx2(X)<-> (exists Y (rinvF(X,Y)&ca(Y)))).
% 1.99/2.19 all X (cowlThing(X)-> (all Y0 Y1 (rf(X,Y0)&rf(X,Y1)->Y0=Y1))).
% 1.99/2.19 all X Y (rinvF(X,Y)<->rf(Y,X)).
% 1.99/2.19 all X Y (rinvR(X,Y)<->rr(Y,X)).
% 1.99/2.19 all X Y Z (rr(X,Y)&rr(Y,Z)->rr(X,Z)).
% 1.99/2.19 cSatisfiable(i2003_11_14_17_16_25617).
% 1.99/2.19 all X Y (rf(X,Y)->rr(X,Y)).
% 1.99/2.19 end_of_list.
% 1.99/2.19
% 1.99/2.19 -------> usable clausifies to:
% 1.99/2.19
% 1.99/2.19 list(usable).
% 1.99/2.19 0 [] A=A.
% 1.99/2.19 0 [] A!=B| -cSatisfiable(A)|cSatisfiable(B).
% 1.99/2.19 0 [] A!=B| -ca(A)|ca(B).
% 1.99/2.19 0 [] A!=B| -ca_Vx2(A)|ca_Vx2(B).
% 1.99/2.19 0 [] A!=B| -caxcomp(A)|caxcomp(B).
% 1.99/2.19 0 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 1.99/2.19 0 [] A!=B| -cowlThing(A)|cowlThing(B).
% 1.99/2.19 0 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 1.99/2.19 0 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 1.99/2.19 0 [] A!=B| -rf(A,C)|rf(B,C).
% 1.99/2.19 0 [] A!=B| -rf(C,A)|rf(C,B).
% 1.99/2.19 0 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 1.99/2.19 0 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 1.99/2.19 0 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 1.99/2.19 0 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 1.99/2.19 0 [] A!=B| -rr(A,C)|rr(B,C).
% 1.99/2.19 0 [] A!=B| -rr(C,A)|rr(C,B).
% 1.99/2.19 0 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 1.99/2.19 0 [] A!=B| -xsd_string(A)|xsd_string(B).
% 1.99/2.19 0 [] cowlThing(X).
% 1.99/2.19 0 [] -cowlNothing(X).
% 1.99/2.19 0 [] -xsd_string(X)| -xsd_integer(X).
% 1.99/2.19 0 [] xsd_string(X)|xsd_integer(X).
% 1.99/2.19 0 [] -cSatisfiable(X)|rinvF(X,$f1(X)).
% 1.99/2.19 0 [] -cSatisfiable(X)|ca($f1(X)).
% 1.99/2.19 0 [] -cSatisfiable(X)|caxcomp(X).
% 1.99/2.19 0 [] -cSatisfiable(X)|rinvR(X,$f2(X)).
% 1.99/2.19 0 [] -cSatisfiable(X)|ca_Vx2($f2(X)).
% 1.99/2.19 0 [] cSatisfiable(X)| -rinvF(X,Y)| -ca(Y)| -caxcomp(X)| -rinvR(X,X1)| -ca_Vx2(X1).
% 1.99/2.19 0 [] -ca(X)| -ra_Px1(X,Y).
% 1.99/2.19 0 [] ca(X)|ra_Px1(X,$f3(X)).
% 1.99/2.19 0 [] -caxcomp(X)|ra_Px1(X,$f4(X)).
% 1.99/2.19 0 [] caxcomp(X)| -ra_Px1(X,Y0).
% 1.99/2.19 0 [] -ca_Vx2(X)|rinvF(X,$f5(X)).
% 1.99/2.19 0 [] -ca_Vx2(X)|ca($f5(X)).
% 1.99/2.19 0 [] ca_Vx2(X)| -rinvF(X,Y)| -ca(Y).
% 1.99/2.19 0 [] -cowlThing(X)| -rf(X,Y0)| -rf(X,Y1)|Y0=Y1.
% 1.99/2.19 0 [] -rinvF(X,Y)|rf(Y,X).
% 1.99/2.19 0 [] rinvF(X,Y)| -rf(Y,X).
% 1.99/2.19 0 [] -rinvR(X,Y)|rr(Y,X).
% 1.99/2.19 0 [] rinvR(X,Y)| -rr(Y,X).
% 1.99/2.19 0 [] -rr(X,Y)| -rr(Y,Z)|rr(X,Z).
% 1.99/2.19 0 [] cSatisfiable(i2003_11_14_17_16_25617).
% 1.99/2.19 0 [] -rf(X,Y)|rr(X,Y).
% 1.99/2.19 end_of_list.
% 1.99/2.19
% 1.99/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=6.
% 1.99/2.19
% 1.99/2.19 This ia a non-Horn set with equality. The strategy will be
% 1.99/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.99/2.19 deletion, with positive clauses in sos and nonpositive
% 1.99/2.19 clauses in usable.
% 1.99/2.19
% 1.99/2.19 dependent: set(knuth_bendix).
% 1.99/2.19 dependent: set(anl_eq).
% 1.99/2.19 dependent: set(para_from).
% 1.99/2.19 dependent: set(para_into).
% 1.99/2.19 dependent: clear(para_from_right).
% 1.99/2.19 dependent: clear(para_into_right).
% 1.99/2.19 dependent: set(para_from_vars).
% 1.99/2.19 dependent: set(eq_units_both_ways).
% 1.99/2.19 dependent: set(dynamic_demod_all).
% 1.99/2.19 dependent: set(dynamic_demod).
% 11.76/12.01 dependent: set(order_eq).
% 11.76/12.01 dependent: set(back_demod).
% 11.76/12.01 dependent: set(lrpo).
% 11.76/12.01 dependent: set(hyper_res).
% 11.76/12.01 dependent: set(unit_deletion).
% 11.76/12.01 dependent: set(factor).
% 11.76/12.01
% 11.76/12.01 ------------> process usable:
% 11.76/12.01 ** KEPT (pick-wt=7): 1 [] A!=B| -cSatisfiable(A)|cSatisfiable(B).
% 11.76/12.01 ** KEPT (pick-wt=7): 2 [] A!=B| -ca(A)|ca(B).
% 11.76/12.01 ** KEPT (pick-wt=7): 3 [] A!=B| -ca_Vx2(A)|ca_Vx2(B).
% 11.76/12.01 ** KEPT (pick-wt=7): 4 [] A!=B| -caxcomp(A)|caxcomp(B).
% 11.76/12.01 ** KEPT (pick-wt=7): 5 [] A!=B| -cowlNothing(A)|cowlNothing(B).
% 11.76/12.01 ** KEPT (pick-wt=7): 6 [] A!=B| -cowlThing(A)|cowlThing(B).
% 11.76/12.01 ** KEPT (pick-wt=9): 7 [] A!=B| -ra_Px1(A,C)|ra_Px1(B,C).
% 11.76/12.01 ** KEPT (pick-wt=9): 8 [] A!=B| -ra_Px1(C,A)|ra_Px1(C,B).
% 11.76/12.01 ** KEPT (pick-wt=9): 9 [] A!=B| -rf(A,C)|rf(B,C).
% 11.76/12.01 ** KEPT (pick-wt=9): 10 [] A!=B| -rf(C,A)|rf(C,B).
% 11.76/12.01 ** KEPT (pick-wt=9): 11 [] A!=B| -rinvF(A,C)|rinvF(B,C).
% 11.76/12.01 ** KEPT (pick-wt=9): 12 [] A!=B| -rinvF(C,A)|rinvF(C,B).
% 11.76/12.01 ** KEPT (pick-wt=9): 13 [] A!=B| -rinvR(A,C)|rinvR(B,C).
% 11.76/12.01 ** KEPT (pick-wt=9): 14 [] A!=B| -rinvR(C,A)|rinvR(C,B).
% 11.76/12.01 ** KEPT (pick-wt=9): 15 [] A!=B| -rr(A,C)|rr(B,C).
% 11.76/12.01 ** KEPT (pick-wt=9): 16 [] A!=B| -rr(C,A)|rr(C,B).
% 11.76/12.01 ** KEPT (pick-wt=7): 17 [] A!=B| -xsd_integer(A)|xsd_integer(B).
% 11.76/12.01 ** KEPT (pick-wt=7): 18 [] A!=B| -xsd_string(A)|xsd_string(B).
% 11.76/12.01 ** KEPT (pick-wt=2): 19 [] -cowlNothing(A).
% 11.76/12.01 ** KEPT (pick-wt=4): 20 [] -xsd_string(A)| -xsd_integer(A).
% 11.76/12.01 ** KEPT (pick-wt=6): 21 [] -cSatisfiable(A)|rinvF(A,$f1(A)).
% 11.76/12.01 ** KEPT (pick-wt=5): 22 [] -cSatisfiable(A)|ca($f1(A)).
% 11.76/12.01 ** KEPT (pick-wt=4): 23 [] -cSatisfiable(A)|caxcomp(A).
% 11.76/12.01 ** KEPT (pick-wt=6): 24 [] -cSatisfiable(A)|rinvR(A,$f2(A)).
% 11.76/12.01 ** KEPT (pick-wt=5): 25 [] -cSatisfiable(A)|ca_Vx2($f2(A)).
% 11.76/12.01 ** KEPT (pick-wt=14): 26 [] cSatisfiable(A)| -rinvF(A,B)| -ca(B)| -caxcomp(A)| -rinvR(A,C)| -ca_Vx2(C).
% 11.76/12.01 ** KEPT (pick-wt=5): 27 [] -ca(A)| -ra_Px1(A,B).
% 11.76/12.01 ** KEPT (pick-wt=6): 28 [] -caxcomp(A)|ra_Px1(A,$f4(A)).
% 11.76/12.01 ** KEPT (pick-wt=5): 29 [] caxcomp(A)| -ra_Px1(A,B).
% 11.76/12.01 ** KEPT (pick-wt=6): 30 [] -ca_Vx2(A)|rinvF(A,$f5(A)).
% 11.76/12.01 ** KEPT (pick-wt=5): 31 [] -ca_Vx2(A)|ca($f5(A)).
% 11.76/12.01 ** KEPT (pick-wt=7): 32 [] ca_Vx2(A)| -rinvF(A,B)| -ca(B).
% 11.76/12.01 ** KEPT (pick-wt=11): 33 [] -cowlThing(A)| -rf(A,B)| -rf(A,C)|B=C.
% 11.76/12.01 ** KEPT (pick-wt=6): 34 [] -rinvF(A,B)|rf(B,A).
% 11.76/12.01 ** KEPT (pick-wt=6): 35 [] rinvF(A,B)| -rf(B,A).
% 11.76/12.01 ** KEPT (pick-wt=6): 36 [] -rinvR(A,B)|rr(B,A).
% 11.76/12.01 ** KEPT (pick-wt=6): 37 [] rinvR(A,B)| -rr(B,A).
% 11.76/12.01 ** KEPT (pick-wt=9): 38 [] -rr(A,B)| -rr(B,C)|rr(A,C).
% 11.76/12.01 ** KEPT (pick-wt=6): 39 [] -rf(A,B)|rr(A,B).
% 11.76/12.01 19 back subsumes 5.
% 11.76/12.01
% 11.76/12.01 ------------> process sos:
% 11.76/12.01 ** KEPT (pick-wt=3): 41 [] A=A.
% 11.76/12.01 ** KEPT (pick-wt=2): 42 [] cowlThing(A).
% 11.76/12.01 ** KEPT (pick-wt=4): 43 [] xsd_string(A)|xsd_integer(A).
% 11.76/12.01 ** KEPT (pick-wt=6): 44 [] ca(A)|ra_Px1(A,$f3(A)).
% 11.76/12.01 ** KEPT (pick-wt=2): 45 [] cSatisfiable(i2003_11_14_17_16_25617).
% 11.76/12.01 Following clause subsumed by 41 during input processing: 0 [copy,41,flip.1] A=A.
% 11.76/12.01 41 back subsumes 40.
% 11.76/12.01 42 back subsumes 6.
% 11.76/12.01
% 11.76/12.01 ======= end of input processing =======
% 11.76/12.01
% 11.76/12.01 =========== start of search ===========
% 11.76/12.01
% 11.76/12.01
% 11.76/12.01 Resetting weight limit to 15.
% 11.76/12.01
% 11.76/12.01
% 11.76/12.01 Resetting weight limit to 15.
% 11.76/12.01
% 11.76/12.01 sos_size=3072
% 11.76/12.01
% 11.76/12.01 Search stopped because sos empty.
% 11.76/12.01
% 11.76/12.01
% 11.76/12.01 Search stopped because sos empty.
% 11.76/12.01
% 11.76/12.01 ============ end of search ============
% 11.76/12.01
% 11.76/12.01 -------------- statistics -------------
% 11.76/12.01 clauses given 3575
% 11.76/12.01 clauses generated 36447
% 11.76/12.01 clauses kept 3617
% 11.76/12.01 clauses forward subsumed 15912
% 11.76/12.01 clauses back subsumed 5
% 11.76/12.01 Kbytes malloced 4882
% 11.76/12.01
% 11.76/12.01 ----------- times (seconds) -----------
% 11.76/12.01 user CPU time 9.79 (0 hr, 0 min, 9 sec)
% 11.76/12.01 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 11.76/12.01 wall-clock time 12 (0 hr, 0 min, 12 sec)
% 11.76/12.01
% 11.76/12.01 Process 6879 finished Wed Jul 27 03:36:05 2022
% 11.76/12.01 Otter interrupted
% 11.76/12.01 PROOF NOT FOUND
%------------------------------------------------------------------------------