%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN083+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/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 : 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:34 PM UTC 2025
% Result : Theorem 2.27s 1.58s
% Output : CNFRefutation 2.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 5 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 4 ( 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f,type,
f: ( $i * $i ) > $i ).
tff(f_28,axiom,
! [X,Y,Z] : ( f(X,f(Y,Z)) = f(f(X,Y),Z) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',p61_1) ).
tff(f_31,negated_conjecture,
~ ! [X,Y,Z,W] : ( f(X,f(Y,f(Z,W))) = f(f(f(X,Y),Z),W) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel61) ).
tff(c_2,plain,
! [X_1,Y_2,Z_3] : ( f(f(X_1,Y_2),Z_3) = f(X_1,f(Y_2,Z_3)) ),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_4,plain,
f(f(f('#skF_1','#skF_2'),'#skF_3'),'#skF_4') != f('#skF_1',f('#skF_2',f('#skF_3','#skF_4'))),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_6,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_2,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : SYN083+1 : TPTP v9.0.0. Released v2.0.0.
% 0.02/0.09 % 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.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.27 % CPULimit : 300
% 0.09/0.27 % WCLimit : 300
% 0.09/0.27 % DateTime : Wed Apr 9 06:56:45 EDT 2025
% 0.09/0.27 % CPUTime :
% 2.27/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.59
% 2.27/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------