TSTP Solution File: ALG201+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n009.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:07 EDT 2024
% Result : Theorem 0.12s 0.37s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ALG201+1 : TPTP v8.1.2. Released v2.7.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34 % Computer : n009.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 : Thu Mar 21 02:44:44 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.37 % SZS status Theorem for theBenchmark
% 0.12/0.37 % SZS output start Proof for theBenchmark
% 0.12/0.37
% 0.12/0.37 % Formula: ax1 ( axiom ) converted to clauses:
% 0.12/0.37 cnf(ax1-1, axiom, ( ~sorti1(_u1) | ~sorti1(_u0) | sorti1(op1(_u1, _u0)) )).
% 0.12/0.37
% 0.12/0.37 % Formula: ax2 ( axiom ) converted to clauses:
% 0.12/0.37 cnf(ax2-1, axiom, ( ~sorti2(_u3) | ~sorti2(_u2) | sorti2(op2(_u3, _u2)) )).
% 0.12/0.37
% 0.12/0.37 % Formula: ax3 ( axiom ) converted to clauses:
% 0.12/0.37 cnf(ax3-1, axiom, ( ~sorti1(_u4) | ( op1(_u4, _u4) != _u4) )).
% 0.12/0.37
% 0.12/0.37 % Formula: ax4 ( axiom ) converted to clauses:
% 0.12/0.37 cnf(ax4-1, axiom, ( sorti2(skolem1) )).
% 0.12/0.37 cnf(ax4-2, axiom, ( ( op2(skolem1, skolem1) = skolem1) )).
% 0.12/0.37
% 0.12/0.37 % Formula: co1 ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.37 cnf(co1-1, negated_conjecture, ( ~sorti1(_u6) | sorti2(h(_u6)) )).
% 0.12/0.37 cnf(co1-2, negated_conjecture, ( ~sorti2(_u7) | sorti1(j(_u7)) )).
% 0.12/0.37 cnf(co1-3, negated_conjecture, ( ~sorti1(_u9) | ~sorti1(_u8) | ( h(op1(_u9, _u8)) = op2(h(_u9), h(_u8))) )).
% 0.12/0.37 cnf(co1-4, negated_conjecture, ( ~sorti2(_u11) | ~sorti2(_u10) | ( j(op2(_u11, _u10)) = op1(j(_u11), j(_u10))) )).
% 0.12/0.37 cnf(co1-5, negated_conjecture, ( ~sorti2(_u12) | ( h(j(_u12)) = _u12) )).
% 0.12/0.37 cnf(co1-6, negated_conjecture, ( ~sorti1(_u13) | ( j(h(_u13)) = _u13) )).
% 0.12/0.37
% 0.12/0.37 % Problem matrix:
% 0.12/0.37 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.12/0.37 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.12/0.37 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.12/0.37 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( op1(__eqx_0, __eqx_1) = op1(__eqy_0, __eqy_1)) )).
% 0.12/0.37 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( op2(__eqx_0, __eqx_1) = op2(__eqy_0, __eqy_1)) )).
% 0.12/0.37 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( h(__eqx_0) = h(__eqy_0)) )).
% 0.12/0.37 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( j(__eqx_0) = j(__eqy_0)) )).
% 0.12/0.37 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~sorti1(__eqx_0) | sorti1(__eqy_0) )).
% 0.12/0.37 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~sorti2(__eqx_0) | sorti2(__eqy_0) )).
% 0.12/0.37 cnf(matrix-9, plain, ( ~sorti1(_u1) | ~sorti1(_u0) | sorti1(op1(_u1, _u0)) )).
% 0.12/0.37 cnf(matrix-10, plain, ( ~sorti2(_u3) | ~sorti2(_u2) | sorti2(op2(_u3, _u2)) )).
% 0.12/0.37 cnf(matrix-11, plain, ( ~sorti1(_u4) | ( op1(_u4, _u4) != _u4) )).
% 0.12/0.37 cnf(matrix-12, plain, ( sorti2(skolem1) )).
% 0.12/0.37 cnf(matrix-13, plain, ( ( op2(skolem1, skolem1) = skolem1) )).
% 0.12/0.37 cnf(matrix-14, plain, ( ~sorti1(_u6) | sorti2(h(_u6)) )).
% 0.12/0.37 cnf(matrix-15, plain, ( ~sorti2(_u7) | sorti1(j(_u7)) )).
% 0.12/0.37 cnf(matrix-16, plain, ( ~sorti1(_u9) | ~sorti1(_u8) | ( h(op1(_u9, _u8)) = op2(h(_u9), h(_u8))) )).
% 0.12/0.37 cnf(matrix-17, plain, ( ~sorti2(_u11) | ~sorti2(_u10) | ( j(op2(_u11, _u10)) = op1(j(_u11), j(_u10))) )).
% 0.12/0.37 cnf(matrix-18, plain, ( ~sorti2(_u12) | ( h(j(_u12)) = _u12) )).
% 0.12/0.37 cnf(matrix-19, plain, ( ~sorti1(_u13) | ( j(h(_u13)) = _u13) )).
% 0.12/0.37
% 0.12/0.37 % Proof stack:
% 0.12/0.37 cnf(proof-stack, plain,
% 0.12/0.37 proof_stack(
% 0.12/0.37 start(11),
% 0.12/0.37 left_branch(0, 15, 1, 2),
% 0.12/0.37 left_branch(0, 12, 0, 3),
% 0.12/0.37 right_branch(3),
% 0.12/0.37 right_branch(2),
% 0.12/0.37 left_branch(0, 2, 2, 3),
% 0.12/0.37 left_branch(0, 1, 1, 4),
% 0.12/0.37 left_branch(0, 17, 2, 5),
% 0.12/0.37 left_branch(0, 12, 0, 6),
% 0.12/0.37 right_branch(6),
% 0.12/0.37 lemmata(0, 1),
% 0.12/0.37 right_branch(5),
% 0.12/0.37 right_branch(4),
% 0.12/0.37 left_branch(0, 6, 1, 5),
% 0.12/0.37 left_branch(0, 13, 0, 6),
% 0.12/0.37 right_branch(6),
% 0.12/0.37 right_branch(5),
% 0.12/0.37 right_branch(3)
% 0.12/0.37 )).
% 0.12/0.37 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------