TSTP Solution File: LCL289-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL289-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n009.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:04:08 EDT 2022
% Result : Unknown 1.83s 1.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL289-10 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 09:25:36 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.72/1.91 ----- Otter 3.3f, August 2004 -----
% 1.72/1.91 The process was started by sandbox on n009.cluster.edu,
% 1.72/1.91 Wed Jul 27 09:25:36 2022
% 1.72/1.91 The command was "./otter". The process ID is 10720.
% 1.72/1.91
% 1.72/1.91 set(prolog_style_variables).
% 1.72/1.91 set(auto).
% 1.72/1.91 dependent: set(auto1).
% 1.72/1.91 dependent: set(process_input).
% 1.72/1.91 dependent: clear(print_kept).
% 1.72/1.91 dependent: clear(print_new_demod).
% 1.72/1.91 dependent: clear(print_back_demod).
% 1.72/1.91 dependent: clear(print_back_sub).
% 1.72/1.91 dependent: set(control_memory).
% 1.72/1.91 dependent: assign(max_mem, 12000).
% 1.72/1.91 dependent: assign(pick_given_ratio, 4).
% 1.72/1.91 dependent: assign(stats_level, 1).
% 1.72/1.91 dependent: assign(max_seconds, 10800).
% 1.72/1.91 clear(print_given).
% 1.72/1.91
% 1.72/1.91 list(usable).
% 1.72/1.91 0 [] A=A.
% 1.72/1.91 0 [] ife_q(A,A,B,C)=B.
% 1.72/1.91 0 [] axiom(implies(or(A,A),A))=true.
% 1.72/1.91 0 [] axiom(implies(A,or(B,A)))=true.
% 1.72/1.91 0 [] axiom(implies(or(A,B),or(B,A)))=true.
% 1.72/1.91 0 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C))))=true.
% 1.72/1.91 0 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))=true.
% 1.72/1.91 0 [] implies(X,Y)=or(not(X),Y).
% 1.72/1.91 0 [] ife_q(axiom(X),true,theorem(X),true)=true.
% 1.72/1.91 0 [] ife_q(theorem(implies(Y,X)),true,ife_q(theorem(Y),true,theorem(X),true),true)=true.
% 1.72/1.91 0 [] and(P,Q)=not(or(not(P),not(Q))).
% 1.72/1.91 0 [] e_quivalent(P,Q)=and(implies(P,Q),implies(Q,P)).
% 1.72/1.91 0 [] theorem(e_quivalent(not(and(p,not(q))),or(not(p),q)))!=true.
% 1.72/1.91 end_of_list.
% 1.72/1.91
% 1.72/1.91 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.72/1.91
% 1.72/1.91 All clauses are units, and equality is present; the
% 1.72/1.91 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.72/1.91
% 1.72/1.91 dependent: set(knuth_bendix).
% 1.72/1.91 dependent: set(anl_eq).
% 1.72/1.91 dependent: set(para_from).
% 1.72/1.91 dependent: set(para_into).
% 1.72/1.91 dependent: clear(para_from_right).
% 1.72/1.91 dependent: clear(para_into_right).
% 1.72/1.91 dependent: set(para_from_vars).
% 1.72/1.91 dependent: set(eq_units_both_ways).
% 1.72/1.91 dependent: set(dynamic_demod_all).
% 1.72/1.91 dependent: set(dynamic_demod).
% 1.72/1.91 dependent: set(order_eq).
% 1.72/1.91 dependent: set(back_demod).
% 1.72/1.91 dependent: set(lrpo).
% 1.72/1.91
% 1.72/1.91 ------------> process usable:
% 1.72/1.91 ** KEPT (pick-wt=13): 1 [] theorem(e_quivalent(not(and(p,not(q))),or(not(p),q)))!=true.
% 1.72/1.91
% 1.72/1.91 ------------> process sos:
% 1.72/1.91 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.72/1.91 ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 1.72/1.91 ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 1.72/1.91 ** KEPT (pick-wt=8): 5 [] axiom(implies(or(A,A),A))=true.
% 1.72/1.91 ---> New Demodulator: 6 [new_demod,5] axiom(implies(or(A,A),A))=true.
% 1.72/1.91 ** KEPT (pick-wt=8): 7 [] axiom(implies(A,or(B,A)))=true.
% 1.72/1.91 ---> New Demodulator: 8 [new_demod,7] axiom(implies(A,or(B,A)))=true.
% 1.72/1.91 ** KEPT (pick-wt=10): 9 [] axiom(implies(or(A,B),or(B,A)))=true.
% 1.72/1.91 ---> New Demodulator: 10 [new_demod,9] axiom(implies(or(A,B),or(B,A)))=true.
% 1.72/1.91 ** KEPT (pick-wt=14): 11 [] axiom(implies(or(A,or(B,C)),or(B,or(A,C))))=true.
% 1.72/1.91 ---> New Demodulator: 12 [new_demod,11] axiom(implies(or(A,or(B,C)),or(B,or(A,C))))=true.
% 1.72/1.91 ** KEPT (pick-wt=14): 13 [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))=true.
% 1.72/1.91 ---> New Demodulator: 14 [new_demod,13] axiom(implies(implies(A,B),implies(or(C,A),or(C,B))))=true.
% 1.72/1.91 ** KEPT (pick-wt=8): 16 [copy,15,flip.1] or(not(A),B)=implies(A,B).
% 1.72/1.91 ---> New Demodulator: 17 [new_demod,16] or(not(A),B)=implies(A,B).
% 1.72/1.91 ** KEPT (pick-wt=9): 18 [] ife_q(axiom(A),true,theorem(A),true)=true.
% 1.72/1.91 ---> New Demodulator: 19 [new_demod,18] ife_q(axiom(A),true,theorem(A),true)=true.
% 1.72/1.91 ** KEPT (pick-wt=16): 20 [] ife_q(theorem(implies(A,B)),true,ife_q(theorem(A),true,theorem(B),true),true)=true.
% 1.72/1.91 ---> New Demodulator: 21 [new_demod,20] ife_q(theorem(implies(A,B)),true,ife_q(theorem(A),true,theorem(B),true),true)=true.
% 1.72/1.91 ** KEPT (pick-wt=9): 23 [copy,22,demod,17,flip.1] not(implies(A,not(B)))=and(A,B).
% 1.72/1.91 ---> New Demodulator: 24 [new_demod,23] not(implies(A,not(B)))=and(A,B).
% 1.72/1.91 ** KEPT (pick-wt=11): 26 [copy,25,flip.1] and(implies(A,B),implies(B,A))=e_quivalent(A,B).
% 1.72/1.91 ---> New Demodulator: 27 [new_demod,26] and(implies(A,B),implies(B,A))=e_quivalent(A,B).
% 1.72/1.91 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.72/1.91 >>>> Starting back demodulation with 4.
% 1.72/1.91 >>>> Starting back demodulation with 6.
% 1.72/1.91 >>>> Starting back demodulation with 8.
% 1.72/1.91 >>>> Starting back demodulation with 10.
% 1.72/1.91 >>>> Starting back demodulation with 12.
% 1.72/1.91 >>>> Starting back demodulation with 14.
% 1.72/1.91 >>>> Starting back demodulation with 17.
% 1.83/1.99 >> back demodulating 1 with 17.
% 1.83/1.99 >>>> Starting back demodulation with 19.
% 1.83/1.99 >>>> Starting back demodulation with 21.
% 1.83/1.99 >>>> Starting back demodulation with 24.
% 1.83/1.99 >>>> Starting back demodulation with 27.
% 1.83/1.99
% 1.83/1.99 ======= end of input processing =======
% 1.83/1.99
% 1.83/1.99 =========== start of search ===========
% 1.83/1.99
% 1.83/1.99
% 1.83/1.99 Resetting weight limit to 12.
% 1.83/1.99
% 1.83/1.99
% 1.83/1.99 Resetting weight limit to 12.
% 1.83/1.99
% 1.83/1.99 sos_size=100
% 1.83/1.99
% 1.83/1.99
% 1.83/1.99 Resetting weight limit to 9.
% 1.83/1.99
% 1.83/1.99
% 1.83/1.99 Resetting weight limit to 9.
% 1.83/1.99
% 1.83/1.99 sos_size=75
% 1.83/1.99
% 1.83/1.99 Search stopped because sos empty.
% 1.83/1.99
% 1.83/1.99
% 1.83/1.99 Search stopped because sos empty.
% 1.83/1.99
% 1.83/1.99 ============ end of search ============
% 1.83/1.99
% 1.83/1.99 -------------- statistics -------------
% 1.83/1.99 clauses given 236
% 1.83/1.99 clauses generated 10939
% 1.83/1.99 clauses kept 255
% 1.83/1.99 clauses forward subsumed 8537
% 1.83/1.99 clauses back subsumed 0
% 1.83/1.99 Kbytes malloced 8789
% 1.83/1.99
% 1.83/1.99 ----------- times (seconds) -----------
% 1.83/1.99 user CPU time 0.07 (0 hr, 0 min, 0 sec)
% 1.83/1.99 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.83/1.99 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.83/1.99
% 1.83/1.99 Process 10720 finished Wed Jul 27 09:25:37 2022
% 1.83/1.99 Otter interrupted
% 1.83/1.99 PROOF NOT FOUND
%------------------------------------------------------------------------------