TSTP Solution File: KRS016-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : KRS016-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n016.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:58 EDT 2022
% Result : Unknown 1.68s 1.90s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS016-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n016.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:53:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.90 ----- Otter 3.3f, August 2004 -----
% 1.68/1.90 The process was started by sandbox2 on n016.cluster.edu,
% 1.68/1.90 Wed Jul 27 03:53:07 2022
% 1.68/1.90 The command was "./otter". The process ID is 28140.
% 1.68/1.90
% 1.68/1.90 set(prolog_style_variables).
% 1.68/1.90 set(auto).
% 1.68/1.90 dependent: set(auto1).
% 1.68/1.90 dependent: set(process_input).
% 1.68/1.90 dependent: clear(print_kept).
% 1.68/1.90 dependent: clear(print_new_demod).
% 1.68/1.90 dependent: clear(print_back_demod).
% 1.68/1.90 dependent: clear(print_back_sub).
% 1.68/1.90 dependent: set(control_memory).
% 1.68/1.90 dependent: assign(max_mem, 12000).
% 1.68/1.90 dependent: assign(pick_given_ratio, 4).
% 1.68/1.90 dependent: assign(stats_level, 1).
% 1.68/1.90 dependent: assign(max_seconds, 10800).
% 1.68/1.90 clear(print_given).
% 1.68/1.90
% 1.68/1.90 list(usable).
% 1.68/1.90 0 [] c(exist).
% 1.68/1.90 0 [] d(exist).
% 1.68/1.90 0 [] s(X1,X2)| -c(X1)| -r(X1,X2).
% 1.68/1.90 0 [] r(X1,X2)| -c(X1)| -s(X1,X2).
% 1.68/1.90 0 [] r1most(X1)| -c(X1).
% 1.68/1.90 0 [] c(X1)|s(X1,u0r1(X1))|r(X1,u0r1(X1))| -r1most(X1).
% 1.68/1.90 0 [] c(X1)| -r1most(X1)| -r(X1,u0r1(X1))| -s(X1,u0r1(X1)).
% 1.68/1.90 0 [] e_qualish(X3,X2)| -r1most(X1)| -r(X1,X3)| -r(X1,X2).
% 1.68/1.90 0 [] r1most(X1)| -e_qualish(u1r2(X1),u1r1(X1)).
% 1.68/1.90 0 [] r1most(X1)|r(X1,u1r1(X1)).
% 1.68/1.90 0 [] r1most(X1)|r(X1,u1r2(X1)).
% 1.68/1.90 0 [] -d(X1)| -r(X1,X2)| -s(X1,X2).
% 1.68/1.90 0 [] s1most(X1)| -d(X1).
% 1.68/1.90 0 [] d(X1)|s(X1,u2r1(X1))| -s1most(X1).
% 1.68/1.90 0 [] d(X1)|r(X1,u2r1(X1))| -s1most(X1).
% 1.68/1.90 0 [] e_qualish(X3,X2)| -s1most(X1)| -s(X1,X3)| -s(X1,X2).
% 1.68/1.90 0 [] s1most(X1)| -e_qualish(u3r2(X1),u3r1(X1)).
% 1.68/1.90 0 [] s1most(X1)|s(X1,u3r1(X1)).
% 1.68/1.90 0 [] s1most(X1)|s(X1,u3r2(X1)).
% 1.68/1.90 end_of_list.
% 1.68/1.90
% 1.68/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.68/1.90
% 1.68/1.90 This is a non-Horn set without equality. The strategy will
% 1.68/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.68/1.90 satellites in sos and with nuclei in usable.
% 1.68/1.90
% 1.68/1.90 dependent: set(hyper_res).
% 1.68/1.90 dependent: set(factor).
% 1.68/1.90 dependent: set(unit_deletion).
% 1.68/1.90
% 1.68/1.90 ------------> process usable:
% 1.68/1.90 ** KEPT (pick-wt=8): 1 [] s(A,B)| -c(A)| -r(A,B).
% 1.68/1.90 ** KEPT (pick-wt=8): 2 [] r(A,B)| -c(A)| -s(A,B).
% 1.68/1.90 ** KEPT (pick-wt=4): 3 [] r1most(A)| -c(A).
% 1.68/1.90 ** KEPT (pick-wt=12): 4 [] c(A)|s(A,u0r1(A))|r(A,u0r1(A))| -r1most(A).
% 1.68/1.90 ** KEPT (pick-wt=12): 5 [] c(A)| -r1most(A)| -r(A,u0r1(A))| -s(A,u0r1(A)).
% 1.68/1.90 ** KEPT (pick-wt=11): 6 [] e_qualish(A,B)| -r1most(C)| -r(C,A)| -r(C,B).
% 1.68/1.90 ** KEPT (pick-wt=7): 7 [] r1most(A)| -e_qualish(u1r2(A),u1r1(A)).
% 1.68/1.90 ** KEPT (pick-wt=8): 8 [] -d(A)| -r(A,B)| -s(A,B).
% 1.68/1.90 ** KEPT (pick-wt=4): 9 [] s1most(A)| -d(A).
% 1.68/1.90 ** KEPT (pick-wt=8): 10 [] d(A)|s(A,u2r1(A))| -s1most(A).
% 1.68/1.90 ** KEPT (pick-wt=8): 11 [] d(A)|r(A,u2r1(A))| -s1most(A).
% 1.68/1.90 ** KEPT (pick-wt=11): 12 [] e_qualish(A,B)| -s1most(C)| -s(C,A)| -s(C,B).
% 1.68/1.90 ** KEPT (pick-wt=7): 13 [] s1most(A)| -e_qualish(u3r2(A),u3r1(A)).
% 1.68/1.90
% 1.68/1.90 ------------> process sos:
% 1.68/1.90 ** KEPT (pick-wt=2): 16 [] c(exist).
% 1.68/1.90 ** KEPT (pick-wt=2): 17 [] d(exist).
% 1.68/1.90 ** KEPT (pick-wt=6): 18 [] r1most(A)|r(A,u1r1(A)).
% 1.68/1.90 ** KEPT (pick-wt=6): 19 [] r1most(A)|r(A,u1r2(A)).
% 1.68/1.90 ** KEPT (pick-wt=6): 20 [] s1most(A)|s(A,u3r1(A)).
% 1.68/1.90 ** KEPT (pick-wt=6): 21 [] s1most(A)|s(A,u3r2(A)).
% 1.68/1.90
% 1.68/1.90 ======= end of input processing =======
% 1.68/1.90
% 1.68/1.90 =========== start of search ===========
% 1.68/1.90
% 1.68/1.90 Search stopped because sos empty.
% 1.68/1.90
% 1.68/1.90
% 1.68/1.90 Search stopped because sos empty.
% 1.68/1.90
% 1.68/1.90 ============ end of search ============
% 1.68/1.90
% 1.68/1.90 -------------- statistics -------------
% 1.68/1.90 clauses given 14
% 1.68/1.90 clauses generated 19
% 1.68/1.90 clauses kept 29
% 1.68/1.90 clauses forward subsumed 9
% 1.68/1.90 clauses back subsumed 0
% 1.68/1.90 Kbytes malloced 976
% 1.68/1.90
% 1.68/1.90 ----------- times (seconds) -----------
% 1.68/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/1.90
% 1.68/1.90 Process 28140 finished Wed Jul 27 03:53:08 2022
% 1.68/1.90 Otter interrupted
% 1.68/1.90 PROOF NOT FOUND
%------------------------------------------------------------------------------