%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN082-1 : 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 10:02:34 PM UTC 2025
% Result : Unsatisfiable 2.64s 1.59s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 55 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 57 ( 30 ~; 27 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 17 ( 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > g > f > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff(b,type,
b: $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_32,axiom,
( big_f(a,f(a))
| big_f(a,b) ),
file(unknown,unknown) ).
tff(f_57,axiom,
! [X] :
( big_f(g(X),X)
| ~ big_f(a,X)
| ~ big_f(a,f(a)) ),
file(unknown,unknown) ).
tff(f_85,axiom,
! [X] :
( ~ big_f(g(X),X)
| ~ big_f(a,X)
| ~ big_f(a,f(a)) ),
file(unknown,unknown) ).
tff(f_49,axiom,
! [X] :
( big_f(g(X),X)
| ~ big_f(a,X)
| big_f(a,b) ),
file(unknown,unknown) ).
tff(f_76,axiom,
! [X] :
( ~ big_f(g(X),X)
| ~ big_f(a,X)
| big_f(a,b) ),
file(unknown,unknown) ).
tff(f_29,axiom,
! [Y] :
( big_f(a,f(a))
| ~ big_f(Y,b)
| big_f(Y,f(a)) ),
file(unknown,unknown) ).
tff(c_4,plain,
( big_f(a,b)
| big_f(a,f(a)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_17,plain,
big_f(a,f(a)),
inference(splitLeft,[status(thm)],[c_4]) ).
tff(c_10,plain,
! [X_5] :
( ~ big_f(a,f(a))
| ~ big_f(a,X_5)
| big_f(g(X_5),X_5) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_21,plain,
! [X_5] :
( ~ big_f(a,X_5)
| big_f(g(X_5),X_5) ),
inference(demodulation,[status(thm),theory(equality)],[c_17,c_10]) ).
tff(c_16,plain,
! [X_9] :
( ~ big_f(a,f(a))
| ~ big_f(a,X_9)
| ~ big_f(g(X_9),X_9) ),
inference(cnfTransformation,[status(thm)],[f_85]) ).
tff(c_25,plain,
! [X_11] :
( ~ big_f(a,X_11)
| ~ big_f(g(X_11),X_11) ),
inference(demodulation,[status(thm),theory(equality)],[c_17,c_16]) ).
tff(c_29,plain,
! [X_5] : ~ big_f(a,X_5),
inference(resolution,[status(thm)],[c_21,c_25]) ).
tff(c_8,plain,
! [X_4] :
( big_f(a,b)
| ~ big_f(a,X_4)
| big_f(g(X_4),X_4) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_18,plain,
big_f(a,b),
inference(splitLeft,[status(thm)],[c_8]) ).
tff(c_32,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_29,c_18]) ).
tff(c_37,plain,
! [X_13] :
( ~ big_f(a,X_13)
| big_f(g(X_13),X_13) ),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_34,plain,
~ big_f(a,b),
inference(splitRight,[status(thm)],[c_8]) ).
tff(c_14,plain,
! [X_8] :
( big_f(a,b)
| ~ big_f(a,X_8)
| ~ big_f(g(X_8),X_8) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_35,plain,
! [X_8] :
( ~ big_f(a,X_8)
| ~ big_f(g(X_8),X_8) ),
inference(negUnitSimplification,[status(thm)],[c_34,c_14]) ).
tff(c_41,plain,
! [X_13] : ~ big_f(a,X_13),
inference(resolution,[status(thm)],[c_37,c_35]) ).
tff(c_43,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_41,c_17]) ).
tff(c_44,plain,
big_f(a,b),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_45,plain,
~ big_f(a,f(a)),
inference(splitRight,[status(thm)],[c_4]) ).
tff(c_2,plain,
! [Y_1] :
( big_f(Y_1,f(a))
| ~ big_f(Y_1,b)
| big_f(a,f(a)) ),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_49,plain,
! [Y_14] :
( big_f(Y_14,f(a))
| ~ big_f(Y_14,b) ),
inference(negUnitSimplification,[status(thm)],[c_45,c_2]) ).
tff(c_52,plain,
~ big_f(a,b),
inference(resolution,[status(thm)],[c_49,c_45]) ).
tff(c_56,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_44,c_52]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN082-1 : TPTP v9.0.0. Released v1.0.0.
% 0.06/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.14/0.34 % Computer : n028.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Apr 9 06:56:35 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.64/1.59 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.60
% 2.64/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------