TSTP Solution File: GRP536-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP536-1 : TPTP v8.1.2. Bugfixed v2.7.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 : n017.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:41:28 EDT 2023
% Result : Unsatisfiable 3.09s 1.84s
% Output : CNFRefutation 3.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 26 ( 20 unt; 6 typ; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 5 ( 3 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 37 (; 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(f_30,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_28,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [A,B,C] : ( divide(divide(A,divide(divide(A,B),C)),B) = C ),
file(unknown,unknown) ).
tff(f_32,axiom,
multiply(a,b) != multiply(b,a),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_9] : ( divide(A_9,A_9) = identity ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_11,plain,
! [A_7] : ( divide(identity,A_7) = inverse(A_7) ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_4,plain,
! [A_4,C_6,B_5] : ( divide(A_4,divide(divide(C_6,C_6),B_5)) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_12,plain,
! [A_4,B_5] : ( divide(A_4,inverse(B_5)) = multiply(A_4,B_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_8,c_4]) ).
tff(c_85,plain,
! [A_15,B_16,C_17] : ( divide(divide(A_15,divide(divide(A_15,B_16),C_17)),B_16) = C_17 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_128,plain,
! [A_9,C_17] : ( divide(divide(A_9,divide(identity,C_17)),A_9) = C_17 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_85]) ).
tff(c_139,plain,
! [A_9,C_17] : ( divide(multiply(A_9,C_17),A_9) = C_17 ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_128]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( divide(divide(A_1,divide(divide(A_1,B_2),C_3)),B_2) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_705,plain,
! [A_37,C_38,B_39] : ( divide(divide(A_37,C_38),divide(divide(A_37,B_39),C_38)) = B_39 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_85]) ).
tff(c_821,plain,
! [A_9,C_38] : ( divide(divide(A_9,C_38),divide(identity,C_38)) = A_9 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_705]) ).
tff(c_845,plain,
! [A_40,C_41] : ( multiply(divide(A_40,C_41),C_41) = A_40 ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_821]) ).
tff(c_886,plain,
! [C_17,A_9] : ( multiply(C_17,A_9) = multiply(A_9,C_17) ),
inference(superposition,[status(thm),theory(equality)],[c_139,c_845]) ).
tff(c_10,plain,
multiply(b,a) != multiply(a,b),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_912,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_886,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP536-1 : TPTP v8.1.2. Bugfixed v2.7.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.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 21:29:36 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.09/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.09/1.85
% 3.09/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.23/1.87
% 3.23/1.87 Inference rules
% 3.23/1.87 ----------------------
% 3.23/1.87 #Ref : 0
% 3.23/1.87 #Sup : 221
% 3.23/1.87 #Fact : 0
% 3.23/1.87 #Define : 0
% 3.23/1.87 #Split : 0
% 3.23/1.87 #Chain : 0
% 3.23/1.87 #Close : 0
% 3.23/1.87
% 3.23/1.87 Ordering : KBO
% 3.23/1.87
% 3.23/1.87 Simplification rules
% 3.23/1.87 ----------------------
% 3.23/1.87 #Subsume : 0
% 3.23/1.87 #Demod : 136
% 3.23/1.87 #Tautology : 137
% 3.23/1.87 #SimpNegUnit : 0
% 3.23/1.87 #BackRed : 2
% 3.23/1.87
% 3.23/1.87 #Partial instantiations: 0
% 3.23/1.87 #Strategies tried : 1
% 3.23/1.87
% 3.23/1.87 Timing (in seconds)
% 3.23/1.87 ----------------------
% 3.23/1.87 Preprocessing : 0.44
% 3.23/1.87 Parsing : 0.21
% 3.23/1.87 CNF conversion : 0.02
% 3.23/1.87 Main loop : 0.39
% 3.23/1.87 Inferencing : 0.15
% 3.23/1.87 Reduction : 0.13
% 3.23/1.87 Demodulation : 0.09
% 3.23/1.87 BG Simplification : 0.03
% 3.23/1.87 Subsumption : 0.07
% 3.23/1.87 Abstraction : 0.02
% 3.23/1.87 MUC search : 0.00
% 3.23/1.87 Cooper : 0.00
% 3.23/1.87 Total : 0.88
% 3.23/1.88 Index Insertion : 0.00
% 3.23/1.88 Index Deletion : 0.00
% 3.23/1.88 Index Matching : 0.00
% 3.23/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------