TSTP Solution File: MGT041-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT041-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 : n012.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:41 EDT 2023
% Result : Unsatisfiable 2.78s 1.65s
% Output : CNFRefutation 2.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 35 ( 13 unt; 10 typ; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 55 ( 29 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 6 >; 5 *; 0 +; 0 <<)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 18 (; 18 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ number_of_routines > organisation_at_time > has_elaborated_routines > founding_time > first_mover > efficient_producer > #nlpp > sk2 > sk1 > low > high
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(high,type,
high: $i ).
tff(has_elaborated_routines,type,
has_elaborated_routines: ( $i * $i ) > $o ).
tff(sk2,type,
sk2: $i ).
tff(sk1,type,
sk1: $i ).
tff(efficient_producer,type,
efficient_producer: $i > $o ).
tff(low,type,
low: $i ).
tff(founding_time,type,
founding_time: ( $i * $i ) > $o ).
tff(organisation_at_time,type,
organisation_at_time: ( $i * $i ) > $o ).
tff(first_mover,type,
first_mover: $i > $o ).
tff(number_of_routines,type,
number_of_routines: ( $i * $i * $i ) > $o ).
tff(f_57,axiom,
~ has_elaborated_routines(sk1,sk2),
file(unknown,unknown) ).
tff(f_53,axiom,
organisation_at_time(sk1,sk2),
file(unknown,unknown) ).
tff(f_64,axiom,
! [A,B] :
( ~ organisation_at_time(A,B)
| first_mover(A)
| efficient_producer(A) ),
file(unknown,unknown) ).
tff(f_54,axiom,
founding_time(sk1,sk2),
file(unknown,unknown) ).
tff(f_55,axiom,
number_of_routines(sk1,sk2,high),
file(unknown,unknown) ).
tff(f_52,axiom,
! [A,B] :
( ~ organisation_at_time(A,B)
| ~ first_mover(A)
| ~ founding_time(A,B)
| number_of_routines(A,B,low) ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A,B] :
( ~ number_of_routines(A,B,low)
| ~ number_of_routines(A,B,high) ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [A,B] :
( ~ organisation_at_time(A,B)
| ~ efficient_producer(A)
| ~ founding_time(A,B)
| has_elaborated_routines(A,B) ),
file(unknown,unknown) ).
tff(c_14,plain,
~ has_elaborated_routines(sk1,sk2),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_8,plain,
organisation_at_time(sk1,sk2),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_17,plain,
! [A_9,B_10] :
( efficient_producer(A_9)
| first_mover(A_9)
| ~ organisation_at_time(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_21,plain,
( efficient_producer(sk1)
| first_mover(sk1) ),
inference(resolution,[status(thm)],[c_8,c_17]) ).
tff(c_23,plain,
first_mover(sk1),
inference(splitLeft,[status(thm)],[c_21]) ).
tff(c_10,plain,
founding_time(sk1,sk2),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_12,plain,
number_of_routines(sk1,sk2,high),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_32,plain,
! [A_15,B_16] :
( number_of_routines(A_15,B_16,low)
| ~ founding_time(A_15,B_16)
| ~ first_mover(A_15)
| ~ organisation_at_time(A_15,B_16) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_2,plain,
! [A_1,B_2] :
( ~ number_of_routines(A_1,B_2,high)
| ~ number_of_routines(A_1,B_2,low) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_37,plain,
! [A_17,B_18] :
( ~ number_of_routines(A_17,B_18,high)
| ~ founding_time(A_17,B_18)
| ~ first_mover(A_17)
| ~ organisation_at_time(A_17,B_18) ),
inference(resolution,[status(thm)],[c_32,c_2]) ).
tff(c_40,plain,
( ~ founding_time(sk1,sk2)
| ~ first_mover(sk1)
| ~ organisation_at_time(sk1,sk2) ),
inference(resolution,[status(thm)],[c_12,c_37]) ).
tff(c_44,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_23,c_10,c_40]) ).
tff(c_45,plain,
efficient_producer(sk1),
inference(splitRight,[status(thm)],[c_21]) ).
tff(c_47,plain,
! [A_19,B_20] :
( has_elaborated_routines(A_19,B_20)
| ~ founding_time(A_19,B_20)
| ~ efficient_producer(A_19)
| ~ organisation_at_time(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_50,plain,
( has_elaborated_routines(sk1,sk2)
| ~ founding_time(sk1,sk2)
| ~ efficient_producer(sk1) ),
inference(resolution,[status(thm)],[c_8,c_47]) ).
tff(c_53,plain,
has_elaborated_routines(sk1,sk2),
inference(demodulation,[status(thm),theory(equality)],[c_45,c_10,c_50]) ).
tff(c_55,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_53]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT041-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.13/0.34 % Computer : n012.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 20:25:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.78/1.65 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.78/1.66
% 2.78/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.85/1.69
% 2.85/1.69 Inference rules
% 2.85/1.69 ----------------------
% 2.85/1.69 #Ref : 0
% 2.85/1.69 #Sup : 5
% 2.85/1.69 #Fact : 0
% 2.85/1.69 #Define : 0
% 2.85/1.69 #Split : 1
% 2.85/1.69 #Chain : 0
% 2.85/1.69 #Close : 0
% 2.85/1.69
% 2.85/1.69 Ordering : KBO
% 2.85/1.69
% 2.85/1.69 Simplification rules
% 2.85/1.69 ----------------------
% 2.85/1.69 #Subsume : 0
% 2.85/1.69 #Demod : 6
% 2.85/1.69 #Tautology : 0
% 2.85/1.69 #SimpNegUnit : 2
% 2.85/1.69 #BackRed : 0
% 2.85/1.69
% 2.85/1.69 #Partial instantiations: 0
% 2.85/1.69 #Strategies tried : 1
% 2.85/1.69
% 2.85/1.69 Timing (in seconds)
% 2.85/1.69 ----------------------
% 2.85/1.69 Preprocessing : 0.42
% 2.85/1.69 Parsing : 0.24
% 2.85/1.69 CNF conversion : 0.02
% 2.85/1.69 Main loop : 0.21
% 2.85/1.69 Inferencing : 0.10
% 2.85/1.70 Reduction : 0.04
% 2.85/1.70 Demodulation : 0.03
% 2.85/1.70 BG Simplification : 0.01
% 2.85/1.70 Subsumption : 0.03
% 2.85/1.70 Abstraction : 0.01
% 2.85/1.70 MUC search : 0.00
% 2.85/1.70 Cooper : 0.00
% 2.85/1.70 Total : 0.68
% 2.85/1.70 Index Insertion : 0.00
% 2.85/1.70 Index Deletion : 0.00
% 2.85/1.70 Index Matching : 0.00
% 2.85/1.70 BG Taut test : 0.00
%------------------------------------------------------------------------------