TSTP Solution File: SYN415+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SYN415+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 : n031.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:42:45 EDT 2024
% Result : Theorem 16.19s 16.38s
% Output : Proof 16.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYN415+1 : TPTP v8.1.2. Released v2.0.0.
% 0.03/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n031.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 : Wed Mar 20 23:42:48 EDT 2024
% 0.12/0.33 % CPUTime :
% 16.19/16.38 % SZS status Theorem for theBenchmark
% 16.19/16.38 % SZS output start Proof for theBenchmark
% 16.19/16.38
% 16.19/16.38 % Formula: kalish317 ( conjecture ) (definitionally) converted to clauses:
% 16.19/16.38 cnf(kalish317-1, negated_conjecture, ( ~_def1(_u1, _u4, _u2) | ~_def3(_u7, _u5) )).
% 16.19/16.38 cnf(kalish317-2, negated_conjecture, ( _def1(_u1, _u4, _u2) | f(skolem1) )).
% 16.19/16.38 cnf(kalish317-3, negated_conjecture, ( _def1(_u1, _u4, _u2) | ~f(_u2) | ~f(_u1) | ( _u2 = _u1) )).
% 16.19/16.38 cnf(kalish317-4, negated_conjecture, ( _def1(_u1, _u4, _u2) | ~f(_u4) | ~_def0(_u4) )).
% 16.19/16.38 cnf(kalish317-5, negated_conjecture, ( _def0(_u4) | f(skolem2(_u4)) )).
% 16.19/16.38 cnf(kalish317-6, negated_conjecture, ( _def0(_u4) | ( _u4 != skolem2(_u4)) )).
% 16.19/16.38 cnf(kalish317-7, negated_conjecture, ( _def3(_u7, _u5) | f(skolem3) )).
% 16.19/16.38 cnf(kalish317-8, negated_conjecture, ( _def3(_u7, _u5) | ~f(_u5) | ( skolem3 = _u5) )).
% 16.19/16.38 cnf(kalish317-9, negated_conjecture, ( _def3(_u7, _u5) | ~f(_u7) | ~_def2 )).
% 16.19/16.38 cnf(kalish317-10, negated_conjecture, ( _def2 | f(skolem4) )).
% 16.19/16.38 cnf(kalish317-11, negated_conjecture, ( _def2 | f(skolem5) )).
% 16.19/16.38 cnf(kalish317-12, negated_conjecture, ( _def2 | ( skolem4 != skolem5) )).
% 16.19/16.38
% 16.19/16.38 % Problem matrix:
% 16.19/16.38 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 16.19/16.38 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 16.19/16.38 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 16.19/16.38 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 16.19/16.38 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ~f(__eqx_0) | f(__eqy_0) )).
% 16.19/16.38 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~_def0(__eqx_0) | _def0(__eqy_0) )).
% 16.19/16.38 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~_def1(__eqx_0, __eqx_1, __eqx_2) | _def1(__eqy_0, __eqy_1, __eqy_2) )).
% 16.19/16.38 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~_def3(__eqx_0, __eqx_1) | _def3(__eqy_0, __eqy_1) )).
% 16.19/16.38 cnf(matrix-8, plain, ( ~_def1(_u1, _u4, _u2) | ~_def3(_u7, _u5) )).
% 16.19/16.38 cnf(matrix-9, plain, ( _def1(_u1, _u4, _u2) | f(skolem1) )).
% 16.19/16.38 cnf(matrix-10, plain, ( _def1(_u1, _u4, _u2) | ~f(_u2) | ~f(_u1) | ( _u2 = _u1) )).
% 16.19/16.38 cnf(matrix-11, plain, ( _def1(_u1, _u4, _u2) | ~f(_u4) | ~_def0(_u4) )).
% 16.19/16.38 cnf(matrix-12, plain, ( _def0(_u4) | f(skolem2(_u4)) )).
% 16.19/16.38 cnf(matrix-13, plain, ( _def0(_u4) | ( _u4 != skolem2(_u4)) )).
% 16.19/16.38 cnf(matrix-14, plain, ( _def3(_u7, _u5) | f(skolem3) )).
% 16.19/16.38 cnf(matrix-15, plain, ( _def3(_u7, _u5) | ~f(_u5) | ( skolem3 = _u5) )).
% 16.19/16.38 cnf(matrix-16, plain, ( _def3(_u7, _u5) | ~f(_u7) | ~_def2 )).
% 16.19/16.38 cnf(matrix-17, plain, ( _def2 | f(skolem4) )).
% 16.19/16.38 cnf(matrix-18, plain, ( _def2 | f(skolem5) )).
% 16.19/16.38 cnf(matrix-19, plain, ( _def2 | ( skolem4 != skolem5) )).
% 16.19/16.38
% 16.19/16.38 % Proof stack:
% 16.19/16.38 cnf(proof-stack, plain,
% 16.19/16.38 proof_stack(
% 16.19/16.38 start(18),
% 16.19/16.38 left_branch(0, 16, 2, 2),
% 16.19/16.38 left_branch(0, 8, 1, 3),
% 16.19/16.38 left_branch(0, 11, 0, 4),
% 16.19/16.38 left_branch(0, 13, 0, 5),
% 16.19/16.38 left_branch(0, 10, 3, 6),
% 16.19/16.38 reduction(0, 2),
% 16.19/16.38 left_branch(0, 12, 1, 8),
% 16.19/16.38 reduction(0, 3),
% 16.19/16.38 right_branch(8),
% 16.19/16.38 left_branch(0, 9, 1, 9),
% 16.19/16.38 reduction(0, 2),
% 16.19/16.38 right_branch(9),
% 16.19/16.38 right_branch(6),
% 16.19/16.38 right_branch(5),
% 16.19/16.38 left_branch(0, 9, 1, 6),
% 16.19/16.38 reduction(0, 2),
% 16.19/16.38 right_branch(6),
% 16.19/16.38 right_branch(4),
% 16.19/16.38 right_branch(3),
% 16.19/16.38 left_branch(0, 9, 1, 4),
% 16.19/16.38 left_branch(0, 8, 0, 5),
% 16.19/16.38 left_branch(0, 16, 0, 6),
% 16.19/16.38 reduction(0, 0),
% 16.19/16.38 left_branch(0, 14, 1, 8),
% 16.19/16.38 reduction(0, 3),
% 16.19/16.38 right_branch(8),
% 16.19/16.38 right_branch(6),
% 16.19/16.38 right_branch(5),
% 16.19/16.38 right_branch(4),
% 16.19/16.38 right_branch(2),
% 16.19/16.38 left_branch(0, 15, 1, 3),
% 16.19/16.38 left_branch(0, 8, 1, 4),
% 16.19/16.38 left_branch(0, 11, 0, 5),
% 16.19/16.38 left_branch(0, 13, 0, 6),
% 16.19/16.38 left_branch(0, 10, 3, 7),
% 16.19/16.38 reduction(0, 2),
% 16.19/16.38 left_branch(0, 12, 1, 9),
% 16.19/16.38 reduction(0, 3),
% 16.19/16.38 right_branch(9),
% 16.19/16.38 reduction(0, 0),
% 16.19/16.38 right_branch(7),
% 16.19/16.38 right_branch(6),
% 16.19/16.38 reduction(0, 0),
% 16.19/16.38 right_branch(5),
% 16.19/16.38 right_branch(4),
% 16.19/16.38 left_branch(0, 7, 0, 5),
% 16.19/16.38 left_branch(0, 8, 1, 6),
% 16.19/16.38 left_branch(0, 10, 0, 7),
% 16.19/16.38 left_branch(0, 19, 1, 8),
% 16.19/16.38 lemmata(0, 0),
% 16.19/16.38 right_branch(8),
% 16.19/16.38 reduction(0, 0),
% 16.19/16.38 left_branch(0, 17, 1, 10),
% 16.19/16.38 lemmata(0, 0),
% 16.19/16.38 right_branch(10),
% 16.19/16.38 right_branch(7),
% 16.19/16.38 right_branch(6),
% 16.19/16.38 left_branch(0, 15, 0, 7),
% 16.19/16.38 left_branch(0, 1, 0, 8),
% 16.19/16.38 left_branch(0, 2, 0, 9),
% 16.19/16.38 left_branch(0, 19, 1, 10),
% 16.19/16.38 lemmata(0, 0),
% 16.19/16.38 right_branch(10),
% 16.19/16.38 reduction(0, 1),
% 16.19/16.38 right_branch(9),
% 16.19/16.38 right_branch(8),
% 16.19/16.38 left_branch(0, 17, 1, 9),
% 16.19/16.38 lemmata(0, 0),
% 16.19/16.38 right_branch(9),
% 16.19/16.38 right_branch(7),
% 16.19/16.38 left_branch(0, 1, 1, 8),
% 16.19/16.38 left_branch(0, 0, 0, 9),
% 16.19/16.38 right_branch(9),
% 16.19/16.38 right_branch(8),
% 16.19/16.38 right_branch(5),
% 16.19/16.38 right_branch(3)
% 16.19/16.38 )).
% 16.19/16.38 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------