%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET872+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/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 : n016.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:29 PM UTC 2025
% Result : Theorem 3.02s 1.76s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 26 ( 8 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 17 ( 5 ~; 6 |; 0 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 22 ( 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > empty > unordered_pair > #nlpp > singleton > #skF_4 > #skF_7 > #skF_6 > #skF_9 > #skF_8 > #skF_3 > #skF_2 > #skF_1 > #skF_5
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i * $i ) > $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff(f_66,negated_conjecture,
~ ! [A,B] : subset(singleton(A),unordered_pair(A,B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_zfmisc_1) ).
tff(f_49,axiom,
! [A,B,C] :
( ( C = unordered_pair(A,B) )
<=> ! [D] :
( in(D,C)
<=> ( ( D = A )
| ( D = B ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_tarski) ).
tff(f_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_40,axiom,
! [A,B] :
( ( B = singleton(A) )
<=> ! [C] :
( in(C,B)
<=> ( C = A ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
tff(c_48,plain,
~ subset(singleton('#skF_8'),unordered_pair('#skF_8','#skF_9')),
inference(cnfTransformation,[status(thm)],[f_66]) ).
tff(c_22,plain,
! [D_15,B_11] : in(D_15,unordered_pair(D_15,B_11)),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_133,plain,
! [A_40,B_41] :
( in('#skF_5'(A_40,B_41),A_40)
| subset(A_40,B_41) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_6,plain,
! [C_9,A_5] :
( ( C_9 = A_5 )
| ~ in(C_9,singleton(A_5)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_241,plain,
! [A_65,B_66] :
( ( '#skF_5'(singleton(A_65),B_66) = A_65 )
| subset(singleton(A_65),B_66) ),
inference(resolution,[status(thm)],[c_133,c_6]) ).
tff(c_249,plain,
'#skF_5'(singleton('#skF_8'),unordered_pair('#skF_8','#skF_9')) = '#skF_8',
inference(resolution,[status(thm)],[c_241,c_48]) ).
tff(c_38,plain,
! [A_16,B_17] :
( ~ in('#skF_5'(A_16,B_17),B_17)
| subset(A_16,B_17) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_256,plain,
( ~ in('#skF_8',unordered_pair('#skF_8','#skF_9'))
| subset(singleton('#skF_8'),unordered_pair('#skF_8','#skF_9')) ),
inference(superposition,[status(thm),theory(equality)],[c_249,c_38]) ).
tff(c_264,plain,
subset(singleton('#skF_8'),unordered_pair('#skF_8','#skF_9')),
inference(demodulation,[status(thm),theory(equality)],[c_22,c_256]) ).
tff(c_266,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_48,c_264]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET872+1 : TPTP v9.0.0. Released v3.2.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.13/0.34 % Computer : n016.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 21:48:08 EDT 2025
% 0.13/0.35 % CPUTime :
% 3.02/1.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.02/1.77
% 3.02/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------