%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN413+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 : 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:03:30 PM UTC 2025
% Result : Theorem 2.96s 2.21s
% Output : CNFRefutation 3.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 9 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 18 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 11 ~; 6 |; 1 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 15 ( 13 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(f,type,
f: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(f_40,negated_conjecture,
~ ( ! [Z] :
? [Y] :
! [X] :
( f(X,Y)
<=> ( f(X,Z)
& ~ f(X,X) ) )
=> ~ ? [V] :
! [U] : f(U,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish256) ).
tff(c_2,plain,
! [U_8] : f(U_8,'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
! [X_6,Z_1] :
( f(X_6,'#skF_1'(Z_1))
| f(X_6,X_6)
| ~ f(X_6,Z_1) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_29,plain,
! [Z_1] :
( ~ f('#skF_1'(Z_1),Z_1)
| f('#skF_1'(Z_1),'#skF_1'(Z_1)) ),
inference(factorization,[status(thm),theory(equality)],[c_4]) ).
tff(c_51,plain,
! [Z_17] :
( ~ f('#skF_1'(Z_17),Z_17)
| f('#skF_1'(Z_17),'#skF_1'(Z_17)) ),
inference(factorization,[status(thm),theory(equality)],[c_4]) ).
tff(c_6,plain,
! [X_6,Z_1] :
( ~ f(X_6,X_6)
| ~ f(X_6,'#skF_1'(Z_1)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_59,plain,
! [Z_18,Z_19] :
( ~ f('#skF_1'(Z_18),'#skF_1'(Z_19))
| ~ f('#skF_1'(Z_18),Z_18) ),
inference(resolution,[status(thm)],[c_51,c_6]) ).
tff(c_71,plain,
! [Z_20] : ~ f('#skF_1'(Z_20),Z_20),
inference(resolution,[status(thm)],[c_29,c_59]) ).
tff(c_78,plain,
$false,
inference(resolution,[status(thm)],[c_2,c_71]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN413+1 : TPTP v9.0.0. Released v2.0.0.
% 0.00/0.10 % 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.10/0.30 % Computer : n028.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Wed Apr 9 07:23:19 EDT 2025
% 0.10/0.30 % CPUTime :
% 2.96/2.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.21/2.22
% 3.21/2.22 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------