TSTP Solution File: SYO618-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYO618-1 : TPTP v8.1.0. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n006.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:26:26 EDT 2022
% Result : Unknown 35.34s 35.53s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYO618-1 : TPTP v8.1.0. Released v7.1.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n006.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 10:21:31 EDT 2022
% 0.12/0.33 % CPUTime :
% 35.34/35.53 ----- Otter 3.3f, August 2004 -----
% 35.34/35.53 The process was started by sandbox2 on n006.cluster.edu,
% 35.34/35.53 Wed Jul 27 10:21:32 2022
% 35.34/35.53 The command was "./otter". The process ID is 28673.
% 35.34/35.53
% 35.34/35.53 set(prolog_style_variables).
% 35.34/35.53 set(auto).
% 35.34/35.53 dependent: set(auto1).
% 35.34/35.53 dependent: set(process_input).
% 35.34/35.53 dependent: clear(print_kept).
% 35.34/35.53 dependent: clear(print_new_demod).
% 35.34/35.53 dependent: clear(print_back_demod).
% 35.34/35.53 dependent: clear(print_back_sub).
% 35.34/35.53 dependent: set(control_memory).
% 35.34/35.53 dependent: assign(max_mem, 12000).
% 35.34/35.53 dependent: assign(pick_given_ratio, 4).
% 35.34/35.53 dependent: assign(stats_level, 1).
% 35.34/35.53 dependent: assign(max_seconds, 10800).
% 35.34/35.53 clear(print_given).
% 35.34/35.53
% 35.34/35.53 list(usable).
% 35.34/35.53 0 [] le(A,A).
% 35.34/35.53 0 [] -le(max(A,B),C)|le(A,C).
% 35.34/35.53 0 [] -le(max(A,B),C)|le(B,C).
% 35.34/35.53 0 [] e_q(f(A),a0)|e_q(f(A),a1)|e_q(f(A),a2).
% 35.34/35.53 0 [] -e_q(f(A0),a0)| -e_q(f(A1),a0)| -e_q(f(A2),a0)| -e_q(f(A3),a0)| -e_q(f(A4),a0)| -e_q(f(A5),a0)| -e_q(f(A6),a0)| -le(s(A0),A1)| -le(s(A1),A2)| -le(s(A2),A3)| -le(s(A3),A4)| -le(s(A4),A5)| -le(s(A5),A6).
% 35.34/35.53 0 [] -e_q(f(A0),a1)| -e_q(f(A1),a1)| -e_q(f(A2),a1)| -e_q(f(A3),a1)| -e_q(f(A4),a1)| -e_q(f(A5),a1)| -e_q(f(A6),a1)| -le(s(A0),A1)| -le(s(A1),A2)| -le(s(A2),A3)| -le(s(A3),A4)| -le(s(A4),A5)| -le(s(A5),A6).
% 35.34/35.53 0 [] -e_q(f(A0),a2)| -e_q(f(A1),a2)| -e_q(f(A2),a2)| -e_q(f(A3),a2)| -e_q(f(A4),a2)| -e_q(f(A5),a2)| -e_q(f(A6),a2)| -le(s(A0),A1)| -le(s(A1),A2)| -le(s(A2),A3)| -le(s(A3),A4)| -le(s(A4),A5)| -le(s(A5),A6).
% 35.34/35.53 end_of_list.
% 35.34/35.53
% 35.34/35.53 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=13.
% 35.34/35.53
% 35.34/35.53 This is a non-Horn set without equality. The strategy will
% 35.34/35.53 be ordered hyper_res, unit deletion, and factoring, with
% 35.34/35.53 satellites in sos and with nuclei in usable.
% 35.34/35.53
% 35.34/35.53 dependent: set(hyper_res).
% 35.34/35.53 dependent: set(factor).
% 35.34/35.53 dependent: set(unit_deletion).
% 35.34/35.53
% 35.34/35.53 ------------> process usable:
% 35.34/35.53 ** KEPT (pick-wt=8): 1 [] -le(max(A,B),C)|le(A,C).
% 35.34/35.53 ** KEPT (pick-wt=8): 2 [] -le(max(A,B),C)|le(B,C).
% 35.34/35.53 ** KEPT (pick-wt=52): 3 [] -e_q(f(A),a0)| -e_q(f(B),a0)| -e_q(f(C),a0)| -e_q(f(D),a0)| -e_q(f(E),a0)| -e_q(f(F),a0)| -e_q(f(G),a0)| -le(s(A),B)| -le(s(B),C)| -le(s(C),D)| -le(s(D),E)| -le(s(E),F)| -le(s(F),G).
% 35.34/35.53 ** KEPT (pick-wt=52): 4 [] -e_q(f(A),a1)| -e_q(f(B),a1)| -e_q(f(C),a1)| -e_q(f(D),a1)| -e_q(f(E),a1)| -e_q(f(F),a1)| -e_q(f(G),a1)| -le(s(A),B)| -le(s(B),C)| -le(s(C),D)| -le(s(D),E)| -le(s(E),F)| -le(s(F),G).
% 35.34/35.53 ** KEPT (pick-wt=52): 5 [] -e_q(f(A),a2)| -e_q(f(B),a2)| -e_q(f(C),a2)| -e_q(f(D),a2)| -e_q(f(E),a2)| -e_q(f(F),a2)| -e_q(f(G),a2)| -le(s(A),B)| -le(s(B),C)| -le(s(C),D)| -le(s(D),E)| -le(s(E),F)| -le(s(F),G).
% 35.34/35.53
% 35.34/35.53 ------------> process sos:
% 35.34/35.53 ** KEPT (pick-wt=3): 24 [] le(A,A).
% 35.34/35.53 ** KEPT (pick-wt=12): 25 [] e_q(f(A),a0)|e_q(f(A),a1)|e_q(f(A),a2).
% 35.34/35.53
% 35.34/35.53 ======= end of input processing =======
% 35.34/35.53
% 35.34/35.53 =========== start of search ===========
% 35.34/35.53
% 35.34/35.53 Search stopped in tp_alloc by max_mem option.
% 35.34/35.53
% 35.34/35.53 Search stopped in tp_alloc by max_mem option.
% 35.34/35.53
% 35.34/35.53 ============ end of search ============
% 35.34/35.53
% 35.34/35.53 -------------- statistics -------------
% 35.34/35.53 clauses given 6
% 35.34/35.53 clauses generated 4713
% 35.34/35.53 clauses kept 4420
% 35.34/35.53 clauses forward subsumed 300
% 35.34/35.53 clauses back subsumed 0
% 35.34/35.53 Kbytes malloced 11718
% 35.34/35.53
% 35.34/35.53 ----------- times (seconds) -----------
% 35.34/35.53 user CPU time 33.41 (0 hr, 0 min, 33 sec)
% 35.34/35.53 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 35.34/35.53 wall-clock time 35 (0 hr, 0 min, 35 sec)
% 35.34/35.53
% 35.34/35.53 Process 28673 finished Wed Jul 27 10:22:07 2022
% 35.34/35.53 Otter interrupted
% 35.34/35.53 PROOF NOT FOUND
%------------------------------------------------------------------------------