%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SEU122+2 : 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 : n032.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:52:49 PM UTC 2025
% Result : Theorem 3.65s 1.81s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 15 ( 10 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 4 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 13 ( 7 ~; 2 |; 0 &)
% ( 2 <=>; 2 =>; 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 14 ( 13 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > disjoint > empty > set_intersection2 > #nlpp > empty_set > #skF_1 > #skF_4 > #skF_7 > #skF_5 > #skF_6 > #skF_8 > #skF_3 > #skF_2 > #skF_9
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $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('#skF_5',type,
'#skF_5': $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(empty,type,
empty: $i > $o ).
tff(disjoint,type,
disjoint: ( $i * $i ) > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(f_46,axiom,
! [A,B] :
( subset(A,B)
<=> ! [C] :
( in(C,A)
=> in(C,B) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
tff(f_65,axiom,
? [A] : empty(A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
tff(f_119,axiom,
! [A] :
( empty(A)
=> ( A = empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
tff(f_39,axiom,
! [A] :
( ( A = empty_set )
<=> ! [B] : ~ in(B,A) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
tff(f_83,negated_conjecture,
~ ! [A] : subset(empty_set,A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
tff(c_423,plain,
! [A_93,B_94] :
( in('#skF_2'(A_93,B_94),A_93)
| subset(A_93,B_94) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_46,plain,
empty('#skF_5'),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_84,plain,
! [A_49] :
( ( empty_set = A_49 )
| ~ empty(A_49) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_91,plain,
empty_set = '#skF_5',
inference(resolution,[status(thm)],[c_46,c_84]) ).
tff(c_6,plain,
! [B_8] : ~ in(B_8,empty_set),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_96,plain,
! [B_8] : ~ in(B_8,'#skF_5'),
inference(demodulation,[status(thm),theory(equality)],[c_91,c_6]) ).
tff(c_456,plain,
! [B_94] : subset('#skF_5',B_94),
inference(resolution,[status(thm)],[c_423,c_96]) ).
tff(c_56,plain,
~ subset(empty_set,'#skF_7'),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_95,plain,
~ subset('#skF_5','#skF_7'),
inference(demodulation,[status(thm),theory(equality)],[c_91,c_56]) ).
tff(c_459,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_456,c_95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : SEU122+2 : TPTP v9.0.0. Released v3.3.0.
% 0.06/0.10 % 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.11/0.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Tue Apr 8 22:05:00 EDT 2025
% 0.11/0.29 % CPUTime :
% 3.65/1.81 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.74/1.81
% 3.74/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------