%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWB003+2 : TPTP v9.0.0. Released v5.2.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 : n003.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 09:15:44 PM UTC 2025
% Result : Theorem 2.19s 1.51s
% Output : CNFRefutation 2.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 5 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 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-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 2 ( 1 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ iext > #nlpp > literal_plain > uri_ex_s > uri_ex_p > dat_str_foo
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(uri_ex_s,type,
uri_ex_s: $i ).
tff(dat_str_foo,type,
dat_str_foo: $i ).
tff(uri_ex_p,type,
uri_ex_p: $i ).
tff(iext,type,
iext: ( $i * $i * $i ) > $o ).
tff(literal_plain,type,
literal_plain: $i > $i ).
tff(f_27,negated_conjecture,
~ ? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
tff(f_28,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
tff(c_2,plain,
! [BNODE_x_1] : ~ iext(uri_ex_p,uri_ex_s,BNODE_x_1),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_4,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_5,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWB003+2 : TPTP v9.0.0. Released v5.2.0.
% 0.06/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.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Apr 9 00:51:48 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.19/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.19/1.51
% 2.19/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------