TSTP Solution File: GRP581-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP581-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 : n024.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:34 EDT 2023
% Result : Unsatisfiable 3.06s 1.89s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% 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 : 6 ( 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(A,double_divide(double_divide(identity,B),double_divide(C,double_divide(B,A)))),double_divide(identity,identity)) = C ),
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_49,plain,
! [B_10,A_11] : ( inverse(double_divide(B_10,A_11)) = multiply(A_11,B_10) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_28]) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( double_divide(double_divide(A_1,double_divide(double_divide(identity,B_2),double_divide(C_3,double_divide(B_2,A_1)))),double_divide(identity,identity)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_66,plain,
! [A_13,B_14,C_15] : ( double_divide(double_divide(A_13,double_divide(double_divide(identity,B_14),double_divide(C_15,double_divide(B_14,A_13)))),inverse(identity)) = C_15 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2]) ).
tff(c_551,plain,
! [A_33,C_34] : ( double_divide(double_divide(identity,double_divide(double_divide(identity,A_33),double_divide(C_34,inverse(A_33)))),inverse(identity)) = C_34 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_66]) ).
tff(c_610,plain,
! [A_7] : ( double_divide(double_divide(identity,double_divide(double_divide(identity,A_7),identity)),inverse(identity)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_551]) ).
tff(c_622,plain,
! [A_35] : ( double_divide(double_divide(identity,multiply(A_35,identity)),inverse(identity)) = A_35 ),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_6,c_610]) ).
tff(c_656,plain,
double_divide(double_divide(identity,inverse(identity)),inverse(identity)) = inverse(identity),
inference(superposition,[status(thm),theory(equality)],[c_57,c_622]) ).
tff(c_661,plain,
inverse(identity) = identity,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_8,c_656]) ).
tff(c_663,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_661]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : GRP581-1 : TPTP v8.1.2. Released v2.6.0.
% 0.14/0.14 % 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 : n024.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.36 % DateTime : Thu Aug 3 21:53:00 EDT 2023
% 0.21/0.36 % CPUTime :
% 3.06/1.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.06/1.89
% 3.06/1.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.28/1.92
% 3.28/1.92 Inference rules
% 3.28/1.92 ----------------------
% 3.28/1.92 #Ref : 0
% 3.28/1.92 #Sup : 171
% 3.28/1.92 #Fact : 0
% 3.28/1.92 #Define : 0
% 3.28/1.92 #Split : 0
% 3.28/1.92 #Chain : 0
% 3.28/1.92 #Close : 0
% 3.28/1.92
% 3.28/1.92 Ordering : KBO
% 3.28/1.92
% 3.28/1.92 Simplification rules
% 3.28/1.92 ----------------------
% 3.28/1.92 #Subsume : 0
% 3.28/1.92 #Demod : 124
% 3.28/1.92 #Tautology : 89
% 3.28/1.92 #SimpNegUnit : 1
% 3.28/1.92 #BackRed : 1
% 3.28/1.92
% 3.28/1.92 #Partial instantiations: 0
% 3.28/1.92 #Strategies tried : 1
% 3.28/1.92
% 3.28/1.92 Timing (in seconds)
% 3.28/1.92 ----------------------
% 3.28/1.92 Preprocessing : 0.40
% 3.28/1.92 Parsing : 0.21
% 3.28/1.92 CNF conversion : 0.02
% 3.28/1.93 Main loop : 0.40
% 3.28/1.93 Inferencing : 0.15
% 3.28/1.93 Reduction : 0.13
% 3.28/1.93 Demodulation : 0.10
% 3.28/1.93 BG Simplification : 0.02
% 3.28/1.93 Subsumption : 0.07
% 3.28/1.93 Abstraction : 0.02
% 3.28/1.93 MUC search : 0.00
% 3.28/1.93 Cooper : 0.00
% 3.28/1.93 Total : 0.85
% 3.28/1.93 Index Insertion : 0.00
% 3.28/1.93 Index Deletion : 0.00
% 3.28/1.93 Index Matching : 0.00
% 3.28/1.93 BG Taut test : 0.00
%------------------------------------------------------------------------------