TSTP Solution File: KRS008-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS008-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:00:57 EDT 2022
% Result : Timeout 299.84s 300.03s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : KRS008-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n011.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:27:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.87/2.12 ----- Otter 3.3f, August 2004 -----
% 1.87/2.12 The process was started by sandbox2 on n011.cluster.edu,
% 1.87/2.12 Wed Jul 27 03:27:10 2022
% 1.87/2.12 The command was "./otter". The process ID is 25503.
% 1.87/2.12
% 1.87/2.12 set(prolog_style_variables).
% 1.87/2.12 set(auto).
% 1.87/2.12 dependent: set(auto1).
% 1.87/2.12 dependent: set(process_input).
% 1.87/2.12 dependent: clear(print_kept).
% 1.87/2.12 dependent: clear(print_new_demod).
% 1.87/2.12 dependent: clear(print_back_demod).
% 1.87/2.12 dependent: clear(print_back_sub).
% 1.87/2.12 dependent: set(control_memory).
% 1.87/2.12 dependent: assign(max_mem, 12000).
% 1.87/2.12 dependent: assign(pick_given_ratio, 4).
% 1.87/2.12 dependent: assign(stats_level, 1).
% 1.87/2.12 dependent: assign(max_seconds, 10800).
% 1.87/2.12 clear(print_given).
% 1.87/2.12
% 1.87/2.12 list(usable).
% 1.87/2.12 0 [] e(exist).
% 1.87/2.12 0 [] -f(exist).
% 1.87/2.12 0 [] s2least(X1)| -c(X1).
% 1.87/2.12 0 [] c(X1)| -s2least(X1).
% 1.87/2.12 0 [] -s2least(X1)| -e_qualish(u1r2(X1),u1r1(X1)).
% 1.87/2.12 0 [] s(X1,u1r1(X1))| -s2least(X1).
% 1.87/2.12 0 [] s(X1,u1r2(X1))| -s2least(X1).
% 1.87/2.12 0 [] s2least(X1)|e_qualish(X3,X2)| -s(X1,X3)| -s(X1,X2).
% 1.87/2.12 0 [] s1most(X1)| -d(X1).
% 1.87/2.12 0 [] d(X1)| -s1most(X1).
% 1.87/2.12 0 [] e_qualish(X3,X2)| -s1most(X1)| -s(X1,X3)| -s(X1,X2).
% 1.87/2.12 0 [] s1most(X1)| -e_qualish(u3r2(X1),u3r1(X1)).
% 1.94/2.12 0 [] s1most(X1)|s(X1,u3r1(X1)).
% 1.94/2.12 0 [] s1most(X1)|s(X1,u3r2(X1)).
% 1.94/2.12 0 [] d(u4r2(X1))| -e(X1).
% 1.94/2.12 0 [] r(X1,u4r2(X1))| -e(X1).
% 1.94/2.12 0 [] c(u4r1(X1))| -e(X1).
% 1.94/2.12 0 [] r(X1,u4r1(X1))| -e(X1).
% 1.94/2.12 0 [] r2most(X1)| -e(X1).
% 1.94/2.12 0 [] e(X1)| -r2most(X1)| -r(X1,X2)| -c(X2)| -r(X1,X3)| -d(X3).
% 1.94/2.12 0 [] e_qualish(X4,X3)|e_qualish(X4,X2)|e_qualish(X3,X2)| -r2most(X1)| -r(X1,X4)| -r(X1,X3)| -r(X1,X2).
% 1.94/2.12 0 [] r2most(X1)| -e_qualish(u5r2(X1),u5r1(X1)).
% 1.94/2.12 0 [] r2most(X1)| -e_qualish(u5r3(X1),u5r1(X1)).
% 1.94/2.12 0 [] r2most(X1)| -e_qualish(u5r3(X1),u5r2(X1)).
% 1.94/2.12 0 [] r2most(X1)|r(X1,u5r1(X1)).
% 1.94/2.12 0 [] r2most(X1)|r(X1,u5r2(X1)).
% 1.94/2.12 0 [] r2most(X1)|r(X1,u5r3(X1)).
% 1.94/2.12 0 [] e_qualish(X5,X4)| -f(X1)| -r(X1,X5)| -r(X1,X4)| -d(X5)| -d(X4).
% 1.94/2.12 0 [] e_qualish(X3,X2)| -f(X1)| -r(X1,X3)| -r(X1,X2)| -c(X3)| -c(X2).
% 1.94/2.12 0 [] f(X1)| -e_qualish(u6r2(X1),u6r1(X1))| -e_qualish(u6r4(X1),u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|d(u6r3(X1))| -e_qualish(u6r2(X1),u6r1(X1)).
% 1.94/2.12 0 [] f(X1)|d(u6r4(X1))| -e_qualish(u6r2(X1),u6r1(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r3(X1))| -e_qualish(u6r2(X1),u6r1(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r4(X1))| -e_qualish(u6r2(X1),u6r1(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r1(X1))| -e_qualish(u6r4(X1),u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r1(X1))|d(u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r1(X1))|d(u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r1(X1))|r(X1,u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r1(X1))|r(X1,u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r2(X1))| -e_qualish(u6r4(X1),u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r2(X1))|d(u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r2(X1))|d(u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r2(X1))|r(X1,u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|c(u6r2(X1))|r(X1,u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r1(X1))| -e_qualish(u6r4(X1),u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r1(X1))|d(u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r1(X1))|d(u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r1(X1))|r(X1,u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r1(X1))|r(X1,u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r2(X1))| -e_qualish(u6r4(X1),u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r2(X1))|d(u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r2(X1))|d(u6r4(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r2(X1))|r(X1,u6r3(X1)).
% 1.94/2.12 0 [] f(X1)|r(X1,u6r2(X1))|r(X1,u6r4(X1)).
% 1.94/2.12 end_of_list.
% 1.94/2.12
% 1.94/2.12 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 1.94/2.12
% 1.94/2.12 This is a non-Horn set without equality. The strategy will
% 1.94/2.12 be ordered hyper_res, unit deletion, and factoring, with
% 1.94/2.12 satellites in sos and with nuclei in usable.
% 1.94/2.12
% 1.94/2.12 dependent: set(hyper_res).
% 1.94/2.12 dependent: set(factor).
% 1.94/2.12 dependent: set(unit_deletion).
% 1.94/2.12
% 1.94/2.12 ------------> process usable:
% 1.94/2.12 ** KEPT (pick-wt=2): 1 [] -f(exist).
% 1.94/2.12 ** KEPT (pick-wt=4): 2 [] s2least(A)| -c(A).
% 1.94/2.12 ** KEPT (pick-wt=4): 3 [] c(A)| -s2least(A).
% 1.94/2.12 ** KEPT (pick-wt=7): 4 [] -s2least(A)| -e_qualish(u1r2(A),u1r1(A)).
% 1.94/2.12 ** KEPT (pick-wt=6): 5 [] s(A,u1r1(A))| -s2least(A).
% 1.94/2.12 ** KEPT (pick-wt=6): 6 [] s(A,u1r2(A))| -s2least(A).
% 1.94/2.12 ** KEPT (pick-wt=11): 7 [] s2least(A)|e_qualish(B,C)| -s(A,B)| -s(A,C).
% 1.94/2.12 ** KEPT (pick-wt=4): 8 [] s1most(A)| -d(A).
% 1.94/2.12 ** KEPT (pick-wt=4): 9 [] d(A)| -s1most(A).
% 1.94/2.12 ** KEPT (pick-wt=11): 10 [] e_qualish(A,B)| -s1most(C)| -s(C,A)| -s(C,B).
% 1.94/2.12 ** KEPT (pick-wt=7): 11 [] s1most(A)| -e_qualish(u3r2(A),u3r1(A)).
% 1.94/2.12 ** KEPT (pick-wt=5): 12 [] d(u4r2(A))| -e(A).
% 1.94/2.12 ** KEPT (pick-wt=6): 13 [] r(A,u4r2(A))| -e(A).
% 1.94/2.12 ** KEPT (pick-wt=5): 14 [] c(u4r1(A))| -e(A).
% 1.94/2.12 ** KEPT (pick-wt=6): 15 [] r(A,Alarm clock
% 299.84/300.03 Otter interrupted
% 299.84/300.03 PROOF NOT FOUND
%------------------------------------------------------------------------------