%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN321+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 : n017.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:10 PM UTC 2025
% Result : Theorem 2.64s 1.65s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 16 ( 6 ~; 5 |; 0 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 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 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 2-2 aty)
% Number of variables : 25 ( 22 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_g > big_f > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_g,type,
big_g: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(big_f,type,
big_f: ( $i * $i ) > $o ).
tff(f_41,negated_conjecture,
~ ? [X,Y] :
( ( ? [Z] : big_f(X,Z)
=> ! [Z] : big_g(X,Z) )
=> ( ! [Z] :
( big_g(Z,Z)
=> big_f(Z,Y) )
=> ( big_f(X,Y)
<=> ! [Z] : big_g(X,Z) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_3_2) ).
tff(c_12,plain,
! [X_1,Y_2,Z_8] :
( big_f(X_1,Y_2)
| big_g(X_1,Z_8) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_14,plain,
! [X_15,Z_16,Z_17] :
( big_g(X_15,Z_16)
| ~ big_f(X_15,Z_17) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_17,plain,
! [X_1,Z_16,Z_8] :
( big_g(X_1,Z_16)
| big_g(X_1,Z_8) ),
inference(resolution,[status(thm)],[c_12,c_14]) ).
tff(c_35,plain,
! [X_1,Z_16] : big_g(X_1,Z_16),
inference(factorization,[status(thm),theory(equality)],[c_17]) ).
tff(c_6,plain,
! [X_1,Y_2] :
( ~ big_g(X_1,'#skF_1'(X_1,Y_2))
| ~ big_f(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_53,plain,
! [X_1,Y_2] : ~ big_f(X_1,Y_2),
inference(demodulation,[status(thm),theory(equality)],[c_35,c_6]) ).
tff(c_4,plain,
! [Z_9,Y_2] :
( big_f(Z_9,Y_2)
| ~ big_g(Z_9,Z_9) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_48,plain,
! [Z_9,Y_2] : big_f(Z_9,Y_2),
inference(demodulation,[status(thm),theory(equality)],[c_35,c_4]) ).
tff(c_55,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_53,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN321+1 : TPTP v9.0.0. Released v2.0.0.
% 0.11/0.13 % 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.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Apr 9 07:16:55 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.64/1.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.64/1.65
% 2.64/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------