TSTP Solution File: MGT049-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : MGT049-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/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 : n031.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:43 EDT 2023
% Result : Unsatisfiable 3.34s 1.87s
% Output : CNFRefutation 3.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 25 ( 8 unt; 11 typ; 0 def)
% Number of atoms : 22 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 13 ~; 8 |; 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 : 18 (; 18 !; 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_134,axiom,
organization(sk1),
file(unknown,unknown) ).
tff(f_133,axiom,
! [A,B,C] :
( ~ organization(A)
| ( external_ties(A,B) = external_ties(A,C) ) ),
file(unknown,unknown) ).
tff(f_128,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_137,axiom,
position(sk1,sk3) != position(sk1,sk2),
file(unknown,unknown) ).
tff(c_30,plain,
organization(sk1),
inference(cnfTransformation,[status(thm)],[f_134]) ).
tff(c_74,plain,
! [A_51,C_52,B_53] :
( ( external_ties(A_51,C_52) = external_ties(A_51,B_53) )
| ~ organization(A_51) ),
inference(cnfTransformation,[status(thm)],[f_133]) ).
tff(c_77,plain,
! [C_52,B_53] : ( external_ties(sk1,C_52) = external_ties(sk1,B_53) ),
inference(resolution,[status(thm)],[c_30,c_74]) ).
tff(c_141,plain,
! [A_62,C_63,B_64] :
( ( position(A_62,C_63) = position(A_62,B_64) )
| ( external_ties(A_62,C_63) != external_ties(A_62,B_64) )
| ~ organization(A_62) ),
inference(cnfTransformation,[status(thm)],[f_128]) ).
tff(c_155,plain,
! [C_68,B_69] :
( ( position(sk1,C_68) = position(sk1,B_69) )
| ( external_ties(sk1,C_68) != external_ties(sk1,B_69) ) ),
inference(resolution,[status(thm)],[c_30,c_141]) ).
tff(c_34,plain,
position(sk1,sk3) != position(sk1,sk2),
inference(cnfTransformation,[status(thm)],[f_137]) ).
tff(c_170,plain,
! [C_68] :
( ( position(sk1,sk2) != position(sk1,C_68) )
| ( external_ties(sk1,sk3) != external_ties(sk1,C_68) ) ),
inference(superposition,[status(thm),theory(equality)],[c_155,c_34]) ).
tff(c_188,plain,
external_ties(sk1,sk3) != external_ties(sk1,sk2),
inference(reflexivity,[status(thm),theory(equality)],[c_170]) ).
tff(c_203,plain,
! [C_52] : ( external_ties(sk1,sk2) != external_ties(sk1,C_52) ),
inference(superposition,[status(thm),theory(equality)],[c_77,c_188]) ).
tff(c_239,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_203]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : MGT049-1 : TPTP v8.1.2. Released v2.4.0.
% 0.13/0.15 % 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.14/0.36 % Computer : n031.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 20:57:29 EDT 2023
% 0.14/0.37 % CPUTime :
% 3.34/1.87 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.34/1.87
% 3.34/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.34/1.90
% 3.34/1.90 Inference rules
% 3.34/1.90 ----------------------
% 3.34/1.90 #Ref : 2
% 3.34/1.90 #Sup : 50
% 3.34/1.90 #Fact : 2
% 3.34/1.90 #Define : 0
% 3.34/1.90 #Split : 0
% 3.34/1.90 #Chain : 0
% 3.34/1.90 #Close : 0
% 3.34/1.90
% 3.34/1.90 Ordering : KBO
% 3.34/1.90
% 3.34/1.90 Simplification rules
% 3.34/1.90 ----------------------
% 3.34/1.90 #Subsume : 10
% 3.34/1.90 #Demod : 4
% 3.34/1.90 #Tautology : 9
% 3.34/1.90 #SimpNegUnit : 0
% 3.34/1.90 #BackRed : 0
% 3.34/1.90
% 3.34/1.90 #Partial instantiations: 0
% 3.34/1.90 #Strategies tried : 1
% 3.34/1.90
% 3.34/1.90 Timing (in seconds)
% 3.34/1.90 ----------------------
% 3.34/1.90 Preprocessing : 0.49
% 3.34/1.90 Parsing : 0.24
% 3.34/1.90 CNF conversion : 0.03
% 3.34/1.90 Main loop : 0.29
% 3.34/1.90 Inferencing : 0.11
% 3.34/1.90 Reduction : 0.08
% 3.34/1.90 Demodulation : 0.06
% 3.34/1.90 BG Simplification : 0.02
% 3.34/1.90 Subsumption : 0.06
% 3.34/1.90 Abstraction : 0.01
% 3.34/1.90 MUC search : 0.00
% 3.34/1.90 Cooper : 0.00
% 3.34/1.90 Total : 0.82
% 3.34/1.90 Index Insertion : 0.00
% 3.34/1.90 Index Deletion : 0.00
% 3.34/1.90 Index Matching : 0.00
% 3.34/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------