%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SET046+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 : n011.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:40 PM UTC 2025
% Result : Theorem 2.46s 1.58s
% Output : CNFRefutation 2.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 10 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 21 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 24 ( 13 ~; 9 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 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 : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-1 aty)
% Number of variables : 11 ( 9 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ element > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(f_39,negated_conjecture,
~ ~ ? [Y] :
! [X] :
( element(X,Y)
<=> ~ ? [Z] :
( element(X,Z)
& element(Z,X) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',pel42) ).
tff(c_4,plain,
! [X_6] :
( element('#skF_2'(X_6),X_6)
| element(X_6,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_6,plain,
! [X_6] :
( element(X_6,'#skF_2'(X_6))
| element(X_6,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_9,plain,
! [Z_12,X_13] :
( ~ element(Z_12,X_13)
| ~ element(X_13,Z_12)
| ~ element(X_13,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_16,plain,
! [X_14] :
( ~ element('#skF_2'(X_14),X_14)
| ~ element('#skF_2'(X_14),'#skF_1')
| element(X_14,'#skF_1') ),
inference(resolution,[status(thm)],[c_6,c_9]) ).
tff(c_20,plain,
! [X_15] :
( ~ element('#skF_2'(X_15),'#skF_1')
| element(X_15,'#skF_1') ),
inference(resolution,[status(thm)],[c_4,c_16]) ).
tff(c_25,plain,
element('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_4,c_20]) ).
tff(c_2,plain,
! [Z_9,X_6] :
( ~ element(Z_9,X_6)
| ~ element(X_6,Z_9)
| ~ element(X_6,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_27,plain,
~ element('#skF_1','#skF_1'),
inference(resolution,[status(thm)],[c_25,c_2]) ).
tff(c_31,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_25,c_27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET046+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.12/0.34 % Computer : n011.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Tue Apr 8 19:53:33 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.46/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.46/1.59
% 2.46/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------