TSTP Solution File: GRP710+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.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 : n031.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 : Theorem 5.45s 2.30s
% Output : CNFRefutation 5.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 51 ( 42 unt; 7 typ; 0 def)
% Number of atoms : 46 ( 44 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 13 ( 11 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 77 (; 75 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mult > #nlpp > i > unit > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(i,type,
i: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_29,axiom,
! [A] : ( mult(A,unit) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).
tff(f_37,axiom,
! [A] : ( mult(i(A),A) = unit ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
tff(f_31,axiom,
! [A] : ( mult(unit,A) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
tff(f_33,axiom,
! [C,B,A] : ( mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
tff(f_35,axiom,
! [A] : ( mult(A,i(A)) = unit ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
tff(f_45,negated_conjecture,
~ ( ! [X0,X1] :
? [X2] : ( mult(X0,X2) = X1 )
& ! [X3,X4] :
? [X5] : ( mult(X5,X4) = X3 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_2,plain,
! [A_1] : ( mult(A_1,unit) = A_1 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_10,plain,
! [A_7] : ( mult(i(A_7),A_7) = unit ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_4,plain,
! [A_2] : ( mult(unit,A_2) = A_2 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_1559,plain,
! [A_47,B_48,C_49] : ( mult(mult(mult(A_47,B_48),B_48),C_49) = mult(A_47,mult(B_48,mult(B_48,C_49))) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_1581,plain,
! [A_47,B_48] : ( mult(A_47,mult(B_48,mult(B_48,unit))) = mult(mult(A_47,B_48),B_48) ),
inference(superposition,[status(thm),theory(equality)],[c_1559,c_2]) ).
tff(c_1763,plain,
! [A_57,B_58] : ( mult(mult(A_57,B_58),B_58) = mult(A_57,mult(B_58,B_58)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1581]) ).
tff(c_1817,plain,
! [A_7] : ( mult(i(A_7),mult(A_7,A_7)) = mult(unit,A_7) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1763]) ).
tff(c_1832,plain,
! [A_7] : ( mult(i(A_7),mult(A_7,A_7)) = A_7 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1817]) ).
tff(c_1618,plain,
! [A_47,B_48] : ( mult(mult(A_47,B_48),B_48) = mult(A_47,mult(B_48,B_48)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_1581]) ).
tff(c_6,plain,
! [A_5,B_4,C_3] : ( mult(mult(mult(A_5,B_4),B_4),C_3) = mult(A_5,mult(B_4,mult(B_4,C_3))) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_3660,plain,
! [A_110,B_111,C_112] : ( mult(mult(A_110,mult(B_111,B_111)),C_112) = mult(A_110,mult(B_111,mult(B_111,C_112))) ),
inference(demodulation,[status(thm),theory(equality)],[c_1618,c_6]) ).
tff(c_95,plain,
! [A_17,B_18,C_19] : ( mult(mult(mult(A_17,B_18),B_18),C_19) = mult(A_17,mult(B_18,mult(B_18,C_19))) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_113,plain,
! [A_17,B_18] : ( mult(A_17,mult(B_18,mult(B_18,unit))) = mult(mult(A_17,B_18),B_18) ),
inference(superposition,[status(thm),theory(equality)],[c_95,c_2]) ).
tff(c_150,plain,
! [A_17,B_18] : ( mult(mult(A_17,B_18),B_18) = mult(A_17,mult(B_18,B_18)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_113]) ).
tff(c_1066,plain,
! [A_39,B_40,C_41] : ( mult(mult(A_39,mult(B_40,B_40)),C_41) = mult(A_39,mult(B_40,mult(B_40,C_41))) ),
inference(demodulation,[status(thm),theory(equality)],[c_150,c_6]) ).
tff(c_1239,plain,
! [B_40,C_41] : ( mult(i(mult(B_40,B_40)),mult(B_40,mult(B_40,C_41))) = mult(unit,C_41) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_1066]) ).
tff(c_1293,plain,
! [B_40,C_41] : ( mult(i(mult(B_40,B_40)),mult(B_40,mult(B_40,C_41))) = C_41 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1239]) ).
tff(c_133,plain,
! [A_7,C_19] : ( mult(i(A_7),mult(A_7,mult(A_7,C_19))) = mult(mult(unit,A_7),C_19) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_95]) ).
tff(c_154,plain,
! [A_7,C_19] : ( mult(i(A_7),mult(A_7,mult(A_7,C_19))) = mult(A_7,C_19) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_133]) ).
tff(c_8,plain,
! [A_6] : ( mult(A_6,i(A_6)) = unit ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_126,plain,
! [A_6,C_19] : ( mult(A_6,mult(i(A_6),mult(i(A_6),C_19))) = mult(mult(unit,i(A_6)),C_19) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_95]) ).
tff(c_767,plain,
! [A_34,C_35] : ( mult(A_34,mult(i(A_34),mult(i(A_34),C_35))) = mult(i(A_34),C_35) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_126]) ).
tff(c_824,plain,
! [A_7,C_19] : ( mult(i(A_7),mult(A_7,mult(A_7,C_19))) = mult(A_7,mult(i(A_7),mult(A_7,C_19))) ),
inference(superposition,[status(thm),theory(equality)],[c_154,c_767]) ).
tff(c_881,plain,
! [A_7,C_19] : ( mult(A_7,mult(i(A_7),mult(A_7,C_19))) = mult(A_7,C_19) ),
inference(demodulation,[status(thm),theory(equality)],[c_154,c_824]) ).
tff(c_1298,plain,
! [B_42,C_43] : ( mult(i(mult(B_42,B_42)),mult(B_42,mult(B_42,C_43))) = C_43 ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_1239]) ).
tff(c_1340,plain,
! [A_7,C_19] : ( mult(i(mult(A_7,A_7)),mult(A_7,mult(A_7,C_19))) = mult(i(A_7),mult(A_7,C_19)) ),
inference(superposition,[status(thm),theory(equality)],[c_881,c_1298]) ).
tff(c_1441,plain,
! [A_44,C_45] : ( mult(i(A_44),mult(A_44,C_45)) = C_45 ),
inference(demodulation,[status(thm),theory(equality)],[c_1293,c_1340]) ).
tff(c_12,plain,
! [X5_11,X2_9] :
( ( mult(X5_11,'#skF_4') != '#skF_3' )
| ( mult('#skF_1',X2_9) != '#skF_2' ) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_86,plain,
! [X2_9] : ( mult('#skF_1',X2_9) != '#skF_2' ),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_792,plain,
! [C_35] : ( mult(i('#skF_1'),C_35) != '#skF_2' ),
inference(superposition,[status(thm),theory(equality)],[c_767,c_86]) ).
tff(c_1457,plain,
! [C_45] : ( C_45 != '#skF_2' ),
inference(superposition,[status(thm),theory(equality)],[c_1441,c_792]) ).
tff(c_1549,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_1457]) ).
tff(c_1550,plain,
! [X5_11] : ( mult(X5_11,'#skF_4') != '#skF_3' ),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_1801,plain,
! [A_57] : ( mult(A_57,mult('#skF_4','#skF_4')) != '#skF_3' ),
inference(superposition,[status(thm),theory(equality)],[c_1763,c_1550]) ).
tff(c_4169,plain,
! [A_113,B_114] : ( mult(A_113,mult(B_114,mult(B_114,mult('#skF_4','#skF_4')))) != '#skF_3' ),
inference(superposition,[status(thm),theory(equality)],[c_3660,c_1801]) ).
tff(c_4205,plain,
! [A_113] : ( mult(A_113,mult(i('#skF_4'),'#skF_4')) != '#skF_3' ),
inference(superposition,[status(thm),theory(equality)],[c_1832,c_4169]) ).
tff(c_4237,plain,
! [A_113] : ( A_113 != '#skF_3' ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_10,c_4205]) ).
tff(c_4245,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_4237]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP710+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n031.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 22:32:30 EDT 2023
% 0.15/0.36 % CPUTime :
% 5.45/2.30 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.45/2.31
% 5.45/2.31 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.52/2.35
% 5.52/2.35 Inference rules
% 5.52/2.35 ----------------------
% 5.52/2.35 #Ref : 2
% 5.52/2.35 #Sup : 945
% 5.52/2.35 #Fact : 0
% 5.52/2.35 #Define : 0
% 5.52/2.35 #Split : 1
% 5.52/2.35 #Chain : 0
% 5.52/2.35 #Close : 0
% 5.52/2.35
% 5.52/2.35 Ordering : KBO
% 5.52/2.35
% 5.52/2.35 Simplification rules
% 5.52/2.35 ----------------------
% 5.52/2.35 #Subsume : 220
% 5.52/2.35 #Demod : 1101
% 5.52/2.35 #Tautology : 333
% 5.52/2.35 #SimpNegUnit : 0
% 5.52/2.35 #BackRed : 7
% 5.52/2.35
% 5.52/2.35 #Partial instantiations: 0
% 5.52/2.35 #Strategies tried : 1
% 5.52/2.35
% 5.52/2.35 Timing (in seconds)
% 5.52/2.35 ----------------------
% 5.52/2.35 Preprocessing : 0.42
% 5.52/2.35 Parsing : 0.23
% 5.52/2.35 CNF conversion : 0.03
% 5.52/2.35 Main loop : 0.84
% 5.52/2.35 Inferencing : 0.30
% 5.52/2.35 Reduction : 0.31
% 5.52/2.35 Demodulation : 0.25
% 5.52/2.35 BG Simplification : 0.03
% 5.52/2.35 Subsumption : 0.14
% 5.52/2.35 Abstraction : 0.04
% 5.52/2.35 MUC search : 0.00
% 5.52/2.35 Cooper : 0.00
% 5.52/2.35 Total : 1.33
% 5.52/2.35 Index Insertion : 0.00
% 5.52/2.35 Index Deletion : 0.00
% 5.52/2.35 Index Matching : 0.00
% 5.52/2.35 BG Taut test : 0.00
%------------------------------------------------------------------------------