%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN363+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 : n007.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 10:03:21 PM UTC 2025
% Result : Theorem 2.41s 1.52s
% Output : CNFRefutation 2.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 1 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 10 ( 8 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_r > #nlpp > b > a > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(big_r,type,
big_r: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(b,type,
b: $i ).
tff(f_38,negated_conjecture,
~ ( ( ! [X] : big_r(X,b)
& ! [Y] :
( ? [Z] : big_r(Y,Z)
=> big_r(a,Y) ) )
=> ? [U] :
! [V] : big_r(U,V) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2114) ).
tff(c_6,plain,
! [X_1] : big_r(X_1,b),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_9,plain,
! [Y_9,Z_10] :
( big_r(a,Y_9)
| ~ big_r(Y_9,Z_10) ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_14,plain,
! [X_11] : big_r(a,X_11),
inference(resolution,[status(thm)],[c_6,c_9]) ).
tff(c_2,plain,
! [U_5] : ~ big_r(U_5,'#skF_1'(U_5)),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_19,plain,
$false,
inference(resolution,[status(thm)],[c_14,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYN363+1 : TPTP v9.0.0. Released v2.0.0.
% 0.11/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.14/0.34 % Computer : n007.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Apr 9 07:21:09 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.41/1.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.41/1.52
% 2.41/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------