%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU139+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/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 : n007.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 7.09s 2.78s
% Output : CNFRefutation 7.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 18 ( 10 ~; 4 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 20 ( 20 usr; 5 con; 0-3 aty)
% Number of variables : 13 ( 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > proper_subset > in > disjoint > empty > set_union2 > set_intersection2 > set_difference > #nlpp > empty_set > #skF_11 > #skF_6 > #skF_15 > #skF_1 > #skF_13 > #skF_10 > #skF_16 > #skF_14 > #skF_12 > #skF_5 > #skF_2 > #skF_9 > #skF_7 > #skF_3 > #skF_8 > #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_15',type,
'#skF_15': $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i ) > $i ).
tff(proper_subset,type,
proper_subset: ( $i * $i ) > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
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_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_119,axiom,
! [A,B] : ~ proper_subset(A,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',irreflexivity_r2_xboole_0) ).
tff(f_239,negated_conjecture,
~ ! [A,B] :
~ ( subset(A,B)
& proper_subset(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t60_xboole_1) ).
tff(f_36,axiom,
! [A,B] :
( proper_subset(A,B)
=> ~ proper_subset(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_xboole_0) ).
tff(f_98,axiom,
! [A,B] :
( proper_subset(A,B)
<=> ( subset(A,B)
& ( A != B ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d8_xboole_0) ).
tff(c_108,plain,
! [A_50] : ~ proper_subset(A_50,A_50),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_180,plain,
proper_subset('#skF_16','#skF_15'),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_468,plain,
! [B_148,A_149] :
( ~ proper_subset(B_148,A_149)
| ~ proper_subset(A_149,B_148) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_471,plain,
~ proper_subset('#skF_15','#skF_16'),
inference(resolution,[status(thm)],[c_180,c_468]) ).
tff(c_182,plain,
subset('#skF_15','#skF_16'),
inference(cnfTransformation,[status(thm)],[f_239]) ).
tff(c_2312,plain,
! [A_243,B_244] :
( proper_subset(A_243,B_244)
| ( B_244 = A_243 )
| ~ subset(A_243,B_244) ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_2345,plain,
( proper_subset('#skF_15','#skF_16')
| ( '#skF_15' = '#skF_16' ) ),
inference(resolution,[status(thm)],[c_182,c_2312]) ).
tff(c_2361,plain,
'#skF_15' = '#skF_16',
inference(negUnitSimplification,[status(thm)],[c_471,c_2345]) ).
tff(c_2370,plain,
proper_subset('#skF_16','#skF_16'),
inference(demodulation,[status(thm),theory(equality)],[c_2361,c_180]) ).
tff(c_2378,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_108,c_2370]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SEU139+2 : 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.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Apr 8 22:07:24 EDT 2025
% 0.21/0.35 % CPUTime :
% 7.09/2.78 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 7.12/2.79
% 7.12/2.79 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------