TSTP Solution File: SEU120+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% 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 : n016.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:06 EDT 2024
% Result : Theorem 0.20s 0.52s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU120+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n016.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 : Wed Mar 20 15:25:09 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.20/0.52 % SZS status Theorem for theBenchmark
% 0.20/0.52 % SZS output start Proof for theBenchmark
% 0.20/0.52
% 0.20/0.52 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.20/0.52 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.20/0.52
% 0.20/0.52 % Formula: commutativity_k3_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(commutativity_k3_xboole_0-1, axiom, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 0.20/0.52
% 0.20/0.52 % Formula: d1_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(d1_xboole_0-1, axiom, ( ( _u7 != empty_set) | ~in(_u4, _u7) )).
% 0.20/0.52 cnf(d1_xboole_0-2, axiom, ( in(skolem1(_u8), _u8) | ( _u8 = empty_set) )).
% 0.20/0.52
% 0.20/0.52 % Formula: d7_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(d7_xboole_0-1, axiom, ( ~disjoint(_u13, _u11) | ( set_intersection2(_u13, _u11) = empty_set) )).
% 0.20/0.52 cnf(d7_xboole_0-2, axiom, ( ( set_intersection2(_u14, _u12) != empty_set) | disjoint(_u14, _u12) )).
% 0.20/0.52
% 0.20/0.52 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(dt_k1_xboole_0, axiom, $true).
% 0.20/0.52
% 0.20/0.52 % Formula: dt_k3_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(dt_k3_xboole_0, axiom, $true).
% 0.20/0.52
% 0.20/0.52 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.20/0.52
% 0.20/0.52 % Formula: idempotence_k3_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(idempotence_k3_xboole_0-1, axiom, ( ( set_intersection2(_u16, _u16) = _u16) )).
% 0.20/0.52
% 0.20/0.52 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(rc1_xboole_0-1, axiom, ( empty(skolem2) )).
% 0.20/0.52
% 0.20/0.52 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem3) )).
% 0.20/0.52
% 0.20/0.52 % Formula: symmetry_r1_xboole_0 ( axiom ) converted to clauses:
% 0.20/0.52 cnf(symmetry_r1_xboole_0-1, axiom, ( ~disjoint(_u20, _u19) | disjoint(_u19, _u20) )).
% 0.20/0.52
% 0.20/0.52 % Formula: t4_xboole_0 ( conjecture ) (definitionally) converted to clauses:
% 0.20/0.52 cnf(t4_xboole_0-1, negated_conjecture, ( ~_def0(_u21) | ~_def1 )).
% 0.20/0.52 cnf(t4_xboole_0-2, negated_conjecture, ( _def0(_u21) | ~disjoint(skolem4, skolem5) )).
% 0.20/0.52 cnf(t4_xboole_0-3, negated_conjecture, ( _def0(_u21) | ~in(_u21, set_intersection2(skolem4, skolem5)) )).
% 0.20/0.52 cnf(t4_xboole_0-4, negated_conjecture, ( _def1 | in(skolem6, set_intersection2(skolem4, skolem5)) )).
% 0.20/0.52 cnf(t4_xboole_0-5, negated_conjecture, ( _def1 | disjoint(skolem4, skolem5) )).
% 0.20/0.52
% 0.20/0.52 % Problem matrix:
% 0.20/0.52 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.20/0.52 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.20/0.52 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.20/0.52 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_intersection2(__eqx_0, __eqx_1) = set_intersection2(__eqy_0, __eqy_1)) )).
% 0.20/0.52 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 0.20/0.52 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.20/0.52 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~disjoint(__eqx_0, __eqx_1) | disjoint(__eqy_0, __eqy_1) )).
% 0.20/0.52 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.20/0.52 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~_def0(__eqx_0) | _def0(__eqy_0) )).
% 0.20/0.52 cnf(matrix-9, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.20/0.52 cnf(matrix-10, plain, ( ( set_intersection2(_u3, _u2) = set_intersection2(_u2, _u3)) )).
% 0.20/0.52 cnf(matrix-11, plain, ( ( _u7 != empty_set) | ~in(_u4, _u7) )).
% 0.20/0.52 cnf(matrix-12, plain, ( in(skolem1(_u8), _u8) | ( _u8 = empty_set) )).
% 0.20/0.52 cnf(matrix-13, plain, ( ~disjoint(_u13, _u11) | ( set_intersection2(_u13, _u11) = empty_set) )).
% 0.20/0.52 cnf(matrix-14, plain, ( ( set_intersection2(_u14, _u12) != empty_set) | disjoint(_u14, _u12) )).
% 0.20/0.52 cnf(matrix-15, plain, ( empty(empty_set) )).
% 0.20/0.52 cnf(matrix-16, plain, ( ( set_intersection2(_u16, _u16) = _u16) )).
% 0.20/0.52 cnf(matrix-17, plain, ( empty(skolem2) )).
% 0.20/0.52 cnf(matrix-18, plain, ( ~empty(skolem3) )).
% 0.20/0.52 cnf(matrix-19, plain, ( ~disjoint(_u20, _u19) | disjoint(_u19, _u20) )).
% 0.20/0.52 cnf(matrix-20, plain, ( ~_def0(_u21) | ~_def1 )).
% 0.20/0.52 cnf(matrix-21, plain, ( _def0(_u21) | ~disjoint(skolem4, skolem5) )).
% 0.20/0.52 cnf(matrix-22, plain, ( _def0(_u21) | ~in(_u21, set_intersection2(skolem4, skolem5)) )).
% 0.20/0.52 cnf(matrix-23, plain, ( _def1 | in(skolem6, set_intersection2(skolem4, skolem5)) )).
% 0.20/0.52 cnf(matrix-24, plain, ( _def1 | disjoint(skolem4, skolem5) )).
% 0.20/0.52
% 0.20/0.52 % Proof stack:
% 0.20/0.52 cnf(proof-stack, plain,
% 0.20/0.52 proof_stack(
% 0.20/0.52 start(20),
% 0.20/0.52 left_branch(0, 22, 0, 2),
% 0.20/0.52 left_branch(0, 12, 0, 3),
% 0.20/0.52 left_branch(0, 14, 0, 4),
% 0.20/0.52 left_branch(0, 21, 1, 5),
% 0.20/0.52 reduction(0, 0),
% 0.20/0.52 right_branch(5),
% 0.20/0.52 right_branch(4),
% 0.20/0.52 right_branch(3),
% 0.20/0.52 right_branch(2),
% 0.20/0.52 left_branch(0, 24, 0, 3),
% 0.20/0.52 left_branch(0, 13, 0, 4),
% 0.20/0.52 left_branch(0, 11, 0, 5),
% 0.20/0.52 left_branch(0, 23, 1, 6),
% 0.20/0.52 reduction(0, 0),
% 0.20/0.52 right_branch(6),
% 0.20/0.52 right_branch(5),
% 0.20/0.52 right_branch(4),
% 0.20/0.52 right_branch(3)
% 0.20/0.52 )).
% 0.20/0.52 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------