%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP658+1 : TPTP v9.0.0. Released v4.0.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 : 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 : Wed Apr 9 06:26:53 PM UTC 2025
% Result : Theorem 12.10s 3.93s
% Output : CNFRefutation 12.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 27 unt; 0 typ; 0 def)
% Number of atoms : 31 ( 30 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 : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 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 : 64 ( 63 !; 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_28,axiom,
! [B,A] : ( mult(A,ld(A,B)) = B ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).
tff(f_32,axiom,
! [B,A] : ( mult(rd(A,B),B) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f03) ).
tff(f_36,axiom,
! [C,B,A] : ( mult(mult(A,mult(B,B)),C) = mult(mult(A,B),mult(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).
tff(f_34,axiom,
! [B,A] : ( rd(mult(A,B),B) = A ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f04) ).
tff(f_42,negated_conjecture,
~ ? [X0] :
! [X1] :
( ( mult(X1,X0) = X1 )
& ( mult(X0,X1) = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_2,plain,
! [A_2,B_1] : ( mult(A_2,ld(A_2,B_1)) = B_1 ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
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,mult(B_28,B_28)),C_29) = mult(mult(A_27,B_28),mult(B_28,C_29)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_161,plain,
! [A_30,B_31,B_32] : ( mult(mult(A_30,B_31),mult(B_31,ld(mult(A_30,mult(B_31,B_31)),B_32))) = B_32 ),
inference(superposition,[status(thm),theory(equality)],[c_114,c_2]) ).
tff(c_538,plain,
! [A_45,B_46,B_47] : ( mult(mult(rd(A_45,mult(B_46,B_46)),B_46),mult(B_46,ld(A_45,B_47))) = B_47 ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_161]) ).
tff(c_888,plain,
! [A_52,B_53] : ( mult(mult(rd(A_52,mult(A_52,A_52)),A_52),B_53) = B_53 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_538]) ).
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_1230,plain,
! [B_58,A_59] : ( rd(B_58,B_58) = mult(rd(A_59,mult(A_59,A_59)),A_59) ),
inference(superposition,[status(thm),theory(equality)],[c_888,c_8]) ).
tff(c_622,plain,
! [A_2,B_1] : ( mult(mult(rd(A_2,mult(A_2,A_2)),A_2),B_1) = B_1 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_538]) ).
tff(c_1241,plain,
! [B_58,B_1] : ( mult(rd(B_58,B_58),B_1) = B_1 ),
inference(superposition,[status(thm),theory(equality)],[c_1230,c_622]) ).
tff(c_224,plain,
! [A_33,B_34,C_35] : ( mult(mult(rd(A_33,mult(B_34,B_34)),B_34),mult(B_34,C_35)) = mult(A_33,C_35) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_114]) ).
tff(c_282,plain,
! [A_33,A_2,B_1] : ( mult(mult(rd(A_33,mult(A_2,A_2)),A_2),B_1) = mult(A_33,ld(A_2,B_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_224]) ).
tff(c_10,plain,
! [A_11,B_10,C_9] : ( mult(mult(A_11,mult(B_10,B_10)),C_9) = mult(mult(A_11,B_10),mult(B_10,C_9)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_245,plain,
! [A_33,C_35,C_9] : ( mult(mult(mult(rd(A_33,mult(C_35,C_35)),C_35),C_35),mult(C_35,C_9)) = mult(mult(A_33,C_35),C_9) ),
inference(superposition,[status(thm),theory(equality)],[c_224,c_10]) ).
tff(c_14509,plain,
! [A_188,C_189,C_190] : ( mult(mult(A_188,ld(C_189,C_189)),mult(C_189,C_190)) = mult(mult(A_188,C_189),C_190) ),
inference(demodulation,[status(thm),theory(equality)],[c_282,c_245]) ).
tff(c_14894,plain,
! [A_2,C_189,C_190] : ( mult(mult(mult(rd(A_2,mult(A_2,A_2)),A_2),C_189),C_190) = mult(ld(C_189,C_189),mult(C_189,C_190)) ),
inference(superposition,[status(thm),theory(equality)],[c_622,c_14509]) ).
tff(c_14999,plain,
! [C_191,C_192] : ( mult(ld(C_191,C_191),mult(C_191,C_192)) = mult(C_191,C_192) ),
inference(demodulation,[status(thm),theory(equality)],[c_622,c_14894]) ).
tff(c_15233,plain,
! [A_2,B_1] : ( mult(ld(A_2,A_2),B_1) = mult(A_2,ld(A_2,B_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_14999]) ).
tff(c_15291,plain,
! [A_193,B_194] : ( mult(ld(A_193,A_193),B_194) = B_194 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_15233]) ).
tff(c_15857,plain,
! [B_197,A_198] : ( rd(B_197,B_197) = ld(A_198,A_198) ),
inference(superposition,[status(thm),theory(equality)],[c_15291,c_8]) ).
tff(c_17215,plain,
! [A_206,B_207] : ( mult(A_206,rd(B_207,B_207)) = A_206 ),
inference(superposition,[status(thm),theory(equality)],[c_15857,c_2]) ).
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_17475,plain,
! [B_207] : ( mult(rd(B_207,B_207),'#skF_1'(rd(B_207,B_207))) != '#skF_1'(rd(B_207,B_207)) ),
inference(superposition,[status(thm),theory(equality)],[c_17215,c_12]) ).
tff(c_17637,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1241,c_17475]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : GRP658+1 : TPTP v9.0.0. Released v4.0.0.
% 0.14/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.14/0.36 % Computer : n031.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 : Mon Apr 7 22:20:22 EDT 2025
% 0.14/0.36 % CPUTime :
% 12.10/3.93 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.10/3.94
% 12.10/3.94 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------