%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN343+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 : n015.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:16 PM UTC 2025
% Result : Theorem 2.46s 1.60s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 10 ( 4 ~; 2 |; 1 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 1 ( 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 : 1 ( 1 usr; 0 con; 3-3 aty)
% Number of variables : 12 ( 9 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_f > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_37,negated_conjecture,
~ ? [X,Y1,Y2] :
! [Z] :
( ( ( big_f(X,Y1)
=> big_f(Z,X) )
=> big_f(X,X) )
=> ( big_f(X,X)
& big_f(Y1,Y2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_16_2) ).
tff(c_6,plain,
! [X_1,Y1_2] :
( big_f(X_1,Y1_2)
| big_f(X_1,X_1) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_19,plain,
! [Y1_2] : big_f(Y1_2,Y1_2),
inference(factorization,[status(thm),theory(equality)],[c_6]) ).
tff(c_2,plain,
! [Y1_2,Y2_3,X_1] :
( ~ big_f(Y1_2,Y2_3)
| ~ big_f(X_1,X_1) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_26,plain,
! [Y1_2,Y2_3] : ~ big_f(Y1_2,Y2_3),
inference(demodulation,[status(thm),theory(equality)],[c_19,c_2]) ).
tff(c_28,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_26,c_19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN343+1 : TPTP v9.0.0. Released v2.0.0.
% 0.06/0.13 % 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.13/0.34 % Computer : n015.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Apr 9 07:19:35 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.46/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.46/1.60
% 2.46/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------