TSTP Solution File: ALG211+1 by ConnectPP---0.3.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.3.0
% Problem  : ALG211+1 : TPTP v8.1.2. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n002.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 13:59:08 EDT 2024

% Result   : Theorem 0.12s 0.34s
% Output   : Proof 0.12s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : ALG211+1 : TPTP v8.1.2. Released v3.1.0.
% 0.04/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33  % Computer : n002.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Thu Mar 21 03:05:08 EDT 2024
% 0.12/0.34  % CPUTime  : 
% 0.12/0.34  % SZS status Theorem for theBenchmark
% 0.12/0.34  % SZS output start Proof for theBenchmark
% 0.12/0.34  
% 0.12/0.34  % Formula: basis_of ( axiom ) converted to clauses:
% 0.12/0.34  cnf(basis_of-1, axiom, ( ~basis_of(_u1, _u0) | lin_ind_subset(_u1, _u0) )).
% 0.12/0.34  cnf(basis_of-2, axiom, ( ~basis_of(_u1, _u0) | a_subset_of(_u1, vec_to_class(_u0)) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: bg_2_2_5 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(bg_2_2_5-1, axiom, ( ~lin_ind_subset(_u5, _u3) | ~basis_of(_u4, _u3) | a_subset_of(skolem1(_u5, _u4, _u3), _u4) )).
% 0.12/0.34  cnf(bg_2_2_5-2, axiom, ( ~lin_ind_subset(_u5, _u3) | ~basis_of(_u4, _u3) | basis_of(union(_u5, skolem1(_u5, _u4, _u3)), _u3) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: bg_remark_63_a ( axiom ) converted to clauses:
% 0.12/0.34  cnf(bg_remark_63_a-1, axiom, ( ~a_vector_space(_u7) | basis_of(skolem2(_u7), _u7) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: bg_2_4_a ( axiom ) converted to clauses:
% 0.12/0.34  cnf(bg_2_4_a-1, axiom, ( a_vector_space(_u9) | ~a_vector_subspace_of(_u9, _u8) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: bg_2_4_2 ( axiom ) converted to clauses:
% 0.12/0.34  cnf(bg_2_4_2-1, axiom, ( ~a_vector_subspace_of(_u12, _u11) | ~a_subset_of(_u10, vec_to_class(_u12)) | ~lin_ind_subset(_u10, _u12) | lin_ind_subset(_u10, _u11) )).
% 0.12/0.34  cnf(bg_2_4_2-2, axiom, ( ~a_vector_subspace_of(_u12, _u11) | ~a_subset_of(_u10, vec_to_class(_u12)) | ~lin_ind_subset(_u10, _u11) | lin_ind_subset(_u10, _u12) )).
% 0.12/0.34  
% 0.12/0.34  % Formula: bg_2_4_3 ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.34  cnf(bg_2_4_3-1, negated_conjecture, ( a_vector_subspace_of(skolem3, skolem4) )).
% 0.12/0.34  cnf(bg_2_4_3-2, negated_conjecture, ( a_vector_space(skolem4) )).
% 0.12/0.34  cnf(bg_2_4_3-3, negated_conjecture, ( ~basis_of(union(_u14, _u13), skolem4) | ~basis_of(_u14, skolem3) )).
% 0.12/0.34  
% 0.12/0.34  % Problem matrix:
% 0.12/0.34  cnf(matrix-0, plain, ( ~basis_of(_u1, _u0) | lin_ind_subset(_u1, _u0) )).
% 0.12/0.34  cnf(matrix-1, plain, ( ~basis_of(_u1, _u0) | a_subset_of(_u1, vec_to_class(_u0)) )).
% 0.12/0.34  cnf(matrix-2, plain, ( ~lin_ind_subset(_u5, _u3) | ~basis_of(_u4, _u3) | a_subset_of(skolem1(_u5, _u4, _u3), _u4) )).
% 0.12/0.34  cnf(matrix-3, plain, ( ~lin_ind_subset(_u5, _u3) | ~basis_of(_u4, _u3) | basis_of(union(_u5, skolem1(_u5, _u4, _u3)), _u3) )).
% 0.12/0.34  cnf(matrix-4, plain, ( ~a_vector_space(_u7) | basis_of(skolem2(_u7), _u7) )).
% 0.12/0.34  cnf(matrix-5, plain, ( a_vector_space(_u9) | ~a_vector_subspace_of(_u9, _u8) )).
% 0.12/0.34  cnf(matrix-6, plain, ( ~a_vector_subspace_of(_u12, _u11) | ~a_subset_of(_u10, vec_to_class(_u12)) | ~lin_ind_subset(_u10, _u12) | lin_ind_subset(_u10, _u11) )).
% 0.12/0.34  cnf(matrix-7, plain, ( ~a_vector_subspace_of(_u12, _u11) | ~a_subset_of(_u10, vec_to_class(_u12)) | ~lin_ind_subset(_u10, _u11) | lin_ind_subset(_u10, _u12) )).
% 0.12/0.34  cnf(matrix-8, plain, ( a_vector_subspace_of(skolem3, skolem4) )).
% 0.12/0.34  cnf(matrix-9, plain, ( a_vector_space(skolem4) )).
% 0.12/0.34  cnf(matrix-10, plain, ( ~basis_of(union(_u14, _u13), skolem4) | ~basis_of(_u14, skolem3) )).
% 0.12/0.34  
% 0.12/0.34  % Proof stack:
% 0.12/0.34  cnf(proof-stack, plain, 
% 0.12/0.34  proof_stack(
% 0.12/0.34  start(10), 
% 0.12/0.34  left_branch(0, 3, 2, 2), 
% 0.12/0.34  left_branch(0, 6, 3, 3), 
% 0.12/0.34  left_branch(0, 8, 0, 4), 
% 0.12/0.34  right_branch(4), 
% 0.12/0.34  left_branch(0, 0, 1, 5), 
% 0.12/0.34  left_branch(0, 4, 1, 6), 
% 0.12/0.34  left_branch(0, 5, 0, 7), 
% 0.12/0.34  left_branch(0, 8, 0, 8), 
% 0.12/0.34  right_branch(8), 
% 0.12/0.34  right_branch(7), 
% 0.12/0.34  right_branch(6), 
% 0.12/0.34  right_branch(5), 
% 0.12/0.34  left_branch(0, 1, 1, 6), 
% 0.12/0.34  left_branch(0, 4, 1, 7), 
% 0.12/0.34  left_branch(0, 5, 0, 8), 
% 0.12/0.34  left_branch(0, 8, 0, 9), 
% 0.12/0.34  right_branch(9), 
% 0.12/0.34  right_branch(8), 
% 0.12/0.34  right_branch(7), 
% 0.12/0.34  right_branch(6), 
% 0.12/0.34  right_branch(3), 
% 0.12/0.34  left_branch(0, 4, 1, 4), 
% 0.12/0.34  left_branch(0, 9, 0, 5), 
% 0.12/0.34  right_branch(5), 
% 0.12/0.34  right_branch(4), 
% 0.12/0.34  right_branch(2), 
% 0.12/0.34  left_branch(0, 4, 1, 3), 
% 0.12/0.34  left_branch(0, 5, 0, 4), 
% 0.12/0.34  left_branch(0, 8, 0, 5), 
% 0.12/0.34  right_branch(5), 
% 0.12/0.34  right_branch(4), 
% 0.12/0.34  right_branch(3)
% 0.12/0.34  )).
% 0.12/0.34  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------