TSTP Solution File: GRP493-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP493-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/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 : n021.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:22 EDT 2023
% Result : Unsatisfiable 3.19s 1.87s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 26 ( 21 unt; 5 typ; 0 def)
% Number of atoms : 21 ( 20 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 25 (; 25 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > identity > a1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a1,type,
a1: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(double_divide,type,
double_divide: ( $i * $i ) > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(f_27,axiom,
! [A] : ( inverse(A) = double_divide(A,identity) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [A] : ( identity = double_divide(A,inverse(A)) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( multiply(A,B) = double_divide(double_divide(B,A),identity) ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(inverse(a1),a1) != identity,
file(unknown,unknown) ).
tff(f_23,axiom,
! [A,B,C] : ( double_divide(double_divide(identity,A),double_divide(double_divide(double_divide(B,C),double_divide(identity,identity)),double_divide(A,C))) = B ),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_6] : ( double_divide(A_6,identity) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_8,plain,
! [A_7] : ( double_divide(A_7,inverse(A_7)) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_28,plain,
! [B_10,A_11] : ( double_divide(double_divide(B_10,A_11),identity) = multiply(A_11,B_10) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_52,plain,
! [A_7] : ( multiply(inverse(A_7),A_7) = double_divide(identity,identity) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_28]) ).
tff(c_57,plain,
! [A_7] : ( multiply(inverse(A_7),A_7) = inverse(identity) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_52]) ).
tff(c_10,plain,
multiply(inverse(a1),a1) != identity,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_58,plain,
inverse(identity) != identity,
inference(demodulation,[status(thm),theory(equality)],[c_57,c_10]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( double_divide(double_divide(identity,A_1),double_divide(double_divide(double_divide(B_2,C_3),double_divide(identity,identity)),double_divide(A_1,C_3))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_66,plain,
! [A_13,B_14,C_15] : ( double_divide(double_divide(identity,A_13),double_divide(double_divide(double_divide(B_14,C_15),inverse(identity)),double_divide(A_13,C_15))) = B_14 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_110,plain,
! [A_13,A_7] : ( double_divide(double_divide(identity,A_13),double_divide(double_divide(identity,inverse(identity)),double_divide(A_13,inverse(A_7)))) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_66]) ).
tff(c_459,plain,
! [A_29,A_30] : ( double_divide(double_divide(identity,A_29),double_divide(identity,double_divide(A_29,inverse(A_30)))) = A_30 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_110]) ).
tff(c_503,plain,
! [A_7] : ( double_divide(double_divide(identity,A_7),double_divide(identity,identity)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_459]) ).
tff(c_508,plain,
! [A_31] : ( double_divide(double_divide(identity,A_31),inverse(identity)) = A_31 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_503]) ).
tff(c_549,plain,
double_divide(identity,inverse(identity)) = inverse(identity),
inference(superposition,[status(thm),theory(equality)],[c_8,c_508]) ).
tff(c_553,plain,
inverse(identity) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_549]) ).
tff(c_555,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_553]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP493-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n021.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:25:52 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.19/1.87 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.19/1.87
% 3.19/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.19/1.90
% 3.19/1.90 Inference rules
% 3.19/1.90 ----------------------
% 3.19/1.90 #Ref : 0
% 3.19/1.90 #Sup : 144
% 3.19/1.90 #Fact : 0
% 3.19/1.90 #Define : 0
% 3.19/1.90 #Split : 0
% 3.19/1.90 #Chain : 0
% 3.19/1.90 #Close : 0
% 3.19/1.90
% 3.19/1.90 Ordering : KBO
% 3.19/1.90
% 3.19/1.90 Simplification rules
% 3.19/1.90 ----------------------
% 3.19/1.90 #Subsume : 0
% 3.19/1.90 #Demod : 102
% 3.19/1.90 #Tautology : 74
% 3.19/1.90 #SimpNegUnit : 1
% 3.19/1.90 #BackRed : 1
% 3.19/1.90
% 3.19/1.90 #Partial instantiations: 0
% 3.19/1.90 #Strategies tried : 1
% 3.19/1.90
% 3.19/1.90 Timing (in seconds)
% 3.19/1.90 ----------------------
% 3.19/1.90 Preprocessing : 0.43
% 3.19/1.90 Parsing : 0.23
% 3.19/1.90 CNF conversion : 0.02
% 3.19/1.90 Main loop : 0.36
% 3.19/1.90 Inferencing : 0.14
% 3.19/1.90 Reduction : 0.12
% 3.19/1.90 Demodulation : 0.09
% 3.19/1.90 BG Simplification : 0.02
% 3.19/1.90 Subsumption : 0.06
% 3.19/1.90 Abstraction : 0.02
% 3.19/1.90 MUC search : 0.00
% 3.19/1.90 Cooper : 0.00
% 3.19/1.90 Total : 0.83
% 3.19/1.90 Index Insertion : 0.00
% 3.19/1.90 Index Deletion : 0.00
% 3.19/1.90 Index Matching : 0.00
% 3.19/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------