%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU120+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 : n031.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:48 PM UTC 2025
% Result : Theorem 3.98s 2.54s
% Output : CNFRefutation 3.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 34 ( 20 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 14 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 38 ( 22 ~; 11 |; 3 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 27 ( 26 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_1 > #skF_7 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_8 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_39,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_43,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_intersection2(A,B) = empty_set ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d7_xboole_0) ).
tff(f_71,negated_conjecture,
~ ! [A,B] :
( ~ ( ~ disjoint(A,B)
& ! [C] : ~ in(C,set_intersection2(A,B)) )
& ~ ( ? [C] : in(C,set_intersection2(A,B))
& disjoint(A,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
tff(c_6,plain,
! [B_8] : ~ in(B_8,empty_set),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_4,plain,
! [B_4,A_3] : ( set_intersection2(B_4,A_3) = set_intersection2(A_3,B_4) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_96,plain,
! [A_30,B_31] :
( disjoint(A_30,B_31)
| ( set_intersection2(A_30,B_31) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_32,plain,
( disjoint('#skF_4','#skF_5')
| ~ disjoint('#skF_7','#skF_8') ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_59,plain,
~ disjoint('#skF_7','#skF_8'),
inference(splitLeft,[status(thm)],[c_32]) ).
tff(c_102,plain,
set_intersection2('#skF_7','#skF_8') != empty_set,
inference(resolution,[status(thm)],[c_96,c_59]) ).
tff(c_107,plain,
set_intersection2('#skF_8','#skF_7') != empty_set,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_102]) ).
tff(c_8,plain,
! [A_5] :
( ( empty_set = A_5 )
| in('#skF_1'(A_5),A_5) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_28,plain,
! [C_17] :
( disjoint('#skF_4','#skF_5')
| ~ in(C_17,set_intersection2('#skF_7','#skF_8')) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_35,plain,
! [C_17] :
( disjoint('#skF_4','#skF_5')
| ~ in(C_17,set_intersection2('#skF_8','#skF_7')) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_28]) ).
tff(c_123,plain,
! [C_34] : ~ in(C_34,set_intersection2('#skF_8','#skF_7')),
inference(splitLeft,[status(thm)],[c_35]) ).
tff(c_127,plain,
set_intersection2('#skF_8','#skF_7') = empty_set,
inference(resolution,[status(thm)],[c_8,c_123]) ).
tff(c_131,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_107,c_127]) ).
tff(c_132,plain,
disjoint('#skF_4','#skF_5'),
inference(splitRight,[status(thm)],[c_35]) ).
tff(c_10,plain,
! [A_9,B_10] :
( ( set_intersection2(A_9,B_10) = empty_set )
| ~ disjoint(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_138,plain,
set_intersection2('#skF_4','#skF_5') = empty_set,
inference(resolution,[status(thm)],[c_132,c_10]) ).
tff(c_30,plain,
! [C_17] :
( in('#skF_6',set_intersection2('#skF_4','#skF_5'))
| ~ in(C_17,set_intersection2('#skF_7','#skF_8')) ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_36,plain,
! [C_17] :
( in('#skF_6',set_intersection2('#skF_4','#skF_5'))
| ~ in(C_17,set_intersection2('#skF_8','#skF_7')) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_30]) ).
tff(c_172,plain,
! [C_17] :
( in('#skF_6',empty_set)
| ~ in(C_17,set_intersection2('#skF_8','#skF_7')) ),
inference(demodulation,[status(thm),theory(equality)],[c_138,c_36]) ).
tff(c_174,plain,
! [C_35] : ~ in(C_35,set_intersection2('#skF_8','#skF_7')),
inference(negUnitSimplification,[status(thm)],[c_6,c_172]) ).
tff(c_178,plain,
set_intersection2('#skF_8','#skF_7') = empty_set,
inference(resolution,[status(thm)],[c_8,c_174]) ).
tff(c_182,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_107,c_178]) ).
tff(c_183,plain,
disjoint('#skF_4','#skF_5'),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_238,plain,
! [A_39,B_40] :
( ( set_intersection2(A_39,B_40) = empty_set )
| ~ disjoint(A_39,B_40) ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_254,plain,
set_intersection2('#skF_4','#skF_5') = empty_set,
inference(resolution,[status(thm)],[c_183,c_238]) ).
tff(c_184,plain,
disjoint('#skF_7','#skF_8'),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_34,plain,
( in('#skF_6',set_intersection2('#skF_4','#skF_5'))
| ~ disjoint('#skF_7','#skF_8') ),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_196,plain,
in('#skF_6',set_intersection2('#skF_4','#skF_5')),
inference(demodulation,[status(thm),theory(equality)],[c_184,c_34]) ).
tff(c_280,plain,
in('#skF_6',empty_set),
inference(demodulation,[status(thm),theory(equality)],[c_254,c_196]) ).
tff(c_282,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_6,c_280]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU120+1 : TPTP v9.0.0. Released v3.3.0.
% 0.03/0.11 % 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.32 % Computer : n031.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Tue Apr 8 22:04:37 EDT 2025
% 0.10/0.32 % CPUTime :
% 3.98/2.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.98/2.55
% 3.98/2.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------