TSTP Solution File: MGT045-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT045-1 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n004.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:42 EDT 2023
% Result : Unsatisfiable 3.63s 1.95s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 17
% Syntax : Number of formulae : 30 ( 7 unt; 11 typ; 0 def)
% Number of atoms : 39 ( 11 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 47 ( 27 ~; 20 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 8 >; 7 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ smaller_or_equal > smaller > greater_or_equal > greater > organization > position > external_ties > age > #nlpp > sk3 > sk2 > sk1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(sk2,type,
sk2: $i ).
tff(organization,type,
organization: $i > $o ).
tff(sk1,type,
sk1: $i ).
tff(position,type,
position: ( $i * $i ) > $i ).
tff(smaller,type,
smaller: ( $i * $i ) > $o ).
tff(age,type,
age: ( $i * $i ) > $i ).
tff(sk3,type,
sk3: $i ).
tff(external_ties,type,
external_ties: ( $i * $i ) > $i ).
tff(greater_or_equal,type,
greater_or_equal: ( $i * $i ) > $o ).
tff(smaller_or_equal,type,
smaller_or_equal: ( $i * $i ) > $o ).
tff(f_139,axiom,
greater(age(sk1,sk3),age(sk1,sk2)),
file(unknown,unknown) ).
tff(f_138,axiom,
organization(sk1),
file(unknown,unknown) ).
tff(f_137,axiom,
! [A,B,C] :
( ~ organization(A)
| ~ greater(age(A,B),age(A,C))
| greater(external_ties(A,B),external_ties(A,C)) ),
file(unknown,unknown) ).
tff(f_121,axiom,
! [A,B,C] :
( ~ organization(A)
| ~ greater(external_ties(A,B),external_ties(A,C))
| greater(position(A,B),position(A,C)) ),
file(unknown,unknown) ).
tff(f_129,axiom,
! [A,B,C] :
( ~ organization(A)
| ( external_ties(A,B) != external_ties(A,C) )
| ( position(A,B) = position(A,C) ) ),
file(unknown,unknown) ).
tff(f_141,axiom,
~ greater(position(sk1,sk3),position(sk1,sk2)),
file(unknown,unknown) ).
tff(c_32,plain,
greater(age(sk1,sk3),age(sk1,sk2)),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_30,plain,
organization(sk1),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_28,plain,
! [A_30,B_31,C_32] :
( greater(external_ties(A_30,B_31),external_ties(A_30,C_32))
| ~ greater(age(A_30,B_31),age(A_30,C_32))
| ~ organization(A_30) ),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_24,plain,
! [A_24,B_25,C_26] :
( greater(position(A_24,B_25),position(A_24,C_26))
| ~ greater(external_ties(A_24,B_25),external_ties(A_24,C_26))
| ~ organization(A_24) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_138,plain,
! [A_60,C_61,B_62] :
( ( position(A_60,C_61) = position(A_60,B_62) )
| ( external_ties(A_60,C_61) != external_ties(A_60,B_62) )
| ~ organization(A_60) ),
inference(cnfTransformation,[status(thm)],[f_129]) ).
tff(c_142,plain,
! [C_63,B_64] :
( ( position(sk1,C_63) = position(sk1,B_64) )
| ( external_ties(sk1,C_63) != external_ties(sk1,B_64) ) ),
inference(resolution,[status(thm)],[c_30,c_138]) ).
tff(c_34,plain,
~ greater(position(sk1,sk3),position(sk1,sk2)),
inference(cnfTransformation,[status(thm)],[f_141]) ).
tff(c_386,plain,
! [C_73] :
( ~ greater(position(sk1,C_73),position(sk1,sk2))
| ( external_ties(sk1,sk3) != external_ties(sk1,C_73) ) ),
inference(superposition,[status(thm),theory(equality)],[c_142,c_34]) ).
tff(c_390,plain,
! [B_25] :
( ( external_ties(sk1,sk3) != external_ties(sk1,B_25) )
| ~ greater(external_ties(sk1,B_25),external_ties(sk1,sk2))
| ~ organization(sk1) ),
inference(resolution,[status(thm)],[c_24,c_386]) ).
tff(c_438,plain,
! [B_77] :
( ( external_ties(sk1,sk3) != external_ties(sk1,B_77) )
| ~ greater(external_ties(sk1,B_77),external_ties(sk1,sk2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_390]) ).
tff(c_442,plain,
! [B_31] :
( ( external_ties(sk1,sk3) != external_ties(sk1,B_31) )
| ~ greater(age(sk1,B_31),age(sk1,sk2))
| ~ organization(sk1) ),
inference(resolution,[status(thm)],[c_28,c_438]) ).
tff(c_804,plain,
! [B_87] :
( ( external_ties(sk1,sk3) != external_ties(sk1,B_87) )
| ~ greater(age(sk1,B_87),age(sk1,sk2)) ),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_442]) ).
tff(c_841,plain,
$false,
inference(resolution,[status(thm)],[c_32,c_804]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT045-1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n004.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:27:26 EDT 2023
% 0.13/0.34 % CPUTime :
% 3.63/1.95 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.02/1.95
% 4.02/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.02/1.98
% 4.02/1.98 Inference rules
% 4.02/1.98 ----------------------
% 4.02/1.98 #Ref : 0
% 4.02/1.98 #Sup : 191
% 4.02/1.98 #Fact : 8
% 4.02/1.98 #Define : 0
% 4.02/1.98 #Split : 1
% 4.02/1.98 #Chain : 0
% 4.02/1.98 #Close : 0
% 4.02/1.98
% 4.02/1.98 Ordering : KBO
% 4.02/1.98
% 4.02/1.98 Simplification rules
% 4.02/1.98 ----------------------
% 4.02/1.98 #Subsume : 56
% 4.02/1.98 #Demod : 33
% 4.02/1.98 #Tautology : 22
% 4.02/1.98 #SimpNegUnit : 2
% 4.02/1.98 #BackRed : 1
% 4.02/1.98
% 4.02/1.98 #Partial instantiations: 0
% 4.02/1.98 #Strategies tried : 1
% 4.02/1.98
% 4.02/1.98 Timing (in seconds)
% 4.02/1.98 ----------------------
% 4.02/1.98 Preprocessing : 0.47
% 4.02/1.98 Parsing : 0.23
% 4.02/1.98 CNF conversion : 0.03
% 4.02/1.98 Main loop : 0.48
% 4.02/1.98 Inferencing : 0.18
% 4.02/1.98 Reduction : 0.11
% 4.02/1.98 Demodulation : 0.08
% 4.02/1.98 BG Simplification : 0.03
% 4.02/1.98 Subsumption : 0.11
% 4.02/1.98 Abstraction : 0.02
% 4.02/1.98 MUC search : 0.00
% 4.02/1.98 Cooper : 0.00
% 4.02/1.98 Total : 0.99
% 4.02/1.98 Index Insertion : 0.00
% 4.02/1.98 Index Deletion : 0.00
% 4.02/1.98 Index Matching : 0.00
% 4.02/1.98 BG Taut test : 0.00
%------------------------------------------------------------------------------