TSTP Solution File: SYN319+1 by ConnectPP---0.2.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SYN319+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n029.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 : Wed Mar  6 09:27:33 EST 2024

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SYN319+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Sun Mar  3 21:10:20 EST 2024
% 0.12/0.35  % CPUTime  : 
% 0.12/0.35  % SZS status Theorem for theBenchmark
% 0.12/0.35  % SZS output start Proof for theBenchmark
% 0.12/0.35  
% 0.12/0.35  % Formula: church_46_2_5 ( conjecture ) converted to clauses:
% 0.12/0.35  cnf(church_46_2_5-1, negated_conjecture, ( ~big_h(skolem1) | big_f(skolem2) | big_g(skolem2) )).
% 0.12/0.35  cnf(church_46_2_5-2, negated_conjecture, ( ~big_h(skolem1) | ~big_h(skolem2) )).
% 0.12/0.35  cnf(church_46_2_5-3, negated_conjecture, ( ~big_h(skolem1) | big_h(_u8) )).
% 0.12/0.35  cnf(church_46_2_5-4, negated_conjecture, ( big_h(_u10) | ~big_f(_u10) )).
% 0.12/0.35  cnf(church_46_2_5-5, negated_conjecture, ( big_h(_u10) | ~big_g(_u10) )).
% 0.12/0.35  cnf(church_46_2_5-6, negated_conjecture, ( ~big_g(skolem3) | ~big_f(skolem4) )).
% 0.12/0.35  cnf(church_46_2_5-7, negated_conjecture, ( ~big_g(skolem3) | big_g(_u11) )).
% 0.12/0.35  cnf(church_46_2_5-8, negated_conjecture, ( big_f(_u9) | ~big_f(skolem4) )).
% 0.12/0.35  cnf(church_46_2_5-9, negated_conjecture, ( big_f(_u9) | big_g(_u11) )).
% 0.12/0.35  
% 0.12/0.35  % Problem matrix:
% 0.12/0.35  cnf(matrix-0, plain, ( ~big_h(skolem1) | big_f(skolem2) | big_g(skolem2) )).
% 0.12/0.35  cnf(matrix-1, plain, ( ~big_h(skolem1) | ~big_h(skolem2) )).
% 0.12/0.35  cnf(matrix-2, plain, ( ~big_h(skolem1) | big_h(_u8) )).
% 0.12/0.35  cnf(matrix-3, plain, ( big_h(_u10) | ~big_f(_u10) )).
% 0.12/0.35  cnf(matrix-4, plain, ( big_h(_u10) | ~big_g(_u10) )).
% 0.12/0.35  cnf(matrix-5, plain, ( ~big_g(skolem3) | ~big_f(skolem4) )).
% 0.12/0.35  cnf(matrix-6, plain, ( ~big_g(skolem3) | big_g(_u11) )).
% 0.12/0.35  cnf(matrix-7, plain, ( big_f(_u9) | ~big_f(skolem4) )).
% 0.12/0.35  cnf(matrix-8, plain, ( big_f(_u9) | big_g(_u11) )).
% 0.12/0.35  
% 0.12/0.35  % Proof stack:
% 0.12/0.35  cnf(proof-stack, plain, 
% 0.12/0.35  proof_stack(
% 0.12/0.35  start(1), 
% 0.12/0.35  left_branch(0, 4, 0, 2), 
% 0.12/0.35  left_branch(0, 8, 1, 3), 
% 0.12/0.35  left_branch(0, 3, 1, 4), 
% 0.12/0.35  reduction(0, 0), 
% 0.12/0.35  right_branch(4), 
% 0.12/0.35  right_branch(3), 
% 0.12/0.35  right_branch(2), 
% 0.12/0.35  left_branch(0, 4, 0, 3), 
% 0.12/0.35  left_branch(0, 8, 1, 4), 
% 0.12/0.35  left_branch(0, 3, 1, 5), 
% 0.12/0.35  reduction(0, 0), 
% 0.12/0.35  right_branch(5), 
% 0.12/0.35  right_branch(4), 
% 0.12/0.35  right_branch(3)
% 0.12/0.35  )).
% 0.12/0.35  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------