TSTP Solution File: LCL569+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL569+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n019.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:39 EDT 2022
% Result : Unknown 1.84s 1.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL569+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 09:31:52 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.66/1.79 ----- Otter 3.3f, August 2004 -----
% 1.66/1.79 The process was started by sandbox on n019.cluster.edu,
% 1.66/1.79 Wed Jul 27 09:31:52 2022
% 1.66/1.79 The command was "./otter". The process ID is 12468.
% 1.66/1.79
% 1.66/1.79 set(prolog_style_variables).
% 1.66/1.79 set(auto).
% 1.66/1.79 dependent: set(auto1).
% 1.66/1.79 dependent: set(process_input).
% 1.66/1.79 dependent: clear(print_kept).
% 1.66/1.79 dependent: clear(print_new_demod).
% 1.66/1.79 dependent: clear(print_back_demod).
% 1.66/1.79 dependent: clear(print_back_sub).
% 1.66/1.79 dependent: set(control_memory).
% 1.66/1.79 dependent: assign(max_mem, 12000).
% 1.66/1.79 dependent: assign(pick_given_ratio, 4).
% 1.66/1.79 dependent: assign(stats_level, 1).
% 1.66/1.79 dependent: assign(max_seconds, 10800).
% 1.66/1.79 clear(print_given).
% 1.66/1.79
% 1.66/1.79 formula_list(usable).
% 1.66/1.79 all A (A=A).
% 1.66/1.79 op_or-> (all X Y (or(X,Y)=not(and(not(X),not(Y))))).
% 1.66/1.79 op_and-> (all X Y (and(X,Y)=not(or(not(X),not(Y))))).
% 1.66/1.79 op_implies_and-> (all X Y (implies(X,Y)=not(and(X,not(Y))))).
% 1.66/1.79 op_implies_or-> (all X Y (implies(X,Y)=or(not(X),Y))).
% 1.66/1.79 op_e_quiv-> (all X Y (e_quiv(X,Y)=and(implies(X,Y),implies(Y,X)))).
% 1.66/1.79 necessitation<-> (all X (is_a_theorem(X)->is_a_theorem(necessarily(X)))).
% 1.66/1.79 modus_ponens_strict_implies<-> (all X Y (is_a_theorem(X)&is_a_theorem(strict_implies(X,Y))->is_a_theorem(Y))).
% 1.66/1.79 adjunction<-> (all X Y (is_a_theorem(X)&is_a_theorem(Y)->is_a_theorem(and(X,Y)))).
% 1.66/1.79 substitution_strict_e_quiv<-> (all X Y (is_a_theorem(strict_e_quiv(X,Y))->X=Y)).
% 1.66/1.79 axiom_K<-> (all X Y is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y))))).
% 1.66/1.79 axiom_M<-> (all X is_a_theorem(implies(necessarily(X),X))).
% 1.66/1.79 axiom_4<-> (all X is_a_theorem(implies(necessarily(X),necessarily(necessarily(X))))).
% 1.66/1.79 axiom_B<-> (all X is_a_theorem(implies(X,necessarily(possibly(X))))).
% 1.66/1.79 axiom_5<-> (all X is_a_theorem(implies(possibly(X),necessarily(possibly(X))))).
% 1.66/1.79 axiom_s1<-> (all X Y Z is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z))))).
% 1.66/1.79 axiom_s2<-> (all P Q is_a_theorem(strict_implies(possibly(and(P,Q)),and(possibly(P),possibly(Q))))).
% 1.66/1.79 axiom_s3<-> (all X Y is_a_theorem(strict_implies(strict_implies(X,Y),strict_implies(not(possibly(Y)),not(possibly(X)))))).
% 1.66/1.79 axiom_s4<-> (all X is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X))))).
% 1.66/1.79 axiom_m1<-> (all X Y is_a_theorem(strict_implies(and(X,Y),and(Y,X)))).
% 1.66/1.79 axiom_m2<-> (all X Y is_a_theorem(strict_implies(and(X,Y),X))).
% 1.66/1.79 axiom_m3<-> (all X Y Z is_a_theorem(strict_implies(and(and(X,Y),Z),and(X,and(Y,Z))))).
% 1.66/1.79 axiom_m4<-> (all X is_a_theorem(strict_implies(X,and(X,X)))).
% 1.66/1.79 axiom_m5<-> (all X Y Z is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z)))).
% 1.66/1.79 axiom_m6<-> (all X is_a_theorem(strict_implies(X,possibly(X)))).
% 1.66/1.79 axiom_m7<-> (all P Q is_a_theorem(strict_implies(possibly(and(P,Q)),P))).
% 1.66/1.79 axiom_m8<-> (all P Q is_a_theorem(strict_implies(strict_implies(P,Q),strict_implies(possibly(P),possibly(Q))))).
% 1.66/1.79 axiom_m9<-> (all X is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X)))).
% 1.66/1.79 axiom_m10<-> (all X is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X))))).
% 1.66/1.79 op_possibly-> (all X (possibly(X)=not(necessarily(not(X))))).
% 1.66/1.79 op_necessarily-> (all X (necessarily(X)=not(possibly(not(X))))).
% 1.66/1.79 op_strict_implies-> (all X Y (strict_implies(X,Y)=necessarily(implies(X,Y)))).
% 1.66/1.79 op_strict_e_quiv-> (all X Y (strict_e_quiv(X,Y)=and(strict_implies(X,Y),strict_implies(Y,X)))).
% 1.66/1.79 op_possibly.
% 1.66/1.79 op_or.
% 1.66/1.79 op_implies.
% 1.66/1.79 op_strict_implies.
% 1.66/1.79 op_e_quiv.
% 1.66/1.79 op_strict_e_quiv.
% 1.66/1.79 modus_ponens_strict_implies.
% 1.66/1.79 substitution_strict_e_quiv.
% 1.66/1.79 adjunction.
% 1.66/1.79 axiom_m1.
% 1.66/1.79 axiom_m2.
% 1.66/1.79 axiom_m3.
% 1.66/1.79 axiom_m4.
% 1.66/1.79 axiom_m5.
% 1.66/1.79 axiom_m6.
% 1.66/1.79 axiom_s3.
% 1.66/1.79 axiom_m9.
% 1.66/1.79 axiom_b.
% 1.66/1.79 -axiom_m10.
% 1.66/1.79 end_of_list.
% 1.66/1.79
% 1.66/1.79 -------> usable clausifies to:
% 1.66/1.79
% 1.66/1.79 list(usable).
% 1.66/1.79 0 [] A=A.
% 1.66/1.79 0 [] -op_or|or(X,Y)=not(and(not(X),not(Y))).
% 1.66/1.79 0 [] -op_and|and(X,Y)=not(or(not(X),not(Y))).
% 1.66/1.79 0 [] -op_implies_and|implies(X,Y)=not(and(X,not(Y))).
% 1.66/1.79 0 [] -op_implies_or|implies(X,Y)=or(not(X),Y).
% 1.66/1.79 0 [] -op_e_quiv|e_quiv(X,Y)=and(implies(X,Y),implies(Y,X)).
% 1.66/1.79 0 [] -necessitation| -is_a_theorem(X)|is_a_theorem(necessarily(X)).
% 1.66/1.79 0 [] necessitation|is_a_theorem($c1).
% 1.66/1.79 0 [] necessitation| -is_a_theorem(necessarily($c1)).
% 1.66/1.79 0 [] -modus_ponens_strict_implies| -is_a_theorem(X)| -is_a_theorem(strict_implies(X,Y))|is_a_theorem(Y).
% 1.66/1.79 0 [] modus_ponens_strict_implies|is_a_theorem($c3).
% 1.66/1.79 0 [] modus_ponens_strict_implies|is_a_theorem(strict_implies($c3,$c2)).
% 1.66/1.79 0 [] modus_ponens_strict_implies| -is_a_theorem($c2).
% 1.66/1.79 0 [] -adjunction| -is_a_theorem(X)| -is_a_theorem(Y)|is_a_theorem(and(X,Y)).
% 1.66/1.79 0 [] adjunction|is_a_theorem($c5).
% 1.66/1.79 0 [] adjunction|is_a_theorem($c4).
% 1.66/1.79 0 [] adjunction| -is_a_theorem(and($c5,$c4)).
% 1.66/1.79 0 [] -substitution_strict_e_quiv| -is_a_theorem(strict_e_quiv(X,Y))|X=Y.
% 1.66/1.79 0 [] substitution_strict_e_quiv|is_a_theorem(strict_e_quiv($c7,$c6)).
% 1.66/1.79 0 [] substitution_strict_e_quiv|$c7!=$c6.
% 1.66/1.79 0 [] -axiom_K|is_a_theorem(implies(necessarily(implies(X,Y)),implies(necessarily(X),necessarily(Y)))).
% 1.66/1.79 0 [] axiom_K| -is_a_theorem(implies(necessarily(implies($c9,$c8)),implies(necessarily($c9),necessarily($c8)))).
% 1.66/1.79 0 [] -axiom_M|is_a_theorem(implies(necessarily(X),X)).
% 1.66/1.79 0 [] axiom_M| -is_a_theorem(implies(necessarily($c10),$c10)).
% 1.66/1.79 0 [] -axiom_4|is_a_theorem(implies(necessarily(X),necessarily(necessarily(X)))).
% 1.66/1.79 0 [] axiom_4| -is_a_theorem(implies(necessarily($c11),necessarily(necessarily($c11)))).
% 1.66/1.79 0 [] -axiom_B|is_a_theorem(implies(X,necessarily(possibly(X)))).
% 1.66/1.79 0 [] axiom_B| -is_a_theorem(implies($c12,necessarily(possibly($c12)))).
% 1.66/1.79 0 [] -axiom_5|is_a_theorem(implies(possibly(X),necessarily(possibly(X)))).
% 1.66/1.79 0 [] axiom_5| -is_a_theorem(implies(possibly($c13),necessarily(possibly($c13)))).
% 1.66/1.79 0 [] -axiom_s1|is_a_theorem(implies(and(necessarily(implies(X,Y)),necessarily(implies(Y,Z))),necessarily(implies(X,Z)))).
% 1.66/1.79 0 [] axiom_s1| -is_a_theorem(implies(and(necessarily(implies($c16,$c15)),necessarily(implies($c15,$c14))),necessarily(implies($c16,$c14)))).
% 1.66/1.79 0 [] -axiom_s2|is_a_theorem(strict_implies(possibly(and(P,Q)),and(possibly(P),possibly(Q)))).
% 1.66/1.79 0 [] axiom_s2| -is_a_theorem(strict_implies(possibly(and($c18,$c17)),and(possibly($c18),possibly($c17)))).
% 1.66/1.79 0 [] -axiom_s3|is_a_theorem(strict_implies(strict_implies(X,Y),strict_implies(not(possibly(Y)),not(possibly(X))))).
% 1.66/1.79 0 [] axiom_s3| -is_a_theorem(strict_implies(strict_implies($c20,$c19),strict_implies(not(possibly($c19)),not(possibly($c20))))).
% 1.66/1.79 0 [] -axiom_s4|is_a_theorem(strict_implies(necessarily(X),necessarily(necessarily(X)))).
% 1.66/1.79 0 [] axiom_s4| -is_a_theorem(strict_implies(necessarily($c21),necessarily(necessarily($c21)))).
% 1.66/1.79 0 [] -axiom_m1|is_a_theorem(strict_implies(and(X,Y),and(Y,X))).
% 1.66/1.79 0 [] axiom_m1| -is_a_theorem(strict_implies(and($c23,$c22),and($c22,$c23))).
% 1.66/1.79 0 [] -axiom_m2|is_a_theorem(strict_implies(and(X,Y),X)).
% 1.66/1.79 0 [] axiom_m2| -is_a_theorem(strict_implies(and($c25,$c24),$c25)).
% 1.66/1.79 0 [] -axiom_m3|is_a_theorem(strict_implies(and(and(X,Y),Z),and(X,and(Y,Z)))).
% 1.66/1.79 0 [] axiom_m3| -is_a_theorem(strict_implies(and(and($c28,$c27),$c26),and($c28,and($c27,$c26)))).
% 1.66/1.79 0 [] -axiom_m4|is_a_theorem(strict_implies(X,and(X,X))).
% 1.66/1.79 0 [] axiom_m4| -is_a_theorem(strict_implies($c29,and($c29,$c29))).
% 1.66/1.79 0 [] -axiom_m5|is_a_theorem(strict_implies(and(strict_implies(X,Y),strict_implies(Y,Z)),strict_implies(X,Z))).
% 1.66/1.79 0 [] axiom_m5| -is_a_theorem(strict_implies(and(strict_implies($c32,$c31),strict_implies($c31,$c30)),strict_implies($c32,$c30))).
% 1.66/1.79 0 [] -axiom_m6|is_a_theorem(strict_implies(X,possibly(X))).
% 1.66/1.79 0 [] axiom_m6| -is_a_theorem(strict_implies($c33,possibly($c33))).
% 1.66/1.79 0 [] -axiom_m7|is_a_theorem(strict_implies(possibly(and(P,Q)),P)).
% 1.66/1.79 0 [] axiom_m7| -is_a_theorem(strict_implies(possibly(and($c35,$c34)),$c35)).
% 1.66/1.79 0 [] -axiom_m8|is_a_theorem(strict_implies(strict_implies(P,Q),strict_implies(possibly(P),possibly(Q)))).
% 1.66/1.79 0 [] axiom_m8| -is_a_theorem(strict_implies(strict_implies($c37,$c36),strict_implies(possibly($c37),possibly($c36)))).
% 1.66/1.79 0 [] -axiom_m9|is_a_theorem(strict_implies(possibly(possibly(X)),possibly(X))).
% 1.66/1.79 0 [] axiom_m9| -is_a_theorem(strict_implies(possibly(possibly($c38)),possibly($c38))).
% 1.66/1.79 0 [] -axiom_m10|is_a_theorem(strict_implies(possibly(X),necessarily(possibly(X)))).
% 1.66/1.79 0 [] axiom_m10| -is_a_theorem(strict_implies(possibly($c39),necessarily(possibly($c39)))).
% 1.66/1.79 0 [] -op_possibly|possibly(X)=not(necessarily(not(X))).
% 1.66/1.79 0 [] -op_necessarily|necessarily(X)=not(possibly(not(X))).
% 1.66/1.79 0 [] -op_strict_implies|strict_implies(X,Y)=necessarily(implies(X,Y)).
% 1.66/1.80 0 [] -op_strict_e_quiv|strict_e_quiv(X,Y)=and(strict_implies(X,Y),strict_implies(Y,X)).
% 1.66/1.80 0 [] op_possibly.
% 1.66/1.80 0 [] op_or.
% 1.66/1.80 0 [] op_implies.
% 1.66/1.80 0 [] op_strict_implies.
% 1.66/1.80 0 [] op_e_quiv.
% 1.66/1.80 0 [] op_strict_e_quiv.
% 1.66/1.80 0 [] modus_ponens_strict_implies.
% 1.66/1.80 0 [] substitution_strict_e_quiv.
% 1.66/1.80 0 [] adjunction.
% 1.66/1.80 0 [] axiom_m1.
% 1.66/1.80 0 [] axiom_m2.
% 1.66/1.80 0 [] axiom_m3.
% 1.66/1.80 0 [] axiom_m4.
% 1.66/1.80 0 [] axiom_m5.
% 1.66/1.80 0 [] axiom_m6.
% 1.66/1.80 0 [] axiom_s3.
% 1.66/1.80 0 [] axiom_m9.
% 1.66/1.80 0 [] axiom_b.
% 1.66/1.80 0 [] -axiom_m10.
% 1.66/1.80 end_of_list.
% 1.66/1.80
% 1.66/1.80 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.66/1.80
% 1.66/1.80 This ia a non-Horn set with equality. The strategy will be
% 1.66/1.80 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.66/1.80 deletion, with positive clauses in sos and nonpositive
% 1.66/1.80 clauses in usable.
% 1.66/1.80
% 1.66/1.80 dependent: set(knuth_bendix).
% 1.66/1.80 dependent: set(anl_eq).
% 1.66/1.80 dependent: set(para_from).
% 1.66/1.80 dependent: set(para_into).
% 1.66/1.80 dependent: clear(para_from_right).
% 1.66/1.80 dependent: clear(para_into_right).
% 1.66/1.80 dependent: set(para_from_vars).
% 1.66/1.80 dependent: set(eq_units_both_ways).
% 1.66/1.80 dependent: set(dynamic_demod_all).
% 1.66/1.80 dependent: set(dynamic_demod).
% 1.66/1.80 dependent: set(order_eq).
% 1.66/1.80 dependent: set(back_demod).
% 1.66/1.80 dependent: set(lrpo).
% 1.66/1.80 dependent: set(hyper_res).
% 1.66/1.80 dependent: set(unit_deletion).
% 1.66/1.80 dependent: set(factor).
% 1.66/1.80
% 1.66/1.80 ------------> process usable:
% 1.66/1.80 ** KEPT (pick-wt=11): 2 [copy,1,flip.2] -op_or|not(and(not(A),not(B)))=or(A,B).
% 1.66/1.80 ** KEPT (pick-wt=11): 4 [copy,3,flip.2] -op_and|not(or(not(A),not(B)))=and(A,B).
% 1.66/1.80 ** KEPT (pick-wt=10): 6 [copy,5,flip.2] -op_implies_and|not(and(A,not(B)))=implies(A,B).
% 1.66/1.80 ** KEPT (pick-wt=9): 8 [copy,7,flip.2] -op_implies_or|or(not(A),B)=implies(A,B).
% 1.66/1.80 ** KEPT (pick-wt=12): 10 [copy,9,flip.2] -op_e_quiv|and(implies(A,B),implies(B,A))=e_quiv(A,B).
% 1.66/1.80 ** KEPT (pick-wt=6): 11 [] -necessitation| -is_a_theorem(A)|is_a_theorem(necessarily(A)).
% 1.66/1.80 ** KEPT (pick-wt=4): 12 [] necessitation| -is_a_theorem(necessarily($c1)).
% 1.66/1.80 ** KEPT (pick-wt=9): 13 [] -modus_ponens_strict_implies| -is_a_theorem(A)| -is_a_theorem(strict_implies(A,B))|is_a_theorem(B).
% 1.66/1.80 ** KEPT (pick-wt=3): 14 [] modus_ponens_strict_implies| -is_a_theorem($c2).
% 1.66/1.80 ** KEPT (pick-wt=9): 15 [] -adjunction| -is_a_theorem(A)| -is_a_theorem(B)|is_a_theorem(and(A,B)).
% 1.66/1.80 ** KEPT (pick-wt=5): 16 [] adjunction| -is_a_theorem(and($c5,$c4)).
% 1.66/1.80 ** KEPT (pick-wt=8): 17 [] -substitution_strict_e_quiv| -is_a_theorem(strict_e_quiv(A,B))|A=B.
% 1.66/1.80 ** KEPT (pick-wt=4): 18 [] substitution_strict_e_quiv|$c7!=$c6.
% 1.66/1.80 ** KEPT (pick-wt=12): 19 [] -axiom_K|is_a_theorem(implies(necessarily(implies(A,B)),implies(necessarily(A),necessarily(B)))).
% 1.66/1.80 ** KEPT (pick-wt=12): 20 [] axiom_K| -is_a_theorem(implies(necessarily(implies($c9,$c8)),implies(necessarily($c9),necessarily($c8)))).
% 1.66/1.80 ** KEPT (pick-wt=6): 21 [] -axiom_M|is_a_theorem(implies(necessarily(A),A)).
% 1.66/1.80 ** KEPT (pick-wt=6): 22 [] axiom_M| -is_a_theorem(implies(necessarily($c10),$c10)).
% 1.66/1.80 ** KEPT (pick-wt=8): 23 [] -axiom_4|is_a_theorem(implies(necessarily(A),necessarily(necessarily(A)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 24 [] axiom_4| -is_a_theorem(implies(necessarily($c11),necessarily(necessarily($c11)))).
% 1.66/1.80 ** KEPT (pick-wt=7): 25 [] -axiom_B|is_a_theorem(implies(A,necessarily(possibly(A)))).
% 1.66/1.80 ** KEPT (pick-wt=7): 26 [] axiom_B| -is_a_theorem(implies($c12,necessarily(possibly($c12)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 27 [] -axiom_5|is_a_theorem(implies(possibly(A),necessarily(possibly(A)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 28 [] axiom_5| -is_a_theorem(implies(possibly($c13),necessarily(possibly($c13)))).
% 1.66/1.80 ** KEPT (pick-wt=16): 29 [] -axiom_s1|is_a_theorem(implies(and(necessarily(implies(A,B)),necessarily(implies(B,C))),necessarily(implies(A,C)))).
% 1.66/1.80 ** KEPT (pick-wt=16): 30 [] axiom_s1| -is_a_theorem(implies(and(necessarily(implies($c16,$c15)),necessarily(implies($c15,$c14))),necessarily(implies($c16,$c14)))).
% 1.66/1.80 ** KEPT (pick-wt=12): 31 [] -axiom_s2|is_a_theorem(strict_implies(possibly(and(A,B)),and(possibly(A),possibly(B)))).
% 1.66/1.80 ** KEPT (pick-wt=12): 32 [] axiom_s2| -is_a_theorem(strict_implies(possibly(and($c18,$c17)),and(possibly($c18),possibly($c17)))).
% 1.66/1.80 ** KEPT (pick-wt=13): 33 [] -axiom_s3|is_a_theorem(strict_implies(strict_implies(A,B),strict_implies(not(possibly(B)),not(possibly(A))))).
% 1.66/1.80 ** KEPT (pick-wt=13): 34 [] axiom_s3| -is_a_theorem(strict_implies(strict_implies($c20,$c19),strict_implies(not(possibly($c19)),not(possibly($c20))))).
% 1.66/1.80 ** KEPT (pick-wt=8): 35 [] -axiom_s4|is_a_theorem(strict_implies(necessarily(A),necessarily(necessarily(A)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 36 [] axiom_s4| -is_a_theorem(strict_implies(necessarily($c21),necessarily(necessarily($c21)))).
% 1.66/1.80 ** KEPT (pick-wt=9): 37 [] -axiom_m1|is_a_theorem(strict_implies(and(A,B),and(B,A))).
% 1.66/1.80 ** KEPT (pick-wt=9): 38 [] axiom_m1| -is_a_theorem(strict_implies(and($c23,$c22),and($c22,$c23))).
% 1.66/1.80 ** KEPT (pick-wt=7): 39 [] -axiom_m2|is_a_theorem(strict_implies(and(A,B),A)).
% 1.66/1.80 ** KEPT (pick-wt=7): 40 [] axiom_m2| -is_a_theorem(strict_implies(and($c25,$c24),$c25)).
% 1.66/1.80 ** KEPT (pick-wt=13): 41 [] -axiom_m3|is_a_theorem(strict_implies(and(and(A,B),C),and(A,and(B,C)))).
% 1.66/1.80 ** KEPT (pick-wt=13): 42 [] axiom_m3| -is_a_theorem(strict_implies(and(and($c28,$c27),$c26),and($c28,and($c27,$c26)))).
% 1.66/1.80 ** KEPT (pick-wt=7): 43 [] -axiom_m4|is_a_theorem(strict_implies(A,and(A,A))).
% 1.66/1.80 ** KEPT (pick-wt=7): 44 [] axiom_m4| -is_a_theorem(strict_implies($c29,and($c29,$c29))).
% 1.66/1.80 ** KEPT (pick-wt=13): 45 [] -axiom_m5|is_a_theorem(strict_implies(and(strict_implies(A,B),strict_implies(B,C)),strict_implies(A,C))).
% 1.66/1.80 ** KEPT (pick-wt=13): 46 [] axiom_m5| -is_a_theorem(strict_implies(and(strict_implies($c32,$c31),strict_implies($c31,$c30)),strict_implies($c32,$c30))).
% 1.66/1.80 ** KEPT (pick-wt=6): 47 [] -axiom_m6|is_a_theorem(strict_implies(A,possibly(A))).
% 1.66/1.80 ** KEPT (pick-wt=6): 48 [] axiom_m6| -is_a_theorem(strict_implies($c33,possibly($c33))).
% 1.66/1.80 ** KEPT (pick-wt=8): 49 [] -axiom_m7|is_a_theorem(strict_implies(possibly(and(A,B)),A)).
% 1.66/1.80 ** KEPT (pick-wt=8): 50 [] axiom_m7| -is_a_theorem(strict_implies(possibly(and($c35,$c34)),$c35)).
% 1.66/1.80 ** KEPT (pick-wt=11): 51 [] -axiom_m8|is_a_theorem(strict_implies(strict_implies(A,B),strict_implies(possibly(A),possibly(B)))).
% 1.66/1.80 ** KEPT (pick-wt=11): 52 [] axiom_m8| -is_a_theorem(strict_implies(strict_implies($c37,$c36),strict_implies(possibly($c37),possibly($c36)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 53 [] -axiom_m9|is_a_theorem(strict_implies(possibly(possibly(A)),possibly(A))).
% 1.66/1.80 ** KEPT (pick-wt=8): 54 [] axiom_m9| -is_a_theorem(strict_implies(possibly(possibly($c38)),possibly($c38))).
% 1.66/1.80 ** KEPT (pick-wt=8): 55 [] -axiom_m10|is_a_theorem(strict_implies(possibly(A),necessarily(possibly(A)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 56 [] axiom_m10| -is_a_theorem(strict_implies(possibly($c39),necessarily(possibly($c39)))).
% 1.66/1.80 ** KEPT (pick-wt=8): 57 [] -op_possibly|possibly(A)=not(necessarily(not(A))).
% 1.66/1.80 ** KEPT (pick-wt=8): 59 [copy,58,flip.2] -op_necessarily|not(possibly(not(A)))=necessarily(A).
% 1.66/1.80 ** KEPT (pick-wt=9): 61 [copy,60,flip.2] -op_strict_implies|necessarily(implies(A,B))=strict_implies(A,B).
% 1.66/1.80 ** KEPT (pick-wt=12): 63 [copy,62,flip.2] -op_strict_e_quiv|and(strict_implies(A,B),strict_implies(B,A))=strict_e_quiv(A,B).
% 1.66/1.80 ** KEPT (pick-wt=1): 64 [] -axiom_m10.
% 1.66/1.80 64 back subsumes 55.
% 1.66/1.80
% 1.66/1.80 ------------> process sos:
% 1.66/1.80 ** KEPT (pick-wt=3): 66 [] A=A.
% 1.66/1.80 ** KEPT (pick-wt=3): 67 [] necessitation|is_a_theorem($c1).
% 1.66/1.80 ** KEPT (pick-wt=3): 68 [] modus_ponens_strict_implies|is_a_theorem($c3).
% 1.66/1.80 ** KEPT (pick-wt=5): 69 [] modus_ponens_strict_implies|is_a_theorem(strict_implies($c3,$c2)).
% 1.66/1.80 ** KEPT (pick-wt=3): 70 [] adjunction|is_a_theorem($c5).
% 1.66/1.80 ** KEPT (pick-wt=3): 71 [] adjunction|is_a_theorem($c4).
% 1.66/1.80 ** KEPT (pick-wt=5): 72 [] substitution_strict_e_quiv|is_a_theorem(strict_e_quiv($c7,$c6)).
% 1.66/1.80 ** KEPT (pick-wt=1): 73 [] op_possibly.
% 1.66/1.80 ** KEPT (pick-wt=1): 74 [] op_or.
% 1.66/1.80 ** KEPT (pick-wt=1): 75 [] op_implies.
% 1.66/1.80 ** KEPT (pick-wt=1): 76 [] op_strict_implies.
% 1.66/1.80 ** KEPT (pick-wt=1): 77 [] op_e_quiv.
% 1.66/1.80 ** KEPT (pick-wt=1): 78 [] op_strict_e_quiv.
% 1.66/1.80 ** KEPT (pick-wt=1): 79 [] modus_ponens_strict_implies.
% 1.66/1.80 ** KEPT (pick-wt=1): 80 [] substitution_strict_e_quiv.
% 1.66/1.80 ** KEPT (pick-wt=1): 81 [] adjunction.
% 1.66/1.80 ** KEPT (pick-wt=1): 82 [] axiom_m1.
% 1.66/1.80 ** KEPT (pick-wt=1): 83 [] axiom_m2.
% 1.66/1.80 ** KEPT (pick-wt=1): 84 [] axiom_m3.
% 1.66/1.80 ** KEPT (pick-wt=1): 85 [] axiom_m4.
% 1.66/1.80 ** KEPT (pick-wt=1): 86 [] axiom_m5.
% 1.66/1.80 ** KEPT (pick-wt=1): 87 [] axiom_m6.
% 1.66/1.80 ** KEPT (pick-wt=1): 88 [] axiom_s3.
% 1.66/1.80 ** KEPT (pick-wt=1): 89 [] axiom_m9.
% 1.84/1.99 ** KEPT (pick-wt=1): 90 [] axiom_b.
% 1.84/1.99 Following clause subsumed by 66 during input processing: 0 [copy,66,flip.1] A=A.
% 1.84/1.99 79 back subsumes 69.
% 1.84/1.99 79 back subsumes 68.
% 1.84/1.99 79 back subsumes 14.
% 1.84/1.99 80 back subsumes 72.
% 1.84/1.99 80 back subsumes 18.
% 1.84/1.99 81 back subsumes 71.
% 1.84/1.99 81 back subsumes 70.
% 1.84/1.99 81 back subsumes 16.
% 1.84/1.99 82 back subsumes 38.
% 1.84/1.99 83 back subsumes 40.
% 1.84/1.99 84 back subsumes 42.
% 1.84/1.99 85 back subsumes 44.
% 1.84/1.99 86 back subsumes 46.
% 1.84/1.99 87 back subsumes 48.
% 1.84/1.99 88 back subsumes 34.
% 1.84/1.99 89 back subsumes 54.
% 1.84/1.99
% 1.84/1.99 ======= end of input processing =======
% 1.84/1.99
% 1.84/1.99 =========== start of search ===========
% 1.84/1.99
% 1.84/1.99
% 1.84/1.99 Resetting weight limit to 10.
% 1.84/1.99
% 1.84/1.99
% 1.84/1.99 Resetting weight limit to 10.
% 1.84/1.99
% 1.84/1.99 sos_size=339
% 1.84/1.99
% 1.84/1.99
% 1.84/1.99 Resetting weight limit to 8.
% 1.84/1.99
% 1.84/1.99
% 1.84/1.99 Resetting weight limit to 8.
% 1.84/1.99
% 1.84/1.99 sos_size=117
% 1.84/1.99
% 1.84/1.99 Search stopped because sos empty.
% 1.84/1.99
% 1.84/1.99
% 1.84/1.99 Search stopped because sos empty.
% 1.84/1.99
% 1.84/1.99 ============ end of search ============
% 1.84/1.99
% 1.84/1.99 -------------- statistics -------------
% 1.84/1.99 clauses given 283
% 1.84/1.99 clauses generated 23663
% 1.84/1.99 clauses kept 546
% 1.84/1.99 clauses forward subsumed 827
% 1.84/1.99 clauses back subsumed 34
% 1.84/1.99 Kbytes malloced 5859
% 1.84/1.99
% 1.84/1.99 ----------- times (seconds) -----------
% 1.84/1.99 user CPU time 0.19 (0 hr, 0 min, 0 sec)
% 1.84/1.99 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.84/1.99 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.84/1.99
% 1.84/1.99 Process 12468 finished Wed Jul 27 09:31:53 2022
% 1.84/1.99 Otter interrupted
% 1.84/1.99 PROOF NOT FOUND
%------------------------------------------------------------------------------