%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET062+3 : 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 : n019.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:44 PM UTC 2025
% Result : Theorem 2.63s 1.65s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 3
% Syntax : Number of formulae : 8 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 1 |; 0 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 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 : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 9 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > member > empty > #nlpp > empty_set > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_38,axiom,
! [B,C] :
( subset(B,C)
<=> ! [D] :
( member(D,B)
=> member(D,C) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
tff(f_30,axiom,
! [B] : ~ member(B,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_defn) ).
tff(f_52,negated_conjecture,
~ ! [B] : subset(empty_set,B),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_empty_set_subset) ).
tff(c_30,plain,
! [B_17,C_18] :
( member('#skF_1'(B_17,C_18),B_17)
| subset(B_17,C_18) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_2,plain,
! [B_1] : ~ member(B_1,empty_set),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_39,plain,
! [C_18] : subset(empty_set,C_18),
inference(resolution,[status(thm)],[c_30,c_2]) ).
tff(c_16,plain,
~ subset(empty_set,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_39,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET062+3 : TPTP v9.0.0. Released v2.2.0.
% 0.10/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 : n019.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 19:54:47 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.63/1.65 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.63/1.65
% 2.63/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------