%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU133+2 : 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 : n020.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:52 PM UTC 2025
% Result : Theorem 16.75s 6.49s
% Output : CNFRefutation 16.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 19 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 4 |; 1 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-3 aty)
% Number of variables : 21 ( 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_union2 > set_intersection2 > set_difference > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_1 > #skF_10 > #skF_12 > #skF_14 > #skF_13 > #skF_5 > #skF_2 > #skF_9 > #skF_7 > #skF_3 > #skF_8 > #skF_16 > #skF_15 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_11',type,
'#skF_11': ( $i * $i ) > $i ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i * $i ) > $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_63,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_82,axiom,
! [A,B,C] :
( ( C = set_difference(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( in(D,A)
& ~ in(D,B) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
tff(f_165,negated_conjecture,
~ ! [A,B] : subset(set_difference(A,B),A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t36_xboole_1) ).
tff(c_1573,plain,
! [A_187,B_188] :
( in('#skF_4'(A_187,B_188),A_187)
| subset(A_187,B_188) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_64,plain,
! [D_35,A_30,B_31] :
( in(D_35,A_30)
| ~ in(D_35,set_difference(A_30,B_31)) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_51648,plain,
! [A_1110,B_1111,B_1112] :
( in('#skF_4'(set_difference(A_1110,B_1111),B_1112),A_1110)
| subset(set_difference(A_1110,B_1111),B_1112) ),
inference(resolution,[status(thm)],[c_1573,c_64]) ).
tff(c_38,plain,
! [A_19,B_20] :
( ~ in('#skF_4'(A_19,B_20),B_20)
| subset(A_19,B_20) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_51822,plain,
! [A_1110,B_1111] : subset(set_difference(A_1110,B_1111),A_1110),
inference(resolution,[status(thm)],[c_51648,c_38]) ).
tff(c_140,plain,
~ subset(set_difference('#skF_13','#skF_14'),'#skF_13'),
inference(cnfTransformation,[status(thm)],[f_165]) ).
tff(c_51848,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_51822,c_140]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU133+2 : TPTP v9.0.0. Released v3.3.0.
% 0.07/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 : n020.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:06:04 EDT 2025
% 0.14/0.34 % CPUTime :
% 16.75/6.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 16.75/6.49
% 16.75/6.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------