TSTP Solution File: KLE002+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : KLE002+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 : n003.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:17:31 EDT 2024
% Result : Theorem 44.42s 44.60s
% Output : Proof 44.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE002+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n003.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 : Thu Mar 21 09:04:34 EDT 2024
% 0.12/0.34 % CPUTime :
% 44.42/44.60 % SZS status Theorem for theBenchmark
% 44.42/44.60 % SZS output start Proof for theBenchmark
% 44.42/44.60
% 44.42/44.60 % Formula: additive_commutativity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(additive_commutativity-1, axiom, ( ( addition(_u1, _u0) = addition(_u0, _u1)) )).
% 44.42/44.60
% 44.42/44.60 % Formula: additive_associativity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(additive_associativity-1, axiom, ( ( addition(_u2, addition(_u3, _u4)) = addition(addition(_u2, _u3), _u4)) )).
% 44.42/44.60
% 44.42/44.60 % Formula: additive_identity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(additive_identity-1, axiom, ( ( addition(_u5, zero) = _u5) )).
% 44.42/44.60
% 44.42/44.60 % Formula: additive_idempotence ( axiom ) converted to clauses:
% 44.42/44.60 cnf(additive_idempotence-1, axiom, ( ( addition(_u6, _u6) = _u6) )).
% 44.42/44.60
% 44.42/44.60 % Formula: multiplicative_associativity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(multiplicative_associativity-1, axiom, ( ( multiplication(_u9, multiplication(_u8, _u7)) = multiplication(multiplication(_u9, _u8), _u7)) )).
% 44.42/44.60
% 44.42/44.60 % Formula: multiplicative_right_identity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(multiplicative_right_identity-1, axiom, ( ( multiplication(_u10, one) = _u10) )).
% 44.42/44.60
% 44.42/44.60 % Formula: multiplicative_left_identity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(multiplicative_left_identity-1, axiom, ( ( multiplication(one, _u11) = _u11) )).
% 44.42/44.60
% 44.42/44.60 % Formula: right_distributivity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(right_distributivity-1, axiom, ( ( multiplication(_u14, addition(_u13, _u12)) = addition(multiplication(_u14, _u13), multiplication(_u14, _u12))) )).
% 44.42/44.60
% 44.42/44.60 % Formula: left_distributivity ( axiom ) converted to clauses:
% 44.42/44.60 cnf(left_distributivity-1, axiom, ( ( multiplication(addition(_u17, _u16), _u15) = addition(multiplication(_u17, _u15), multiplication(_u16, _u15))) )).
% 44.42/44.60
% 44.42/44.60 % Formula: right_annihilation ( axiom ) converted to clauses:
% 44.42/44.60 cnf(right_annihilation-1, axiom, ( ( multiplication(_u18, zero) = zero) )).
% 44.42/44.60
% 44.42/44.60 % Formula: left_annihilation ( axiom ) converted to clauses:
% 44.42/44.60 cnf(left_annihilation-1, axiom, ( ( multiplication(zero, _u19) = zero) )).
% 44.42/44.60
% 44.42/44.60 % Formula: order ( axiom ) converted to clauses:
% 44.42/44.60 cnf(order-1, axiom, ( ~leq(_u24, _u22) | ( addition(_u24, _u22) = _u22) )).
% 44.42/44.60 cnf(order-2, axiom, ( ( addition(_u25, _u23) != _u23) | leq(_u25, _u23) )).
% 44.42/44.60
% 44.42/44.60 % Formula: goals ( conjecture ) (definitionally) converted to clauses:
% 44.42/44.60 cnf(goals-1, negated_conjecture, ( leq(skolem1, skolem2) )).
% 44.42/44.60 cnf(goals-2, negated_conjecture, ( ~leq(multiplication(skolem1, skolem3), multiplication(skolem2, skolem3)) )).
% 44.42/44.60
% 44.42/44.60 % Problem matrix:
% 44.42/44.60 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 44.42/44.60 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 44.42/44.60 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 44.42/44.60 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( addition(__eqx_0, __eqx_1) = addition(__eqy_0, __eqy_1)) )).
% 44.42/44.60 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( multiplication(__eqx_0, __eqx_1) = multiplication(__eqy_0, __eqy_1)) )).
% 44.42/44.60 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~leq(__eqx_0, __eqx_1) | leq(__eqy_0, __eqy_1) )).
% 44.42/44.60 cnf(matrix-6, plain, ( ( addition(_u1, _u0) = addition(_u0, _u1)) )).
% 44.42/44.60 cnf(matrix-7, plain, ( ( addition(_u2, addition(_u3, _u4)) = addition(addition(_u2, _u3), _u4)) )).
% 44.42/44.60 cnf(matrix-8, plain, ( ( addition(_u5, zero) = _u5) )).
% 44.42/44.60 cnf(matrix-9, plain, ( ( addition(_u6, _u6) = _u6) )).
% 44.42/44.60 cnf(matrix-10, plain, ( ( multiplication(_u9, multiplication(_u8, _u7)) = multiplication(multiplication(_u9, _u8), _u7)) )).
% 44.42/44.60 cnf(matrix-11, plain, ( ( multiplication(_u10, one) = _u10) )).
% 44.42/44.60 cnf(matrix-12, plain, ( ( multiplication(one, _u11) = _u11) )).
% 44.42/44.60 cnf(matrix-13, plain, ( ( multiplication(_u14, addition(_u13, _u12)) = addition(multiplication(_u14, _u13), multiplication(_u14, _u12))) )).
% 44.42/44.60 cnf(matrix-14, plain, ( ( multiplication(addition(_u17, _u16), _u15) = addition(multiplication(_u17, _u15), multiplication(_u16, _u15))) )).
% 44.42/44.60 cnf(matrix-15, plain, ( ( multiplication(_u18, zero) = zero) )).
% 44.42/44.60 cnf(matrix-16, plain, ( ( multiplication(zero, _u19) = zero) )).
% 44.42/44.60 cnf(matrix-17, plain, ( ~leq(_u24, _u22) | ( addition(_u24, _u22) = _u22) )).
% 44.42/44.60 cnf(matrix-18, plain, ( ( addition(_u25, _u23) != _u23) | leq(_u25, _u23) )).
% 44.42/44.60 cnf(matrix-19, plain, ( leq(skolem1, skolem2) )).
% 44.42/44.60 cnf(matrix-20, plain, ( ~leq(multiplication(skolem1, skolem3), multiplication(skolem2, skolem3)) )).
% 44.42/44.60
% 44.42/44.60 % Proof stack:
% 44.42/44.60 cnf(proof-stack, plain,
% 44.42/44.60 proof_stack(
% 44.42/44.60 start(20),
% 44.42/44.60 left_branch(0, 18, 1, 2),
% 44.42/44.60 left_branch(0, 1, 1, 3),
% 44.42/44.60 left_branch(0, 2, 2, 4),
% 44.42/44.60 left_branch(0, 4, 2, 5),
% 44.42/44.60 left_branch(0, 1, 1, 6),
% 44.42/44.60 left_branch(0, 17, 1, 7),
% 44.42/44.60 left_branch(0, 19, 0, 8),
% 44.42/44.60 right_branch(8),
% 44.42/44.60 right_branch(7),
% 44.42/44.60 right_branch(6),
% 44.42/44.60 left_branch(0, 1, 1, 7),
% 44.42/44.60 left_branch(0, 12, 0, 8),
% 44.42/44.60 right_branch(8),
% 44.42/44.60 right_branch(7),
% 44.42/44.60 right_branch(5),
% 44.42/44.60 left_branch(0, 2, 2, 6),
% 44.42/44.60 left_branch(0, 14, 0, 7),
% 44.42/44.60 right_branch(7),
% 44.42/44.60 left_branch(0, 3, 2, 8),
% 44.42/44.60 left_branch(0, 4, 2, 9),
% 44.42/44.60 left_branch(0, 0, 0, 10),
% 44.42/44.60 right_branch(10),
% 44.42/44.60 left_branch(0, 12, 0, 11),
% 44.42/44.60 right_branch(11),
% 44.42/44.60 right_branch(9),
% 44.42/44.60 left_branch(0, 4, 2, 10),
% 44.42/44.60 left_branch(0, 0, 0, 11),
% 44.42/44.60 right_branch(11),
% 44.42/44.60 left_branch(0, 12, 0, 12),
% 44.42/44.60 right_branch(12),
% 44.42/44.60 right_branch(10),
% 44.42/44.60 right_branch(8),
% 44.42/44.60 right_branch(6),
% 44.42/44.60 right_branch(4),
% 44.42/44.60 right_branch(3),
% 44.42/44.60 right_branch(2)
% 44.42/44.60 )).
% 44.42/44.60 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------