TSTP Solution File: SEU189+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n020.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:33:29 EDT 2024
% Result : Theorem 0.83s 1.08s
% Output : Proof 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU189+1 : TPTP v8.1.2. Released v3.3.0.
% 0.12/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n020.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.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Mar 20 15:07:13 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.83/1.08 % SZS status Theorem for theBenchmark
% 0.83/1.08 % SZS output start Proof for theBenchmark
% 0.83/1.08
% 0.83/1.08 % Formula: existence_m1_subset_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(existence_m1_subset_1-1, axiom, ( element(skolem1(_u1), _u1) )).
% 0.83/1.08
% 0.83/1.08 % Formula: dt_m1_subset_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(dt_m1_subset_1, axiom, $true).
% 0.83/1.08
% 0.83/1.08 % Formula: t2_subset ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t2_subset-1, axiom, ( ~element(_u3, _u2) | empty(_u2) | in(_u3, _u2) )).
% 0.83/1.08
% 0.83/1.08 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.83/1.08 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u5, _u4) | ~in(_u4, _u5) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t1_subset ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t1_subset-1, axiom, ( ~in(_u7, _u6) | element(_u7, _u6) )).
% 0.83/1.08
% 0.83/1.08 % Formula: rc1_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(rc1_relat_1-1, axiom, ( empty(skolem2) )).
% 0.83/1.08 cnf(rc1_relat_1-2, axiom, ( relation(skolem2) )).
% 0.83/1.08
% 0.83/1.08 % Formula: cc1_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(cc1_relat_1-1, axiom, ( ~empty(_u9) | relation(_u9) )).
% 0.83/1.08
% 0.83/1.08 % Formula: rc2_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(rc2_relat_1-1, axiom, ( ~empty(skolem3) )).
% 0.83/1.08 cnf(rc2_relat_1-2, axiom, ( relation(skolem3) )).
% 0.83/1.08
% 0.83/1.08 % Formula: fc5_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(fc5_relat_1-1, axiom, ( empty(_u11) | ~relation(_u11) | ~empty(relation_dom(_u11)) )).
% 0.83/1.08
% 0.83/1.08 % Formula: fc6_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(fc6_relat_1-1, axiom, ( empty(_u12) | ~relation(_u12) | ~empty(relation_rng(_u12)) )).
% 0.83/1.08
% 0.83/1.08 % Formula: fc7_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(fc7_relat_1-1, axiom, ( ~empty(_u13) | empty(relation_dom(_u13)) )).
% 0.83/1.08 cnf(fc7_relat_1-2, axiom, ( ~empty(_u13) | relation(relation_dom(_u13)) )).
% 0.83/1.08
% 0.83/1.08 % Formula: fc8_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(fc8_relat_1-1, axiom, ( ~empty(_u14) | empty(relation_rng(_u14)) )).
% 0.83/1.08 cnf(fc8_relat_1-2, axiom, ( ~empty(_u14) | relation(relation_rng(_u14)) )).
% 0.83/1.08
% 0.83/1.08 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(rc1_xboole_0-1, axiom, ( empty(skolem4) )).
% 0.83/1.08
% 0.83/1.08 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem5) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t7_boole ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t7_boole-1, axiom, ( ~in(_u18, _u17) | ~empty(_u17) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t8_boole ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t8_boole-1, axiom, ( ~empty(_u20) | ( _u20 = _u19) | ~empty(_u19) )).
% 0.83/1.08
% 0.83/1.08 % Formula: dt_k1_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(dt_k1_relat_1, axiom, $true).
% 0.83/1.08
% 0.83/1.08 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(dt_k1_xboole_0, axiom, $true).
% 0.83/1.08
% 0.83/1.08 % Formula: dt_k2_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(dt_k2_relat_1, axiom, $true).
% 0.83/1.08
% 0.83/1.08 % Formula: fc4_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(fc4_relat_1-1, axiom, ( empty(empty_set) )).
% 0.83/1.08 cnf(fc4_relat_1-2, axiom, ( relation(empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t6_boole ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t6_boole-1, axiom, ( ~empty(_u21) | ( _u21 = empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t65_relat_1 ( conjecture ) (definitionally) converted to clauses:
% 0.83/1.08 cnf(t65_relat_1-1, negated_conjecture, ( relation(skolem6) )).
% 0.83/1.08 cnf(t65_relat_1-2, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.83/1.08 cnf(t65_relat_1-3, negated_conjecture, ( _def0 | ( relation_dom(skolem6) = empty_set) )).
% 0.83/1.08 cnf(t65_relat_1-4, negated_conjecture, ( _def0 | ( relation_rng(skolem6) != empty_set) )).
% 0.83/1.08 cnf(t65_relat_1-5, negated_conjecture, ( _def1 | ( relation_rng(skolem6) = empty_set) )).
% 0.83/1.08 cnf(t65_relat_1-6, negated_conjecture, ( _def1 | ( relation_dom(skolem6) != empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t60_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t60_relat_1-1, axiom, ( ( relation_dom(empty_set) = empty_set) )).
% 0.83/1.08 cnf(t60_relat_1-2, axiom, ( ( relation_rng(empty_set) = empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Formula: t64_relat_1 ( axiom ) converted to clauses:
% 0.83/1.08 cnf(t64_relat_1-1, axiom, ( ~relation(_u23) | ( _u23 = empty_set) | ( relation_dom(_u23) != empty_set) )).
% 0.83/1.08 cnf(t64_relat_1-2, axiom, ( ~relation(_u23) | ( _u23 = empty_set) | ( relation_rng(_u23) != empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Problem matrix:
% 0.83/1.08 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.83/1.08 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.83/1.08 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.83/1.08 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( relation_dom(__eqx_0) = relation_dom(__eqy_0)) )).
% 0.83/1.08 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( relation_rng(__eqx_0) = relation_rng(__eqy_0)) )).
% 0.83/1.08 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 0.83/1.08 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~element(__eqx_0, __eqx_1) | element(__eqy_0, __eqy_1) )).
% 0.83/1.08 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.83/1.08 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.83/1.08 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ~relation(__eqx_0) | relation(__eqy_0) )).
% 0.83/1.08 cnf(matrix-10, plain, ( element(skolem1(_u1), _u1) )).
% 0.83/1.08 cnf(matrix-11, plain, ( ~element(_u3, _u2) | empty(_u2) | in(_u3, _u2) )).
% 0.83/1.08 cnf(matrix-12, plain, ( ~in(_u5, _u4) | ~in(_u4, _u5) )).
% 0.83/1.08 cnf(matrix-13, plain, ( ~in(_u7, _u6) | element(_u7, _u6) )).
% 0.83/1.08 cnf(matrix-14, plain, ( empty(skolem2) )).
% 0.83/1.08 cnf(matrix-15, plain, ( relation(skolem2) )).
% 0.83/1.08 cnf(matrix-16, plain, ( ~empty(_u9) | relation(_u9) )).
% 0.83/1.08 cnf(matrix-17, plain, ( ~empty(skolem3) )).
% 0.83/1.08 cnf(matrix-18, plain, ( relation(skolem3) )).
% 0.83/1.08 cnf(matrix-19, plain, ( empty(_u11) | ~relation(_u11) | ~empty(relation_dom(_u11)) )).
% 0.83/1.08 cnf(matrix-20, plain, ( empty(_u12) | ~relation(_u12) | ~empty(relation_rng(_u12)) )).
% 0.83/1.08 cnf(matrix-21, plain, ( ~empty(_u13) | empty(relation_dom(_u13)) )).
% 0.83/1.08 cnf(matrix-22, plain, ( ~empty(_u13) | relation(relation_dom(_u13)) )).
% 0.83/1.08 cnf(matrix-23, plain, ( ~empty(_u14) | empty(relation_rng(_u14)) )).
% 0.83/1.08 cnf(matrix-24, plain, ( ~empty(_u14) | relation(relation_rng(_u14)) )).
% 0.83/1.08 cnf(matrix-25, plain, ( empty(skolem4) )).
% 0.83/1.08 cnf(matrix-26, plain, ( ~empty(skolem5) )).
% 0.83/1.08 cnf(matrix-27, plain, ( ~in(_u18, _u17) | ~empty(_u17) )).
% 0.83/1.08 cnf(matrix-28, plain, ( ~empty(_u20) | ( _u20 = _u19) | ~empty(_u19) )).
% 0.83/1.08 cnf(matrix-29, plain, ( empty(empty_set) )).
% 0.83/1.08 cnf(matrix-30, plain, ( relation(empty_set) )).
% 0.83/1.08 cnf(matrix-31, plain, ( empty(empty_set) )).
% 0.83/1.08 cnf(matrix-32, plain, ( ~empty(_u21) | ( _u21 = empty_set) )).
% 0.83/1.08 cnf(matrix-33, plain, ( relation(skolem6) )).
% 0.83/1.08 cnf(matrix-34, plain, ( ~_def0 | ~_def1 )).
% 0.83/1.08 cnf(matrix-35, plain, ( _def0 | ( relation_dom(skolem6) = empty_set) )).
% 0.83/1.08 cnf(matrix-36, plain, ( _def0 | ( relation_rng(skolem6) != empty_set) )).
% 0.83/1.08 cnf(matrix-37, plain, ( _def1 | ( relation_rng(skolem6) = empty_set) )).
% 0.83/1.08 cnf(matrix-38, plain, ( _def1 | ( relation_dom(skolem6) != empty_set) )).
% 0.83/1.08 cnf(matrix-39, plain, ( ( relation_dom(empty_set) = empty_set) )).
% 0.83/1.08 cnf(matrix-40, plain, ( ( relation_rng(empty_set) = empty_set) )).
% 0.83/1.08 cnf(matrix-41, plain, ( ~relation(_u23) | ( _u23 = empty_set) | ( relation_dom(_u23) != empty_set) )).
% 0.83/1.08 cnf(matrix-42, plain, ( ~relation(_u23) | ( _u23 = empty_set) | ( relation_rng(_u23) != empty_set) )).
% 0.83/1.08
% 0.83/1.08 % Proof stack:
% 0.83/1.08 cnf(proof-stack, plain,
% 0.83/1.08 proof_stack(
% 0.83/1.08 start(34),
% 0.83/1.08 left_branch(0, 36, 0, 2),
% 0.83/1.08 left_branch(0, 2, 2, 3),
% 0.83/1.08 left_branch(0, 4, 1, 4),
% 0.83/1.08 left_branch(0, 41, 1, 5),
% 0.83/1.08 left_branch(0, 33, 0, 6),
% 0.83/1.08 right_branch(6),
% 0.83/1.08 left_branch(0, 35, 1, 7),
% 0.83/1.08 reduction(0, 0),
% 0.83/1.08 right_branch(7),
% 0.83/1.08 right_branch(5),
% 0.83/1.08 right_branch(4),
% 0.83/1.08 left_branch(0, 41, 1, 5),
% 0.83/1.08 left_branch(0, 24, 1, 6),
% 0.83/1.08 left_branch(0, 31, 0, 7),
% 0.83/1.08 right_branch(7),
% 0.83/1.08 right_branch(6),
% 0.83/1.08 left_branch(0, 2, 2, 7),
% 0.83/1.08 left_branch(0, 3, 1, 8),
% 0.83/1.08 left_branch(0, 40, 0, 9),
% 0.83/1.08 right_branch(9),
% 0.83/1.08 right_branch(8),
% 0.83/1.08 left_branch(0, 39, 0, 9),
% 0.83/1.08 right_branch(9),
% 0.83/1.08 right_branch(7),
% 0.83/1.08 right_branch(5),
% 0.83/1.08 right_branch(3),
% 0.83/1.08 right_branch(2),
% 0.83/1.08 left_branch(0, 38, 0, 3),
% 0.83/1.08 left_branch(0, 2, 2, 4),
% 0.83/1.08 left_branch(0, 3, 1, 5),
% 0.83/1.08 left_branch(0, 42, 1, 6),
% 0.83/1.08 left_branch(0, 33, 0, 7),
% 0.83/1.08 right_branch(7),
% 0.83/1.08 left_branch(0, 37, 1, 8),
% 0.83/1.08 reduction(0, 0),
% 0.83/1.08 right_branch(8),
% 0.83/1.08 right_branch(6),
% 0.83/1.08 right_branch(5),
% 0.83/1.08 left_branch(0, 42, 1, 6),
% 0.83/1.08 left_branch(0, 22, 1, 7),
% 0.83/1.08 left_branch(0, 31, 0, 8),
% 0.83/1.08 right_branch(8),
% 0.83/1.08 right_branch(7),
% 0.83/1.08 left_branch(0, 2, 2, 8),
% 0.83/1.08 left_branch(0, 4, 1, 9),
% 0.83/1.08 left_branch(0, 39, 0, 10),
% 0.83/1.08 right_branch(10),
% 0.83/1.08 right_branch(9),
% 0.83/1.08 left_branch(0, 40, 0, 10),
% 0.83/1.08 right_branch(10),
% 0.83/1.08 right_branch(8),
% 0.83/1.08 right_branch(6),
% 0.83/1.08 right_branch(4),
% 0.83/1.08 right_branch(3)
% 0.83/1.08 )).
% 0.83/1.08 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------