TSTP Solution File: HWC004-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : HWC004-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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 12:58:02 EDT 2022
% Result : Unknown 1.70s 1.90s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : HWC004-1 : TPTP v8.1.0. Released v2.5.0.
% 0.10/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 04:05:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.70/1.90 ----- Otter 3.3f, August 2004 -----
% 1.70/1.90 The process was started by sandbox on n022.cluster.edu,
% 1.70/1.90 Wed Jul 27 04:05:05 2022
% 1.70/1.90 The command was "./otter". The process ID is 23066.
% 1.70/1.90
% 1.70/1.90 set(prolog_style_variables).
% 1.70/1.90 set(auto).
% 1.70/1.90 dependent: set(auto1).
% 1.70/1.90 dependent: set(process_input).
% 1.70/1.90 dependent: clear(print_kept).
% 1.70/1.90 dependent: clear(print_new_demod).
% 1.70/1.90 dependent: clear(print_back_demod).
% 1.70/1.90 dependent: clear(print_back_sub).
% 1.70/1.90 dependent: set(control_memory).
% 1.70/1.90 dependent: assign(max_mem, 12000).
% 1.70/1.90 dependent: assign(pick_given_ratio, 4).
% 1.70/1.90 dependent: assign(stats_level, 1).
% 1.70/1.90 dependent: assign(max_seconds, 10800).
% 1.70/1.90 clear(print_given).
% 1.70/1.90
% 1.70/1.90 list(usable).
% 1.70/1.90 0 [] A=A.
% 1.70/1.90 0 [] and(n0,n0)=n0.
% 1.70/1.90 0 [] and(n0,n1)=n0.
% 1.70/1.90 0 [] and(n1,n0)=n0.
% 1.70/1.90 0 [] and(n1,n1)=n1.
% 1.70/1.90 0 [] or(n0,n0)=n0.
% 1.70/1.90 0 [] or(n0,n1)=n1.
% 1.70/1.90 0 [] or(n1,n0)=n1.
% 1.70/1.90 0 [] or(n1,n1)=n1.
% 1.70/1.90 0 [] not(n0)=n1.
% 1.70/1.90 0 [] not(n1)=n0.
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.70/1.90
% 1.70/1.90 All clauses are units, and equality is present; the
% 1.70/1.90 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.70/1.90
% 1.70/1.90 dependent: set(knuth_bendix).
% 1.70/1.90 dependent: set(anl_eq).
% 1.70/1.90 dependent: set(para_from).
% 1.70/1.90 dependent: set(para_into).
% 1.70/1.90 dependent: clear(para_from_right).
% 1.70/1.90 dependent: clear(para_into_right).
% 1.70/1.90 dependent: set(para_from_vars).
% 1.70/1.90 dependent: set(eq_units_both_ways).
% 1.70/1.90 dependent: set(dynamic_demod_all).
% 1.70/1.90 dependent: set(dynamic_demod).
% 1.70/1.90 dependent: set(order_eq).
% 1.70/1.90 dependent: set(back_demod).
% 1.70/1.90 dependent: set(lrpo).
% 1.70/1.90
% 1.70/1.90 There is no negative clause, so all clause lists will
% 1.70/1.90 be printed at the end of the search.
% 1.70/1.90
% 1.70/1.90 dependent: set(print_lists_at_end).
% 1.70/1.90
% 1.70/1.90 ------------> process usable:
% 1.70/1.90
% 1.70/1.90 ------------> process sos:
% 1.70/1.90 ** KEPT (pick-wt=3): 1 [] A=A.
% 1.70/1.90 ** KEPT (pick-wt=5): 2 [] and(n0,n0)=n0.
% 1.70/1.90 ---> New Demodulator: 3 [new_demod,2] and(n0,n0)=n0.
% 1.70/1.90 ** KEPT (pick-wt=5): 4 [] and(n0,n1)=n0.
% 1.70/1.90 ---> New Demodulator: 5 [new_demod,4] and(n0,n1)=n0.
% 1.70/1.90 ** KEPT (pick-wt=5): 6 [] and(n1,n0)=n0.
% 1.70/1.90 ---> New Demodulator: 7 [new_demod,6] and(n1,n0)=n0.
% 1.70/1.90 ** KEPT (pick-wt=5): 8 [] and(n1,n1)=n1.
% 1.70/1.90 ---> New Demodulator: 9 [new_demod,8] and(n1,n1)=n1.
% 1.70/1.90 ** KEPT (pick-wt=5): 10 [] or(n0,n0)=n0.
% 1.70/1.90 ---> New Demodulator: 11 [new_demod,10] or(n0,n0)=n0.
% 1.70/1.90 ** KEPT (pick-wt=5): 12 [] or(n0,n1)=n1.
% 1.70/1.90 ---> New Demodulator: 13 [new_demod,12] or(n0,n1)=n1.
% 1.70/1.90 ** KEPT (pick-wt=5): 14 [] or(n1,n0)=n1.
% 1.70/1.90 ---> New Demodulator: 15 [new_demod,14] or(n1,n0)=n1.
% 1.70/1.90 ** KEPT (pick-wt=5): 16 [] or(n1,n1)=n1.
% 1.70/1.90 ---> New Demodulator: 17 [new_demod,16] or(n1,n1)=n1.
% 1.70/1.90 ** KEPT (pick-wt=4): 18 [] not(n0)=n1.
% 1.70/1.90 ---> New Demodulator: 19 [new_demod,18] not(n0)=n1.
% 1.70/1.90 ** KEPT (pick-wt=4): 20 [] not(n1)=n0.
% 1.70/1.90 ---> New Demodulator: 21 [new_demod,20] not(n1)=n0.
% 1.70/1.90 Following clause subsumed by 1 during input processing: 0 [copy,1,flip.1] A=A.
% 1.70/1.90 >>>> Starting back demodulation with 3.
% 1.70/1.90 >>>> Starting back demodulation with 5.
% 1.70/1.90 >>>> Starting back demodulation with 7.
% 1.70/1.90 >>>> Starting back demodulation with 9.
% 1.70/1.90 >>>> Starting back demodulation with 11.
% 1.70/1.90 >>>> Starting back demodulation with 13.
% 1.70/1.90 >>>> Starting back demodulation with 15.
% 1.70/1.90 >>>> Starting back demodulation with 17.
% 1.70/1.90 >>>> Starting back demodulation with 19.
% 1.70/1.90 >>>> Starting back demodulation with 21.
% 1.70/1.90
% 1.70/1.90 ======= end of input processing =======
% 1.70/1.90
% 1.70/1.90 =========== start of search ===========
% 1.70/1.90
% 1.70/1.90 Search stopped because sos empty.
% 1.70/1.90
% 1.70/1.90
% 1.70/1.90 Search stopped because sos empty.
% 1.70/1.90
% 1.70/1.90 ============ end of search ============
% 1.70/1.90
% 1.70/1.90 list(usable).
% 1.70/1.90 1 [] A=A.
% 1.70/1.90 18 [] not(n0)=n1.
% 1.70/1.90 20 [] not(n1)=n0.
% 1.70/1.90 2 [] and(n0,n0)=n0.
% 1.70/1.90 4 [] and(n0,n1)=n0.
% 1.70/1.90 6 [] and(n1,n0)=n0.
% 1.70/1.90 8 [] and(n1,n1)=n1.
% 1.70/1.90 10 [] or(n0,n0)=n0.
% 1.70/1.90 12 [] or(n0,n1)=n1.
% 1.70/1.90 14 [] or(n1,n0)=n1.
% 1.70/1.90 16 [] or(n1,n1)=n1.
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 list(sos).
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 list(demodulators).
% 1.70/1.90 3 [new_demod,2] and(n0,n0)=n0.
% 1.70/1.90 5 [new_demod,4] and(n0,n1)=n0.
% 1.70/1.90 7 [new_demod,6] and(n1,n0)=n0.
% 1.70/1.90 9 [new_demod,8] and(n1,n1)=n1.
% 1.70/1.90 11 [new_demod,10] or(n0,n0)=n0.
% 1.70/1.90 13 [new_demod,12] or(n0,n1)=n1.
% 1.70/1.90 15 [new_demod,14] or(n1,n0)=n1.
% 1.70/1.90 17 [new_demod,16] or(n1,n1)=n1.
% 1.70/1.90 19 [new_demod,18] not(n0)=n1.
% 1.70/1.90 21 [new_demod,20] not(n1)=n0.
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90
% 1.70/1.90 -------------- statistics -------------
% 1.70/1.90 clauses given 11
% 1.70/1.90 clauses generated 20
% 1.70/1.90 clauses kept 11
% 1.70/1.90 clauses forward subsumed 21
% 1.70/1.90 clauses back subsumed 0
% 1.70/1.90 Kbytes malloced 976
% 1.70/1.90
% 1.70/1.90 ----------- times (seconds) -----------
% 1.70/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.90 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.70/1.90
% 1.70/1.90 Process 23066 finished Wed Jul 27 04:05:07 2022
% 1.70/1.90 Otter interrupted
% 1.70/1.90 PROOF NOT FOUND
%------------------------------------------------------------------------------