%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP702-11 : 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/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 : n029.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:27:01 PM UTC 2025
% Result : Unsatisfiable 14.73s 5.74s
% Output : CNFRefutation 14.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 23 ( 23 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 22 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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 : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 32 ( 32 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > x1 > x0 > unit > op_f > op_e > op_d > op_c
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(op_f,type,
op_f: $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(op_e,type,
op_e: $i ).
tff(op_c,type,
op_c: $i ).
tff(x1,type,
x1: $i ).
tff(unit,type,
unit: $i ).
tff(op_d,type,
op_d: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(x0,type,
x0: $i ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( mult(A,ld(A,B)) = B ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [A] : ( op_d = ld(A,mult(op_c,A)) ),
file(unknown,unknown) ).
tff(f_43,axiom,
! [A,B] : ( mult(A,mult(op_c,B)) = mult(mult(A,op_c),B) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [A,B] : ( mult(op_c,mult(A,B)) = mult(mult(op_c,A),B) ),
file(unknown,unknown) ).
tff(f_51,axiom,
mult(x0,mult(x1,op_d)) != mult(mult(x0,x1),op_d),
file(unknown,unknown) ).
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_2,plain,
! [A_1,B_2] : ( mult(A_1,ld(A_1,B_2)) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_72,plain,
! [A_28,B_29] : ( ld(A_28,mult(A_28,B_29)) = B_29 ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_22,plain,
! [A_20] : ( ld(A_20,mult(op_c,A_20)) = op_d ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_79,plain,
op_d = op_c,
inference(superposition,[status(thm),theory(equality)],[c_72,c_22]) ).
tff(c_266,plain,
! [A_40] : ( ld(A_40,mult(op_c,A_40)) = op_c ),
inference(demodulation,[status(thm),theory(equality)],[c_79,c_22]) ).
tff(c_271,plain,
! [A_40] : ( mult(op_c,A_40) = mult(A_40,op_c) ),
inference(superposition,[status(thm),theory(equality)],[c_266,c_2]) ).
tff(c_330,plain,
! [A_43,B_44] : ( mult(mult(A_43,op_c),B_44) = mult(A_43,mult(op_c,B_44)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_5824,plain,
! [A_117,B_118] : ( mult(A_117,mult(op_c,ld(mult(A_117,op_c),B_118))) = B_118 ),
inference(superposition,[status(thm),theory(equality)],[c_330,c_2]) ).
tff(c_930,plain,
! [A_58,B_59] : ( mult(mult(op_c,A_58),B_59) = mult(op_c,mult(A_58,B_59)) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_996,plain,
! [B_2,B_59] : ( mult(op_c,mult(ld(op_c,B_2),B_59)) = mult(B_2,B_59) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_930]) ).
tff(c_5846,plain,
! [B_2,B_118] : ( mult(B_2,mult(op_c,ld(mult(ld(op_c,B_2),op_c),B_118))) = mult(op_c,B_118) ),
inference(superposition,[status(thm),theory(equality)],[c_5824,c_996]) ).
tff(c_40779,plain,
! [B_335,B_336] : ( mult(B_335,mult(op_c,ld(B_335,B_336))) = mult(op_c,B_336) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_271,c_5846]) ).
tff(c_41171,plain,
! [A_3,B_4] : ( mult(op_c,mult(A_3,B_4)) = mult(A_3,mult(op_c,B_4)) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_40779]) ).
tff(c_28,plain,
mult(mult(x0,x1),op_d) != mult(x0,mult(x1,op_d)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_584,plain,
mult(x0,mult(op_c,x1)) != mult(op_c,mult(x0,x1)),
inference(demodulation,[status(thm),theory(equality)],[c_271,c_271,c_79,c_79,c_28]) ).
tff(c_44994,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_41171,c_584]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP702-11 : TPTP v9.0.0. Released v8.1.0.
% 0.03/0.12 % 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.13/0.33 % Computer : n029.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Apr 7 22:28:04 EDT 2025
% 0.13/0.33 % CPUTime :
% 14.73/5.74 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 14.73/5.75
% 14.73/5.75 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------