%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM387+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/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 : n031.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 07:55:48 PM UTC 2025
% Result : Theorem 4.63s 2.61s
% Output : CNFRefutation 4.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 2 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 8 ( 6 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 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 : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 12 con; 0-2 aty)
% Number of variables : 7 ( 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > element > relation_non_empty > relation_empty_yielding > relation > one_to_one > function > empty > set_union2 > #nlpp > succ > singleton > empty_set > #skF_11 > #skF_1 > #skF_7 > #skF_10 > #skF_5 > #skF_6 > #skF_2 > #skF_3 > #skF_9 > #skF_8 > #skF_4 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(relation,type,
relation: $i > $o ).
tff(singleton,type,
singleton: $i > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(relation_non_empty,type,
relation_non_empty: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(relation_empty_yielding,type,
relation_empty_yielding: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_4',type,
'#skF_4': $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(succ,type,
succ: $i > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(f_142,negated_conjecture,
~ ! [A] : ( A != succ(A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t14_ordinal1) ).
tff(f_138,axiom,
! [A] : in(A,succ(A)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_ordinal1) ).
tff(f_31,axiom,
! [A,B] :
( in(A,B)
=> ~ in(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
tff(c_88,plain,
succ('#skF_12') = '#skF_12',
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_188,plain,
! [A_37] : in(A_37,succ(A_37)),
inference(cnfTransformation,[status(thm)],[f_138]) ).
tff(c_191,plain,
in('#skF_12','#skF_12'),
inference(superposition,[status(thm),theory(equality)],[c_88,c_188]) ).
tff(c_392,plain,
! [B_55,A_56] :
( ~ in(B_55,A_56)
| ~ in(A_56,B_55) ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_394,plain,
~ in('#skF_12','#skF_12'),
inference(resolution,[status(thm)],[c_191,c_392]) ).
tff(c_400,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_191,c_394]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.21 % Problem : NUM387+1 : TPTP v9.0.0. Released v3.2.0.
% 0.08/0.22 % 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.09/0.44 % Computer : n031.cluster.edu
% 0.09/0.44 % Model : x86_64 x86_64
% 0.09/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.44 % Memory : 8042.1875MB
% 0.09/0.44 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.44 % CPULimit : 300
% 0.09/0.44 % WCLimit : 300
% 0.09/0.44 % DateTime : Tue Apr 8 12:06:07 EDT 2025
% 0.09/0.44 % CPUTime :
% 4.63/2.61 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.63/2.61
% 4.63/2.61 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------