TSTP Solution File: KRS009-1 by Otter---3.3

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Otter---3.3
% Problem  : KRS009-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : otter-tptp-script %s

% Computer : n013.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   : Unknown 1.89s 2.08s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : KRS009-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12  % Command  : otter-tptp-script %s
% 0.12/0.33  % Computer : n013.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:21:15 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.89/2.08  ----- Otter 3.3f, August 2004 -----
% 1.89/2.08  The process was started by sandbox2 on n013.cluster.edu,
% 1.89/2.08  Wed Jul 27 03:21:15 2022
% 1.89/2.08  The command was "./otter".  The process ID is 8325.
% 1.89/2.08  
% 1.89/2.08  set(prolog_style_variables).
% 1.89/2.08  set(auto).
% 1.89/2.08     dependent: set(auto1).
% 1.89/2.08     dependent: set(process_input).
% 1.89/2.08     dependent: clear(print_kept).
% 1.89/2.08     dependent: clear(print_new_demod).
% 1.89/2.08     dependent: clear(print_back_demod).
% 1.89/2.08     dependent: clear(print_back_sub).
% 1.89/2.08     dependent: set(control_memory).
% 1.89/2.08     dependent: assign(max_mem, 12000).
% 1.89/2.08     dependent: assign(pick_given_ratio, 4).
% 1.89/2.08     dependent: assign(stats_level, 1).
% 1.89/2.08     dependent: assign(max_seconds, 10800).
% 1.89/2.08  clear(print_given).
% 1.89/2.08  
% 1.89/2.08  list(usable).
% 1.89/2.08  0 [] e(exist).
% 1.89/2.08  0 [] p2least(X1)| -c(X1).
% 1.89/2.08  0 [] c(X1)| -p2least(X1).
% 1.89/2.08  0 [] -p2least(X1)| -e_qualish(u1r2(X1),u1r1(X1)).
% 1.89/2.08  0 [] p(X1,u1r1(X1))| -p2least(X1).
% 1.89/2.08  0 [] p(X1,u1r2(X1))| -p2least(X1).
% 1.89/2.08  0 [] p2least(X1)|e_qualish(X3,X2)| -p(X1,X3)| -p(X1,X2).
% 1.89/2.08  0 [] p1most(X1)| -d(X1).
% 1.89/2.08  0 [] d(X1)| -p1most(X1).
% 1.89/2.08  0 [] e_qualish(X3,X2)| -p1most(X1)| -p(X1,X3)| -p(X1,X2).
% 1.89/2.08  0 [] p1most(X1)| -e_qualish(u3r2(X1),u3r1(X1)).
% 1.89/2.08  0 [] p1most(X1)|p(X1,u3r1(X1)).
% 1.89/2.08  0 [] p1most(X1)|p(X1,u3r2(X1)).
% 1.89/2.08  0 [] c(X1)|d(X1)| -a(X1).
% 1.89/2.08  0 [] a(X1)| -d(X1).
% 1.89/2.08  0 [] a(X1)| -c(X1).
% 1.89/2.08  0 [] c(X2)| -r(X1,X2).
% 1.89/2.08  0 [] t(X1,X2)| -r(X1,X2).
% 1.89/2.08  0 [] d(X2)| -s(X1,X2).
% 1.89/2.08  0 [] t(X1,X2)| -s(X1,X2).
% 1.89/2.08  0 [] s1most(X1)| -e(X1).
% 1.89/2.08  0 [] r1most(X1)| -e(X1).
% 1.89/2.08  0 [] t3least(X1)| -e(X1).
% 1.89/2.08  0 [] a(X2)| -e(X1)| -t(X1,X2).
% 1.89/2.08  0 [] e(X1)| -a(u7r1(X1))| -t3least(X1)| -r1most(X1)| -s1most(X1).
% 1.89/2.08  0 [] e(X1)|t(X1,u7r1(X1))| -t3least(X1)| -r1most(X1)| -s1most(X1).
% 1.89/2.08  0 [] -t3least(X1)| -e_qualish(u8r2(X1),u8r1(X1)).
% 1.89/2.08  0 [] -t3least(X1)| -e_qualish(u8r3(X1),u8r1(X1)).
% 1.89/2.08  0 [] -t3least(X1)| -e_qualish(u8r3(X1),u8r2(X1)).
% 1.89/2.08  0 [] t(X1,u8r1(X1))| -t3least(X1).
% 1.89/2.08  0 [] t(X1,u8r2(X1))| -t3least(X1).
% 1.89/2.08  0 [] t(X1,u8r3(X1))| -t3least(X1).
% 1.89/2.08  0 [] t3least(X1)|e_qualish(X4,X3)|e_qualish(X4,X2)|e_qualish(X3,X2)| -t(X1,X4)| -t(X1,X3)| -t(X1,X2).
% 1.89/2.08  0 [] e_qualish(X3,X2)| -r1most(X1)| -r(X1,X3)| -r(X1,X2).
% 1.89/2.08  0 [] r1most(X1)| -e_qualish(u9r2(X1),u9r1(X1)).
% 1.89/2.08  0 [] r1most(X1)|r(X1,u9r1(X1)).
% 1.89/2.08  0 [] r1most(X1)|r(X1,u9r2(X1)).
% 1.89/2.08  0 [] e_qualish(X3,X2)| -s1most(X1)| -s(X1,X3)| -s(X1,X2).
% 1.89/2.08  0 [] s1most(X1)| -e_qualish(u10r2(X1),u10r1(X1)).
% 1.89/2.08  0 [] s1most(X1)|s(X1,u10r1(X1)).
% 1.89/2.08  0 [] s1most(X1)|s(X1,u10r2(X1)).
% 1.89/2.08  end_of_list.
% 1.89/2.08  
% 1.89/2.08  SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=7.
% 1.89/2.08  
% 1.89/2.08  This is a non-Horn set without equality.  The strategy will
% 1.89/2.08  be ordered hyper_res, unit deletion, and factoring, with
% 1.89/2.08  satellites in sos and with nuclei in usable.
% 1.89/2.08  
% 1.89/2.08     dependent: set(hyper_res).
% 1.89/2.08     dependent: set(factor).
% 1.89/2.08     dependent: set(unit_deletion).
% 1.89/2.08  
% 1.89/2.08  ------------> process usable:
% 1.89/2.08  ** KEPT (pick-wt=4): 1 [] p2least(A)| -c(A).
% 1.89/2.08  ** KEPT (pick-wt=4): 2 [] c(A)| -p2least(A).
% 1.89/2.08  ** KEPT (pick-wt=7): 3 [] -p2least(A)| -e_qualish(u1r2(A),u1r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 4 [] p(A,u1r1(A))| -p2least(A).
% 1.89/2.08  ** KEPT (pick-wt=6): 5 [] p(A,u1r2(A))| -p2least(A).
% 1.89/2.08  ** KEPT (pick-wt=11): 6 [] p2least(A)|e_qualish(B,C)| -p(A,B)| -p(A,C).
% 1.89/2.08  ** KEPT (pick-wt=4): 7 [] p1most(A)| -d(A).
% 1.89/2.08  ** KEPT (pick-wt=4): 8 [] d(A)| -p1most(A).
% 1.89/2.08  ** KEPT (pick-wt=11): 9 [] e_qualish(A,B)| -p1most(C)| -p(C,A)| -p(C,B).
% 1.89/2.08  ** KEPT (pick-wt=7): 10 [] p1most(A)| -e_qualish(u3r2(A),u3r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 11 [] c(A)|d(A)| -a(A).
% 1.89/2.08  ** KEPT (pick-wt=4): 12 [] a(A)| -d(A).
% 1.89/2.08  ** KEPT (pick-wt=4): 13 [] a(A)| -c(A).
% 1.89/2.08  ** KEPT (pick-wt=5): 14 [] c(A)| -r(B,A).
% 1.89/2.08  ** KEPT (pick-wt=6): 15 [] t(A,B)| -r(A,B).
% 1.89/2.08  ** KEPT (pick-wt=5): 16 [] d(A)| -s(B,A).
% 1.89/2.08  ** KEPT (pick-wt=6): 17 [] t(A,B)| -s(A,B).
% 1.89/2.08  ** KEPT (pick-wt=4): 18 [] s1most(A)| -e(A).
% 1.89/2.08  ** KEPT (pick-wt=4): 19 [] r1most(A)| -e(A).
% 1.89/2.08  ** KEPT (pick-wt=4): 20 [] t3least(A)| -e(A).
% 1.89/2.08  ** KEPT (pick-wt=7): 21 [] a(A)| -e(B)| -t(B,A).
% 1.89/2.08  ** KEPT (pick-wt=11): 22 [] e(A)| -a(u7r1(A))| -t3least(A)| -r1most(A)| -s1most(A).
% 1.89/2.08  ** KEPT (pick-wt=12): 23 [] e(A)|t(A,u7r1(A))| -t3least(A)| -r1most(A)| -s1most(A).
% 1.89/2.08  ** KEPT (pick-wt=7): 24 [] -t3least(A)| -e_qualish(u8r2(A),u8r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=7): 25 [] -t3least(A)| -e_qualish(u8r3(A),u8r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=7): 26 [] -t3least(A)| -e_qualish(u8r3(A),u8r2(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 27 [] t(A,u8r1(A))| -t3least(A).
% 1.89/2.08  ** KEPT (pick-wt=6): 28 [] t(A,u8r2(A))| -t3least(A).
% 1.89/2.08  ** KEPT (pick-wt=6): 29 [] t(A,u8r3(A))| -t3least(A).
% 1.89/2.08  ** KEPT (pick-wt=20): 30 [] t3least(A)|e_qualish(B,C)|e_qualish(B,D)|e_qualish(C,D)| -t(A,B)| -t(A,C)| -t(A,D).
% 1.89/2.08  ** KEPT (pick-wt=11): 31 [] e_qualish(A,B)| -r1most(C)| -r(C,A)| -r(C,B).
% 1.89/2.08  ** KEPT (pick-wt=7): 32 [] r1most(A)| -e_qualish(u9r2(A),u9r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=11): 33 [] e_qualish(A,B)| -s1most(C)| -s(C,A)| -s(C,B).
% 1.89/2.08  ** KEPT (pick-wt=7): 34 [] s1most(A)| -e_qualish(u10r2(A),u10r1(A)).
% 1.89/2.08  
% 1.89/2.08  ------------> process sos:
% 1.89/2.08  ** KEPT (pick-wt=2): 40 [] e(exist).
% 1.89/2.08  ** KEPT (pick-wt=6): 41 [] p1most(A)|p(A,u3r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 42 [] p1most(A)|p(A,u3r2(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 43 [] r1most(A)|r(A,u9r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 44 [] r1most(A)|r(A,u9r2(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 45 [] s1most(A)|s(A,u10r1(A)).
% 1.89/2.08  ** KEPT (pick-wt=6): 46 [] s1most(A)|s(A,u10r2(A)).
% 1.89/2.08  
% 1.89/2.08  ======= end of input processing =======
% 1.89/2.08  
% 1.89/2.08  =========== start of search ===========
% 1.89/2.08  
% 1.89/2.08  Search stopped because sos empty.
% 1.89/2.08  
% 1.89/2.08  
% 1.89/2.08  Search stopped because sos empty.
% 1.89/2.08  
% 1.89/2.08  ============ end of search ============
% 1.89/2.08  
% 1.89/2.08  -------------- statistics -------------
% 1.89/2.08  clauses given                 26
% 1.89/2.08  clauses generated            111
% 1.89/2.08  clauses kept                  65
% 1.89/2.08  clauses forward subsumed      87
% 1.89/2.08  clauses back subsumed          0
% 1.89/2.08  Kbytes malloced              976
% 1.89/2.08  
% 1.89/2.08  ----------- times (seconds) -----------
% 1.89/2.08  user CPU time          0.00          (0 hr, 0 min, 0 sec)
% 1.89/2.08  system CPU time        0.00          (0 hr, 0 min, 0 sec)
% 1.89/2.08  wall-clock time        1             (0 hr, 0 min, 1 sec)
% 1.89/2.08  
% 1.89/2.08  Process 8325 finished Wed Jul 27 03:21:16 2022
% 1.89/2.08  Otter interrupted
% 1.89/2.08  PROOF NOT FOUND
%------------------------------------------------------------------------------