%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SYN403+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 : n025.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:28 PM UTC 2025
% Result : Theorem 2.16s 1.44s
% Output : CNFRefutation 2.28s
% 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 : 11 ( 4 ~; 2 |; 1 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 1 ( 1 !; 0 ?; 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_38,negated_conjecture,
~ ! [X] :
( ( ( f(X)
=> g(X) )
& ( g(X)
=> h(X) ) )
=> ( f(X)
=> h(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish234) ).
tff(c_4,plain,
f('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_8,plain,
( g('#skF_1')
| ~ f('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_10,plain,
g('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_8]) ).
tff(c_6,plain,
( h('#skF_1')
| ~ g('#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_12,plain,
h('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_6]) ).
tff(c_2,plain,
~ h('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_14,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : SYN403+1 : TPTP v9.0.0. Released v2.0.0.
% 0.08/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 : n025.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 07:22:35 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.16/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.16/1.45
% 2.16/1.45 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------