%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN369+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 : n026.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:22 PM UTC 2025
% Result : Theorem 2.80s 2.02s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 5 ( 2 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 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 : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 1 usr; 0 con; 1-1 aty)
% Number of variables : 11 ( 10 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ big_p > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(big_p,type,
big_p: ( $i * $i ) > $o ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(f_34,negated_conjecture,
~ ( ! [U,V,W] :
( big_p(U,V)
| big_p(V,W) )
=> ? [X] :
! [Y] : big_p(X,Y) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2120) ).
tff(c_20,plain,
! [V_7,W_8,U_9] :
( big_p(V_7,W_8)
| big_p(U_9,V_7) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [X_4] : ~ big_p(X_4,'#skF_1'(X_4)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_28,plain,
! [U_9,V_7] : big_p(U_9,V_7),
inference(resolution,[status(thm)],[c_20,c_2]) ).
tff(c_36,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_28,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYN369+1 : TPTP v9.0.0. Released v2.0.0.
% 0.11/0.12 % 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.11/0.33 % Computer : n026.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 300
% 0.11/0.33 % DateTime : Wed Apr 9 07:20:53 EDT 2025
% 0.11/0.33 % CPUTime :
% 2.80/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.80/2.03
% 2.80/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------