TSTP Solution File: LCL219-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL219-10 : TPTP v8.1.0. Released v7.5.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:03:57 EDT 2022
% Result : Unknown 2.28s 2.53s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL219-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/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 09:09:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.99/2.16 ----- Otter 3.3f, August 2004 -----
% 1.99/2.16 The process was started by sandbox2 on n006.cluster.edu,
% 1.99/2.16 Wed Jul 27 09:09:02 2022
% 1.99/2.16 The command was "./otter". The process ID is 24954.
% 1.99/2.16
% 1.99/2.16 set(prolog_style_variables).
% 1.99/2.16 set(auto).
% 1.99/2.16 dependent: set(auto1).
% 1.99/2.16 dependent: set(process_input).
% 1.99/2.16 dependent: clear(print_kept).
% 1.99/2.16 dependent: clear(print_new_demod).
% 1.99/2.16 dependent: clear(print_back_demod).
% 1.99/2.16 dependent: clear(print_back_sub).
% 1.99/2.16 dependent: set(control_memory).
% 1.99/2.16 dependent: assign(max_mem, 12000).
% 1.99/2.16 dependent: assign(pick_given_ratio, 4).
% 1.99/2.16 dependent: assign(stats_level, 1).
% 1.99/2.16 dependent: assign(max_seconds, 10800).
% 1.99/2.16 clear(print_given).
% 1.99/2.16
% 1.99/2.16 list(usable).
% 1.99/2.16 0 [] A=A.
% 1.99/2.16 0 [] ife_q(A,A,B,C)=B.
% 1.99/2.16 0 [] axiom(or(not(or(A,A)),A))=true.
% 1.99/2.16 0 [] axiom(or(not(A),or(B,A)))=true.
% 1.99/2.16 0 [] axiom(or(not(or(A,B)),or(B,A)))=true.
% 1.99/2.16 0 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))=true.
% 1.99/2.16 0 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))=true.
% 1.99/2.16 0 [] ife_q(axiom(X),true,theorem(X),true)=true.
% 1.99/2.16 0 [] ife_q(theorem(Y),true,ife_q(axiom(or(not(Y),X)),true,theorem(X),true),true)=true.
% 1.99/2.16 0 [] ife_q(theorem(or(not(Y),Z)),true,ife_q(axiom(or(not(X),Y)),true,theorem(or(not(X),Z)),true),true)=true.
% 1.99/2.16 0 [] theorem(or(not(or(not(or(not(p),q)),q)),or(p,q)))!=true.
% 1.99/2.16 end_of_list.
% 1.99/2.16
% 1.99/2.16 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.99/2.16
% 1.99/2.16 All clauses are units, and equality is present; the
% 1.99/2.16 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.99/2.16
% 1.99/2.16 dependent: set(knuth_bendix).
% 1.99/2.16 dependent: set(anl_eq).
% 1.99/2.16 dependent: set(para_from).
% 1.99/2.16 dependent: set(para_into).
% 1.99/2.16 dependent: clear(para_from_right).
% 1.99/2.16 dependent: clear(para_into_right).
% 1.99/2.16 dependent: set(para_from_vars).
% 1.99/2.16 dependent: set(eq_units_both_ways).
% 1.99/2.16 dependent: set(dynamic_demod_all).
% 1.99/2.16 dependent: set(dynamic_demod).
% 1.99/2.16 dependent: set(order_eq).
% 1.99/2.16 dependent: set(back_demod).
% 1.99/2.16 dependent: set(lrpo).
% 1.99/2.16
% 1.99/2.16 ------------> process usable:
% 1.99/2.16 ** KEPT (pick-wt=15): 1 [] theorem(or(not(or(not(or(not(p),q)),q)),or(p,q)))!=true.
% 1.99/2.16
% 1.99/2.16 ------------> process sos:
% 1.99/2.16 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.99/2.16 ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 1.99/2.16 ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 1.99/2.16 ** KEPT (pick-wt=9): 5 [] axiom(or(not(or(A,A)),A))=true.
% 1.99/2.16 ---> New Demodulator: 6 [new_demod,5] axiom(or(not(or(A,A)),A))=true.
% 1.99/2.16 ** KEPT (pick-wt=9): 7 [] axiom(or(not(A),or(B,A)))=true.
% 1.99/2.16 ---> New Demodulator: 8 [new_demod,7] axiom(or(not(A),or(B,A)))=true.
% 1.99/2.16 ** KEPT (pick-wt=11): 9 [] axiom(or(not(or(A,B)),or(B,A)))=true.
% 1.99/2.16 ---> New Demodulator: 10 [new_demod,9] axiom(or(not(or(A,B)),or(B,A)))=true.
% 1.99/2.16 ** KEPT (pick-wt=15): 11 [] axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))=true.
% 1.99/2.16 ---> New Demodulator: 12 [new_demod,11] axiom(or(not(or(A,or(B,C))),or(B,or(A,C))))=true.
% 1.99/2.16 ** KEPT (pick-wt=17): 13 [] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))=true.
% 1.99/2.16 ---> New Demodulator: 14 [new_demod,13] axiom(or(not(or(not(A),B)),or(not(or(C,A)),or(C,B))))=true.
% 1.99/2.16 ** KEPT (pick-wt=9): 15 [] ife_q(axiom(A),true,theorem(A),true)=true.
% 1.99/2.16 ---> New Demodulator: 16 [new_demod,15] ife_q(axiom(A),true,theorem(A),true)=true.
% 1.99/2.16 ** KEPT (pick-wt=17): 17 [] ife_q(theorem(A),true,ife_q(axiom(or(not(A),B)),true,theorem(B),true),true)=true.
% 1.99/2.16 ---> New Demodulator: 18 [new_demod,17] ife_q(theorem(A),true,ife_q(axiom(or(not(A),B)),true,theorem(B),true),true)=true.
% 1.99/2.16 ** KEPT (pick-wt=23): 19 [] ife_q(theorem(or(not(A),B)),true,ife_q(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true)=true.
% 1.99/2.16 ---> New Demodulator: 20 [new_demod,19] ife_q(theorem(or(not(A),B)),true,ife_q(axiom(or(not(C),A)),true,theorem(or(not(C),B)),true),true)=true.
% 1.99/2.16 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.99/2.16 >>>> Starting back demodulation with 4.
% 1.99/2.16 >>>> Starting back demodulation with 6.
% 1.99/2.16 >>>> Starting back demodulation with 8.
% 1.99/2.16 >>>> Starting back demodulation with 10.
% 1.99/2.16 >>>> Starting back demodulation with 12.
% 1.99/2.16 >>>> Starting back demodulation with 14.
% 1.99/2.16 >>>> Starting back demodulation with 16.
% 1.99/2.16 >>>> Starting back demodulation with 18.
% 1.99/2.16 >>>> Starting back demodulation with 20.
% 1.99/2.16
% 1.99/2.16 ======= end of input processing =======
% 1.99/2.16
% 1.99/2.16 =========== start of search ===========
% 1.99/2.16
% 1.99/2.16
% 1.99/2.16 Resetting weight limit to 13.
% 2.28/2.53
% 2.28/2.53
% 2.28/2.53 Resetting weight limit to 13.
% 2.28/2.53
% 2.28/2.53 sos_size=187
% 2.28/2.53
% 2.28/2.53 Search stopped because sos empty.
% 2.28/2.53
% 2.28/2.53
% 2.28/2.53 Search stopped because sos empty.
% 2.28/2.53
% 2.28/2.53 ============ end of search ============
% 2.28/2.53
% 2.28/2.53 -------------- statistics -------------
% 2.28/2.53 clauses given 607
% 2.28/2.53 clauses generated 135914
% 2.28/2.53 clauses kept 626
% 2.28/2.53 clauses forward subsumed 133153
% 2.28/2.53 clauses back subsumed 0
% 2.28/2.53 Kbytes malloced 7812
% 2.28/2.53
% 2.28/2.53 ----------- times (seconds) -----------
% 2.28/2.53 user CPU time 0.39 (0 hr, 0 min, 0 sec)
% 2.28/2.53 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.28/2.53 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.28/2.53
% 2.28/2.53 Process 24954 finished Wed Jul 27 09:09:04 2022
% 2.28/2.53 Otter interrupted
% 2.28/2.53 PROOF NOT FOUND
%------------------------------------------------------------------------------