TSTP Solution File: MGT005+2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n005.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:05:56 EDT 2022
% Result : Theorem 2.55s 2.71s
% Output : Refutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 24
% Syntax : Number of clauses : 31 ( 27 unt; 1 nHn; 31 RR)
% Number of literals : 66 ( 3 equ; 36 neg)
% Maximal clause size : 19 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 13 ( 13 usr; 13 con; 0-0 aty)
% Number of variables : 28 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
( ~ organization(A,B)
| ~ organization(A,C)
| ~ greater(D,B)
| ~ greater(C,D)
| organization(A,D) ),
file('MGT005+2.p',unknown),
[] ).
cnf(7,axiom,
( ~ reorganization(A,B,C)
| greater(C,B) ),
file('MGT005+2.p',unknown),
[] ).
cnf(10,axiom,
( ~ organization(A,B)
| ~ organization(C,B)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,B)
| ~ reorganization(A,B,F)
| ~ reorganization(C,B,D)
| ~ reorganization_type(A,G,B)
| ~ reorganization_type(C,G,B)
| ~ complexity(A,H,B)
| ~ complexity(C,I,B)
| ~ greater(I,H)
| greater(D,F) ),
file('MGT005+2.p',unknown),
[] ).
cnf(11,axiom,
( ~ organization(A,B)
| ~ organization(C,B)
| ~ organization(A,D)
| ~ organization(C,D)
| ~ class(A,E,B)
| ~ class(C,E,B)
| ~ survival_chance(A,F,B)
| ~ survival_chance(C,F,B)
| ~ reorganization(A,B,D)
| ~ reorganization(C,B,G)
| ~ reorganization_type(A,H,B)
| ~ reorganization_type(C,H,B)
| ~ survival_chance(A,I,D)
| ~ survival_chance(C,J,D)
| ~ complexity(A,K,B)
| ~ complexity(C,L,B)
| ~ greater(L,K)
| greater(I,J)
| I = J ),
file('MGT005+2.p',unknown),
[] ).
cnf(18,axiom,
~ greater(dollar_c8,dollar_c7),
file('MGT005+2.p',unknown),
[] ).
cnf(19,axiom,
dollar_c8 != dollar_c7,
file('MGT005+2.p',unknown),
[] ).
cnf(58,axiom,
organization(dollar_c13,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(59,axiom,
organization(dollar_c12,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(60,axiom,
organization(dollar_c13,dollar_c1),
file('MGT005+2.p',unknown),
[] ).
cnf(61,axiom,
organization(dollar_c12,dollar_c1),
file('MGT005+2.p',unknown),
[] ).
cnf(62,axiom,
class(dollar_c13,dollar_c10,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(63,axiom,
class(dollar_c12,dollar_c10,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(64,axiom,
survival_chance(dollar_c13,dollar_c9,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(65,axiom,
survival_chance(dollar_c12,dollar_c9,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(66,axiom,
reorganization(dollar_c13,dollar_c3,dollar_c2),
file('MGT005+2.p',unknown),
[] ).
cnf(67,axiom,
reorganization(dollar_c12,dollar_c3,dollar_c1),
file('MGT005+2.p',unknown),
[] ).
cnf(68,axiom,
reorganization_type(dollar_c13,dollar_c11,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(69,axiom,
reorganization_type(dollar_c12,dollar_c11,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(71,axiom,
survival_chance(dollar_c13,dollar_c8,dollar_c4),
file('MGT005+2.p',unknown),
[] ).
cnf(72,axiom,
survival_chance(dollar_c12,dollar_c7,dollar_c4),
file('MGT005+2.p',unknown),
[] ).
cnf(73,axiom,
complexity(dollar_c13,dollar_c6,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(74,axiom,
complexity(dollar_c12,dollar_c5,dollar_c3),
file('MGT005+2.p',unknown),
[] ).
cnf(75,axiom,
greater(dollar_c5,dollar_c6),
file('MGT005+2.p',unknown),
[] ).
cnf(77,axiom,
dollar_c4 = dollar_c2,
file('MGT005+2.p',unknown),
[] ).
cnf(78,plain,
survival_chance(dollar_c12,dollar_c7,dollar_c2),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[72]),77]),
[iquote('back_demod,72,demod,77')] ).
cnf(79,plain,
survival_chance(dollar_c13,dollar_c8,dollar_c2),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[71]),77]),
[iquote('back_demod,71,demod,77')] ).
cnf(204,plain,
greater(dollar_c2,dollar_c3),
inference(hyper,[status(thm)],[66,7]),
[iquote('hyper,66,7')] ).
cnf(316,plain,
greater(dollar_c1,dollar_c2),
inference(hyper,[status(thm)],[74,10,58,59,61,62,63,66,67,68,69,73,75]),
[iquote('hyper,74,10,58,59,61,62,63,66,67,68,69,73,75')] ).
cnf(332,plain,
organization(dollar_c12,dollar_c2),
inference(hyper,[status(thm)],[316,6,59,61,204]),
[iquote('hyper,316,6,59,61,204')] ).
cnf(333,plain,
organization(dollar_c13,dollar_c2),
inference(hyper,[status(thm)],[316,6,58,60,204]),
[iquote('hyper,316,6,58,60,204')] ).
cnf(382,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[79,11,58,59,333,332,62,63,64,65,66,67,68,69,78,73,74,75]),18,19]),
[iquote('hyper,79,11,58,59,333,332,62,63,64,65,66,67,68,69,78,73,74,75,unit_del,18,19')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MGT005+2 : TPTP v8.1.0. Bugfixed v3.2.0.
% 0.06/0.12 % Command : otter-tptp-script %s
% 0.13/0.33 % Computer : n005.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 04:00:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.81/2.02 ----- Otter 3.3f, August 2004 -----
% 1.81/2.02 The process was started by sandbox on n005.cluster.edu,
% 1.81/2.02 Wed Jul 27 04:00:20 2022
% 1.81/2.02 The command was "./otter". The process ID is 6798.
% 1.81/2.02
% 1.81/2.02 set(prolog_style_variables).
% 1.81/2.02 set(auto).
% 1.81/2.02 dependent: set(auto1).
% 1.81/2.02 dependent: set(process_input).
% 1.81/2.02 dependent: clear(print_kept).
% 1.81/2.02 dependent: clear(print_new_demod).
% 1.81/2.02 dependent: clear(print_back_demod).
% 1.81/2.02 dependent: clear(print_back_sub).
% 1.81/2.02 dependent: set(control_memory).
% 1.81/2.02 dependent: assign(max_mem, 12000).
% 1.81/2.02 dependent: assign(pick_given_ratio, 4).
% 1.81/2.02 dependent: assign(stats_level, 1).
% 1.81/2.02 dependent: assign(max_seconds, 10800).
% 1.81/2.02 clear(print_given).
% 1.81/2.02
% 1.81/2.02 formula_list(usable).
% 1.81/2.02 all A (A=A).
% 1.81/2.02 all X Y (-(greater(X,Y)&X=Y)).
% 1.81/2.02 all X Y (-(greater(X,Y)&greater(Y,X))).
% 1.81/2.02 all X Y Z (greater(X,Y)&greater(Y,Z)->greater(X,Z)).
% 1.81/2.02 all X Y P1 P2 T (survival_chance(X,P1,T)&survival_chance(Y,P2,T)->greater(P1,P2)|P1=P2|greater(P2,P1)).
% 1.81/2.02 all X T (organization(X,T)-> (exists P survival_chance(X,P,T))).
% 1.81/2.02 all X T T1 T2 (organization(X,T1)&organization(X,T2)&greater(T,T1)&greater(T2,T)->organization(X,T)).
% 1.81/2.02 all X Ta Tb (reorganization(X,Ta,Tb)->greater(Tb,Ta)).
% 1.81/2.02 all X P1 P2 T1 T2 (organization(X,T1)&organization(X,T2)&reorganization_free(X,T1,T2)&survival_chance(X,P1,T1)&survival_chance(X,P2,T2)&greater(T2,T1)->greater(P2,P1)).
% 1.81/2.02 all X P1 P2 T1 T2 Ta Tb (organization(X,T1)&organization(X,T2)&reorganization(X,Ta,Tb)&survival_chance(X,P1,T1)&survival_chance(X,P2,T2)& -greater(Ta,T1)&greater(T2,T1)& -greater(T2,Tb)->greater(P1,P2)).
% 1.81/2.02 all X Y Re C C1 C2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)&organization(Y,Tc)&class(X,C,Ta)&class(Y,C,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Re,Ta)&reorganization_type(Y,Re,Ta)&complexity(X,C1,Ta)&complexity(Y,C2,Ta)&greater(C2,C1)->greater(Tc,Tb)).
% 1.81/2.02 all X Y Re C P P1 P2 C1 C2 Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)&organization(X,Tb)&organization(Y,Tb)&class(X,C,Ta)&class(Y,C,Ta)&survival_chance(X,P,Ta)&survival_chance(Y,P,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Re,Ta)&reorganization_type(Y,Re,Ta)&survival_chance(X,P1,Tb)&survival_chance(Y,P2,Tb)&complexity(X,C1,Ta)&complexity(Y,C2,Ta)&greater(C2,C1)->greater(P1,P2)|P1=P2).
% 1.81/2.02 all X Y Px1 Px2 Py1 Py2 T1 T2 (greater(T2,T1)&survival_chance(X,Px1,T1)&survival_chance(Y,Py1,T1)&survival_chance(X,Px2,T2)&survival_chance(Y,Py2,T2)&greater(Px2,Px1)&greater(Py1,Px2)-> (exists T0 Px0 Py0 (greater(T0,T1)&greater(T2,T0)&survival_chance(X,Px0,T0)&survival_chance(Y,Py0,T0)&Px0=Py0))).
% 1.81/2.02 -(all X Y Re C P P1 P2 C1 C2 T Ta Tb Tc (organization(X,Ta)&organization(Y,Ta)&organization(X,Tc)&organization(Y,Tc)&class(X,C,Ta)&class(Y,C,Ta)&survival_chance(X,P,Ta)&survival_chance(Y,P,Ta)&reorganization(X,Ta,Tb)&reorganization(Y,Ta,Tc)&reorganization_type(X,Re,Ta)&reorganization_type(Y,Re,Ta)&reorganization_free(X,Tb,Tc)&survival_chance(X,P1,T)&survival_chance(Y,P2,T)&complexity(X,C1,Ta)&complexity(Y,C2,Ta)&greater(C2,C1)& (T=Tc->greater(P1,P2))-> (T=Tb->greater(P1,P2)|P1=P2))).
% 1.81/2.02 end_of_list.
% 1.81/2.02
% 1.81/2.02 -------> usable clausifies to:
% 1.81/2.02
% 1.81/2.02 list(usable).
% 1.81/2.02 0 [] A=A.
% 1.81/2.02 0 [] -greater(X,Y)|X!=Y.
% 1.81/2.02 0 [] -greater(X,Y)| -greater(Y,X).
% 1.81/2.02 0 [] -greater(X,Y)| -greater(Y,Z)|greater(X,Z).
% 1.81/2.02 0 [] -survival_chance(X,P1,T)| -survival_chance(Y,P2,T)|greater(P1,P2)|P1=P2|greater(P2,P1).
% 1.81/2.02 0 [] -organization(X,T)|survival_chance(X,$f1(X,T),T).
% 1.81/2.02 0 [] -organization(X,T1)| -organization(X,T2)| -greater(T,T1)| -greater(T2,T)|organization(X,T).
% 1.81/2.02 0 [] -reorganization(X,Ta,Tb)|greater(Tb,Ta).
% 1.81/2.02 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization_free(X,T1,T2)| -survival_chance(X,P1,T1)| -survival_chance(X,P2,T2)| -greater(T2,T1)|greater(P2,P1).
% 1.81/2.02 0 [] -organization(X,T1)| -organization(X,T2)| -reorganization(X,Ta,Tb)| -survival_chance(X,P1,T1)| -survival_chance(X,P2,T2)|greater(Ta,T1)| -greater(T2,T1)|greater(T2,Tb)|greater(P1,P2).
% 1.81/2.02 0 [] -organization(X,Ta)| -organization(Y,Ta)| -organization(Y,Tc)| -class(X,C,Ta)| -class(Y,C,Ta)| -reorganization(X,Ta,Tb)| -reorganization(Y,Ta,Tc)| -reorganization_type(X,Re,Ta)| -reorganization_type(Y,Re,Ta)| -complexity(X,C1,Ta)| -complexity(Y,C2,Ta)| -greater(C2,C1)|greater(Tc,Tb).
% 1.88/2.05 0 [] -organization(X,Ta)| -organization(Y,Ta)| -organization(X,Tb)| -organization(Y,Tb)| -class(X,C,Ta)| -class(Y,C,Ta)| -survival_chance(X,P,Ta)| -survival_chance(Y,P,Ta)| -reorganization(X,Ta,Tb)| -reorganization(Y,Ta,Tc)| -reorganization_type(X,Re,Ta)| -reorganization_type(Y,Re,Ta)| -survival_chance(X,P1,Tb)| -survival_chance(Y,P2,Tb)| -complexity(X,C1,Ta)| -complexity(Y,C2,Ta)| -greater(C2,C1)|greater(P1,P2)|P1=P2.
% 1.88/2.05 0 [] -greater(T2,T1)| -survival_chance(X,Px1,T1)| -survival_chance(Y,Py1,T1)| -survival_chance(X,Px2,T2)| -survival_chance(Y,Py2,T2)| -greater(Px2,Px1)| -greater(Py1,Px2)|greater($f4(X,Y,Px1,Px2,Py1,Py2,T1,T2),T1).
% 1.88/2.05 0 [] -greater(T2,T1)| -survival_chance(X,Px1,T1)| -survival_chance(Y,Py1,T1)| -survival_chance(X,Px2,T2)| -survival_chance(Y,Py2,T2)| -greater(Px2,Px1)| -greater(Py1,Px2)|greater(T2,$f4(X,Y,Px1,Px2,Py1,Py2,T1,T2)).
% 1.88/2.05 0 [] -greater(T2,T1)| -survival_chance(X,Px1,T1)| -survival_chance(Y,Py1,T1)| -survival_chance(X,Px2,T2)| -survival_chance(Y,Py2,T2)| -greater(Px2,Px1)| -greater(Py1,Px2)|survival_chance(X,$f3(X,Y,Px1,Px2,Py1,Py2,T1,T2),$f4(X,Y,Px1,Px2,Py1,Py2,T1,T2)).
% 1.88/2.05 0 [] -greater(T2,T1)| -survival_chance(X,Px1,T1)| -survival_chance(Y,Py1,T1)| -survival_chance(X,Px2,T2)| -survival_chance(Y,Py2,T2)| -greater(Px2,Px1)| -greater(Py1,Px2)|survival_chance(Y,$f2(X,Y,Px1,Px2,Py1,Py2,T1,T2),$f4(X,Y,Px1,Px2,Py1,Py2,T1,T2)).
% 1.88/2.05 0 [] -greater(T2,T1)| -survival_chance(X,Px1,T1)| -survival_chance(Y,Py1,T1)| -survival_chance(X,Px2,T2)| -survival_chance(Y,Py2,T2)| -greater(Px2,Px1)| -greater(Py1,Px2)|$f3(X,Y,Px1,Px2,Py1,Py2,T1,T2)=$f2(X,Y,Px1,Px2,Py1,Py2,T1,T2).
% 1.88/2.05 0 [] organization($c13,$c3).
% 1.88/2.05 0 [] organization($c12,$c3).
% 1.88/2.05 0 [] organization($c13,$c1).
% 1.88/2.05 0 [] organization($c12,$c1).
% 1.88/2.05 0 [] class($c13,$c10,$c3).
% 1.88/2.05 0 [] class($c12,$c10,$c3).
% 1.88/2.05 0 [] survival_chance($c13,$c9,$c3).
% 1.88/2.05 0 [] survival_chance($c12,$c9,$c3).
% 1.88/2.05 0 [] reorganization($c13,$c3,$c2).
% 1.88/2.05 0 [] reorganization($c12,$c3,$c1).
% 1.88/2.05 0 [] reorganization_type($c13,$c11,$c3).
% 1.88/2.05 0 [] reorganization_type($c12,$c11,$c3).
% 1.88/2.05 0 [] reorganization_free($c13,$c2,$c1).
% 1.88/2.05 0 [] survival_chance($c13,$c8,$c4).
% 1.88/2.05 0 [] survival_chance($c12,$c7,$c4).
% 1.88/2.05 0 [] complexity($c13,$c6,$c3).
% 1.88/2.05 0 [] complexity($c12,$c5,$c3).
% 1.88/2.05 0 [] greater($c5,$c6).
% 1.88/2.05 0 [] $c4!=$c1|greater($c8,$c7).
% 1.88/2.05 0 [] $c4=$c2.
% 1.88/2.05 0 [] -greater($c8,$c7).
% 1.88/2.05 0 [] $c8!=$c7.
% 1.88/2.05 end_of_list.
% 1.88/2.05
% 1.88/2.05 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=19.
% 1.88/2.05
% 1.88/2.05 This ia a non-Horn set with equality. The strategy will be
% 1.88/2.05 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.88/2.05 deletion, with positive clauses in sos and nonpositive
% 1.88/2.05 clauses in usable.
% 1.88/2.05
% 1.88/2.05 dependent: set(knuth_bendix).
% 1.88/2.05 dependent: set(anl_eq).
% 1.88/2.05 dependent: set(para_from).
% 1.88/2.05 dependent: set(para_into).
% 1.88/2.05 dependent: clear(para_from_right).
% 1.88/2.05 dependent: clear(para_into_right).
% 1.88/2.05 dependent: set(para_from_vars).
% 1.88/2.05 dependent: set(eq_units_both_ways).
% 1.88/2.05 dependent: set(dynamic_demod_all).
% 1.88/2.05 dependent: set(dynamic_demod).
% 1.88/2.05 dependent: set(order_eq).
% 1.88/2.05 dependent: set(back_demod).
% 1.88/2.05 dependent: set(lrpo).
% 1.88/2.05 dependent: set(hyper_res).
% 1.88/2.05 dependent: set(unit_deletion).
% 1.88/2.05 dependent: set(factor).
% 1.88/2.05
% 1.88/2.05 ------------> process usable:
% 1.88/2.05 ** KEPT (pick-wt=6): 1 [] -greater(A,B)|A!=B.
% 1.88/2.05 ** KEPT (pick-wt=6): 2 [] -greater(A,B)| -greater(B,A).
% 1.88/2.05 ** KEPT (pick-wt=9): 3 [] -greater(A,B)| -greater(B,C)|greater(A,C).
% 1.88/2.05 ** KEPT (pick-wt=17): 4 [] -survival_chance(A,B,C)| -survival_chance(D,E,C)|greater(B,E)|B=E|greater(E,B).
% 1.88/2.05 ** KEPT (pick-wt=9): 5 [] -organization(A,B)|survival_chance(A,$f1(A,B),B).
% 1.88/2.05 ** KEPT (pick-wt=15): 6 [] -organization(A,B)| -organization(A,C)| -greater(D,B)| -greater(C,D)|organization(A,D).
% 1.88/2.05 ** KEPT (pick-wt=7): 7 [] -reorganization(A,B,C)|greater(C,B).
% 1.88/2.05 ** KEPT (pick-wt=24): 8 [] -organization(A,B)| -organization(A,C)| -reorganization_free(A,B,C)| -survival_chance(A,D,B)| -survival_chance(A,E,C)| -greater(C,B)|greater(E,D).
% 1.88/2.05 ** KEPT (pick-wt=30): 9 [] -organization(A,B)| -organization(A,C)| -reorganization(A,D,E)| -survival_chance(A,F,B)| -survival_chance(A,G,C)|greater(D,B)| -greater(C,B)|greater(C,E)|greater(F,G).
% 1.88/2.05 ** KEPT (pick-wt=47): 10 [] -organization(A,B)| -organization(C,B)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -reorganization(A,B,F)| -reorganization(C,B,D)| -reorganization_type(A,G,B)| -reorganization_type(C,G,B)| -complexity(A,H,B)| -complexity(C,I,B)| -greater(I,H)|greater(D,F).
% 2.55/2.71 ** KEPT (pick-wt=69): 11 [] -organization(A,B)| -organization(C,B)| -organization(A,D)| -organization(C,D)| -class(A,E,B)| -class(C,E,B)| -survival_chance(A,F,B)| -survival_chance(C,F,B)| -reorganization(A,B,D)| -reorganization(C,B,G)| -reorganization_type(A,H,B)| -reorganization_type(C,H,B)| -survival_chance(A,I,D)| -survival_chance(C,J,D)| -complexity(A,K,B)| -complexity(C,L,B)| -greater(L,K)|greater(I,J)|I=J.
% 2.55/2.71 ** KEPT (pick-wt=36): 12 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|greater($f4(C,E,D,G,F,H,B,A),B).
% 2.55/2.71 ** KEPT (pick-wt=36): 13 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|greater(A,$f4(C,E,D,G,F,H,B,A)).
% 2.55/2.71 ** KEPT (pick-wt=45): 14 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|survival_chance(C,$f3(C,E,D,G,F,H,B,A),$f4(C,E,D,G,F,H,B,A)).
% 2.55/2.71 ** KEPT (pick-wt=45): 15 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|survival_chance(E,$f2(C,E,D,G,F,H,B,A),$f4(C,E,D,G,F,H,B,A)).
% 2.55/2.71 ** KEPT (pick-wt=44): 16 [] -greater(A,B)| -survival_chance(C,D,B)| -survival_chance(E,F,B)| -survival_chance(C,G,A)| -survival_chance(E,H,A)| -greater(G,D)| -greater(F,G)|$f3(C,E,D,G,F,H,B,A)=$f2(C,E,D,G,F,H,B,A).
% 2.55/2.71 ** KEPT (pick-wt=6): 17 [] $c4!=$c1|greater($c8,$c7).
% 2.55/2.71 ** KEPT (pick-wt=3): 18 [] -greater($c8,$c7).
% 2.55/2.71 ** KEPT (pick-wt=3): 19 [] $c8!=$c7.
% 2.55/2.71 27 back subsumes 25.
% 2.55/2.71 27 back subsumes 24.
% 2.55/2.71
% 2.55/2.71 ------------> process sos:
% 2.55/2.71 ** KEPT (pick-wt=3): 57 [] A=A.
% 2.55/2.71 ** KEPT (pick-wt=3): 58 [] organization($c13,$c3).
% 2.55/2.71 ** KEPT (pick-wt=3): 59 [] organization($c12,$c3).
% 2.55/2.71 ** KEPT (pick-wt=3): 60 [] organization($c13,$c1).
% 2.55/2.71 ** KEPT (pick-wt=3): 61 [] organization($c12,$c1).
% 2.55/2.71 ** KEPT (pick-wt=4): 62 [] class($c13,$c10,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 63 [] class($c12,$c10,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 64 [] survival_chance($c13,$c9,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 65 [] survival_chance($c12,$c9,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 66 [] reorganization($c13,$c3,$c2).
% 2.55/2.71 ** KEPT (pick-wt=4): 67 [] reorganization($c12,$c3,$c1).
% 2.55/2.71 ** KEPT (pick-wt=4): 68 [] reorganization_type($c13,$c11,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 69 [] reorganization_type($c12,$c11,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 70 [] reorganization_free($c13,$c2,$c1).
% 2.55/2.71 ** KEPT (pick-wt=4): 71 [] survival_chance($c13,$c8,$c4).
% 2.55/2.71 ** KEPT (pick-wt=4): 72 [] survival_chance($c12,$c7,$c4).
% 2.55/2.71 ** KEPT (pick-wt=4): 73 [] complexity($c13,$c6,$c3).
% 2.55/2.71 ** KEPT (pick-wt=4): 74 [] complexity($c12,$c5,$c3).
% 2.55/2.71 ** KEPT (pick-wt=3): 75 [] greater($c5,$c6).
% 2.55/2.71 ** KEPT (pick-wt=3): 76 [] $c4=$c2.
% 2.55/2.71 ---> New Demodulator: 77 [new_demod,76] $c4=$c2.
% 2.55/2.71 Following clause subsumed by 57 during input processing: 0 [copy,57,flip.1] A=A.
% 2.55/2.71 57 back subsumes 21.
% 2.55/2.71 >>>> Starting back demodulation with 77.
% 2.55/2.71 >> back demodulating 72 with 77.
% 2.55/2.71 >> back demodulating 71 with 77.
% 2.55/2.71 >> back demodulating 17 with 77.
% 2.55/2.71
% 2.55/2.71 ======= end of input processing =======
% 2.55/2.71
% 2.55/2.71 =========== start of search ===========
% 2.55/2.71
% 2.55/2.71 -------- PROOF --------
% 2.55/2.71
% 2.55/2.71 -----> EMPTY CLAUSE at 0.70 sec ----> 382 [hyper,79,11,58,59,333,332,62,63,64,65,66,67,68,69,78,73,74,75,unit_del,18,19] $F.
% 2.55/2.71
% 2.55/2.71 Length of proof is 6. Level of proof is 2.
% 2.55/2.71
% 2.55/2.71 ---------------- PROOF ----------------
% 2.55/2.71 % SZS status Theorem
% 2.55/2.71 % SZS output start Refutation
% See solution above
% 2.55/2.71 ------------ end of proof -------------
% 2.55/2.71
% 2.55/2.71
% 2.55/2.71 Search stopped by max_proofs option.
% 2.55/2.71
% 2.55/2.71
% 2.55/2.71 Search stopped by max_proofs option.
% 2.55/2.71
% 2.55/2.71 ============ end of search ============
% 2.55/2.71
% 2.55/2.71 -------------- statistics -------------
% 2.55/2.71 clauses given 26
% 2.55/2.71 clauses generated 3189
% 2.55/2.71 clauses kept 380
% 2.55/2.71 clauses forward subsumed 2847
% 2.55/2.71 clauses back subsumed 3
% 2.55/2.71 Kbytes malloced 1953
% 2.55/2.71
% 2.55/2.71 ----------- times (seconds) -----------
% 2.55/2.71 user CPU time 0.70 (0 hr, 0 min, 0 sec)
% 2.55/2.71 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.55/2.71 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.55/2.71
% 2.55/2.71 That finishes the proof of the theorem.
% 2.55/2.71
% 2.55/2.71 Process 6798 finished Wed Jul 27 04:00:22 2022
% 2.55/2.71 Otter interrupted
% 2.55/2.71 PROOF FOUND
%------------------------------------------------------------------------------