%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN399+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 : n024.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:28 PM UTC 2025
% Result : Theorem 2.79s 1.96s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 4 |; 0 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 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 : 3 ( 2 usr; 2 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ f > #nlpp > p > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f,type,
f: $i > $o ).
tff(f_35,negated_conjecture,
~ ( ! [X] :
( f(X)
<=> p )
=> ( ! [Y] : f(Y)
<=> p ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kalish223) ).
tff(c_12,plain,
! [Y_2] :
( f(Y_2)
| p ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_13,plain,
p,
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_4,plain,
! [X_1] :
( f(X_1)
| ~ p ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_15,plain,
! [X_1] : f(X_1),
inference(demodulation,[status(thm),theory(equality)],[c_13,c_4]) ).
tff(c_6,plain,
( ~ p
| ~ f('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_20,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_15,c_13,c_6]) ).
tff(c_22,plain,
~ p,
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_21,plain,
! [Y_2] : f(Y_2),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_2,plain,
! [X_1] :
( p
| ~ f(X_1) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_28,plain,
p,
inference(demodulation,[status(thm),theory(equality)],[c_21,c_2]) ).
tff(c_29,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22,c_28]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : SYN399+1 : TPTP v9.0.0. Released v2.0.0.
% 0.08/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 : n024.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:22:36 EDT 2025
% 0.10/0.30 % CPUTime :
% 2.79/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.79/1.96
% 2.79/1.96 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------