TSTP Solution File: LCL893+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : LCL893+1 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n008.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:10:38 EST 2024
% Result : Theorem 11.43s 11.59s
% Output : Proof 11.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LCL893+1 : TPTP v8.1.2. Released v5.5.0.
% 0.03/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.32 % Computer : n008.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sun Mar 3 14:28:30 EST 2024
% 0.12/0.32 % CPUTime :
% 11.43/11.59 % SZS status Theorem for theBenchmark
% 11.43/11.59 % SZS output start Proof for theBenchmark
% 11.43/11.59
% 11.43/11.59 % Formula: sos_01 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_01-1, axiom, ( ( +(+(_u2, _u1), _u0) = +(_u2, +(_u1, _u0))) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_02 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_02-1, axiom, ( ( +(_u4, _u3) = +(_u3, _u4)) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_03 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_03-1, axiom, ( ( +(_u5, 0) = _u5) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_04 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_04-1, axiom, ( ( +(_u6, 1) = 1) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_05 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_05-1, axiom, ( >=(_u7, _u7) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_06 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_06-1, axiom, ( ~>=(_u10, _u9) | ~>=(_u9, _u8) | >=(_u10, _u8) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_07 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_07-1, axiom, ( ~>=(_u12, _u11) | ~>=(_u11, _u12) | ( _u12 = _u11) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_08 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_08-1, axiom, ( ~>=(+(_u20, _u18), _u16) | >=(_u18, ==>(_u20, _u16)) )).
% 11.43/11.59 cnf(sos_08-2, axiom, ( ~>=(_u19, ==>(_u21, _u17)) | >=(+(_u21, _u19), _u17) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_09 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_09-1, axiom, ( >=(_u22, 0) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_10 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_10-1, axiom, ( ~>=(_u25, _u24) | >=(+(_u25, _u23), +(_u24, _u23)) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_11 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_11-1, axiom, ( ~>=(_u28, _u27) | >=(==>(_u27, _u26), ==>(_u28, _u26)) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_12 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_12-1, axiom, ( ~>=(_u31, _u30) | >=(==>(_u29, _u31), ==>(_u29, _u30)) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_13 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_13-1, axiom, ( ( +(_u33, ==>(_u33, _u32)) = +(_u32, ==>(_u32, _u33))) )).
% 11.43/11.59
% 11.43/11.59 % Formula: sos_14 ( axiom ) converted to clauses:
% 11.43/11.59 cnf(sos_14-1, axiom, ( ( h(_u34) = ==>(h(_u34), _u34)) )).
% 11.43/11.59
% 11.43/11.59 % Formula: goals_15 ( conjecture ) converted to clauses:
% 11.43/11.59 cnf(goals_15-1, negated_conjecture, ( ( h(skolem1) = skolem1) )).
% 11.43/11.59 cnf(goals_15-2, negated_conjecture, ( ( skolem1 != 0) )).
% 11.43/11.59
% 11.43/11.59 % Problem matrix:
% 11.43/11.59 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 11.43/11.59 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 11.43/11.59 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 11.43/11.59 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( +(__eqx_0, __eqx_1) = +(__eqy_0, __eqy_1)) )).
% 11.43/11.59 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( ==>(__eqx_0, __eqx_1) = ==>(__eqy_0, __eqy_1)) )).
% 11.43/11.59 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( h(__eqx_0) = h(__eqy_0)) )).
% 11.43/11.59 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~>=(__eqx_0, __eqx_1) | >=(__eqy_0, __eqy_1) )).
% 11.43/11.59 cnf(matrix-7, plain, ( ( +(+(_u2, _u1), _u0) = +(_u2, +(_u1, _u0))) )).
% 11.43/11.59 cnf(matrix-8, plain, ( ( +(_u4, _u3) = +(_u3, _u4)) )).
% 11.43/11.59 cnf(matrix-9, plain, ( ( +(_u5, 0) = _u5) )).
% 11.43/11.59 cnf(matrix-10, plain, ( ( +(_u6, 1) = 1) )).
% 11.43/11.59 cnf(matrix-11, plain, ( >=(_u7, _u7) )).
% 11.43/11.59 cnf(matrix-12, plain, ( ~>=(_u10, _u9) | ~>=(_u9, _u8) | >=(_u10, _u8) )).
% 11.43/11.59 cnf(matrix-13, plain, ( ~>=(_u12, _u11) | ~>=(_u11, _u12) | ( _u12 = _u11) )).
% 11.43/11.59 cnf(matrix-14, plain, ( ~>=(+(_u20, _u18), _u16) | >=(_u18, ==>(_u20, _u16)) )).
% 11.43/11.59 cnf(matrix-15, plain, ( ~>=(_u19, ==>(_u21, _u17)) | >=(+(_u21, _u19), _u17) )).
% 11.43/11.59 cnf(matrix-16, plain, ( >=(_u22, 0) )).
% 11.43/11.59 cnf(matrix-17, plain, ( ~>=(_u25, _u24) | >=(+(_u25, _u23), +(_u24, _u23)) )).
% 11.43/11.59 cnf(matrix-18, plain, ( ~>=(_u28, _u27) | >=(==>(_u27, _u26), ==>(_u28, _u26)) )).
% 11.43/11.59 cnf(matrix-19, plain, ( ~>=(_u31, _u30) | >=(==>(_u29, _u31), ==>(_u29, _u30)) )).
% 11.43/11.59 cnf(matrix-20, plain, ( ( +(_u33, ==>(_u33, _u32)) = +(_u32, ==>(_u32, _u33))) )).
% 11.43/11.59 cnf(matrix-21, plain, ( ( h(_u34) = ==>(h(_u34), _u34)) )).
% 11.43/11.59 cnf(matrix-22, plain, ( ( h(skolem1) = skolem1) )).
% 11.43/11.59 cnf(matrix-23, plain, ( ( skolem1 != 0) )).
% 11.43/11.59
% 11.43/11.59 % Proof stack:
% 11.43/11.59 cnf(proof-stack, plain,
% 11.43/11.59 proof_stack(
% 11.43/11.59 start(23),
% 11.43/11.59 left_branch(0, 13, 2, 2),
% 11.43/11.59 left_branch(0, 16, 0, 3),
% 11.43/11.59 right_branch(3),
% 11.43/11.59 left_branch(0, 12, 2, 4),
% 11.43/11.59 left_branch(0, 14, 1, 5),
% 11.43/11.59 left_branch(0, 6, 3, 6),
% 11.43/11.59 left_branch(0, 0, 0, 7),
% 11.43/11.59 right_branch(7),
% 11.43/11.59 left_branch(0, 11, 0, 8),
% 11.43/11.59 right_branch(8),
% 11.43/11.59 left_branch(0, 9, 0, 9),
% 11.43/11.59 right_branch(9),
% 11.43/11.59 right_branch(6),
% 11.43/11.59 right_branch(5),
% 11.43/11.59 left_branch(0, 6, 3, 6),
% 11.43/11.59 left_branch(0, 4, 2, 7),
% 11.43/11.59 left_branch(0, 22, 0, 8),
% 11.43/11.59 right_branch(8),
% 11.43/11.59 left_branch(0, 0, 0, 9),
% 11.43/11.59 right_branch(9),
% 11.43/11.59 right_branch(7),
% 11.43/11.59 left_branch(0, 6, 3, 8),
% 11.43/11.59 left_branch(0, 21, 0, 9),
% 11.43/11.59 right_branch(9),
% 11.43/11.59 left_branch(0, 11, 0, 10),
% 11.43/11.59 right_branch(10),
% 11.43/11.59 left_branch(0, 22, 0, 11),
% 11.43/11.59 right_branch(11),
% 11.43/11.59 right_branch(8),
% 11.43/11.59 left_branch(0, 13, 2, 9),
% 11.43/11.59 left_branch(0, 11, 0, 10),
% 11.43/11.59 right_branch(10),
% 11.43/11.59 lemmata(0, 4),
% 11.43/11.59 right_branch(9),
% 11.43/11.59 right_branch(6),
% 11.43/11.59 right_branch(4),
% 11.43/11.59 right_branch(2)
% 11.43/11.59 )).
% 11.43/11.59 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------