TSTP Solution File: GRP700+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP700+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 : n023.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:57 EDT 2023
% Result : Theorem 5.72s 2.57s
% Output : CNFRefutation 5.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of formulae : 31 ( 24 unt; 5 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 4 ~; 1 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 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 : 40 (; 39 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > unit > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_32,axiom,
! [B,A] : ( mult(rd(A,B),B) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).
tff(f_36,axiom,
! [A] : ( mult(A,unit) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
tff(f_30,axiom,
! [B,A] : ( ld(A,mult(A,B)) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
tff(f_34,axiom,
! [B,A] : ( rd(mult(A,B),B) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
tff(f_38,axiom,
! [A] : ( mult(unit,A) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).
tff(f_42,axiom,
! [C,B,A] : ( mult(mult(A,B),mult(B,mult(C,B))) = mult(mult(A,mult(B,mult(B,C))),B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).
tff(f_48,negated_conjecture,
~ ! [X0] :
? [X1] :
( ( mult(X1,X0) = unit )
& ( mult(X0,X1) = unit ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_6,plain,
! [A_6,B_5] : ( mult(rd(A_6,B_5),B_5) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_132,plain,
! [A_28,B_29] : ( ld(A_28,mult(A_28,B_29)) = B_29 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_155,plain,
! [A_9] : ( ld(A_9,A_9) = unit ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_132]) ).
tff(c_8,plain,
! [A_8,B_7] : ( rd(mult(A_8,B_7),B_7) = A_8 ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_12,plain,
! [A_10] : ( mult(unit,A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_259,plain,
! [A_36,B_37,C_38] : ( mult(mult(A_36,mult(B_37,mult(B_37,C_38))),B_37) = mult(mult(A_36,B_37),mult(B_37,mult(C_38,B_37))) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_317,plain,
! [B_37,C_38] : ( mult(mult(unit,B_37),mult(B_37,mult(C_38,B_37))) = mult(mult(B_37,mult(B_37,C_38)),B_37) ),
inference(superposition,[status(thm),theory(equality)],[c_12,c_259]) ).
tff(c_897,plain,
! [B_54,C_55] : ( mult(mult(B_54,mult(B_54,C_55)),B_54) = mult(B_54,mult(B_54,mult(C_55,B_54))) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_317]) ).
tff(c_2520,plain,
! [B_81,C_82] : ( rd(mult(B_81,mult(B_81,mult(C_82,B_81))),B_81) = mult(B_81,mult(B_81,C_82)) ),
inference(superposition,[status(thm),theory(equality)],[c_897,c_8]) ).
tff(c_3028,plain,
! [B_88,A_89] : ( rd(mult(B_88,mult(B_88,A_89)),B_88) = mult(B_88,mult(B_88,rd(A_89,B_88))) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_2520]) ).
tff(c_3120,plain,
! [A_9] : ( mult(A_9,mult(A_9,rd(unit,A_9))) = rd(mult(A_9,A_9),A_9) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_3028]) ).
tff(c_3146,plain,
! [A_90] : ( mult(A_90,mult(A_90,rd(unit,A_90))) = A_90 ),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_3120]) ).
tff(c_4,plain,
! [A_4,B_3] : ( ld(A_4,mult(A_4,B_3)) = B_3 ),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_3230,plain,
! [A_90] : ( mult(A_90,rd(unit,A_90)) = ld(A_90,A_90) ),
inference(superposition,[status(thm),theory(equality)],[c_3146,c_4]) ).
tff(c_3302,plain,
! [A_92] : ( mult(A_92,rd(unit,A_92)) = unit ),
inference(demodulation,[status(thm),theory(equality)],[c_155,c_3230]) ).
tff(c_18,plain,
! [X1_18] :
( ( mult('#skF_1',X1_18) != unit )
| ( mult(X1_18,'#skF_1') != unit ) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_3370,plain,
mult(rd(unit,'#skF_1'),'#skF_1') != unit,
inference(superposition,[status(thm),theory(equality)],[c_3302,c_18]) ).
tff(c_3422,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_3370]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : GRP700+1 : TPTP v8.1.2. Released v4.0.0.
% 0.12/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.36 % Computer : n023.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 22:34:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.72/2.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.72/2.57
% 5.72/2.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.72/2.62
% 5.72/2.62 Inference rules
% 5.72/2.62 ----------------------
% 5.72/2.62 #Ref : 0
% 5.72/2.62 #Sup : 866
% 5.72/2.62 #Fact : 0
% 5.72/2.62 #Define : 0
% 5.72/2.62 #Split : 2
% 5.72/2.62 #Chain : 0
% 5.72/2.62 #Close : 0
% 5.72/2.62
% 5.72/2.62 Ordering : KBO
% 5.72/2.62
% 5.72/2.62 Simplification rules
% 5.72/2.62 ----------------------
% 5.72/2.62 #Subsume : 6
% 5.72/2.62 #Demod : 1481
% 5.72/2.62 #Tautology : 319
% 5.72/2.62 #SimpNegUnit : 0
% 5.72/2.62 #BackRed : 1
% 5.72/2.62
% 5.72/2.62 #Partial instantiations: 0
% 5.72/2.62 #Strategies tried : 1
% 5.72/2.62
% 5.72/2.62 Timing (in seconds)
% 5.72/2.62 ----------------------
% 5.72/2.63 Preprocessing : 0.50
% 5.72/2.63 Parsing : 0.24
% 5.72/2.63 CNF conversion : 0.04
% 5.72/2.63 Main loop : 0.97
% 5.72/2.63 Inferencing : 0.34
% 5.72/2.63 Reduction : 0.40
% 5.72/2.63 Demodulation : 0.34
% 5.72/2.63 BG Simplification : 0.05
% 5.72/2.63 Subsumption : 0.13
% 5.72/2.63 Abstraction : 0.06
% 5.72/2.63 MUC search : 0.00
% 5.72/2.63 Cooper : 0.00
% 5.72/2.63 Total : 1.55
% 5.72/2.63 Index Insertion : 0.00
% 5.72/2.63 Index Deletion : 0.00
% 5.72/2.63 Index Matching : 0.00
% 5.72/2.63 BG Taut test : 0.00
%------------------------------------------------------------------------------