%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET043+1 : TPTP v9.0.0. Released v2.0.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 : n022.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:39 PM UTC 2025
% Result : Theorem 2.57s 1.66s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 9 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 9 ( 6 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 4 ( 3 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_36,negated_conjecture,
~ ~ ? [X] :
! [Y] :
( element(Y,X)
<=> ~ element(Y,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel39) ).
tff(c_4,plain,
! [Y_2] :
( element(Y_2,'#skF_1')
| element(Y_2,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_17,plain,
element('#skF_1','#skF_1'),
inference(factorization,[status(thm),theory(equality)],[c_4]) ).
tff(c_21,plain,
! [Y_4] :
( ~ element(Y_4,Y_4)
| ~ element(Y_4,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_23,plain,
~ element('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_17,c_21]) ).
tff(c_30,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_17,c_23]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET043+1 : TPTP v9.0.0. Released v2.0.0.
% 0.03/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 : n022.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:52:51 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.57/1.66 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.57/1.67
% 2.57/1.67 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------