TSTP Solution File: GRP538-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP538-1 : TPTP v8.1.2. Released v2.6.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 : n007.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 2.64s 1.69s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 19 unt; 6 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 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 : 29 (; 29 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > divide > #nlpp > inverse > identity > b2 > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(b2,type,
b2: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(a2,type,
a2: $i ).
tff(identity,type,
identity: $i ).
tff(f_29,axiom,
! [A] : ( identity = divide(A,A) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( inverse(A) = divide(divide(B,B),A) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B,C] : ( multiply(A,B) = divide(A,divide(divide(C,C),B)) ),
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( divide(divide(A,B),divide(divide(A,C),B)) = C ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file(unknown,unknown) ).
tff(c_8,plain,
! [A_9] : ( divide(A_9,A_9) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_6,plain,
! [B_8,A_7] : ( divide(divide(B_8,B_8),A_7) = inverse(A_7) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
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_25]) ).
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,B_16),divide(divide(A_15,C_17),B_16)) = C_17 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_131,plain,
! [A_9,B_16] : ( divide(divide(A_9,B_16),divide(identity,B_16)) = A_9 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_85]) ).
tff(c_169,plain,
! [A_19,B_20] : ( multiply(divide(A_19,B_20),B_20) = A_19 ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_11,c_131]) ).
tff(c_187,plain,
! [A_9] : ( multiply(identity,A_9) = A_9 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_169]) ).
tff(c_42,plain,
! [A_12,B_13] : ( divide(A_12,inverse(B_13)) = multiply(A_12,B_13) ),
inference(demodulation,[status(thm),theory(equality)],[c_11,c_8,c_4]) ).
tff(c_53,plain,
! [B_13] : ( multiply(inverse(B_13),B_13) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_42,c_8]) ).
tff(c_10,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_70,plain,
multiply(identity,a2) != a2,
inference(demodulation,[status(thm),theory(equality)],[c_53,c_10]) ).
tff(c_195,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_187,c_70]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP538-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/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.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 21:52:23 EDT 2023
% 0.15/0.36 % CPUTime :
% 2.64/1.69 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/1.69
% 2.64/1.69 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.64/1.71
% 2.64/1.71 Inference rules
% 2.64/1.71 ----------------------
% 2.64/1.71 #Ref : 0
% 2.64/1.71 #Sup : 49
% 2.64/1.71 #Fact : 0
% 2.64/1.71 #Define : 0
% 2.64/1.71 #Split : 0
% 2.64/1.71 #Chain : 0
% 2.64/1.71 #Close : 0
% 2.64/1.71
% 2.64/1.71 Ordering : KBO
% 2.64/1.71
% 2.64/1.71 Simplification rules
% 2.64/1.71 ----------------------
% 2.64/1.71 #Subsume : 0
% 2.64/1.71 #Demod : 18
% 2.64/1.71 #Tautology : 23
% 2.64/1.71 #SimpNegUnit : 0
% 2.64/1.71 #BackRed : 3
% 2.64/1.71
% 2.64/1.71 #Partial instantiations: 0
% 2.64/1.71 #Strategies tried : 1
% 2.64/1.71
% 2.64/1.71 Timing (in seconds)
% 2.64/1.71 ----------------------
% 2.64/1.72 Preprocessing : 0.39
% 2.64/1.72 Parsing : 0.21
% 2.64/1.72 CNF conversion : 0.02
% 2.64/1.72 Main loop : 0.24
% 2.64/1.72 Inferencing : 0.09
% 2.64/1.72 Reduction : 0.08
% 2.64/1.72 Demodulation : 0.07
% 2.64/1.72 BG Simplification : 0.01
% 2.64/1.72 Subsumption : 0.04
% 2.64/1.72 Abstraction : 0.01
% 2.64/1.72 MUC search : 0.00
% 2.64/1.72 Cooper : 0.00
% 2.64/1.72 Total : 0.67
% 2.64/1.72 Index Insertion : 0.00
% 2.64/1.72 Index Deletion : 0.00
% 2.64/1.72 Index Matching : 0.00
% 2.64/1.72 BG Taut test : 0.00
%------------------------------------------------------------------------------