TSTP Solution File: GRP710-10 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP710-10 : TPTP v8.1.2. Released v8.1.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 : n019.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:42:00 EDT 2023
% Result : Unsatisfiable 3.88s 2.00s
% Output : CNFRefutation 4.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 35 ( 30 unt; 5 typ; 0 def)
% Number of atoms : 30 ( 29 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 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 : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 50 (; 50 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mult > #nlpp > i > x1 > x0 > unit
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i > $i ).
tff(x1,type,
x1: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(x0,type,
x0: $i ).
tff(f_28,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_34,axiom,
! [A] : ( mult(i(A),A) = unit ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_30,axiom,
! [A,B,C] : ( mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C) ),
file(unknown,unknown) ).
tff(f_32,axiom,
! [A] : ( mult(A,i(A)) = unit ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [X2] : ( mult(x0,X2) != x1 ),
file(unknown,unknown) ).
tff(c_4,plain,
! [A_2] : ( mult(unit,A_2) = A_2 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_10,plain,
! [A_7] : ( mult(i(A_7),A_7) = unit ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [A_1] : ( mult(A_1,unit) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_92,plain,
! [A_14,B_15,C_16] : ( mult(mult(mult(A_14,B_15),B_15),C_16) = mult(A_14,mult(B_15,mult(B_15,C_16))) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_110,plain,
! [A_14,B_15] : ( mult(A_14,mult(B_15,mult(B_15,unit))) = mult(mult(A_14,B_15),B_15) ),
inference(superposition,[status(thm),theory(equality)],[c_92,c_2]) ).
tff(c_147,plain,
! [A_14,B_15] : ( mult(mult(A_14,B_15),B_15) = mult(A_14,mult(B_15,B_15)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_110]) ).
tff(c_6,plain,
! [A_3,B_4,C_5] : ( mult(mult(mult(A_3,B_4),B_4),C_5) = mult(A_3,mult(B_4,mult(B_4,C_5))) ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_1103,plain,
! [A_36,B_37,C_38] : ( mult(mult(A_36,mult(B_37,B_37)),C_38) = mult(A_36,mult(B_37,mult(B_37,C_38))) ),
inference(demodulation,[status(thm),theory(equality)],[c_147,c_6]) ).
tff(c_1272,plain,
! [B_37,C_38] : ( mult(i(mult(B_37,B_37)),mult(B_37,mult(B_37,C_38))) = mult(unit,C_38) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1103]) ).
tff(c_1329,plain,
! [B_37,C_38] : ( mult(i(mult(B_37,B_37)),mult(B_37,mult(B_37,C_38))) = C_38 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1272]) ).
tff(c_123,plain,
! [A_7,C_16] : ( mult(i(A_7),mult(A_7,mult(A_7,C_16))) = mult(mult(unit,A_7),C_16) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_92]) ).
tff(c_150,plain,
! [A_7,C_16] : ( mult(i(A_7),mult(A_7,mult(A_7,C_16))) = mult(A_7,C_16) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_123]) ).
tff(c_8,plain,
! [A_6] : ( mult(A_6,i(A_6)) = unit ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_126,plain,
! [A_6,C_16] : ( mult(A_6,mult(i(A_6),mult(i(A_6),C_16))) = mult(mult(unit,i(A_6)),C_16) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_92]) ).
tff(c_806,plain,
! [A_31,C_32] : ( mult(A_31,mult(i(A_31),mult(i(A_31),C_32))) = mult(i(A_31),C_32) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_126]) ).
tff(c_863,plain,
! [A_7,C_16] : ( mult(i(A_7),mult(A_7,mult(A_7,C_16))) = mult(A_7,mult(i(A_7),mult(A_7,C_16))) ),
inference(superposition,[status(thm),theory(equality)],[c_150,c_806]) ).
tff(c_920,plain,
! [A_7,C_16] : ( mult(A_7,mult(i(A_7),mult(A_7,C_16))) = mult(A_7,C_16) ),
inference(demodulation,[status(thm),theory(equality)],[c_150,c_863]) ).
tff(c_1335,plain,
! [B_39,C_40] : ( mult(i(mult(B_39,B_39)),mult(B_39,mult(B_39,C_40))) = C_40 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1272]) ).
tff(c_1377,plain,
! [A_7,C_16] : ( mult(i(mult(A_7,A_7)),mult(A_7,mult(A_7,C_16))) = mult(i(A_7),mult(A_7,C_16)) ),
inference(superposition,[status(thm),theory(equality)],[c_920,c_1335]) ).
tff(c_1478,plain,
! [A_41,C_42] : ( mult(i(A_41),mult(A_41,C_42)) = C_42 ),
inference(demodulation,[status(thm),theory(equality)],[c_1329,c_1377]) ).
tff(c_12,plain,
! [X2_8] : ( mult(x0,X2_8) != x1 ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_835,plain,
! [C_32] : ( mult(i(x0),C_32) != x1 ),
inference(superposition,[status(thm),theory(equality)],[c_806,c_12]) ).
tff(c_1494,plain,
! [C_42] : ( x1 != C_42 ),
inference(superposition,[status(thm),theory(equality)],[c_1478,c_835]) ).
tff(c_1586,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_1494]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP710-10 : TPTP v8.1.2. Released v8.1.0.
% 0.00/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.20/0.36 % Computer : n019.cluster.edu
% 0.20/0.36 % Model : x86_64 x86_64
% 0.20/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.36 % Memory : 8042.1875MB
% 0.20/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.20/0.36 % CPULimit : 300
% 0.20/0.36 % WCLimit : 300
% 0.20/0.36 % DateTime : Thu Aug 3 22:27:31 EDT 2023
% 0.20/0.36 % CPUTime :
% 3.88/2.00 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.88/2.00
% 3.88/2.00 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.13/2.03
% 4.13/2.03 Inference rules
% 4.13/2.03 ----------------------
% 4.13/2.03 #Ref : 1
% 4.13/2.03 #Sup : 359
% 4.13/2.03 #Fact : 0
% 4.13/2.03 #Define : 0
% 4.13/2.03 #Split : 0
% 4.13/2.03 #Chain : 0
% 4.13/2.03 #Close : 0
% 4.13/2.03
% 4.13/2.03 Ordering : KBO
% 4.13/2.03
% 4.13/2.03 Simplification rules
% 4.13/2.03 ----------------------
% 4.13/2.03 #Subsume : 21
% 4.13/2.03 #Demod : 493
% 4.13/2.03 #Tautology : 195
% 4.13/2.03 #SimpNegUnit : 0
% 4.13/2.03 #BackRed : 2
% 4.13/2.03
% 4.13/2.03 #Partial instantiations: 0
% 4.13/2.03 #Strategies tried : 1
% 4.13/2.03
% 4.13/2.03 Timing (in seconds)
% 4.13/2.03 ----------------------
% 4.13/2.03 Preprocessing : 0.38
% 4.13/2.03 Parsing : 0.21
% 4.13/2.03 CNF conversion : 0.02
% 4.13/2.03 Main loop : 0.57
% 4.13/2.03 Inferencing : 0.22
% 4.13/2.03 Reduction : 0.22
% 4.13/2.03 Demodulation : 0.17
% 4.13/2.03 BG Simplification : 0.02
% 4.13/2.03 Subsumption : 0.08
% 4.13/2.03 Abstraction : 0.03
% 4.13/2.03 MUC search : 0.00
% 4.13/2.03 Cooper : 0.00
% 4.13/2.04 Total : 1.00
% 4.13/2.04 Index Insertion : 0.00
% 4.13/2.04 Index Deletion : 0.00
% 4.13/2.04 Index Matching : 0.00
% 4.13/2.04 BG Taut test : 0.00
%------------------------------------------------------------------------------