TSTP Solution File: SYN551+3 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SYN551+3 : TPTP v8.1.2. Bugfixed v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n022.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:43:05 EDT 2024
% Result : Theorem 16.67s 16.87s
% Output : Proof 16.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN551+3 : TPTP v8.1.2. Bugfixed v3.1.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34 % Computer : n022.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 : Wed Mar 20 23:12:42 EDT 2024
% 0.12/0.34 % CPUTime :
% 16.67/16.87 % SZS status Theorem for theBenchmark
% 16.67/16.87 % SZS output start Proof for theBenchmark
% 16.67/16.87
% 16.67/16.87 % Formula: prove_this_cute_thing ( conjecture ) (definitionally) converted to clauses:
% 16.67/16.87 cnf(prove_this_cute_thing-1, negated_conjecture, ( ~_def1(_u0, _u3) | ~_def3(_u4, _u7) )).
% 16.67/16.87 cnf(prove_this_cute_thing-2, negated_conjecture, ( _def1(_u0, _u3) | ( skolem1 = f(g(skolem1))) )).
% 16.67/16.87 cnf(prove_this_cute_thing-3, negated_conjecture, ( _def1(_u0, _u3) | ( _u0 != f(g(_u0))) | ( _u0 = skolem1) )).
% 16.67/16.87 cnf(prove_this_cute_thing-4, negated_conjecture, ( _def1(_u0, _u3) | ( _u3 != g(f(_u3))) | ~_def0(_u3) )).
% 16.67/16.87 cnf(prove_this_cute_thing-5, negated_conjecture, ( _def0(_u3) | ( skolem2(_u3) = g(f(skolem2(_u3)))) )).
% 16.67/16.87 cnf(prove_this_cute_thing-6, negated_conjecture, ( _def0(_u3) | ( skolem2(_u3) != _u3) )).
% 16.67/16.87 cnf(prove_this_cute_thing-7, negated_conjecture, ( _def3(_u4, _u7) | ( skolem3 = g(f(skolem3))) )).
% 16.67/16.87 cnf(prove_this_cute_thing-8, negated_conjecture, ( _def3(_u4, _u7) | ( _u4 != g(f(_u4))) | ( _u4 = skolem3) )).
% 16.67/16.87 cnf(prove_this_cute_thing-9, negated_conjecture, ( _def3(_u4, _u7) | ( _u7 != f(g(_u7))) | ~_def2(_u7) )).
% 16.67/16.87 cnf(prove_this_cute_thing-10, negated_conjecture, ( _def2(_u7) | ( skolem4(_u7) = f(g(skolem4(_u7)))) )).
% 16.67/16.87 cnf(prove_this_cute_thing-11, negated_conjecture, ( _def2(_u7) | ( skolem4(_u7) != _u7) )).
% 16.67/16.87
% 16.67/16.87 % Problem matrix:
% 16.67/16.87 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 16.67/16.87 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 16.67/16.87 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 16.67/16.87 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( g(__eqx_0) = g(__eqy_0)) )).
% 16.67/16.87 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( f(__eqx_0) = f(__eqy_0)) )).
% 16.67/16.87 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( skolem2(__eqx_0) = skolem2(__eqy_0)) )).
% 16.67/16.87 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( skolem4(__eqx_0) = skolem4(__eqy_0)) )).
% 16.67/16.87 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~_def0(__eqx_0) | _def0(__eqy_0) )).
% 16.67/16.87 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~_def1(__eqx_0, __eqx_1) | _def1(__eqy_0, __eqy_1) )).
% 16.67/16.87 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~_def2(__eqx_0) | _def2(__eqy_0) )).
% 16.67/16.87 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~_def3(__eqx_0, __eqx_1) | _def3(__eqy_0, __eqy_1) )).
% 16.67/16.87 cnf(matrix-11, plain, ( ~_def1(_u0, _u3) | ~_def3(_u4, _u7) )).
% 16.67/16.87 cnf(matrix-12, plain, ( _def1(_u0, _u3) | ( skolem1 = f(g(skolem1))) )).
% 16.67/16.87 cnf(matrix-13, plain, ( _def1(_u0, _u3) | ( _u0 != f(g(_u0))) | ( _u0 = skolem1) )).
% 16.67/16.87 cnf(matrix-14, plain, ( _def1(_u0, _u3) | ( _u3 != g(f(_u3))) | ~_def0(_u3) )).
% 16.67/16.87 cnf(matrix-15, plain, ( _def0(_u3) | ( skolem2(_u3) = g(f(skolem2(_u3)))) )).
% 16.67/16.87 cnf(matrix-16, plain, ( _def0(_u3) | ( skolem2(_u3) != _u3) )).
% 16.67/16.87 cnf(matrix-17, plain, ( _def3(_u4, _u7) | ( skolem3 = g(f(skolem3))) )).
% 16.67/16.87 cnf(matrix-18, plain, ( _def3(_u4, _u7) | ( _u4 != g(f(_u4))) | ( _u4 = skolem3) )).
% 16.67/16.87 cnf(matrix-19, plain, ( _def3(_u4, _u7) | ( _u7 != f(g(_u7))) | ~_def2(_u7) )).
% 16.67/16.87 cnf(matrix-20, plain, ( _def2(_u7) | ( skolem4(_u7) = f(g(skolem4(_u7)))) )).
% 16.67/16.87 cnf(matrix-21, plain, ( _def2(_u7) | ( skolem4(_u7) != _u7) )).
% 16.67/16.87
% 16.67/16.87 % Proof stack:
% 16.67/16.87 cnf(proof-stack, plain,
% 16.67/16.87 proof_stack(
% 16.67/16.87 start(11),
% 16.67/16.87 left_branch(0, 14, 0, 2),
% 16.67/16.87 left_branch(0, 16, 0, 3),
% 16.67/16.87 left_branch(0, 2, 2, 4),
% 16.67/16.87 left_branch(0, 15, 1, 5),
% 16.67/16.87 reduction(0, 1),
% 16.67/16.87 right_branch(5),
% 16.67/16.87 left_branch(0, 3, 1, 6),
% 16.67/16.87 left_branch(0, 13, 2, 7),
% 16.67/16.87 reduction(0, 0),
% 16.67/16.87 left_branch(0, 4, 1, 9),
% 16.67/16.87 lemmata(0, 0),
% 16.67/16.87 right_branch(9),
% 16.67/16.87 right_branch(7),
% 16.67/16.87 right_branch(6),
% 16.67/16.87 right_branch(4),
% 16.67/16.87 right_branch(3),
% 16.67/16.87 left_branch(0, 3, 1, 4),
% 16.67/16.87 left_branch(0, 12, 1, 5),
% 16.67/16.87 reduction(0, 0),
% 16.67/16.87 right_branch(5),
% 16.67/16.87 right_branch(4),
% 16.67/16.87 right_branch(2),
% 16.67/16.87 left_branch(0, 19, 0, 3),
% 16.67/16.87 left_branch(0, 21, 0, 4),
% 16.67/16.87 left_branch(0, 2, 2, 5),
% 16.67/16.87 left_branch(0, 20, 1, 6),
% 16.67/16.87 reduction(0, 1),
% 16.67/16.87 right_branch(6),
% 16.67/16.87 left_branch(0, 4, 1, 7),
% 16.67/16.87 left_branch(0, 18, 2, 8),
% 16.67/16.87 reduction(0, 0),
% 16.67/16.87 left_branch(0, 3, 1, 10),
% 16.67/16.87 lemmata(0, 1),
% 16.67/16.87 right_branch(10),
% 16.67/16.87 right_branch(8),
% 16.67/16.87 right_branch(7),
% 16.67/16.87 right_branch(5),
% 16.67/16.87 right_branch(4),
% 16.67/16.87 left_branch(0, 4, 1, 5),
% 16.67/16.87 left_branch(0, 17, 1, 6),
% 16.67/16.87 reduction(0, 0),
% 16.67/16.87 right_branch(6),
% 16.67/16.87 right_branch(5),
% 16.67/16.87 right_branch(3)
% 16.67/16.87 )).
% 16.67/16.87 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------