TSTP Solution File: KLE067+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : KLE067+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n032.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:07:28 EST 2024
% Result : Theorem 12.12s 12.32s
% Output : Proof 12.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : KLE067+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 300
% 0.11/0.30 % DateTime : Mon Mar 4 11:29:39 EST 2024
% 0.11/0.30 % CPUTime :
% 12.12/12.32 % SZS status Theorem for theBenchmark
% 12.12/12.32 % SZS output start Proof for theBenchmark
% 12.12/12.32
% 12.12/12.32 % Formula: additive_commutativity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(additive_commutativity-1, axiom, ( ( addition(_u1, _u0) = addition(_u0, _u1)) )).
% 12.12/12.32
% 12.12/12.32 % Formula: additive_associativity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(additive_associativity-1, axiom, ( ( addition(_u2, addition(_u3, _u4)) = addition(addition(_u2, _u3), _u4)) )).
% 12.12/12.32
% 12.12/12.32 % Formula: additive_identity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(additive_identity-1, axiom, ( ( addition(_u5, zero) = _u5) )).
% 12.12/12.32
% 12.12/12.32 % Formula: additive_idempotence ( axiom ) converted to clauses:
% 12.12/12.32 cnf(additive_idempotence-1, axiom, ( ( addition(_u6, _u6) = _u6) )).
% 12.12/12.32
% 12.12/12.32 % Formula: multiplicative_associativity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(multiplicative_associativity-1, axiom, ( ( multiplication(_u9, multiplication(_u8, _u7)) = multiplication(multiplication(_u9, _u8), _u7)) )).
% 12.12/12.32
% 12.12/12.32 % Formula: multiplicative_right_identity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(multiplicative_right_identity-1, axiom, ( ( multiplication(_u10, one) = _u10) )).
% 12.12/12.32
% 12.12/12.32 % Formula: multiplicative_left_identity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(multiplicative_left_identity-1, axiom, ( ( multiplication(one, _u11) = _u11) )).
% 12.12/12.32
% 12.12/12.32 % Formula: right_distributivity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(right_distributivity-1, axiom, ( ( multiplication(_u14, addition(_u13, _u12)) = addition(multiplication(_u14, _u13), multiplication(_u14, _u12))) )).
% 12.12/12.32
% 12.12/12.32 % Formula: left_distributivity ( axiom ) converted to clauses:
% 12.12/12.32 cnf(left_distributivity-1, axiom, ( ( multiplication(addition(_u17, _u16), _u15) = addition(multiplication(_u17, _u15), multiplication(_u16, _u15))) )).
% 12.12/12.32
% 12.12/12.32 % Formula: right_annihilation ( axiom ) converted to clauses:
% 12.12/12.32 cnf(right_annihilation-1, axiom, ( ( multiplication(_u18, zero) = zero) )).
% 12.12/12.32
% 12.12/12.32 % Formula: left_annihilation ( axiom ) converted to clauses:
% 12.12/12.32 cnf(left_annihilation-1, axiom, ( ( multiplication(zero, _u19) = zero) )).
% 12.12/12.32
% 12.12/12.32 % Formula: order ( axiom ) converted to clauses:
% 12.12/12.32 cnf(order-1, axiom, ( ~leq(_u24, _u22) | ( addition(_u24, _u22) = _u22) )).
% 12.12/12.32 cnf(order-2, axiom, ( ( addition(_u25, _u23) != _u23) | leq(_u25, _u23) )).
% 12.12/12.32
% 12.12/12.32 % Formula: domain1 ( axiom ) converted to clauses:
% 12.12/12.32 cnf(domain1-1, axiom, ( ( addition(_u26, multiplication(domain(_u26), _u26)) = multiplication(domain(_u26), _u26)) )).
% 12.12/12.32
% 12.12/12.32 % Formula: domain2 ( axiom ) converted to clauses:
% 12.12/12.32 cnf(domain2-1, axiom, ( ( domain(multiplication(_u28, _u27)) = domain(multiplication(_u28, domain(_u27)))) )).
% 12.12/12.32
% 12.12/12.32 % Formula: domain3 ( axiom ) converted to clauses:
% 12.12/12.32 cnf(domain3-1, axiom, ( ( addition(domain(_u29), one) = one) )).
% 12.12/12.32
% 12.12/12.32 % Formula: domain4 ( axiom ) converted to clauses:
% 12.12/12.32 cnf(domain4-1, axiom, ( ( domain(zero) = zero) )).
% 12.12/12.32
% 12.12/12.32 % Formula: domain5 ( axiom ) converted to clauses:
% 12.12/12.32 cnf(domain5-1, axiom, ( ( domain(addition(_u31, _u30)) = addition(domain(_u31), domain(_u30))) )).
% 12.12/12.32
% 12.12/12.32 % Formula: goals ( conjecture ) converted to clauses:
% 12.12/12.32 cnf(goals-1, negated_conjecture, ( ( domain(addition(domain(skolem1), domain(skolem2))) != addition(domain(skolem1), domain(skolem2))) )).
% 12.12/12.32
% 12.12/12.32 % Problem matrix:
% 12.12/12.32 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.12/12.32 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.12/12.32 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.12/12.32 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( addition(__eqx_0, __eqx_1) = addition(__eqy_0, __eqy_1)) )).
% 12.12/12.32 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( multiplication(__eqx_0, __eqx_1) = multiplication(__eqy_0, __eqy_1)) )).
% 12.12/12.32 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( domain(__eqx_0) = domain(__eqy_0)) )).
% 12.12/12.32 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~leq(__eqx_0, __eqx_1) | leq(__eqy_0, __eqy_1) )).
% 12.12/12.32 cnf(matrix-7, plain, ( ( addition(_u1, _u0) = addition(_u0, _u1)) )).
% 12.12/12.32 cnf(matrix-8, plain, ( ( addition(_u2, addition(_u3, _u4)) = addition(addition(_u2, _u3), _u4)) )).
% 12.12/12.32 cnf(matrix-9, plain, ( ( addition(_u5, zero) = _u5) )).
% 12.12/12.32 cnf(matrix-10, plain, ( ( addition(_u6, _u6) = _u6) )).
% 12.12/12.32 cnf(matrix-11, plain, ( ( multiplication(_u9, multiplication(_u8, _u7)) = multiplication(multiplication(_u9, _u8), _u7)) )).
% 12.12/12.32 cnf(matrix-12, plain, ( ( multiplication(_u10, one) = _u10) )).
% 12.12/12.32 cnf(matrix-13, plain, ( ( multiplication(one, _u11) = _u11) )).
% 12.12/12.32 cnf(matrix-14, plain, ( ( multiplication(_u14, addition(_u13, _u12)) = addition(multiplication(_u14, _u13), multiplication(_u14, _u12))) )).
% 12.12/12.32 cnf(matrix-15, plain, ( ( multiplication(addition(_u17, _u16), _u15) = addition(multiplication(_u17, _u15), multiplication(_u16, _u15))) )).
% 12.12/12.32 cnf(matrix-16, plain, ( ( multiplication(_u18, zero) = zero) )).
% 12.12/12.32 cnf(matrix-17, plain, ( ( multiplication(zero, _u19) = zero) )).
% 12.12/12.32 cnf(matrix-18, plain, ( ~leq(_u24, _u22) | ( addition(_u24, _u22) = _u22) )).
% 12.12/12.32 cnf(matrix-19, plain, ( ( addition(_u25, _u23) != _u23) | leq(_u25, _u23) )).
% 12.12/12.32 cnf(matrix-20, plain, ( ( addition(_u26, multiplication(domain(_u26), _u26)) = multiplication(domain(_u26), _u26)) )).
% 12.12/12.32 cnf(matrix-21, plain, ( ( domain(multiplication(_u28, _u27)) = domain(multiplication(_u28, domain(_u27)))) )).
% 12.12/12.32 cnf(matrix-22, plain, ( ( addition(domain(_u29), one) = one) )).
% 12.12/12.32 cnf(matrix-23, plain, ( ( domain(zero) = zero) )).
% 12.12/12.32 cnf(matrix-24, plain, ( ( domain(addition(_u31, _u30)) = addition(domain(_u31), domain(_u30))) )).
% 12.12/12.32 cnf(matrix-25, plain, ( ( domain(addition(domain(skolem1), domain(skolem2))) != addition(domain(skolem1), domain(skolem2))) )).
% 12.12/12.32
% 12.12/12.32 % Proof stack:
% 12.12/12.32 cnf(proof-stack, plain,
% 12.12/12.32 proof_stack(
% 12.12/12.32 start(25),
% 12.12/12.32 left_branch(0, 2, 2, 2),
% 12.12/12.32 left_branch(0, 24, 0, 3),
% 12.12/12.32 right_branch(3),
% 12.12/12.32 left_branch(0, 3, 2, 4),
% 12.12/12.32 left_branch(0, 1, 1, 5),
% 12.12/12.32 left_branch(0, 2, 2, 6),
% 12.12/12.32 left_branch(0, 5, 1, 7),
% 12.12/12.32 left_branch(0, 1, 1, 8),
% 12.12/12.32 left_branch(0, 13, 0, 9),
% 12.12/12.32 right_branch(9),
% 12.12/12.32 right_branch(8),
% 12.12/12.32 right_branch(7),
% 12.12/12.32 left_branch(0, 2, 2, 8),
% 12.12/12.32 left_branch(0, 21, 0, 9),
% 12.12/12.32 right_branch(9),
% 12.12/12.32 left_branch(0, 5, 1, 10),
% 12.12/12.32 left_branch(0, 13, 0, 11),
% 12.12/12.32 right_branch(11),
% 12.12/12.32 right_branch(10),
% 12.12/12.32 right_branch(8),
% 12.12/12.32 right_branch(6),
% 12.12/12.32 right_branch(5),
% 12.12/12.32 left_branch(0, 1, 1, 6),
% 12.12/12.32 left_branch(0, 2, 2, 7),
% 12.12/12.32 left_branch(0, 5, 1, 8),
% 12.12/12.32 left_branch(0, 1, 1, 9),
% 12.12/12.32 left_branch(0, 13, 0, 10),
% 12.12/12.32 right_branch(10),
% 12.12/12.32 right_branch(9),
% 12.12/12.32 right_branch(8),
% 12.12/12.32 left_branch(0, 2, 2, 9),
% 12.12/12.32 left_branch(0, 21, 0, 10),
% 12.12/12.32 right_branch(10),
% 12.12/12.32 left_branch(0, 5, 1, 11),
% 12.12/12.32 left_branch(0, 13, 0, 12),
% 12.12/12.32 right_branch(12),
% 12.12/12.32 right_branch(11),
% 12.12/12.32 right_branch(9),
% 12.12/12.32 right_branch(7),
% 12.12/12.32 right_branch(6),
% 12.12/12.32 right_branch(4),
% 12.12/12.32 right_branch(2)
% 12.12/12.32 )).
% 12.12/12.32 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------