%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET575+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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n003.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:38:45 PM UTC 2025
% Result : Theorem 2.56s 1.56s
% Output : CNFRefutation 2.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 16 ( 8 ~; 4 |; 2 &)
% ( 1 <=>; 1 =>; 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 10 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ member > intersect > #nlpp > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(intersect,type,
intersect: ( $i * $i ) > $o ).
tff(member,type,
member: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(f_48,negated_conjecture,
~ ! [B,C] :
( intersect(B,C)
=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th15) ).
tff(f_34,axiom,
! [B,C] :
( intersect(B,C)
<=> ? [D] :
( member(D,B)
& member(D,C) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
tff(c_12,plain,
intersect('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_4,plain,
! [B_1,C_2] :
( member('#skF_1'(B_1,C_2),C_2)
| ~ intersect(B_1,C_2) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_22,plain,
! [B_13,C_14] :
( member('#skF_1'(B_13,C_14),B_13)
| ~ intersect(B_13,C_14) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_10,plain,
! [D_9] :
( ~ member(D_9,'#skF_3')
| ~ member(D_9,'#skF_2') ),
inference(cnfTransformation,[status(thm)],[f_48]) ).
tff(c_34,plain,
! [C_17] :
( ~ member('#skF_1'('#skF_2',C_17),'#skF_3')
| ~ intersect('#skF_2',C_17) ),
inference(resolution,[status(thm)],[c_22,c_10]) ).
tff(c_38,plain,
~ intersect('#skF_2','#skF_3'),
inference(resolution,[status(thm)],[c_4,c_34]) ).
tff(c_42,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET575+3 : TPTP v9.0.0. Released v2.2.0.
% 0.12/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n003.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:14:48 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.56/1.56 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.56/1.57
% 2.56/1.57 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------