%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN080+1 : TPTP v9.0.0. Released v2.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 : n032.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:33 PM UTC 2025
% Result : Theorem 2.38s 1.51s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% 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 : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 4 ( 4 usr; 2 con; 0-1 aty)
% Number of variables : 15 ( 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > g > f > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f,type,
f: $i > $i ).
tff(g,type,
g: $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_28,axiom,
! [X,Y] : ( f(X) = g(Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel58_1) ).
tff(f_31,negated_conjecture,
~ ! [X,Y] : ( f(f(X)) = f(g(Y)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel58) ).
tff(c_2,plain,
! [Y_2,X_1] : ( g(Y_2) = f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_5,plain,
! [Y_3,X_4] : ( g(Y_3) = f(X_4) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_13,plain,
! [X_4,X_1] : ( f(X_4) = f(X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_4,plain,
f(g('#skF_2')) != f(f('#skF_1')),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_78,plain,
! [Y_9] : ( g(Y_9) != f(f('#skF_1')) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_4]) ).
tff(c_80,plain,
! [Y_9,X_4] : ( g(Y_9) != f(f(X_4)) ),
inference(superposition,[status(thm),theory(equality)],[c_13,c_78]) ).
tff(c_95,plain,
! [Y_9,X_4] : ( g(Y_9) != f(X_4) ),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_80]) ).
tff(c_98,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_95,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.07 % Problem : SYN080+1 : TPTP v9.0.0. Released v2.0.0.
% 0.00/0.08 % 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.07/0.26 % Computer : n032.cluster.edu
% 0.07/0.26 % Model : x86_64 x86_64
% 0.07/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.26 % Memory : 8042.1875MB
% 0.07/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.26 % CPULimit : 300
% 0.07/0.26 % WCLimit : 300
% 0.07/0.26 % DateTime : Wed Apr 9 06:56:15 EDT 2025
% 0.07/0.26 % CPUTime :
% 2.38/1.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.38/1.51
% 2.38/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------