TSTP Solution File: MGT022-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT022-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 : n016.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:34 EDT 2023
% Result : Unsatisfiable 2.61s 1.68s
% Output : CNFRefutation 2.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 23
% Syntax : Number of formulae : 47 ( 15 unt; 14 typ; 0 def)
% Number of atoms : 69 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 76 ( 40 ~; 36 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 10 >; 7 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-4 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 26 (; 26 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subpopulations > greater > increases > environment > decreases > constant > resources > disbanding_rate > difference > #nlpp > resilience > sk2 > sk1 > 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(sk2,type,
sk2: $i ).
tff(constant,type,
constant: $i > $o ).
tff(sk1,type,
sk1: $i ).
tff(efficient_producers,type,
efficient_producers: $i ).
tff(disbanding_rate,type,
disbanding_rate: ( $i * $i ) > $i ).
tff(resilience,type,
resilience: $i > $i ).
tff(decreases,type,
decreases: $i > $o ).
tff(environment,type,
environment: $i > $o ).
tff(first_movers,type,
first_movers: $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff(resources,type,
resources: ( $i * $i ) > $i ).
tff(increases,type,
increases: $i > $o ).
tff(f_62,axiom,
subpopulations(first_movers,efficient_producers,sk1,sk2),
file(unknown,unknown) ).
tff(f_60,axiom,
greater(resilience(efficient_producers),resilience(first_movers)),
file(unknown,unknown) ).
tff(f_61,axiom,
environment(sk1),
file(unknown,unknown) ).
tff(f_65,axiom,
( decreases(resources(sk1,sk2))
| constant(resources(sk1,sk2)) ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [A,B,C,D] :
( ~ environment(A)
| ~ subpopulations(B,C,A,D)
| ~ greater(resilience(C),resilience(B))
| ~ decreases(resources(A,D))
| increases(difference(disbanding_rate(B,D),disbanding_rate(C,D))) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A] :
( ~ constant(A)
| ~ decreases(A) ),
file(unknown,unknown) ).
tff(f_72,axiom,
( ~ increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
| constant(resources(sk1,sk2)) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B,C,D] :
( ~ environment(A)
| ~ subpopulations(B,C,A,D)
| ~ greater(resilience(C),resilience(B))
| ~ constant(resources(A,D))
| constant(difference(disbanding_rate(B,D),disbanding_rate(C,D))) ),
file(unknown,unknown) ).
tff(f_68,axiom,
( decreases(resources(sk1,sk2))
| decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ),
file(unknown,unknown) ).
tff(c_12,plain,
subpopulations(first_movers,efficient_producers,sk1,sk2),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_8,plain,
greater(resilience(efficient_producers),resilience(first_movers)),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_10,plain,
environment(sk1),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_14,plain,
( constant(resources(sk1,sk2))
| decreases(resources(sk1,sk2)) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_22,plain,
decreases(resources(sk1,sk2)),
inference(splitLeft,[status(thm)],[c_14]) ).
tff(c_29,plain,
! [B_11,D_12,C_13,A_14] :
( increases(difference(disbanding_rate(B_11,D_12),disbanding_rate(C_13,D_12)))
| ~ decreases(resources(A_14,D_12))
| ~ greater(resilience(C_13),resilience(B_11))
| ~ subpopulations(B_11,C_13,A_14,D_12)
| ~ environment(A_14) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_31,plain,
! [B_11,C_13] :
( increases(difference(disbanding_rate(B_11,sk2),disbanding_rate(C_13,sk2)))
| ~ greater(resilience(C_13),resilience(B_11))
| ~ subpopulations(B_11,C_13,sk1,sk2)
| ~ environment(sk1) ),
inference(resolution,[status(thm)],[c_22,c_29]) ).
tff(c_35,plain,
! [B_15,C_16] :
( increases(difference(disbanding_rate(B_15,sk2),disbanding_rate(C_16,sk2)))
| ~ greater(resilience(C_16),resilience(B_15))
| ~ subpopulations(B_15,C_16,sk1,sk2) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_31]) ).
tff(c_2,plain,
! [A_1] :
( ~ decreases(A_1)
| ~ constant(A_1) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_26,plain,
~ constant(resources(sk1,sk2)),
inference(resolution,[status(thm)],[c_22,c_2]) ).
tff(c_18,plain,
( constant(resources(sk1,sk2))
| ~ increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_28,plain,
~ increases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))),
inference(negUnitSimplification,[status(thm)],[c_26,c_18]) ).
tff(c_38,plain,
( ~ greater(resilience(efficient_producers),resilience(first_movers))
| ~ subpopulations(first_movers,efficient_producers,sk1,sk2) ),
inference(resolution,[status(thm)],[c_35,c_28]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_8,c_38]) ).
tff(c_43,plain,
constant(resources(sk1,sk2)),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_53,plain,
! [B_21,D_22,C_23,A_24] :
( constant(difference(disbanding_rate(B_21,D_22),disbanding_rate(C_23,D_22)))
| ~ constant(resources(A_24,D_22))
| ~ greater(resilience(C_23),resilience(B_21))
| ~ subpopulations(B_21,C_23,A_24,D_22)
| ~ environment(A_24) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_55,plain,
! [B_21,C_23] :
( constant(difference(disbanding_rate(B_21,sk2),disbanding_rate(C_23,sk2)))
| ~ greater(resilience(C_23),resilience(B_21))
| ~ subpopulations(B_21,C_23,sk1,sk2)
| ~ environment(sk1) ),
inference(resolution,[status(thm)],[c_43,c_53]) ).
tff(c_59,plain,
! [B_25,C_26] :
( constant(difference(disbanding_rate(B_25,sk2),disbanding_rate(C_26,sk2)))
| ~ greater(resilience(C_26),resilience(B_25))
| ~ subpopulations(B_25,C_26,sk1,sk2) ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_55]) ).
tff(c_44,plain,
~ decreases(resources(sk1,sk2)),
inference(splitRight,[status(thm)],[c_14]) ).
tff(c_16,plain,
( decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2)))
| decreases(resources(sk1,sk2)) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_45,plain,
decreases(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))),
inference(negUnitSimplification,[status(thm)],[c_44,c_16]) ).
tff(c_49,plain,
~ constant(difference(disbanding_rate(first_movers,sk2),disbanding_rate(efficient_producers,sk2))),
inference(resolution,[status(thm)],[c_45,c_2]) ).
tff(c_62,plain,
( ~ greater(resilience(efficient_producers),resilience(first_movers))
| ~ subpopulations(first_movers,efficient_producers,sk1,sk2) ),
inference(resolution,[status(thm)],[c_59,c_49]) ).
tff(c_66,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_8,c_62]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : MGT022-2 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % 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.15/0.35 % Computer : n016.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 21:00:23 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.61/1.68 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.61/1.68
% 2.61/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.97/1.71
% 2.97/1.71 Inference rules
% 2.97/1.71 ----------------------
% 2.97/1.71 #Ref : 0
% 2.97/1.71 #Sup : 6
% 2.97/1.71 #Fact : 0
% 2.97/1.71 #Define : 0
% 2.97/1.71 #Split : 1
% 2.97/1.71 #Chain : 0
% 2.97/1.71 #Close : 0
% 2.97/1.71
% 2.97/1.71 Ordering : KBO
% 2.97/1.71
% 2.97/1.71 Simplification rules
% 2.97/1.71 ----------------------
% 2.97/1.71 #Subsume : 1
% 2.97/1.71 #Demod : 9
% 2.97/1.71 #Tautology : 3
% 2.97/1.71 #SimpNegUnit : 2
% 2.97/1.71 #BackRed : 0
% 2.97/1.71
% 2.97/1.71 #Partial instantiations: 0
% 2.97/1.71 #Strategies tried : 1
% 2.97/1.71
% 2.97/1.71 Timing (in seconds)
% 2.97/1.71 ----------------------
% 2.97/1.72 Preprocessing : 0.43
% 2.97/1.72 Parsing : 0.24
% 2.97/1.72 CNF conversion : 0.02
% 2.97/1.72 Main loop : 0.19
% 2.97/1.72 Inferencing : 0.08
% 2.97/1.72 Reduction : 0.05
% 2.97/1.72 Demodulation : 0.03
% 2.97/1.72 BG Simplification : 0.01
% 2.97/1.72 Subsumption : 0.03
% 2.97/1.72 Abstraction : 0.01
% 2.97/1.72 MUC search : 0.00
% 2.97/1.72 Cooper : 0.00
% 2.97/1.72 Total : 0.67
% 2.97/1.72 Index Insertion : 0.00
% 2.97/1.72 Index Deletion : 0.00
% 2.97/1.72 Index Matching : 0.00
% 2.97/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------