TSTP Solution File: GRP494-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP494-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 : n018.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.24s 2.00s
% Output : CNFRefutation 3.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 10
% Syntax : Number of formulae : 39 ( 34 unt; 5 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 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 : 44 (; 44 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > double_divide > #nlpp > inverse > identity > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(inverse,type,
inverse: $i > $i ).
tff(double_divide,type,
double_divide: ( $i * $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 = double_divide(A,inverse(A)) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A] : ( inverse(A) = double_divide(A,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(f_25,axiom,
! [A,B] : ( multiply(A,B) = double_divide(double_divide(B,A),identity) ),
file(unknown,unknown) ).
tff(f_31,axiom,
multiply(identity,a2) != a2,
file(unknown,unknown) ).
tff(c_8,plain,
! [A_7] : ( double_divide(A_7,inverse(A_7)) = identity ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_6,plain,
! [A_6] : ( double_divide(A_6,identity) = inverse(A_6) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
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_65,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_109,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_65]) ).
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_109]) ).
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_507,plain,
! [A_7] : ( double_divide(double_divide(identity,A_7),inverse(identity)) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_503]) ).
tff(c_650,plain,
! [A_33] : ( double_divide(double_divide(identity,A_33),identity) = A_33 ),
inference(demodulation,[status(thm),theory(equality)],[c_553,c_507]) ).
tff(c_4,plain,
! [B_5,A_4] : ( double_divide(double_divide(B_5,A_4),identity) = multiply(A_4,B_5) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_668,plain,
! [A_33] : ( multiply(A_33,identity) = A_33 ),
inference(superposition,[status(thm),theory(equality)],[c_650,c_4]) ).
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_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_791,plain,
! [A_37] : ( inverse(double_divide(identity,A_37)) = A_37 ),
inference(superposition,[status(thm),theory(equality)],[c_650,c_6]) ).
tff(c_852,plain,
! [A_38] : ( double_divide(double_divide(identity,A_38),A_38) = identity ),
inference(superposition,[status(thm),theory(equality)],[c_791,c_8]) ).
tff(c_120,plain,
! [A_13,A_7] : ( double_divide(double_divide(identity,A_13),double_divide(identity,double_divide(A_13,inverse(A_7)))) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_109]) ).
tff(c_862,plain,
! [A_7] : ( double_divide(double_divide(identity,double_divide(identity,inverse(A_7))),double_divide(identity,identity)) = A_7 ),
inference(superposition,[status(thm),theory(equality)],[c_852,c_120]) ).
tff(c_923,plain,
! [A_39] : ( double_divide(identity,inverse(A_39)) = A_39 ),
inference(demodulation,[status(thm),theory(equality)],[c_668,c_49,c_6,c_553,c_6,c_862]) ).
tff(c_944,plain,
! [A_39] : ( double_divide(double_divide(identity,identity),double_divide(identity,A_39)) = A_39 ),
inference(superposition,[status(thm),theory(equality)],[c_923,c_120]) ).
tff(c_1049,plain,
! [A_41] : ( double_divide(identity,double_divide(identity,A_41)) = A_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_553,c_6,c_944]) ).
tff(c_31,plain,
! [B_10,A_11] : ( multiply(identity,double_divide(B_10,A_11)) = double_divide(multiply(A_11,B_10),identity) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_4]) ).
tff(c_53,plain,
! [B_10,A_11] : ( multiply(identity,double_divide(B_10,A_11)) = inverse(multiply(A_11,B_10)) ),
inference(demodulation,[status(thm),theory(equality)],[c_6,c_31]) ).
tff(c_1080,plain,
! [A_41] : ( inverse(multiply(double_divide(identity,A_41),identity)) = multiply(identity,A_41) ),
inference(superposition,[status(thm),theory(equality)],[c_1049,c_53]) ).
tff(c_1115,plain,
! [A_41] : ( multiply(identity,A_41) = A_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_668,c_49,c_668,c_1080]) ).
tff(c_10,plain,
multiply(identity,a2) != a2,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1131,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1115,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP494-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.37 % Computer : n018.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 22:02:50 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.24/2.00 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.24/2.00
% 3.24/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.66/2.03
% 3.66/2.03 Inference rules
% 3.66/2.03 ----------------------
% 3.66/2.03 #Ref : 0
% 3.66/2.03 #Sup : 285
% 3.66/2.03 #Fact : 0
% 3.66/2.03 #Define : 0
% 3.66/2.03 #Split : 0
% 3.66/2.03 #Chain : 0
% 3.66/2.03 #Close : 0
% 3.66/2.03
% 3.66/2.03 Ordering : KBO
% 3.66/2.03
% 3.66/2.03 Simplification rules
% 3.66/2.03 ----------------------
% 3.66/2.03 #Subsume : 0
% 3.66/2.03 #Demod : 275
% 3.66/2.03 #Tautology : 168
% 3.66/2.03 #SimpNegUnit : 0
% 3.66/2.03 #BackRed : 11
% 3.66/2.03
% 3.66/2.03 #Partial instantiations: 0
% 3.66/2.03 #Strategies tried : 1
% 3.66/2.03
% 3.66/2.03 Timing (in seconds)
% 3.66/2.03 ----------------------
% 3.66/2.04 Preprocessing : 0.42
% 3.66/2.04 Parsing : 0.22
% 3.66/2.04 CNF conversion : 0.02
% 3.66/2.04 Main loop : 0.47
% 3.66/2.04 Inferencing : 0.17
% 3.66/2.04 Reduction : 0.17
% 3.66/2.04 Demodulation : 0.13
% 3.66/2.04 BG Simplification : 0.02
% 3.66/2.04 Subsumption : 0.07
% 3.66/2.04 Abstraction : 0.03
% 3.66/2.04 MUC search : 0.00
% 3.66/2.04 Cooper : 0.00
% 3.66/2.04 Total : 0.94
% 3.66/2.04 Index Insertion : 0.00
% 3.66/2.04 Index Deletion : 0.00
% 3.66/2.04 Index Matching : 0.00
% 3.66/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------