%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN075-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/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 : n031.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:32 PM UTC 2025
% Result : Unsatisfiable 3.15s 1.84s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 48 ( 32 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 52 ( 26 ~; 26 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 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 : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > h > #nlpp > g > f > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: ( $i * $i ) > $i ).
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_64,axiom,
! [Y,X] :
( ( Y != g(X) )
| big_f(Y,f(X))
| ( f(X) = X ) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [Y,X] :
( ~ big_f(Y,f(X))
| ( Y != g(X) )
| ( f(X) = X ) ),
file(unknown,unknown) ).
tff(f_91,axiom,
! [X,Z] :
( ( f(X) != X )
| big_f(h(X,Z),f(X))
| ( h(X,Z) = Z ) ),
file(unknown,unknown) ).
tff(f_26,axiom,
! [X,Y] :
( ~ big_f(X,Y)
| ( X = a ) ),
file(unknown,unknown) ).
tff(f_39,axiom,
! [X,Y] :
( ( X != a )
| ( Y != b )
| big_f(X,Y) ),
file(unknown,unknown) ).
tff(f_100,axiom,
! [X,Z] :
( ( f(X) != X )
| ( h(X,Z) != Z )
| ~ big_f(h(X,Z),f(X)) ),
file(unknown,unknown) ).
tff(c_34,plain,
! [X_29] :
( ( f(X_29) = X_29 )
| big_f(g(X_29),f(X_29)) ),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_8,plain,
! [X_8] :
( ( f(X_8) = X_8 )
| ~ big_f(g(X_8),f(X_8)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_44,plain,
! [X_29] : ( f(X_29) = X_29 ),
inference(resolution,[status(thm)],[c_34,c_8]) ).
tff(c_18,plain,
! [X_20,Z_21] :
( ( h(X_20,Z_21) = Z_21 )
| big_f(h(X_20,Z_21),f(X_20))
| ( f(X_20) != X_20 ) ),
inference(cnfTransformation,[status(thm)],[f_91]) ).
tff(c_65,plain,
! [X_33,Z_34] :
( ( h(X_33,Z_34) = Z_34 )
| big_f(h(X_33,Z_34),X_33) ),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_44,c_18]) ).
tff(c_2,plain,
! [X_1,Y_2] :
( ( a = X_1 )
| ~ big_f(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_72,plain,
! [X_33,Z_34] :
( ( h(X_33,Z_34) = a )
| ( h(X_33,Z_34) = Z_34 ) ),
inference(resolution,[status(thm)],[c_65,c_2]) ).
tff(c_91,plain,
! [X_33,Z_34] :
( ( h(X_33,Z_34) = Z_34 )
| ( a != Z_34 ) ),
inference(factorization,[status(thm),theory(equality)],[c_72]) ).
tff(c_6,plain,
big_f(a,b),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_96,plain,
! [X_33,Z_34] :
( ( h(X_33,Z_34) = a )
| ( a != Z_34 ) ),
inference(factorization,[status(thm),theory(equality)],[c_72]) ).
tff(c_20,plain,
! [X_22,Z_23] :
( ~ big_f(h(X_22,Z_23),f(X_22))
| ( h(X_22,Z_23) != Z_23 )
| ( f(X_22) != X_22 ) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_219,plain,
! [X_43,Z_44] :
( ~ big_f(h(X_43,Z_44),X_43)
| ( h(X_43,Z_44) != Z_44 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_44,c_20]) ).
tff(c_241,plain,
! [X_45,Z_46] :
( ~ big_f(a,X_45)
| ( h(X_45,Z_46) != Z_46 )
| ( a != Z_46 ) ),
inference(superposition,[status(thm),theory(equality)],[c_96,c_219]) ).
tff(c_246,plain,
! [Z_47] :
( ( h(b,Z_47) != Z_47 )
| ( a != Z_47 ) ),
inference(resolution,[status(thm)],[c_6,c_241]) ).
tff(c_267,plain,
! [Z_34] : ( a != Z_34 ),
inference(superposition,[status(thm),theory(equality)],[c_91,c_246]) ).
tff(c_278,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_267]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.14 % Problem : SYN075-1 : TPTP v9.0.0. Released v1.0.0.
% 0.09/0.15 % 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.15/0.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Wed Apr 9 06:56:07 EDT 2025
% 0.15/0.37 % CPUTime :
% 3.15/1.84 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.15/1.84
% 3.15/1.84 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------