%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET940+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 : n010.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:38 PM UTC 2025
% Result : Theorem 2.42s 1.54s
% Output : CNFRefutation 2.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 5 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 6 ( 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ empty > unordered_pair > set_union2 > #nlpp > union > #skF_2 > #skF_3 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(union,type,
union: $i > $i ).
tff(unordered_pair,type,
unordered_pair: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(f_54,axiom,
! [A,B] : ( union(unordered_pair(A,B)) = set_union2(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l52_zfmisc_1) ).
tff(f_52,negated_conjecture,
~ ! [A,B] : ( union(unordered_pair(A,B)) = set_union2(A,B) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t93_zfmisc_1) ).
tff(c_18,plain,
! [A_11,B_12] : ( union(unordered_pair(A_11,B_12)) = set_union2(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_16,plain,
union(unordered_pair('#skF_3','#skF_4')) != set_union2('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_20,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_18,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET940+1 : TPTP v9.0.0. Released v3.2.0.
% 0.03/0.14 % 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.35 % Computer : n010.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Apr 8 21:52:03 EDT 2025
% 0.13/0.35 % CPUTime :
% 2.42/1.54 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.42/1.54
% 2.42/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------