%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN732+1 : TPTP v9.0.0. Released v2.5.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 : n021.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:04:19 PM UTC 2025
% Result : Theorem 2.26s 1.47s
% Output : CNFRefutation 2.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 1
% Syntax : Number of formulae : 4 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 6 ( 2 ~; 1 |; 0 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 0 con; 1-1 aty)
% Number of variables : 9 ( 6 !; 3 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ q > p > #nlpp > #skF_2 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(q,type,
q: ( $i * $i ) > $o ).
tff(p,type,
p: ( $i * $i ) > $o ).
tff(f_40,negated_conjecture,
~ ( ! [Y] :
( ! [X] : p(X,Y)
=> ! [U] : q(U,Y) )
=> ? [Z] :
( ? [V] : p(V,Z)
=> ? [W] :
( p(Z,W)
| q(W,Z) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',x3411) ).
tff(c_4,plain,
! [Z_5,W_8] : ~ p(Z_5,W_8),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_2,plain,
! [Z_5] : p('#skF_2'(Z_5),Z_5),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_10,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYN732+1 : TPTP v9.0.0. Released v2.5.0.
% 0.13/0.13 % 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.34 % Computer : n021.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 : Wed Apr 9 08:13:59 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.26/1.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.26/1.47
% 2.26/1.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------