%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU153+1 : TPTP v9.0.0. Released v3.3.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 : n022.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:52:58 PM UTC 2025
% Result : Theorem 3.41s 1.83s
% Output : CNFRefutation 3.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 16 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 30 ( 7 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 12 ~; 6 |; 2 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 22 ( 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > set_intersection2 > #nlpp > singleton > empty_set > #skF_4 > #skF_7 > #skF_6 > #skF_5 > #skF_9 > #skF_8 > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_69,negated_conjecture,
~ ! [A,B] :
~ ( disjoint(singleton(A),B)
& in(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l25_zfmisc_1) ).
tff(f_40,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).
tff(f_46,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_59,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_intersection2(A,B) = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
tff(f_55,axiom,
! [A,B,C] :
( ( C = set_intersection2(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
tff(c_54,plain,
in('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_8,plain,
! [C_9] : in(C_9,singleton(C_9)),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_18,plain,
! [B_13] : ~ in(B_13,empty_set),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_56,plain,
disjoint(singleton('#skF_6'),'#skF_7'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_149,plain,
! [A_42,B_43] :
( ( set_intersection2(A_42,B_43) = empty_set )
| ~ disjoint(A_42,B_43) ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_161,plain,
set_intersection2(singleton('#skF_6'),'#skF_7') = empty_set,
inference(resolution,[status(thm)],[c_56,c_149]) ).
tff(c_358,plain,
! [D_60,A_61,B_62] :
( in(D_60,set_intersection2(A_61,B_62))
| ~ in(D_60,B_62)
| ~ in(D_60,A_61) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_379,plain,
! [D_60] :
( in(D_60,empty_set)
| ~ in(D_60,'#skF_7')
| ~ in(D_60,singleton('#skF_6')) ),
inference(superposition,[status(thm),theory(equality)],[c_161,c_358]) ).
tff(c_460,plain,
! [D_64] :
( ~ in(D_64,'#skF_7')
| ~ in(D_64,singleton('#skF_6')) ),
inference(negUnitSimplification,[status(thm)],[c_18,c_379]) ).
tff(c_472,plain,
~ in('#skF_6','#skF_7'),
inference(resolution,[status(thm)],[c_8,c_460]) ).
tff(c_478,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_54,c_472]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU153+1 : TPTP v9.0.0. Released v3.3.0.
% 0.03/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.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 8 22:08:51 EDT 2025
% 0.14/0.34 % CPUTime :
% 3.41/1.83 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.41/1.83
% 3.41/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------