TSTP Solution File: MGT032-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT032-2 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %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 : Tue Aug 22 10:49:37 EDT 2023
% Result : Unsatisfiable 2.75s 1.70s
% Output : CNFRefutation 2.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 21
% Syntax : Number of formulae : 42 ( 10 unt; 13 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 101 ( 53 ~; 48 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 19 ( 10 >; 9 *; 0 +; 0 <<)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-4 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subpopulations > selection_favors > in_environment > greater_or_equal > greater > stable > environment > growth_rate > #nlpp > sk3 > sk1 > sk2 > first_movers > efficient_producers
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(subpopulations,type,
subpopulations: ( $i * $i * $i * $i ) > $o ).
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(sk1,type,
sk1: $i > $i ).
tff(in_environment,type,
in_environment: ( $i * $i ) > $o ).
tff(sk2,type,
sk2: $i ).
tff(efficient_producers,type,
efficient_producers: $i ).
tff(growth_rate,type,
growth_rate: ( $i * $i ) > $i ).
tff(environment,type,
environment: $i > $o ).
tff(first_movers,type,
first_movers: $i ).
tff(greater_or_equal,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(sk3,type,
sk3: $i > $i ).
tff(selection_favors,type,
selection_favors: ( $i * $i * $i ) > $o ).
tff(stable,type,
stable: $i > $o ).
tff(f_59,axiom,
environment(sk2),
file(unknown,unknown) ).
tff(f_60,axiom,
stable(sk2),
file(unknown,unknown) ).
tff(f_44,axiom,
! [A] :
( ~ environment(A)
| ~ stable(A)
| in_environment(A,sk1(A)) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [A] :
( ~ in_environment(sk2,A)
| subpopulations(first_movers,efficient_producers,sk2,sk3(A)) ),
file(unknown,unknown) ).
tff(f_70,axiom,
! [A] :
( ~ in_environment(sk2,A)
| greater_or_equal(sk3(A),A) ),
file(unknown,unknown) ).
tff(f_58,axiom,
! [A,B] :
( ~ environment(A)
| ~ stable(A)
| ~ subpopulations(first_movers,efficient_producers,A,B)
| ~ greater_or_equal(B,sk1(A))
| greater(growth_rate(efficient_producers,B),growth_rate(first_movers,B)) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [A,B,C,D] :
( ~ environment(A)
| ~ subpopulations(B,C,A,D)
| ~ greater(growth_rate(C,D),growth_rate(B,D))
| selection_favors(C,B,D) ),
file(unknown,unknown) ).
tff(f_76,axiom,
! [A] :
( ~ in_environment(sk2,A)
| ~ selection_favors(efficient_producers,first_movers,sk3(A)) ),
file(unknown,unknown) ).
tff(c_8,plain,
environment(sk2),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_10,plain,
stable(sk2),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_4,plain,
! [A_5] :
( in_environment(A_5,sk1(A_5))
| ~ stable(A_5)
| ~ environment(A_5) ),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_12,plain,
! [A_8] :
( subpopulations(first_movers,efficient_producers,sk2,sk3(A_8))
| ~ in_environment(sk2,A_8) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_14,plain,
! [A_9] :
( greater_or_equal(sk3(A_9),A_9)
| ~ in_environment(sk2,A_9) ),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_22,plain,
! [B_19,A_20] :
( greater(growth_rate(efficient_producers,B_19),growth_rate(first_movers,B_19))
| ~ greater_or_equal(B_19,sk1(A_20))
| ~ subpopulations(first_movers,efficient_producers,A_20,B_19)
| ~ stable(A_20)
| ~ environment(A_20) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_27,plain,
! [A_21] :
( greater(growth_rate(efficient_producers,sk3(sk1(A_21))),growth_rate(first_movers,sk3(sk1(A_21))))
| ~ subpopulations(first_movers,efficient_producers,A_21,sk3(sk1(A_21)))
| ~ stable(A_21)
| ~ environment(A_21)
| ~ in_environment(sk2,sk1(A_21)) ),
inference(resolution,[status(thm)],[c_14,c_22]) ).
tff(c_2,plain,
! [C_3,B_2,D_4,A_1] :
( selection_favors(C_3,B_2,D_4)
| ~ greater(growth_rate(C_3,D_4),growth_rate(B_2,D_4))
| ~ subpopulations(B_2,C_3,A_1,D_4)
| ~ environment(A_1) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_31,plain,
! [A_22,A_23] :
( selection_favors(efficient_producers,first_movers,sk3(sk1(A_22)))
| ~ subpopulations(first_movers,efficient_producers,A_23,sk3(sk1(A_22)))
| ~ environment(A_23)
| ~ subpopulations(first_movers,efficient_producers,A_22,sk3(sk1(A_22)))
| ~ stable(A_22)
| ~ environment(A_22)
| ~ in_environment(sk2,sk1(A_22)) ),
inference(resolution,[status(thm)],[c_27,c_2]) ).
tff(c_34,plain,
! [A_22] :
( selection_favors(efficient_producers,first_movers,sk3(sk1(A_22)))
| ~ environment(sk2)
| ~ subpopulations(first_movers,efficient_producers,A_22,sk3(sk1(A_22)))
| ~ stable(A_22)
| ~ environment(A_22)
| ~ in_environment(sk2,sk1(A_22)) ),
inference(resolution,[status(thm)],[c_12,c_31]) ).
tff(c_38,plain,
! [A_24] :
( selection_favors(efficient_producers,first_movers,sk3(sk1(A_24)))
| ~ subpopulations(first_movers,efficient_producers,A_24,sk3(sk1(A_24)))
| ~ stable(A_24)
| ~ environment(A_24)
| ~ in_environment(sk2,sk1(A_24)) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_34]) ).
tff(c_42,plain,
( selection_favors(efficient_producers,first_movers,sk3(sk1(sk2)))
| ~ stable(sk2)
| ~ environment(sk2)
| ~ in_environment(sk2,sk1(sk2)) ),
inference(resolution,[status(thm)],[c_12,c_38]) ).
tff(c_45,plain,
( selection_favors(efficient_producers,first_movers,sk3(sk1(sk2)))
| ~ in_environment(sk2,sk1(sk2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_10,c_42]) ).
tff(c_46,plain,
~ in_environment(sk2,sk1(sk2)),
inference(splitLeft,[status(thm)],[c_45]) ).
tff(c_49,plain,
( ~ stable(sk2)
| ~ environment(sk2) ),
inference(resolution,[status(thm)],[c_4,c_46]) ).
tff(c_53,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_10,c_49]) ).
tff(c_55,plain,
in_environment(sk2,sk1(sk2)),
inference(splitRight,[status(thm)],[c_45]) ).
tff(c_54,plain,
selection_favors(efficient_producers,first_movers,sk3(sk1(sk2))),
inference(splitRight,[status(thm)],[c_45]) ).
tff(c_16,plain,
! [A_10] :
( ~ selection_favors(efficient_producers,first_movers,sk3(A_10))
| ~ in_environment(sk2,A_10) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_58,plain,
~ in_environment(sk2,sk1(sk2)),
inference(resolution,[status(thm)],[c_54,c_16]) ).
tff(c_62,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_55,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT032-2 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.18/0.35 % Computer : n019.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 20:33:31 EDT 2023
% 0.18/0.35 % CPUTime :
% 2.75/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.75/1.70
% 2.75/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.95/1.73
% 2.95/1.73 Inference rules
% 2.95/1.73 ----------------------
% 2.95/1.73 #Ref : 0
% 2.95/1.73 #Sup : 6
% 2.95/1.73 #Fact : 0
% 2.95/1.73 #Define : 0
% 2.95/1.73 #Split : 1
% 2.95/1.73 #Chain : 0
% 2.95/1.73 #Close : 0
% 2.95/1.73
% 2.95/1.73 Ordering : KBO
% 2.95/1.73
% 2.95/1.73 Simplification rules
% 2.95/1.73 ----------------------
% 2.95/1.73 #Subsume : 1
% 2.95/1.73 #Demod : 6
% 2.95/1.73 #Tautology : 0
% 2.95/1.73 #SimpNegUnit : 0
% 2.95/1.74 #BackRed : 0
% 2.95/1.74
% 2.95/1.74 #Partial instantiations: 0
% 2.95/1.74 #Strategies tried : 1
% 2.95/1.74
% 2.95/1.74 Timing (in seconds)
% 2.95/1.74 ----------------------
% 2.95/1.74 Preprocessing : 0.43
% 2.95/1.74 Parsing : 0.24
% 2.95/1.74 CNF conversion : 0.02
% 2.95/1.74 Main loop : 0.23
% 2.95/1.74 Inferencing : 0.11
% 2.95/1.74 Reduction : 0.05
% 2.95/1.74 Demodulation : 0.03
% 2.95/1.74 BG Simplification : 0.01
% 2.95/1.74 Subsumption : 0.05
% 2.95/1.74 Abstraction : 0.01
% 2.95/1.74 MUC search : 0.00
% 2.95/1.74 Cooper : 0.00
% 2.95/1.74 Total : 0.72
% 2.95/1.74 Index Insertion : 0.00
% 2.95/1.74 Index Deletion : 0.00
% 2.95/1.74 Index Matching : 0.00
% 2.95/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------