%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : SWB002+2 : TPTP v9.3.1. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n011.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 : Tue Sep 29 12:59:40 PM UTC 2026
% Result : Theorem 0.12s 0.43s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWB002+2 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.04 % Command : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n011.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Mon Sep 28 06:54:15 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.43 Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.12/0.43
% 0.12/0.43 % SZS status Theorem
% 0.12/0.43
% 0.12/0.43 % SZS output start Proof
% 0.12/0.43 Axiom 1 (testcase_premise_fullish_002_Existential_Blank_Nodes): iext(uri_ex_p, uri_ex_s, bnode_o) = true.
% 0.12/0.43 Axiom 2 (testcase_premise_fullish_002_Existential_Blank_Nodes_1): iext(uri_ex_q, bnode_o, uri_ex_s) = true.
% 0.12/0.43
% 0.12/0.43 Goal 1 (testcase_conclusion_fullish_002_Existential_Blank_Nodes): tuple(iext(uri_ex_p, X, Y), iext(uri_ex_q, Y, X)) = tuple(true, true).
% 0.12/0.43 The goal is true when:
% 0.12/0.43 X = uri_ex_s
% 0.12/0.43 Y = bnode_o
% 0.12/0.43
% 0.12/0.43 Proof:
% 0.12/0.43 tuple(iext(uri_ex_p, uri_ex_s, bnode_o), iext(uri_ex_q, bnode_o, uri_ex_s))
% 0.12/0.43 = { by axiom 1 (testcase_premise_fullish_002_Existential_Blank_Nodes) }
% 0.12/0.43 tuple(true, iext(uri_ex_q, bnode_o, uri_ex_s))
% 0.12/0.43 = { by axiom 2 (testcase_premise_fullish_002_Existential_Blank_Nodes_1) }
% 0.12/0.43 tuple(true, true)
% 0.12/0.43 % SZS output end Proof
% 0.12/0.43
% 0.12/0.43 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------