%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : GRP702-12 : 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 : n011.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 3.27s 2.11s
% Output : CNFRefutation 3.39s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of formulae : 10 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 3 ( 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 : 10 ( 10 !; 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_43,axiom,
! [A,B] : ( mult(A,mult(op_c,B)) = mult(mult(A,op_c),B) ),
file(unknown,unknown) ).
tff(f_27,axiom,
! [A,B] : ( ld(A,mult(A,B)) = B ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [A] : ( op_d = ld(A,mult(op_c,A)) ),
file(unknown,unknown) ).
tff(f_51,axiom,
mult(x0,mult(op_d,x1)) != mult(mult(x0,op_d),x1),
file(unknown,unknown) ).
tff(c_20,plain,
! [A_18,B_19] : ( mult(mult(A_18,op_c),B_19) = mult(A_18,mult(op_c,B_19)) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
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_28,plain,
mult(mult(x0,op_d),x1) != mult(x0,mult(op_d,x1)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_585,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_79,c_79,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP702-12 : TPTP v9.0.0. Released v8.1.0.
% 0.06/0.11 % 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.11/0.32 % Computer : n011.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Apr 7 22:28:03 EDT 2025
% 0.11/0.32 % CPUTime :
% 3.27/2.11 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.27/2.12
% 3.27/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------