%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU140+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/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:52:53 PM UTC 2025
% Result : Theorem 3.54s 1.90s
% Output : CNFRefutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 31 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 50 ( 17 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 15 ~; 12 |; 1 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 38 ( 37 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_5 > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $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(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(f_43,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_73,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_37,axiom,
! [A,B] :
( disjoint(A,B)
<=> ( set_intersection2(A,B) = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
tff(f_69,negated_conjecture,
~ ! [A,B,C] :
( ( subset(A,B)
& disjoint(B,C) )
=> disjoint(A,C) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t63_xboole_1) ).
tff(f_52,axiom,
! [A,B] :
( disjoint(A,B)
=> disjoint(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
tff(f_33,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_56,axiom,
! [A,B,C] :
( subset(A,B)
=> subset(set_intersection2(A,C),set_intersection2(B,C)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t26_xboole_1) ).
tff(f_62,axiom,
! [A] :
( subset(A,empty_set)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_1) ).
tff(c_18,plain,
empty('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_53,plain,
! [A_25] :
( ( empty_set = A_25 )
| ~ empty(A_25) ),
inference(cnfTransformation,[status(thm)],[f_73]) ).
tff(c_62,plain,
empty_set = '#skF_1',
inference(resolution,[status(thm)],[c_18,c_53]) ).
tff(c_8,plain,
! [A_5,B_6] :
( disjoint(A_5,B_6)
| ( set_intersection2(A_5,B_6) != empty_set ) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_237,plain,
! [A_43,B_44] :
( disjoint(A_43,B_44)
| ( set_intersection2(A_43,B_44) != '#skF_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_8]) ).
tff(c_32,plain,
~ disjoint('#skF_3','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_248,plain,
set_intersection2('#skF_3','#skF_5') != '#skF_1',
inference(resolution,[status(thm)],[c_237,c_32]) ).
tff(c_36,plain,
subset('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_34,plain,
disjoint('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_215,plain,
! [B_39,A_40] :
( disjoint(B_39,A_40)
| ~ disjoint(A_40,B_39) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_218,plain,
disjoint('#skF_5','#skF_4'),
inference(resolution,[status(thm)],[c_34,c_215]) ).
tff(c_6,plain,
! [A_5,B_6] :
( ( set_intersection2(A_5,B_6) = empty_set )
| ~ disjoint(A_5,B_6) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_227,plain,
! [A_41,B_42] :
( ( set_intersection2(A_41,B_42) = '#skF_1' )
| ~ disjoint(A_41,B_42) ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_6]) ).
tff(c_234,plain,
set_intersection2('#skF_5','#skF_4') = '#skF_1',
inference(resolution,[status(thm)],[c_218,c_227]) ).
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_310,plain,
! [A_49,C_50,B_51] :
( subset(set_intersection2(A_49,C_50),set_intersection2(B_51,C_50))
| ~ subset(A_49,B_51) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_461,plain,
! [A_59,A_60,B_61] :
( subset(set_intersection2(A_59,A_60),set_intersection2(A_60,B_61))
| ~ subset(A_59,B_61) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_310]) ).
tff(c_636,plain,
! [A_70] :
( subset(set_intersection2(A_70,'#skF_5'),'#skF_1')
| ~ subset(A_70,'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_234,c_461]) ).
tff(c_30,plain,
! [A_17] :
( ( empty_set = A_17 )
| ~ subset(A_17,empty_set) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_112,plain,
! [A_17] :
( ( A_17 = '#skF_1' )
| ~ subset(A_17,'#skF_1') ),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_62,c_30]) ).
tff(c_666,plain,
! [A_71] :
( ( set_intersection2(A_71,'#skF_5') = '#skF_1' )
| ~ subset(A_71,'#skF_4') ),
inference(resolution,[status(thm)],[c_636,c_112]) ).
tff(c_677,plain,
set_intersection2('#skF_3','#skF_5') = '#skF_1',
inference(resolution,[status(thm)],[c_36,c_666]) ).
tff(c_689,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_248,c_677]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU140+1 : TPTP v9.0.0. Released v3.3.0.
% 0.12/0.13 % 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.12/0.34 % Computer : n029.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 : Tue Apr 8 22:06:49 EDT 2025
% 0.12/0.34 % CPUTime :
% 3.54/1.90 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.91/1.91
% 3.91/1.91 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------