%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : HEN008-4 : TPTP v9.0.0. Released v1.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 : n028.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:45:55 PM UTC 2025
% Result : Unsatisfiable 8.77s 3.20s
% Output : CNFRefutation 8.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 22 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 32 ( 13 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 13 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less_equal > divide > #nlpp > zero > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(less_equal,type,
less_equal: ( $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(divide,type,
divide: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(zero,type,
zero: $i ).
tff(c,type,
c: $i ).
tff(f_62,axiom,
! [X] : less_equal(zero,X),
file(unknown,unknown) ).
tff(f_81,axiom,
! [X] : ( divide(zero,X) = zero ),
file(unknown,unknown) ).
tff(f_103,axiom,
less_equal(a,b),
file(unknown,unknown) ).
tff(f_48,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ( divide(X,Y) = zero ) ),
file(unknown,unknown) ).
tff(f_59,axiom,
! [X,Z,Y] : less_equal(divide(divide(X,Z),divide(Y,Z)),divide(divide(X,Y),Z)),
file(unknown,unknown) ).
tff(f_71,axiom,
! [X,Y] :
( ~ less_equal(X,Y)
| ~ less_equal(Y,X)
| ( X = Y ) ),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X,Y] :
( ( divide(X,Y) != zero )
| less_equal(X,Y) ),
file(unknown,unknown) ).
tff(f_105,axiom,
~ less_equal(divide(a,c),divide(b,c)),
file(unknown,unknown) ).
tff(c_10,plain,
! [X_10] : less_equal(zero,X_10),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_18,plain,
! [X_15] : ( divide(zero,X_15) = zero ),
inference(cnfTransformation,[status(thm)],[f_81]) ).
tff(c_30,plain,
less_equal(a,b),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_100,plain,
! [X_33,Y_34] :
( ( divide(X_33,Y_34) = zero )
| ~ less_equal(X_33,Y_34) ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_123,plain,
divide(a,b) = zero,
inference(resolution,[status(thm)],[c_30,c_100]) ).
tff(c_429,plain,
! [X_56,Z_57,Y_58] : less_equal(divide(divide(X_56,Z_57),divide(Y_58,Z_57)),divide(divide(X_56,Y_58),Z_57)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_12,plain,
! [Y_12,X_11] :
( ( Y_12 = X_11 )
| ~ less_equal(Y_12,X_11)
| ~ less_equal(X_11,Y_12) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_12222,plain,
! [X_232,Z_233,Y_234] :
( ( divide(divide(X_232,Z_233),divide(Y_234,Z_233)) = divide(divide(X_232,Y_234),Z_233) )
| ~ less_equal(divide(divide(X_232,Y_234),Z_233),divide(divide(X_232,Z_233),divide(Y_234,Z_233))) ),
inference(resolution,[status(thm)],[c_429,c_12]) ).
tff(c_12499,plain,
! [Z_233] :
( ( divide(divide(a,Z_233),divide(b,Z_233)) = divide(divide(a,b),Z_233) )
| ~ less_equal(divide(zero,Z_233),divide(divide(a,Z_233),divide(b,Z_233))) ),
inference(superposition,[status(thm),theory(equality)],[c_123,c_12222]) ).
tff(c_12682,plain,
! [Z_233] : ( divide(divide(a,Z_233),divide(b,Z_233)) = zero ),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_18,c_18,c_123,c_12499]) ).
tff(c_179,plain,
! [X_37,Y_38] :
( less_equal(X_37,Y_38)
| ( divide(X_37,Y_38) != zero ) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_32,plain,
~ less_equal(divide(a,c),divide(b,c)),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_186,plain,
divide(divide(a,c),divide(b,c)) != zero,
inference(resolution,[status(thm)],[c_179,c_32]) ).
tff(c_12716,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12682,c_186]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HEN008-4 : TPTP v9.0.0. Released v1.0.0.
% 0.03/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.33 % Computer : n028.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Apr 7 22:51:34 EDT 2025
% 0.12/0.33 % CPUTime :
% 8.77/3.20 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.77/3.21
% 8.77/3.21 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------