%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET932+1 : TPTP v9.0.0. Released v3.2.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 : n017.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:39:37 PM UTC 2025
% Result : Theorem 2.93s 1.75s
% Output : CNFRefutation 2.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 34 ( 1 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 27 ( 10 ~; 10 |; 1 &)
% ( 3 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 28 ( 28 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > #nlpp > powerset > #skF_7 > #skF_3 > #skF_5 > #skF_6 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_63,negated_conjecture,
~ ! [A,B] :
( subset(A,B)
=> subset(powerset(A),powerset(B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t79_zfmisc_1) ).
tff(f_45,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_38,axiom,
! [A,B] :
( ( B = powerset(A) )
<=> ! [C] :
( in(C,B)
<=> subset(C,A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
tff(f_58,axiom,
! [A,B,C] :
( ( subset(A,B)
& subset(B,C) )
=> subset(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_xboole_1) ).
tff(c_30,plain,
~ subset(powerset('#skF_6'),powerset('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_50,plain,
! [A_27,B_28] :
( in('#skF_3'(A_27,B_28),A_27)
| subset(A_27,B_28) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_4,plain,
! [C_7,A_3] :
( subset(C_7,A_3)
| ~ in(C_7,powerset(A_3)) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_57,plain,
! [A_3,B_28] :
( subset('#skF_3'(powerset(A_3),B_28),A_3)
| subset(powerset(A_3),B_28) ),
inference(resolution,[status(thm)],[c_50,c_4]) ).
tff(c_32,plain,
subset('#skF_6','#skF_7'),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_85,plain,
! [A_39,C_40,B_41] :
( subset(A_39,C_40)
| ~ subset(B_41,C_40)
| ~ subset(A_39,B_41) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_91,plain,
! [A_39] :
( subset(A_39,'#skF_7')
| ~ subset(A_39,'#skF_6') ),
inference(resolution,[status(thm)],[c_32,c_85]) ).
tff(c_6,plain,
! [C_7,A_3] :
( in(C_7,powerset(A_3))
| ~ subset(C_7,A_3) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_59,plain,
! [A_29,B_30] :
( ~ in('#skF_3'(A_29,B_30),B_30)
| subset(A_29,B_30) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_141,plain,
! [A_51,A_52] :
( subset(A_51,powerset(A_52))
| ~ subset('#skF_3'(A_51,powerset(A_52)),A_52) ),
inference(resolution,[status(thm)],[c_6,c_59]) ).
tff(c_188,plain,
! [A_58] :
( subset(A_58,powerset('#skF_7'))
| ~ subset('#skF_3'(A_58,powerset('#skF_7')),'#skF_6') ),
inference(resolution,[status(thm)],[c_91,c_141]) ).
tff(c_192,plain,
subset(powerset('#skF_6'),powerset('#skF_7')),
inference(resolution,[status(thm)],[c_57,c_188]) ).
tff(c_196,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_30,c_30,c_192]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET932+1 : TPTP v9.0.0. Released v3.2.0.
% 0.10/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 : n017.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 21:51:10 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.93/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.93/1.76
% 2.93/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------