%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP657-10 : TPTP v9.0.0. Released v8.1.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 : n022.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:52 PM UTC 2025
% Result : Unsatisfiable 4.21s 2.12s
% Output : CNFRefutation 4.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 19 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 18 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 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 : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 0 con; 1-2 aty)
% Number of variables : 37 ( 37 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ tuple > rd > mult > ld > #nlpp > x1_2 > x1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(tuple,type,
tuple: ( $i * $i ) > $i ).
tff(x1,type,
x1: $i > $i ).
tff(x1_2,type,
x1_2: $i > $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_29,axiom,
! [A,B] : ( mult(rd(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A,B,C] : ( mult(mult(A,B),mult(C,A)) = mult(A,mult(mult(B,C),A)) ),
file(unknown,unknown) ).
tff(f_31,axiom,
! [A,B] : ( rd(mult(A,B),B) = A ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [X0] : ( tuple(mult(X0,x1(X0)),mult(x1_2(X0),X0)) != tuple(x1(X0),x1_2(X0)) ),
file(unknown,unknown) ).
tff(c_6,plain,
! [A_5,B_6] : ( mult(rd(A_5,B_6),B_6) = A_5 ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_88,plain,
! [A_23,B_24,C_25] : ( mult(mult(A_23,B_24),mult(C_25,A_23)) = mult(A_23,mult(mult(B_24,C_25),A_23)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_8,plain,
! [A_7,B_8] : ( rd(mult(A_7,B_8),B_8) = A_7 ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_252,plain,
! [A_35,B_36,C_37] : ( rd(mult(A_35,mult(mult(B_36,C_37),A_35)),mult(C_37,A_35)) = mult(A_35,B_36) ),
inference(superposition,[status(thm),theory(equality)],[c_88,c_8]) ).
tff(c_451,plain,
! [A_44,A_45,B_46] : ( rd(mult(A_44,mult(A_45,A_44)),mult(B_46,A_44)) = mult(A_44,rd(A_45,B_46)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_252]) ).
tff(c_658,plain,
! [A_50,B_51] : ( mult(A_50,rd(B_51,B_51)) = A_50 ),
inference(superposition,[status(thm),theory(equality)],[c_451,c_8]) ).
tff(c_4,plain,
! [A_3,B_4] : ( ld(A_3,mult(A_3,B_4)) = B_4 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_810,plain,
! [B_54,A_55] : ( rd(B_54,B_54) = ld(A_55,A_55) ),
inference(superposition,[status(thm),theory(equality)],[c_658,c_4]) ).
tff(c_475,plain,
! [A_44,B_46] : ( mult(A_44,rd(B_46,B_46)) = A_44 ),
inference(superposition,[status(thm),theory(equality)],[c_451,c_8]) ).
tff(c_822,plain,
! [A_44,A_55] : ( mult(A_44,ld(A_55,A_55)) = A_44 ),
inference(superposition,[status(thm),theory(equality)],[c_810,c_475]) ).
tff(c_1353,plain,
! [A_67,B_68] : ( mult(ld(A_67,A_67),B_68) = B_68 ),
inference(superposition,[status(thm),theory(equality)],[c_810,c_6]) ).
tff(c_12,plain,
! [X0_12] : ( tuple(mult(X0_12,x1(X0_12)),mult(x1_2(X0_12),X0_12)) != tuple(x1(X0_12),x1_2(X0_12)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_1433,plain,
! [A_67] : ( tuple(x1(ld(A_67,A_67)),mult(x1_2(ld(A_67,A_67)),ld(A_67,A_67))) != tuple(x1(ld(A_67,A_67)),x1_2(ld(A_67,A_67))) ),
inference(superposition,[status(thm),theory(equality)],[c_1353,c_12]) ).
tff(c_1502,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_822,c_1433]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP657-10 : TPTP v9.0.0. Released v8.1.0.
% 0.07/0.13 % 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.12/0.34 % Computer : n022.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 22:19:51 EDT 2025
% 0.12/0.34 % CPUTime :
% 4.21/2.12 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.21/2.13
% 4.21/2.13 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------