TSTP Solution File: SEU120+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SEU120+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 : n005.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:20:15 EST 2024
% Result : Theorem 12.89s 13.11s
% Output : Proof 12.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13 % Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% 0.10/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sun Mar 3 10:39:33 EST 2024
% 0.15/0.35 % CPUTime :
% 12.89/13.11 % SZS status Theorem for theBenchmark
% 12.89/13.11 % SZS output start Proof for theBenchmark
% 12.89/13.11
% 12.89/13.11 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 12.89/13.11 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 12.89/13.11
% 12.89/13.11 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 12.89/13.11
% 12.89/13.11 % Formula: d1_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(d1_xboole_0-1, axiom, ( ( _u7 != empty_set) | ~in(_u4, _u7) )).
% 12.89/13.11 cnf(d1_xboole_0-2, axiom, ( in(skolem1(_u8), _u8) | ( _u8 = empty_set) )).
% 12.89/13.11
% 12.89/13.11 % Formula: d7_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(d7_xboole_0-1, axiom, ( ~disjoint(_u13, _u11) | ( set_intersection2(_u13, _u11) = empty_set) )).
% 12.89/13.11 cnf(d7_xboole_0-2, axiom, ( ( set_intersection2(_u14, _u12) != empty_set) | disjoint(_u14, _u12) )).
% 12.89/13.11
% 12.89/13.11 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11
% 12.89/13.11 % Formula: dt_k3_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11
% 12.89/13.11 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 12.89/13.11
% 12.89/13.11 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u16, _u16) = _u16) )).
% 12.89/13.11
% 12.89/13.11 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(rc1_xboole_0-1, axiom, ( empty(skolem2) )).
% 12.89/13.11
% 12.89/13.11 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem3) )).
% 12.89/13.11
% 12.89/13.11 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 12.89/13.11 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u20, _u19) | disjoint(_u19, _u20) )).
% 12.89/13.11
% 12.89/13.11 % Formula: t4_xboole_0 ( conjecture ) converted to clauses:
% 12.89/13.11 cnf(t4_xboole_0-1, negated_conjecture, ( ~disjoint(skolem4, skolem5) | in(skolem8, set_intersection2(skolem6, skolem7)) )).
% 12.89/13.11 cnf(t4_xboole_0-2, negated_conjecture, ( ~disjoint(skolem4, skolem5) | disjoint(skolem6, skolem7) )).
% 12.89/13.11 cnf(t4_xboole_0-3, negated_conjecture, ( ~in(_u21, set_intersection2(skolem4, skolem5)) | in(skolem8, set_intersection2(skolem6, skolem7)) )).
% 12.89/13.11 cnf(t4_xboole_0-4, negated_conjecture, ( ~in(_u21, set_intersection2(skolem4, skolem5)) | disjoint(skolem6, skolem7) )).
% 12.89/13.11
% 12.89/13.11 % Problem matrix:
% 12.89/13.11 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 12.89/13.11 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 12.89/13.11 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 12.89/13.11 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_intersection2(__eqx_0, __eqx_1) = set_intersection2(__eqy_0, __eqy_1)) )).
% 12.89/13.11 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 12.89/13.11 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 12.89/13.11 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 12.89/13.11 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 12.89/13.11 cnf(matrix-8, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 12.89/13.11 cnf(matrix-9, plain, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 12.89/13.11 cnf(matrix-10, plain, ( ( _u7 != empty_set) | ~in(_u4, _u7) )).
% 12.89/13.11 cnf(matrix-11, plain, ( in(skolem1(_u8), _u8) | ( _u8 = empty_set) )).
% 12.89/13.11 cnf(matrix-12, plain, ( ~disjoint(_u13, _u11) | ( set_intersection2(_u13, _u11) = empty_set) )).
% 12.89/13.11 cnf(matrix-13, plain, ( ( set_intersection2(_u14, _u12) != empty_set) | disjoint(_u14, _u12) )).
% 12.89/13.11 cnf(matrix-14, plain, ( empty(empty_set) )).
% 12.89/13.11 cnf(matrix-15, plain, ( ( set_intersection2(_u16, _u16) = _u16) )).
% 12.89/13.11 cnf(matrix-16, plain, ( empty(skolem2) )).
% 12.89/13.11 cnf(matrix-17, plain, ( ~empty(skolem3) )).
% 12.89/13.11 cnf(matrix-18, plain, ( ~disjoint(_u20, _u19) | disjoint(_u19, _u20) )).
% 12.89/13.11 cnf(matrix-19, plain, ( ~disjoint(skolem4, skolem5) | in(skolem8, set_intersection2(skolem6, skolem7)) )).
% 12.89/13.11 cnf(matrix-20, plain, ( ~disjoint(skolem4, skolem5) | disjoint(skolem6, skolem7) )).
% 12.89/13.11 cnf(matrix-21, plain, ( ~in(_u21, set_intersection2(skolem4, skolem5)) | in(skolem8, set_intersection2(skolem6, skolem7)) )).
% 12.89/13.11 cnf(matrix-22, plain, ( ~in(_u21, set_intersection2(skolem4, skolem5)) | disjoint(skolem6, skolem7) )).
% 12.89/13.11
% 12.89/13.11 % Proof stack:
% 12.89/13.11 cnf(proof-stack, plain,
% 12.89/13.11 proof_stack(
% 12.89/13.11 start(19),
% 12.89/13.11 left_branch(0, 13, 1, 2),
% 12.89/13.11 left_branch(0, 11, 1, 3),
% 12.89/13.11 left_branch(0, 22, 0, 4),
% 12.89/13.11 left_branch(0, 12, 0, 5),
% 12.89/13.11 left_branch(0, 10, 0, 6),
% 12.89/13.11 left_branch(0, 21, 1, 7),
% 12.89/13.11 reduction(0, 2),
% 12.89/13.11 right_branch(7),
% 12.89/13.11 right_branch(6),
% 12.89/13.11 right_branch(5),
% 12.89/13.11 right_branch(4),
% 12.89/13.11 right_branch(3),
% 12.89/13.11 right_branch(2),
% 12.89/13.11 left_branch(0, 10, 1, 3),
% 12.89/13.11 left_branch(0, 12, 1, 4),
% 12.89/13.11 left_branch(0, 22, 1, 5),
% 12.89/13.11 left_branch(0, 11, 0, 6),
% 12.89/13.11 left_branch(0, 13, 0, 7),
% 12.89/13.11 left_branch(0, 20, 0, 8),
% 12.89/13.11 reduction(0, 2),
% 12.89/13.11 right_branch(8),
% 12.89/13.11 right_branch(7),
% 12.89/13.11 right_branch(6),
% 12.89/13.11 right_branch(5),
% 12.89/13.11 right_branch(4),
% 12.89/13.11 right_branch(3)
% 12.89/13.11 )).
% 12.89/13.11 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------