%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SWB002+2 : TPTP v9.2.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 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 : Tue May 5 05:16:32 PM UTC 2026
% Result : Theorem 0.24s 1.61s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 9 ( 3 unt; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 11 ( 5 ~; 2 |; 4 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 9 ( 0 sgn 2 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_002_Existential_Blank_Nodes,conjecture,
? [X1,X2] :
( iext(uri_ex_p,X1,X2)
& iext(uri_ex_q,X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_conclusion_fullish_002_Existential_Blank_Nodes) ).
fof(testcase_premise_fullish_002_Existential_Blank_Nodes,axiom,
? [X3] :
( iext(uri_ex_p,uri_ex_s,X3)
& iext(uri_ex_q,X3,uri_ex_s) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',testcase_premise_fullish_002_Existential_Blank_Nodes) ).
fof(i_0_2,negated_conjecture,
~ ? [X1,X2] :
( iext(uri_ex_p,X1,X2)
& iext(uri_ex_q,X2,X1) ),
inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_002_Existential_Blank_Nodes]) ).
fof(i_0_3,negated_conjecture,
! [X7,X8] :
( ~ iext(uri_ex_p,X7,X8)
| ~ iext(uri_ex_q,X8,X7) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_2])]) ).
fof(i_0_4,plain,
( iext(uri_ex_p,uri_ex_s,esk1_0)
& iext(uri_ex_q,esk1_0,uri_ex_s) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_002_Existential_Blank_Nodes])]) ).
cnf(i_0_5,negated_conjecture,
( ~ iext(uri_ex_p,X1,X2)
| ~ iext(uri_ex_q,X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_3]),
[final] ).
cnf(i_0_6,plain,
iext(uri_ex_q,esk1_0,uri_ex_s),
inference(split_conjunct,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_7,plain,
iext(uri_ex_p,uri_ex_s,esk1_0),
inference(split_conjunct,[status(thm)],[i_0_4]),
[final] ).
cnf(i_0_8,plain,
$false,
inference(scs_inference,[],[i_0_7,i_0_6,i_0_5]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWB002+2 : TPTP v9.2.1. Released v5.2.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.32 % Computer : n025.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Tue May 5 04:05:58 EDT 2026
% 0.14/0.32 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 0.24/1.61 % Version : CSE_E---1.7
% 0.24/1.61 % Problem : theBenchmark.p
% 0.24/1.61 % SZS status Theorem for theBenchmark.p
% 0.24/1.61 % SZS output start CNFRefutation
% See solution above
% 0.24/1.62 % Total time : 1.271s
%------------------------------------------------------------------------------