%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN406+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/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 : n029.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:29 PM UTC 2025
% Result : Theorem 3.00s 2.09s
% Output : CNFRefutation 3.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 13 ( 6 ~; 2 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-1 aty)
% Number of functors : 1 ( 1 usr; 1 con; 0-0 aty)
% Number of variables : 5 ( 3 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ h > g > f > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: $i > $o ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(g,type,
g: $i > $o ).
tff(f,type,
f: $i > $o ).
tff(f_40,negated_conjecture,
~ ( ( ! [X] :
( f(X)
=> g(X) )
& ? [Y] :
( f(Y)
& h(Y) ) )
=> ? [Z] :
( g(Z)
& h(Z) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish240) ).
tff(c_6,plain,
f('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_14,plain,
! [X_4] :
( g(X_4)
| ~ f(X_4) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_4,plain,
h('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_9,plain,
! [Z_3] :
( ~ h(Z_3)
| ~ g(Z_3) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_13,plain,
~ g('#skF_1'),
inference(resolution,[status(thm)],[c_4,c_9]) ).
tff(c_17,plain,
~ f('#skF_1'),
inference(resolution,[status(thm)],[c_14,c_13]) ).
tff(c_21,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYN406+1 : TPTP v9.0.0. Released v2.0.0.
% 0.09/0.10 % 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.09/0.31 % Computer : n029.cluster.edu
% 0.09/0.31 % Model : x86_64 x86_64
% 0.09/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.31 % Memory : 8042.1875MB
% 0.09/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.31 % CPULimit : 300
% 0.09/0.31 % WCLimit : 300
% 0.09/0.31 % DateTime : Wed Apr 9 07:23:04 EDT 2025
% 0.09/0.31 % CPUTime :
% 3.00/2.09 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.00/2.09
% 3.00/2.09 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------