TSTP Solution File: REL049+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : REL049+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 : n006.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:17:36 EST 2024
% Result : Theorem 3.34s 3.51s
% Output : Proof 3.34s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : REL049+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Sun Mar 3 18:01:20 EST 2024
% 0.13/0.33 % CPUTime :
% 3.34/3.51 % SZS status Theorem for theBenchmark
% 3.34/3.51 % SZS output start Proof for theBenchmark
% 3.34/3.51
% 3.34/3.51 % Formula: maddux1_join_commutativity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(maddux1_join_commutativity-1, axiom, ( ( join(_u1, _u0) = join(_u0, _u1)) )).
% 3.34/3.51
% 3.34/3.51 % Formula: maddux2_join_associativity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(maddux2_join_associativity-1, axiom, ( ( join(_u4, join(_u3, _u2)) = join(join(_u4, _u3), _u2)) )).
% 3.34/3.51
% 3.34/3.51 % Formula: maddux3_a_kind_of_de_Morgan ( axiom ) converted to clauses:
% 3.34/3.51 cnf(maddux3_a_kind_of_de_Morgan-1, axiom, ( ( _u6 = join(complement(join(complement(_u6), complement(_u5))), complement(join(complement(_u6), _u5)))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: maddux4_definiton_of_meet ( axiom ) converted to clauses:
% 3.34/3.51 cnf(maddux4_definiton_of_meet-1, axiom, ( ( meet(_u8, _u7) = complement(join(complement(_u8), complement(_u7)))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: composition_associativity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(composition_associativity-1, axiom, ( ( composition(_u11, composition(_u10, _u9)) = composition(composition(_u11, _u10), _u9)) )).
% 3.34/3.51
% 3.34/3.51 % Formula: composition_identity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(composition_identity-1, axiom, ( ( composition(_u12, one) = _u12) )).
% 3.34/3.51
% 3.34/3.51 % Formula: composition_distributivity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(composition_distributivity-1, axiom, ( ( composition(join(_u15, _u14), _u13) = join(composition(_u15, _u13), composition(_u14, _u13))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: converse_idempotence ( axiom ) converted to clauses:
% 3.34/3.51 cnf(converse_idempotence-1, axiom, ( ( converse(converse(_u16)) = _u16) )).
% 3.34/3.51
% 3.34/3.51 % Formula: converse_additivity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(converse_additivity-1, axiom, ( ( converse(join(_u18, _u17)) = join(converse(_u18), converse(_u17))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: converse_multiplicativity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(converse_multiplicativity-1, axiom, ( ( converse(composition(_u20, _u19)) = composition(converse(_u19), converse(_u20))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: converse_cancellativity ( axiom ) converted to clauses:
% 3.34/3.51 cnf(converse_cancellativity-1, axiom, ( ( join(composition(converse(_u22), complement(composition(_u22, _u21))), complement(_u21)) = complement(_u21)) )).
% 3.34/3.51
% 3.34/3.51 % Formula: def_top ( axiom ) converted to clauses:
% 3.34/3.51 cnf(def_top-1, axiom, ( ( top = join(_u23, complement(_u23))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: def_zero ( axiom ) converted to clauses:
% 3.34/3.51 cnf(def_zero-1, axiom, ( ( zero = meet(_u24, complement(_u24))) )).
% 3.34/3.51
% 3.34/3.51 % Formula: goals ( conjecture ) converted to clauses:
% 3.34/3.51 cnf(goals-1, negated_conjecture, ( ( join(skolem1, skolem2) = skolem2) )).
% 3.34/3.51 cnf(goals-2, negated_conjecture, ( ( join(skolem3, skolem2) = skolem2) )).
% 3.34/3.51 cnf(goals-3, negated_conjecture, ( ( join(join(skolem1, skolem3), skolem2) != skolem2) )).
% 3.34/3.51
% 3.34/3.51 % Problem matrix:
% 3.34/3.51 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 3.34/3.51 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 3.34/3.51 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 3.34/3.51 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( join(__eqx_0, __eqx_1) = join(__eqy_0, __eqy_1)) )).
% 3.34/3.51 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( complement(__eqx_0) = complement(__eqy_0)) )).
% 3.34/3.51 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( meet(__eqx_0, __eqx_1) = meet(__eqy_0, __eqy_1)) )).
% 3.34/3.51 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( composition(__eqx_0, __eqx_1) = composition(__eqy_0, __eqy_1)) )).
% 3.34/3.51 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( converse(__eqx_0) = converse(__eqy_0)) )).
% 3.34/3.51 cnf(matrix-8, plain, ( ( join(_u1, _u0) = join(_u0, _u1)) )).
% 3.34/3.51 cnf(matrix-9, plain, ( ( join(_u4, join(_u3, _u2)) = join(join(_u4, _u3), _u2)) )).
% 3.34/3.51 cnf(matrix-10, plain, ( ( _u6 = join(complement(join(complement(_u6), complement(_u5))), complement(join(complement(_u6), _u5)))) )).
% 3.34/3.51 cnf(matrix-11, plain, ( ( meet(_u8, _u7) = complement(join(complement(_u8), complement(_u7)))) )).
% 3.34/3.51 cnf(matrix-12, plain, ( ( composition(_u11, composition(_u10, _u9)) = composition(composition(_u11, _u10), _u9)) )).
% 3.34/3.51 cnf(matrix-13, plain, ( ( composition(_u12, one) = _u12) )).
% 3.34/3.51 cnf(matrix-14, plain, ( ( composition(join(_u15, _u14), _u13) = join(composition(_u15, _u13), composition(_u14, _u13))) )).
% 3.34/3.51 cnf(matrix-15, plain, ( ( converse(converse(_u16)) = _u16) )).
% 3.34/3.51 cnf(matrix-16, plain, ( ( converse(join(_u18, _u17)) = join(converse(_u18), converse(_u17))) )).
% 3.34/3.51 cnf(matrix-17, plain, ( ( converse(composition(_u20, _u19)) = composition(converse(_u19), converse(_u20))) )).
% 3.34/3.51 cnf(matrix-18, plain, ( ( join(composition(converse(_u22), complement(composition(_u22, _u21))), complement(_u21)) = complement(_u21)) )).
% 3.34/3.51 cnf(matrix-19, plain, ( ( top = join(_u23, complement(_u23))) )).
% 3.34/3.51 cnf(matrix-20, plain, ( ( zero = meet(_u24, complement(_u24))) )).
% 3.34/3.51 cnf(matrix-21, plain, ( ( join(skolem1, skolem2) = skolem2) )).
% 3.34/3.51 cnf(matrix-22, plain, ( ( join(skolem3, skolem2) = skolem2) )).
% 3.34/3.51 cnf(matrix-23, plain, ( ( join(join(skolem1, skolem3), skolem2) != skolem2) )).
% 3.34/3.51
% 3.34/3.51 % Proof stack:
% 3.34/3.51 cnf(proof-stack, plain,
% 3.34/3.51 proof_stack(
% 3.34/3.51 start(23),
% 3.34/3.51 left_branch(0, 2, 2, 2),
% 3.34/3.51 left_branch(0, 2, 2, 3),
% 3.34/3.51 left_branch(0, 3, 2, 4),
% 3.34/3.51 left_branch(0, 8, 0, 5),
% 3.34/3.51 right_branch(5),
% 3.34/3.51 left_branch(0, 0, 0, 6),
% 3.34/3.51 right_branch(6),
% 3.34/3.51 right_branch(4),
% 3.34/3.51 left_branch(0, 1, 1, 5),
% 3.34/3.51 left_branch(0, 9, 0, 6),
% 3.34/3.51 right_branch(6),
% 3.34/3.51 right_branch(5),
% 3.34/3.51 right_branch(3),
% 3.34/3.51 left_branch(0, 2, 2, 4),
% 3.34/3.51 left_branch(0, 3, 2, 5),
% 3.34/3.51 left_branch(0, 0, 0, 6),
% 3.34/3.51 right_branch(6),
% 3.34/3.51 left_branch(0, 21, 0, 7),
% 3.34/3.51 right_branch(7),
% 3.34/3.51 right_branch(5),
% 3.34/3.51 left_branch(0, 22, 0, 6),
% 3.34/3.51 right_branch(6),
% 3.34/3.51 right_branch(4),
% 3.34/3.51 right_branch(2)
% 3.34/3.51 )).
% 3.34/3.51 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------