TSTP Solution File: MGT026+1 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : MGT026+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n024.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 : Thu Aug 31 09:06:51 EDT 2023
% Result : Theorem 0.55s 0.95s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10 % Problem : MGT026+1 : TPTP v8.1.2. Released v2.0.0.
% 0.10/0.11 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.10/0.32 % Computer : n024.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Mon Aug 28 06:38:53 EDT 2023
% 0.10/0.32 % CPUTime :
% 0.18/0.54 start to proof:theBenchmark
% 0.55/0.94 %-------------------------------------------
% 0.55/0.94 % File :CSE---1.6
% 0.55/0.94 % Problem :theBenchmark
% 0.55/0.94 % Transform :cnf
% 0.55/0.94 % Format :tptp:raw
% 0.55/0.94 % Command :java -jar mcs_scs.jar %d %s
% 0.55/0.94
% 0.55/0.94 % Result :Theorem 0.350000s
% 0.55/0.94 % Output :CNFRefutation 0.350000s
% 0.55/0.94 %-------------------------------------------
% 0.55/0.94 %--------------------------------------------------------------------------
% 0.55/0.94 % File : MGT026+1 : TPTP v8.1.2. Released v2.0.0.
% 0.55/0.94 % Domain : Management (Organisation Theory)
% 0.55/0.94 % Problem : Selection favors efficient producers past the critical point
% 0.55/0.94 % Version : [PB+94] axioms : Reduced & Augmented > Complete.
% 0.55/0.94 % English :
% 0.55/0.94
% 0.55/0.94 % Refs : [PM93] Peli & Masuch (1993), The Logic of Propogation Strateg
% 0.55/0.94 % : [PM94] Peli & Masuch (1994), The Logic of Propogation Strateg
% 0.55/0.94 % : [Kam95] Kamps (1995), Email to G. Sutcliffe
% 0.55/0.94 % Source : [Kam95]
% 0.55/0.94 % Names :
% 0.55/0.94
% 0.55/0.94 % Status : Theorem
% 0.55/0.94 % Rating : 0.11 v8.1.0, 0.06 v7.4.0, 0.07 v7.2.0, 0.03 v7.1.0, 0.04 v7.0.0, 0.10 v6.4.0, 0.12 v6.3.0, 0.08 v6.2.0, 0.16 v6.1.0, 0.17 v6.0.0, 0.13 v5.5.0, 0.07 v5.4.0, 0.04 v5.3.0, 0.11 v5.2.0, 0.00 v5.0.0, 0.08 v4.1.0, 0.04 v3.7.0, 0.00 v3.4.0, 0.11 v3.3.0, 0.14 v3.2.0, 0.18 v3.1.0, 0.22 v2.7.0, 0.33 v2.6.0, 0.43 v2.5.0, 0.38 v2.4.0, 0.25 v2.3.0, 0.33 v2.2.1, 0.00 v2.1.0
% 0.55/0.94 % Syntax : Number of formulae : 11 ( 0 unt; 0 def)
% 0.55/0.94 % Number of atoms : 44 ( 3 equ)
% 0.55/0.94 % Maximal formula atoms : 6 ( 4 avg)
% 0.55/0.94 % Number of connectives : 34 ( 1 ~; 1 |; 20 &)
% 0.55/0.94 % ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% 0.55/0.94 % Maximal formula depth : 10 ( 6 avg)
% 0.55/0.94 % Maximal term depth : 2 ( 1 avg)
% 0.55/0.94 % Number of predicates : 8 ( 7 usr; 0 prp; 1-4 aty)
% 0.55/0.94 % Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% 0.55/0.94 % Number of variables : 27 ( 27 !; 0 ?)
% 0.55/0.94 % SPC : FOF_THM_RFO_SEQ
% 0.55/0.94
% 0.55/0.94 % Comments :
% 0.55/0.94 %--------------------------------------------------------------------------
% 0.55/0.94 %----Subsitution axioms
% 0.55/0.95 %----Problem axioms
% 0.55/0.95 %----MP1. Selection favors subpopulations with higher growth rates.
% 0.55/0.95 fof(mp1_high_growth_rates,axiom,
% 0.55/0.95 ! [E,S1,S2,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & subpopulations(S1,S2,E,T)
% 0.55/0.95 & greater(growth_rate(S2,T),growth_rate(S1,T)) )
% 0.55/0.95 => selection_favors(S2,S1,T) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP2. Selection favors organizational sets with members to set without
% 0.55/0.95 %----members.
% 0.55/0.95 fof(mp2_favour_members,axiom,
% 0.55/0.95 ! [E,S1,S2,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & subpopulation(S1,E,T)
% 0.55/0.95 & subpopulation(S2,E,T)
% 0.55/0.95 & greater(cardinality_at_time(S1,T),zero)
% 0.55/0.95 & cardinality_at_time(S2,T) = zero )
% 0.55/0.95 => selection_favors(S1,S2,T) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP. If FM and EP have members in the environment, then they are
% 0.55/0.95 %----non-empty subpopulations.
% 0.55/0.95 fof(mp_non_empty_fm_and_ep,axiom,
% 0.55/0.95 ! [E,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & in_environment(E,T)
% 0.55/0.95 & greater(cardinality_at_time(first_movers,T),zero)
% 0.55/0.95 & greater(cardinality_at_time(efficient_producers,T),zero) )
% 0.55/0.95 => subpopulations(first_movers,efficient_producers,E,T) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP. The number of first movers cannot be negative.
% 0.55/0.95 fof(mp_first_movers_exist,axiom,
% 0.55/0.95 ! [E,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & in_environment(E,T) )
% 0.55/0.95 => greater_or_equal(cardinality_at_time(first_movers,T),zero) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP. First movers and efficient producers are subpopulations.
% 0.55/0.95 fof(mp_subpopulations,axiom,
% 0.55/0.95 ! [E,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & in_environment(E,T) )
% 0.55/0.95 => ( subpopulation(first_movers,E,T)
% 0.55/0.95 & subpopulation(efficient_producers,E,T) ) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP. The critical point cannot precede the appearence of efficient
% 0.55/0.95 %----producers.
% 0.55/0.95 fof(mp_critical_point_after_EP,axiom,
% 0.55/0.95 ! [E] :
% 0.55/0.95 ( environment(E)
% 0.55/0.95 => greater_or_equal(critical_point(E),appear(efficient_producers,E)) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP. inequality
% 0.55/0.95 fof(mp_greater_transitivity,axiom,
% 0.55/0.95 ! [X,Y,Z] :
% 0.55/0.95 ( ( greater(X,Y)
% 0.55/0.95 & greater(Y,Z) )
% 0.55/0.95 => greater(X,Z) ) ).
% 0.55/0.95
% 0.55/0.95 %----MP. on "greater or equal to"
% 0.55/0.95 fof(mp_greater_or_equal,axiom,
% 0.55/0.95 ! [X,Y] :
% 0.55/0.95 ( greater_or_equal(X,Y)
% 0.55/0.95 <=> ( greater(X,Y)
% 0.55/0.95 | X = Y ) ) ).
% 0.55/0.95
% 0.55/0.95 %----D1(<=). If a time-point is the critical point of the environment,
% 0.55/0.95 %----then it is the earliest time past which the growth rate of efficient
% 0.55/0.95 %----producers permanently exceeds growth rate of first movers.
% 0.55/0.95 fof(d1,hypothesis,
% 0.55/0.95 ! [E,Tc] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & Tc = critical_point(E) )
% 0.55/0.95 => ( ~ greater(growth_rate(efficient_producers,Tc),growth_rate(first_movers,Tc))
% 0.55/0.95 & ! [T] :
% 0.55/0.95 ( ( subpopulations(first_movers,efficient_producers,E,T)
% 0.55/0.95 & greater(T,Tc) )
% 0.55/0.95 => greater(growth_rate(efficient_producers,T),growth_rate(first_movers,T)) ) ) ) ).
% 0.55/0.95
% 0.55/0.95 %----T6. Once appeared in an environment, efficient producers do not
% 0.55/0.95 %----disappear.
% 0.55/0.95 fof(t6,hypothesis,
% 0.55/0.95 ! [E,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & in_environment(E,T)
% 0.55/0.95 & greater_or_equal(T,appear(efficient_producers,E)) )
% 0.55/0.95 => greater(cardinality_at_time(efficient_producers,T),zero) ) ).
% 0.55/0.95
% 0.55/0.95 %----GOAL: L8. Selection favors efficient producers above first movers
% 0.55/0.95 %----past the critical point.
% 0.55/0.95 fof(prove_l8,conjecture,
% 0.55/0.95 ! [E,T] :
% 0.55/0.95 ( ( environment(E)
% 0.55/0.95 & in_environment(E,T)
% 0.55/0.95 & greater(T,critical_point(E)) )
% 0.55/0.95 => selection_favors(efficient_producers,first_movers,T) ) ).
% 0.55/0.95
% 0.55/0.95 %--------------------------------------------------------------------------
% 0.55/0.95 %-------------------------------------------
% 0.55/0.95 % Proof found
% 0.55/0.95 % SZS status Theorem for theBenchmark
% 0.55/0.95 % SZS output start Proof
% 0.55/0.95 %ClaNum:45(EqnAxiom:27)
% 0.55/0.95 %VarNum:90(SingletonVarNum:33)
% 0.55/0.95 %MaxLitNum:6
% 0.55/0.95 %MaxfuncDepth:1
% 0.55/0.95 %SharedTerms:10
% 0.55/0.95 %goalClause: 28 29 30 31
% 0.55/0.95 %singleGoalClaCount:4
% 0.55/0.95 [28]P1(a1)
% 0.55/0.95 [29]P2(a1,a6)
% 0.55/0.95 [31]~P5(a5,a7,a6)
% 0.55/0.95 [30]P3(a6,f2(a1))
% 0.55/0.95 [35]~P1(x351)+P4(f2(x351),f3(a5,x351))
% 0.55/0.95 [32]~E(x321,x322)+P4(x321,x322)
% 0.55/0.95 [33]~P3(x331,x332)+P4(x331,x332)
% 0.55/0.95 [34]P3(x341,x342)+~P4(x341,x342)+E(x341,x342)
% 0.55/0.95 [38]~P1(x381)+~P2(x381,x382)+P6(a7,x381,x382)
% 0.55/0.95 [39]~P1(x391)+~P2(x391,x392)+P6(a5,x391,x392)
% 0.55/0.95 [37]~P2(x372,x371)+~P1(x372)+P4(f4(a7,x371),a8)
% 0.55/0.95 [40]~P1(x402)+~E(x401,f2(x402))+~P3(f9(a5,x401),f9(a7,x401))
% 0.55/0.95 [36]~P3(x361,x363)+P3(x361,x362)+~P3(x363,x362)
% 0.55/0.95 [41]~P2(x412,x411)+~P1(x412)+~P4(x411,f3(a5,x412))+P3(f4(a5,x411),a8)
% 0.55/0.95 [45]~P7(x452,x451,x454,x453)+P5(x451,x452,x453)+~P1(x454)+~P3(f9(x451,x453),f9(x452,x453))
% 0.55/0.95 [43]~P1(x431)+~P2(x431,x432)+P7(a7,a5,x431,x432)+~P3(f4(a7,x432),a8)+~P3(f4(a5,x432),a8)
% 0.55/0.95 [44]~P1(x443)+~P3(x441,x442)+~P7(a7,a5,x443,x441)+~E(x442,f2(x443))+P3(f9(a5,x441),f9(a7,x441))
% 0.55/0.95 [42]~P6(x422,x424,x423)+~P6(x421,x424,x423)+P5(x421,x422,x423)+~P1(x424)+~E(f4(x422,x423),a8)+~P3(f4(x421,x423),a8)
% 0.55/0.95 %EqnAxiom
% 0.55/0.95 [1]E(x11,x11)
% 0.55/0.95 [2]E(x22,x21)+~E(x21,x22)
% 0.55/0.95 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33)
% 0.55/0.95 [4]~E(x41,x42)+E(f2(x41),f2(x42))
% 0.55/0.95 [5]~E(x51,x52)+E(f9(x51,x53),f9(x52,x53))
% 0.55/0.95 [6]~E(x61,x62)+E(f9(x63,x61),f9(x63,x62))
% 0.55/0.95 [7]~E(x71,x72)+E(f3(x71,x73),f3(x72,x73))
% 0.55/0.95 [8]~E(x81,x82)+E(f3(x83,x81),f3(x83,x82))
% 0.55/0.95 [9]~E(x91,x92)+E(f4(x91,x93),f4(x92,x93))
% 0.55/0.95 [10]~E(x101,x102)+E(f4(x103,x101),f4(x103,x102))
% 0.55/0.95 [11]~P1(x111)+P1(x112)+~E(x111,x112)
% 0.55/0.95 [12]P2(x122,x123)+~E(x121,x122)+~P2(x121,x123)
% 0.55/0.95 [13]P2(x133,x132)+~E(x131,x132)+~P2(x133,x131)
% 0.55/0.95 [14]P3(x142,x143)+~E(x141,x142)+~P3(x141,x143)
% 0.55/0.95 [15]P3(x153,x152)+~E(x151,x152)+~P3(x153,x151)
% 0.55/0.95 [16]P5(x162,x163,x164)+~E(x161,x162)+~P5(x161,x163,x164)
% 0.55/0.95 [17]P5(x173,x172,x174)+~E(x171,x172)+~P5(x173,x171,x174)
% 0.55/0.95 [18]P5(x183,x184,x182)+~E(x181,x182)+~P5(x183,x184,x181)
% 0.55/0.95 [19]P4(x192,x193)+~E(x191,x192)+~P4(x191,x193)
% 0.55/0.95 [20]P4(x203,x202)+~E(x201,x202)+~P4(x203,x201)
% 0.55/0.95 [21]P7(x212,x213,x214,x215)+~E(x211,x212)+~P7(x211,x213,x214,x215)
% 0.55/0.95 [22]P7(x223,x222,x224,x225)+~E(x221,x222)+~P7(x223,x221,x224,x225)
% 0.55/0.95 [23]P7(x233,x234,x232,x235)+~E(x231,x232)+~P7(x233,x234,x231,x235)
% 0.55/0.95 [24]P7(x243,x244,x245,x242)+~E(x241,x242)+~P7(x243,x244,x245,x241)
% 0.55/0.95 [25]P6(x252,x253,x254)+~E(x251,x252)+~P6(x251,x253,x254)
% 0.55/0.95 [26]P6(x263,x262,x264)+~E(x261,x262)+~P6(x263,x261,x264)
% 0.55/0.95 [27]P6(x273,x274,x272)+~E(x271,x272)+~P6(x273,x274,x271)
% 0.55/0.95
% 0.55/0.95 %-------------------------------------------
% 0.55/0.95 cnf(46,plain,
% 0.55/0.95 (P4(a6,f2(a1))),
% 0.55/0.95 inference(scs_inference,[],[30,33])).
% 0.55/0.95 cnf(47,plain,
% 0.55/0.95 (P4(f2(a1),f3(a5,a1))),
% 0.55/0.95 inference(scs_inference,[],[28,30,33,35])).
% 0.55/0.95 cnf(49,plain,
% 0.55/0.95 (P6(a5,a1,a6)),
% 0.55/0.95 inference(scs_inference,[],[28,29,31,30,33,35,18,39])).
% 0.55/0.95 cnf(51,plain,
% 0.55/0.95 (P6(a7,a1,a6)),
% 0.55/0.95 inference(scs_inference,[],[28,29,31,30,33,35,18,39,38])).
% 0.55/0.95 cnf(53,plain,
% 0.55/0.95 (P4(f4(a7,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[28,29,31,30,33,35,18,39,38,37])).
% 0.55/0.95 cnf(57,plain,
% 0.55/0.95 (~P4(a6,f3(a5,a1))+P3(f4(a5,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[28,29,31,30,33,35,18,39,38,37,40,41])).
% 0.55/0.95 cnf(59,plain,
% 0.55/0.95 (~P7(a7,a5,a1,a6)+~P3(f9(a5,a6),f9(a7,a6))),
% 0.55/0.95 inference(scs_inference,[],[28,29,31,30,33,35,18,39,38,37,40,41,45])).
% 0.55/0.95 cnf(61,plain,
% 0.55/0.95 (~P4(a6,f3(a5,a1))+~E(f4(a7,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[28,29,31,30,33,35,18,39,38,37,40,41,45,42])).
% 0.55/0.95 cnf(74,plain,
% 0.55/0.95 (~P7(a7,a5,a1,a6)+P3(f9(a5,a6),f9(a7,a6))),
% 0.55/0.95 inference(scs_inference,[],[30,31,28,16,44])).
% 0.55/0.95 cnf(76,plain,
% 0.55/0.95 (P7(a7,a5,a1,a6)+~P3(f4(a7,a6),a8)+~P3(f4(a5,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[29,30,31,28,16,44,43])).
% 0.55/0.95 cnf(78,plain,
% 0.55/0.95 (~E(f4(a7,a6),a8)+~P3(f4(a5,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[29,30,31,51,49,28,16,44,43,42])).
% 0.55/0.95 cnf(87,plain,
% 0.55/0.95 (~P3(f2(a1),f3(a5,a1))+P3(f4(a5,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[30,36,33,57])).
% 0.55/0.95 cnf(92,plain,
% 0.55/0.95 (E(f2(a1),f3(a5,a1))+P3(f2(a1),f3(a5,a1))),
% 0.55/0.95 inference(scs_inference,[],[47,34])).
% 0.55/0.95 cnf(112,plain,
% 0.55/0.95 (P3(x1121,f2(a1))+~E(a6,x1121)),
% 0.55/0.95 inference(scs_inference,[],[30,14])).
% 0.55/0.95 cnf(116,plain,
% 0.55/0.95 (E(f4(a7,a6),a8)+P3(f4(a7,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[53,34])).
% 0.55/0.95 cnf(137,plain,
% 0.55/0.95 (~P3(f2(a1),f3(a5,a1))+~E(f4(a7,a6),a8)),
% 0.55/0.95 inference(scs_inference,[],[78,87])).
% 0.55/0.95 cnf(168,plain,
% 0.55/0.95 (P4(x1681,f3(a5,a1))+~E(f2(a1),x1681)),
% 0.55/0.95 inference(scs_inference,[],[47,19])).
% 0.55/0.95 cnf(179,plain,
% 0.55/0.95 (P3(a6,x1791)+~E(f2(a1),x1791)),
% 0.55/0.95 inference(scs_inference,[],[30,15])).
% 0.55/0.95 cnf(190,plain,
% 0.55/0.95 (P3(f4(a7,a6),a8)+~P3(f2(a1),f3(a5,a1))),
% 0.55/0.95 inference(scs_inference,[],[137,116])).
% 0.55/0.95 cnf(194,plain,
% 0.55/0.95 (E(f4(a7,a6),x1941)+P3(x1942,x1941)+~E(a8,x1941)+~E(f4(a7,a6),x1942)),
% 0.55/0.95 inference(scs_inference,[],[53,20,34,14])).
% 0.55/0.95 cnf(202,plain,
% 0.55/0.95 (~P3(f4(a5,a6),a8)+P7(a7,a5,a1,a6)+~P3(f2(a1),f3(a5,a1))),
% 0.55/0.95 inference(scs_inference,[],[190,76])).
% 0.55/0.95 cnf(213,plain,
% 0.55/0.95 (P4(f2(a1),x2131)+~E(f3(a5,a1),x2131)),
% 0.55/0.95 inference(scs_inference,[],[47,20])).
% 0.55/0.96 cnf(286,plain,
% 0.55/0.96 (P7(a7,a5,a1,a6)+~P3(f2(a1),f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[202,87])).
% 0.55/0.96 cnf(287,plain,
% 0.55/0.96 (~P3(f9(a5,a6),f9(a7,a6))+~P3(f2(a1),f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[286,59])).
% 0.55/0.96 cnf(288,plain,
% 0.55/0.96 (~P7(a7,a5,a1,a6)+~P3(f2(a1),f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[287,74])).
% 0.55/0.96 cnf(289,plain,
% 0.55/0.96 (~P3(f2(a1),f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[288,286])).
% 0.55/0.96 cnf(290,plain,
% 0.55/0.96 (E(f2(a1),f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[289,92])).
% 0.55/0.96 cnf(293,plain,
% 0.55/0.96 (~P3(f2(a1),x2931)+~E(x2931,f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[289,194,15])).
% 0.55/0.96 cnf(304,plain,
% 0.55/0.96 (P4(a6,f3(a5,a1))),
% 0.55/0.96 inference(scs_inference,[],[290,46,2,213,179,168,20])).
% 0.55/0.96 cnf(311,plain,
% 0.55/0.96 (~E(f4(a7,a6),a8)),
% 0.55/0.96 inference(scs_inference,[],[290,46,289,2,213,179,168,20,19,36,14,293,112,61])).
% 0.55/0.96 cnf(340,plain,
% 0.55/0.96 (P3(f4(a5,a6),a8)),
% 0.55/0.96 inference(scs_inference,[],[304,57])).
% 0.55/0.96 cnf(341,plain,
% 0.55/0.96 (P3(f4(a7,a6),a8)),
% 0.55/0.96 inference(scs_inference,[],[311,116])).
% 0.55/0.96 cnf(352,plain,
% 0.55/0.96 (P7(a7,a5,a1,a6)),
% 0.55/0.96 inference(scs_inference,[],[341,340,76])).
% 0.55/0.96 cnf(379,plain,
% 0.55/0.96 (~P3(f9(a5,a6),f9(a7,a6))),
% 0.55/0.96 inference(scs_inference,[],[352,59])).
% 0.55/0.96 cnf(380,plain,
% 0.55/0.96 (P3(f9(a5,a6),f9(a7,a6))),
% 0.55/0.96 inference(scs_inference,[],[352,74])).
% 0.55/0.96 cnf(383,plain,
% 0.55/0.96 ($false),
% 0.55/0.96 inference(scs_inference,[],[379,380]),
% 0.55/0.96 ['proof']).
% 0.55/0.96 % SZS output end Proof
% 0.55/0.96 % Total time :0.350000s
%------------------------------------------------------------------------------