TSTP Solution File: SWB003+2 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n018.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 : Mon Mar 25 14:36:03 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWB003+2 : TPTP v8.1.2. Released v5.2.0.
% 0.08/0.14 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.35 % Computer : n018.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Mar 21 00:53:14 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % SZS status Theorem for theBenchmark
% 0.13/0.36 % SZS output start Proof for theBenchmark
% 0.13/0.36
% 0.13/0.36 % Formula: testcase_conclusion_fullish_003_Blank_Nodes_for_Literals ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.36 cnf(testcase_conclusion_fullish_003_Blank_Nodes_for_Literals-1, negated_conjecture, ( ~iext(uri_ex_p, uri_ex_s, _u0) )).
% 0.13/0.36
% 0.13/0.36 % Formula: testcase_premise_fullish_003_Blank_Nodes_for_Literals ( axiom ) converted to clauses:
% 0.13/0.36 cnf(testcase_premise_fullish_003_Blank_Nodes_for_Literals-1, axiom, ( iext(uri_ex_p, uri_ex_s, literal_plain(dat_str_foo)) )).
% 0.13/0.36
% 0.13/0.36 % Problem matrix:
% 0.13/0.36 cnf(matrix-0, plain, ( ~iext(uri_ex_p, uri_ex_s, _u0) )).
% 0.13/0.36 cnf(matrix-1, plain, ( iext(uri_ex_p, uri_ex_s, literal_plain(dat_str_foo)) )).
% 0.13/0.36
% 0.13/0.36 % Proof stack:
% 0.13/0.36 cnf(proof-stack, plain,
% 0.13/0.36 proof_stack(
% 0.13/0.36 start(0),
% 0.13/0.36 left_branch(0, 1, 0, 2),
% 0.13/0.36 right_branch(2)
% 0.13/0.36 )).
% 0.13/0.36 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------