TSTP Solution File: GRP657+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP657+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 : n010.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:50 EDT 2023
% Result : Theorem 5.01s 2.27s
% Output : CNFRefutation 5.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 23 ( 16 unt; 5 typ; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 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 : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 0 con; 1-2 aty)
% Number of variables : 36 (; 35 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $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,
! [C,B,A] : ( mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).
tff(f_34,axiom,
! [B,A] : ( rd(mult(A,B),B) = A ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).
tff(f_30,axiom,
! [B,A] : ( ld(A,mult(A,B)) = B ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).
tff(f_42,negated_conjecture,
~ ? [X0] :
! [X1] :
( ( mult(X1,X0) = X1 )
& ( mult(X0,X1) = X1 ) ),
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_114,plain,
! [A_27,B_28,C_29] : ( mult(mult(A_27,B_28),mult(C_29,A_27)) = mult(A_27,mult(mult(B_28,C_29),A_27)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
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_194,plain,
! [A_33,B_34,C_35] : ( rd(mult(A_33,mult(mult(B_34,C_35),A_33)),mult(C_35,A_33)) = mult(A_33,B_34) ),
inference(superposition,[status(thm),theory(equality)],[c_114,c_8]) ).
tff(c_990,plain,
! [A_63,A_64,B_65] : ( rd(mult(A_63,mult(A_64,A_63)),mult(B_65,A_63)) = mult(A_63,rd(A_64,B_65)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_194]) ).
tff(c_1101,plain,
! [A_66,B_67] : ( mult(A_66,rd(B_67,B_67)) = A_66 ),
inference(superposition,[status(thm),theory(equality)],[c_990,c_8]) ).
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_1477,plain,
! [B_74,A_75] : ( rd(B_74,B_74) = ld(A_75,A_75) ),
inference(superposition,[status(thm),theory(equality)],[c_1101,c_4]) ).
tff(c_1549,plain,
! [A_75,B_74] : ( mult(ld(A_75,A_75),B_74) = B_74 ),
inference(superposition,[status(thm),theory(equality)],[c_1477,c_6]) ).
tff(c_12,plain,
! [X0_12] :
( ( mult('#skF_2'(X0_12),X0_12) != '#skF_2'(X0_12) )
| ( mult(X0_12,'#skF_1'(X0_12)) != '#skF_1'(X0_12) ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_1231,plain,
! [B_67] : ( mult(rd(B_67,B_67),'#skF_1'(rd(B_67,B_67))) != '#skF_1'(rd(B_67,B_67)) ),
inference(superposition,[status(thm),theory(equality)],[c_1101,c_12]) ).
tff(c_1484,plain,
! [A_75,B_74] : ( mult(ld(A_75,A_75),'#skF_1'(rd(B_74,B_74))) != '#skF_1'(rd(B_74,B_74)) ),
inference(superposition,[status(thm),theory(equality)],[c_1477,c_1231]) ).
tff(c_2167,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1549,c_1484]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP657+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/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.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 21:53:58 EDT 2023
% 0.14/0.36 % CPUTime :
% 5.01/2.27 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.01/2.27
% 5.01/2.27 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.14/2.30
% 5.14/2.30 Inference rules
% 5.14/2.30 ----------------------
% 5.14/2.30 #Ref : 0
% 5.14/2.30 #Sup : 607
% 5.14/2.30 #Fact : 0
% 5.14/2.30 #Define : 0
% 5.14/2.30 #Split : 0
% 5.14/2.30 #Chain : 0
% 5.14/2.30 #Close : 0
% 5.14/2.30
% 5.14/2.30 Ordering : KBO
% 5.14/2.30
% 5.14/2.30 Simplification rules
% 5.14/2.30 ----------------------
% 5.14/2.30 #Subsume : 45
% 5.14/2.30 #Demod : 281
% 5.14/2.30 #Tautology : 146
% 5.14/2.30 #SimpNegUnit : 0
% 5.14/2.30 #BackRed : 2
% 5.14/2.30
% 5.14/2.30 #Partial instantiations: 0
% 5.14/2.30 #Strategies tried : 1
% 5.14/2.30
% 5.14/2.30 Timing (in seconds)
% 5.14/2.30 ----------------------
% 5.14/2.30 Preprocessing : 0.43
% 5.14/2.30 Parsing : 0.23
% 5.14/2.30 CNF conversion : 0.03
% 5.14/2.30 Main loop : 0.75
% 5.14/2.30 Inferencing : 0.30
% 5.14/2.30 Reduction : 0.24
% 5.14/2.30 Demodulation : 0.20
% 5.14/2.30 BG Simplification : 0.04
% 5.14/2.30 Subsumption : 0.11
% 5.14/2.30 Abstraction : 0.05
% 5.14/2.30 MUC search : 0.00
% 5.14/2.30 Cooper : 0.00
% 5.14/2.30 Total : 1.23
% 5.14/2.30 Index Insertion : 0.00
% 5.14/2.30 Index Deletion : 0.00
% 5.14/2.30 Index Matching : 0.00
% 5.14/2.30 BG Taut test : 0.00
%------------------------------------------------------------------------------