%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET910+1 : TPTP v9.0.0. Released v3.2.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 : n029.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 08:39:34 PM UTC 2025
% Result : Theorem 3.16s 2.19s
% Output : CNFRefutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 4 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 1 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > empty > set_intersection2 > #nlpp > singleton > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_45,negated_conjecture,
~ ! [A,B] :
( ( set_intersection2(A,singleton(B)) = singleton(B) )
=> in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t51_zfmisc_1) ).
tff(f_49,axiom,
! [A,B] :
( ( set_intersection2(A,singleton(B)) = singleton(B) )
=> in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l30_zfmisc_1) ).
tff(c_12,plain,
~ in('#skF_4','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_14,plain,
set_intersection2('#skF_3',singleton('#skF_4')) = singleton('#skF_4'),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_64,plain,
! [B_14,A_15] :
( in(B_14,A_15)
| ( set_intersection2(A_15,singleton(B_14)) != singleton(B_14) ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_75,plain,
in('#skF_4','#skF_3'),
inference(superposition,[status(thm),theory(equality)],[c_14,c_64]) ).
tff(c_83,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_12,c_75]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SET910+1 : TPTP v9.0.0. Released v3.2.0.
% 0.09/0.10 % 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.30 % Computer : n029.cluster.edu
% 0.09/0.30 % Model : x86_64 x86_64
% 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30 % Memory : 8042.1875MB
% 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Tue Apr 8 21:50:04 EDT 2025
% 0.09/0.30 % CPUTime :
% 3.16/2.19 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.16/2.19
% 3.16/2.19 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------