%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN730+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 : n015.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.54s 1.63s
% Output : CNFRefutation 2.54s
% 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 ( 3 avg)
% Maximal term depth : 3 ( 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-3 aty)
% Number of functors : 4 ( 4 usr; 1 con; 0-1 aty)
% Number of variables : 7 ( 5 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp > k > h > a > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(h,type,
h: $i > $i ).
tff(p,type,
p: ( $i * $i * $i ) > $o ).
tff(k,type,
k: $i > $i ).
tff(f_33,negated_conjecture,
~ ? [V] :
! [J] :
? [Q] :
( ( p(a,J,h(J))
| p(V,J,k(J)) )
=> p(V,J,Q) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm75) ).
tff(c_4,plain,
! [V_1,Q_6] : ~ p(V_1,'#skF_1'(V_1),Q_6),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
! [V_1] :
( p(V_1,'#skF_1'(V_1),k('#skF_1'(V_1)))
| p(a,'#skF_1'(V_1),h('#skF_1'(V_1))) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_7,plain,
! [V_9] : p(a,'#skF_1'(V_9),h('#skF_1'(V_9))),
inference(negUnitSimplification,[status(thm)],[c_4,c_2]) ).
tff(c_12,plain,
$false,
inference(resolution,[status(thm)],[c_7,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SYN730+1 : TPTP v9.0.0. Released v2.5.0.
% 0.10/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 : n015.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:35 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.54/1.63 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.54/1.63
% 2.54/1.63 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------