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