TSTP Solution File: LCL042-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL042-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n011.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:22 EDT 2022
% Result : Unknown 2.17s 2.34s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL042-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n011.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:24:40 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.17/2.34 ----- Otter 3.3f, August 2004 -----
% 2.17/2.34 The process was started by sandbox on n011.cluster.edu,
% 2.17/2.34 Wed Jul 27 09:24:40 2022
% 2.17/2.34 The command was "./otter". The process ID is 14674.
% 2.17/2.34
% 2.17/2.34 set(prolog_style_variables).
% 2.17/2.34 set(auto).
% 2.17/2.34 dependent: set(auto1).
% 2.17/2.34 dependent: set(process_input).
% 2.17/2.34 dependent: clear(print_kept).
% 2.17/2.34 dependent: clear(print_new_demod).
% 2.17/2.34 dependent: clear(print_back_demod).
% 2.17/2.34 dependent: clear(print_back_sub).
% 2.17/2.34 dependent: set(control_memory).
% 2.17/2.34 dependent: assign(max_mem, 12000).
% 2.17/2.34 dependent: assign(pick_given_ratio, 4).
% 2.17/2.34 dependent: assign(stats_level, 1).
% 2.17/2.34 dependent: assign(max_seconds, 10800).
% 2.17/2.34 clear(print_given).
% 2.17/2.34
% 2.17/2.34 list(usable).
% 2.17/2.34 0 [] A=A.
% 2.17/2.34 0 [] ife_q(A,A,B,C)=B.
% 2.17/2.34 0 [] ife_q(is_a_theorem(implies(X,Y)),true,ife_q(is_a_theorem(X),true,is_a_theorem(Y),true),true)=true.
% 2.17/2.34 0 [] is_a_theorem(implies(X,implies(not(X),Y)))=true.
% 2.17/2.34 0 [] is_a_theorem(implies(X,implies(Y,X)))=true.
% 2.17/2.34 0 [] is_a_theorem(implies(implies(X,implies(Y,Z)),implies(Y,implies(X,Z))))=true.
% 2.17/2.34 0 [] is_a_theorem(implies(implies(Y,Z),implies(implies(X,Y),implies(X,Z))))=true.
% 2.17/2.34 0 [] is_a_theorem(implies(implies(X,Y),implies(implies(not(X),Y),Y)))=true.
% 2.17/2.34 0 [] is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))))!=true.
% 2.17/2.34 end_of_list.
% 2.17/2.34
% 2.17/2.34 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 2.17/2.34
% 2.17/2.34 All clauses are units, and equality is present; the
% 2.17/2.34 strategy will be Knuth-Bendix with positive clauses in sos.
% 2.17/2.34
% 2.17/2.34 dependent: set(knuth_bendix).
% 2.17/2.34 dependent: set(anl_eq).
% 2.17/2.34 dependent: set(para_from).
% 2.17/2.34 dependent: set(para_into).
% 2.17/2.34 dependent: clear(para_from_right).
% 2.17/2.34 dependent: clear(para_into_right).
% 2.17/2.34 dependent: set(para_from_vars).
% 2.17/2.34 dependent: set(eq_units_both_ways).
% 2.17/2.34 dependent: set(dynamic_demod_all).
% 2.17/2.34 dependent: set(dynamic_demod).
% 2.17/2.34 dependent: set(order_eq).
% 2.17/2.34 dependent: set(back_demod).
% 2.17/2.34 dependent: set(lrpo).
% 2.17/2.34
% 2.17/2.34 ------------> process usable:
% 2.17/2.34 ** KEPT (pick-wt=16): 1 [] is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c))))!=true.
% 2.17/2.34
% 2.17/2.34 ------------> process sos:
% 2.17/2.34 ** KEPT (pick-wt=3): 2 [] A=A.
% 2.17/2.34 ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 2.17/2.34 ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 2.17/2.34 ** KEPT (pick-wt=16): 5 [] ife_q(is_a_theorem(implies(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 2.17/2.34 ---> New Demodulator: 6 [new_demod,5] ife_q(is_a_theorem(implies(A,B)),true,ife_q(is_a_theorem(A),true,is_a_theorem(B),true),true)=true.
% 2.17/2.34 ** KEPT (pick-wt=9): 7 [] is_a_theorem(implies(A,implies(not(A),B)))=true.
% 2.17/2.34 ---> New Demodulator: 8 [new_demod,7] is_a_theorem(implies(A,implies(not(A),B)))=true.
% 2.17/2.34 ** KEPT (pick-wt=8): 9 [] is_a_theorem(implies(A,implies(B,A)))=true.
% 2.17/2.34 ---> New Demodulator: 10 [new_demod,9] is_a_theorem(implies(A,implies(B,A)))=true.
% 2.17/2.34 ** KEPT (pick-wt=14): 11 [] is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C))))=true.
% 2.17/2.34 ---> New Demodulator: 12 [new_demod,11] is_a_theorem(implies(implies(A,implies(B,C)),implies(B,implies(A,C))))=true.
% 2.17/2.34 ** KEPT (pick-wt=14): 13 [] is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B))))=true.
% 2.17/2.34 ---> New Demodulator: 14 [new_demod,13] is_a_theorem(implies(implies(A,B),implies(implies(C,A),implies(C,B))))=true.
% 2.17/2.34 ** KEPT (pick-wt=13): 15 [] is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B)))=true.
% 2.17/2.34 ---> New Demodulator: 16 [new_demod,15] is_a_theorem(implies(implies(A,B),implies(implies(not(A),B),B)))=true.
% 2.17/2.34 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 2.17/2.34 >>>> Starting back demodulation with 4.
% 2.17/2.34 >>>> Starting back demodulation with 6.
% 2.17/2.34 >>>> Starting back demodulation with 8.
% 2.17/2.34 >>>> Starting back demodulation with 10.
% 2.17/2.34 >>>> Starting back demodulation with 12.
% 2.17/2.34 >>>> Starting back demodulation with 14.
% 2.17/2.34 >>>> Starting back demodulation with 16.
% 2.17/2.34
% 2.17/2.34 ======= end of input processing =======
% 2.17/2.34
% 2.17/2.34 =========== start of search ===========
% 2.17/2.34
% 2.17/2.34
% 2.17/2.34 Resetting weight limit to 12.
% 2.17/2.34
% 2.17/2.34
% 2.17/2.34 Resetting weight limit to 12.
% 2.17/2.34
% 2.17/2.34 sos_size=146
% 2.17/2.34
% 2.17/2.34 Search stopped because sos empty.
% 2.17/2.34
% 2.17/2.34
% 2.17/2.34 Search stopped because sos empty.
% 2.17/2.34
% 2.17/2.34 ============ end of search ============
% 2.17/2.34
% 2.17/2.34 -------------- statistics -------------
% 2.17/2.34 clauses given 322
% 2.17/2.34 clauses generated 50751
% 2.17/2.34 clauses kept 328
% 2.17/2.34 clauses forward subsumed 47346
% 2.17/2.34 clauses back subsumed 0
% 2.17/2.34 Kbytes malloced 7812
% 2.17/2.34
% 2.17/2.34 ----------- times (seconds) -----------
% 2.17/2.34 user CPU time 0.20 (0 hr, 0 min, 0 sec)
% 2.17/2.34 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.17/2.34 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.17/2.34
% 2.17/2.34 Process 14674 finished Wed Jul 27 09:24:42 2022
% 2.17/2.34 Otter interrupted
% 2.17/2.34 PROOF NOT FOUND
%------------------------------------------------------------------------------