%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : SWB003+4 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun Sep 27 08:51:26 AM UTC 2026
% Result : Theorem 0.10s 0.38s
% Output : CNFRefutation 0.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 6 ( 6 unt; 0 def)
% Number of atoms : 6 ( 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 predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-1 aty)
% Number of variables : 3 ( 1 sgn 0 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals,conjecture,
? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
file('theBenchmark.p',testcase_conclusion_fullish_003_Blank_Nodes_for_Literals) ).
fof(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals_neg,negated_conjecture,
~ ? [BNODE_x] : iext(uri_ex_p,uri_ex_s,BNODE_x),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_003_Blank_Nodes_for_Literals]) ).
fof(testcase_premise_fullish_003_Blank_Nodes_for_Literals,axiom,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
file('theBenchmark.p',testcase_premise_fullish_003_Blank_Nodes_for_Literals) ).
cnf(c_118,plain,
iext(uri_ex_p,uri_ex_s,literal_plain(dat_str_foo)),
inference(clausify,[status(thm)],[testcase_premise_fullish_003_Blank_Nodes_for_Literals]) ).
cnf(c_119,negated_conjecture,
~ iext(uri_ex_p,uri_ex_s,A),
inference(clausify,[status(thm)],[testcase_conclusion_fullish_003_Blank_Nodes_for_Literals_neg]) ).
cnf(c_120,plain,
$false,
inference(resolve,[status(thm)],[c_119,c_118]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWB003+4 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.03 % Command : prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n020.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sat Sep 26 11:39:48 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.10/0.36 % Process 1444841 was started by sandbox on n020,
% 0.10/0.36 % Sat Sep 26 11:39:48 2026
% 0.10/0.36 % The command was "/export/starexec/sandbox/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox/benchmark/theBenchmark.p".
% 0.10/0.37
% 0.10/0.37 % From the command line: assign(max_seconds, 300).
% 0.10/0.38
% 0.10/0.38 % SZS status Theorem for theBenchmark
% 0.10/0.38
% 0.10/0.38 % Proof 1 at 0.00 (+ 0.00) seconds.
% 0.10/0.38 % Length of proof is 4.
% 0.10/0.38 % Level of proof is 2.
% 0.10/0.38 % Maximum clause weight is 5.000.
% 0.10/0.38 % Given clauses 0.
% 0.10/0.38
% 0.10/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------