%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET095+4 : TPTP v9.0.0. Released v2.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 : n014.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:37:57 PM UTC 2025
% Result : Theorem 5.91s 2.40s
% Output : CNFRefutation 5.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 22 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 14 ( 5 ~; 5 |; 0 &)
% ( 2 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 14 ( 14 usr; 3 con; 0-2 aty)
% Number of variables : 15 ( 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > equal_set > unordered_pair > union > intersection > difference > #nlpp > sum > singleton > product > power_set > empty_set > #skF_3 > #skF_5 > #skF_4 > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(equal_set,type,
equal_set: ( $i * $i ) > $o ).
tff(power_set,type,
power_set: $i > $i ).
tff(product,type,
product: $i > $i ).
tff(singleton,type,
singleton: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff(sum,type,
sum: $i > $i ).
tff(intersection,type,
intersection: ( $i * $i ) > $i ).
tff(union,type,
union: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(difference,type,
difference: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_119,negated_conjecture,
~ ! [A,X] :
( member(X,A)
=> subset(singleton(X),A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI44) ).
tff(f_56,axiom,
! [A,B] :
( subset(A,B)
<=> ! [X] :
( member(X,A)
=> member(X,B) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
tff(f_92,axiom,
! [X,A] :
( member(X,singleton(A))
<=> ( X = A ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',singleton) ).
tff(c_60,plain,
~ subset(singleton('#skF_5'),'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_62,plain,
member('#skF_5','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_107,plain,
! [A_59,B_60] :
( member('#skF_1'(A_59,B_60),A_59)
| subset(A_59,B_60) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_38,plain,
! [X_20,A_21] :
( ( X_20 = A_21 )
| ~ member(X_20,singleton(A_21)) ),
inference(cnfTransformation,[status(thm)],[f_92]) ).
tff(c_3057,plain,
! [A_260,B_261] :
( ( '#skF_1'(singleton(A_260),B_261) = A_260 )
| subset(singleton(A_260),B_261) ),
inference(resolution,[status(thm)],[c_107,c_38]) ).
tff(c_3073,plain,
'#skF_1'(singleton('#skF_5'),'#skF_4') = '#skF_5',
inference(resolution,[status(thm)],[c_3057,c_60]) ).
tff(c_4,plain,
! [A_1,B_2] :
( ~ member('#skF_1'(A_1,B_2),B_2)
| subset(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_3080,plain,
( ~ member('#skF_5','#skF_4')
| subset(singleton('#skF_5'),'#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_3073,c_4]) ).
tff(c_3086,plain,
subset(singleton('#skF_5'),'#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_62,c_3080]) ).
tff(c_3088,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_60,c_3086]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET095+4 : TPTP v9.0.0. Released v2.2.0.
% 0.03/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.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 8 20:00:49 EDT 2025
% 0.12/0.34 % CPUTime :
% 5.91/2.40 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.91/2.41
% 5.91/2.41 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------