%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU173+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 : n027.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:53:04 PM UTC 2025
% Result : Theorem 3.64s 1.96s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 18 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 39 ( 1 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 33 ( 12 ~; 10 |; 1 &)
% ( 5 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 27 ( 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > empty > #nlpp > powerset > empty_set > #skF_9 > #skF_7 > #skF_4 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_8 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $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(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $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_65,axiom,
! [A] : ~ empty(powerset(A)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_subset_1) ).
tff(f_38,axiom,
! [A,B] :
( ( B = powerset(A) )
<=> ! [C] :
( in(C,B)
<=> subset(C,A) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_zfmisc_1) ).
tff(f_51,axiom,
! [A,B] :
( ( ~ empty(A)
=> ( element(B,A)
<=> in(B,A) ) )
& ( empty(A)
=> ( element(B,A)
<=> empty(B) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_subset_1) ).
tff(f_74,negated_conjecture,
~ ! [A,B] :
( ! [C] :
( in(C,A)
=> in(C,B) )
=> element(A,powerset(B)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l71_subset_1) ).
tff(f_58,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(c_38,plain,
! [A_17] : ~ empty(powerset(A_17)),
inference(cnfTransformation,[status(thm)],[f_65]) ).
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_267,plain,
! [B_62,A_63] :
( element(B_62,A_63)
| ~ in(B_62,A_63)
| empty(A_63) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_276,plain,
! [C_7,A_3] :
( element(C_7,powerset(A_3))
| empty(powerset(A_3))
| ~ subset(C_7,A_3) ),
inference(resolution,[status(thm)],[c_6,c_267]) ).
tff(c_378,plain,
! [C_76,A_77] :
( element(C_76,powerset(A_77))
| ~ subset(C_76,A_77) ),
inference(negUnitSimplification,[status(thm)],[c_38,c_276]) ).
tff(c_42,plain,
~ element('#skF_5',powerset('#skF_6')),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_390,plain,
~ subset('#skF_5','#skF_6'),
inference(resolution,[status(thm)],[c_378,c_42]) ).
tff(c_354,plain,
! [A_71,B_72] :
( in('#skF_3'(A_71,B_72),A_71)
| subset(A_71,B_72) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_44,plain,
! [C_19] :
( in(C_19,'#skF_6')
| ~ in(C_19,'#skF_5') ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_458,plain,
! [B_88] :
( in('#skF_3'('#skF_5',B_88),'#skF_6')
| subset('#skF_5',B_88) ),
inference(resolution,[status(thm)],[c_354,c_44]) ).
tff(c_26,plain,
! [A_10,B_11] :
( ~ in('#skF_3'(A_10,B_11),B_11)
| subset(A_10,B_11) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_464,plain,
subset('#skF_5','#skF_6'),
inference(resolution,[status(thm)],[c_458,c_26]) ).
tff(c_477,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_390,c_390,c_464]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU173+1 : TPTP v9.0.0. Released v3.3.0.
% 0.07/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.13/0.34 % Computer : n027.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Apr 8 22:12:05 EDT 2025
% 0.13/0.35 % CPUTime :
% 3.64/1.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.96
% 3.64/1.96 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------