TSTP Solution File: SEU134+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU134+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 : n002.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:15 EDT 2024
% Result : Theorem 0.13s 0.35s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU134+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.34 % Computer : n002.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Mar 20 15:28:38 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % SZS status Theorem for theBenchmark
% 0.13/0.35 % SZS output start Proof for theBenchmark
% 0.13/0.35
% 0.13/0.35 % Formula: antisymmetry_r2_hidden ( axiom ) converted to clauses:
% 0.13/0.35 cnf(antisymmetry_r2_hidden-1, axiom, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.35
% 0.13/0.35 % Formula: rc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(rc1_xboole_0-1, axiom, ( empty(skolem1) )).
% 0.13/0.35
% 0.13/0.35 % Formula: rc2_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(rc2_xboole_0-1, axiom, ( ~empty(skolem2) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t7_boole ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t7_boole-1, axiom, ( ~in(_u5, _u4) | ~empty(_u4) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t8_boole ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t8_boole-1, axiom, ( ~empty(_u7) | ( _u7 = _u6) | ~empty(_u6) )).
% 0.13/0.35
% 0.13/0.35 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.13/0.35 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u9, _u9) )).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_k1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_k1_xboole_0, axiom, $true).
% 0.13/0.35
% 0.13/0.35 % Formula: dt_k4_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(dt_k4_xboole_0, axiom, $true).
% 0.13/0.35
% 0.13/0.35 % Formula: fc1_xboole_0 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(fc1_xboole_0-1, axiom, ( empty(empty_set) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t3_boole ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t3_boole-1, axiom, ( ( set_difference(_u10, empty_set) = _u10) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t4_boole ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t4_boole-1, axiom, ( ( set_difference(empty_set, _u11) = empty_set) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t6_boole ( axiom ) converted to clauses:
% 0.13/0.35 cnf(t6_boole-1, axiom, ( ~empty(_u12) | ( _u12 = empty_set) )).
% 0.13/0.35
% 0.13/0.35 % Formula: t37_xboole_1 ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.35 cnf(t37_xboole_1-1, negated_conjecture, ( ~_def0 | ~_def1 )).
% 0.13/0.35 cnf(t37_xboole_1-2, negated_conjecture, ( _def0 | ( set_difference(skolem3, skolem4) = empty_set) )).
% 0.13/0.35 cnf(t37_xboole_1-3, negated_conjecture, ( _def0 | ~subset(skolem3, skolem4) )).
% 0.13/0.35 cnf(t37_xboole_1-4, negated_conjecture, ( _def1 | subset(skolem3, skolem4) )).
% 0.13/0.35 cnf(t37_xboole_1-5, negated_conjecture, ( _def1 | ( set_difference(skolem3, skolem4) != empty_set) )).
% 0.13/0.35
% 0.13/0.35 % Formula: l32_xboole_1 ( axiom ) converted to clauses:
% 0.13/0.35 cnf(l32_xboole_1-1, axiom, ( ( set_difference(_u19, _u17) != empty_set) | subset(_u19, _u17) )).
% 0.13/0.35 cnf(l32_xboole_1-2, axiom, ( ~subset(_u20, _u18) | ( set_difference(_u20, _u18) = empty_set) )).
% 0.13/0.35
% 0.13/0.35 % Problem matrix:
% 0.13/0.35 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.35 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.35 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.35 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( set_difference(__eqx_0, __eqx_1) = set_difference(__eqy_0, __eqy_1)) )).
% 0.13/0.35 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~in(__eqx_0, __eqx_1) | in(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~empty(__eqx_0) | empty(__eqy_0) )).
% 0.13/0.35 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~subset(__eqx_0, __eqx_1) | subset(__eqy_0, __eqy_1) )).
% 0.13/0.35 cnf(matrix-7, plain, ( ~in(_u1, _u0) | ~in(_u0, _u1) )).
% 0.13/0.35 cnf(matrix-8, plain, ( empty(skolem1) )).
% 0.13/0.35 cnf(matrix-9, plain, ( ~empty(skolem2) )).
% 0.13/0.35 cnf(matrix-10, plain, ( ~in(_u5, _u4) | ~empty(_u4) )).
% 0.13/0.35 cnf(matrix-11, plain, ( ~empty(_u7) | ( _u7 = _u6) | ~empty(_u6) )).
% 0.13/0.35 cnf(matrix-12, plain, ( subset(_u9, _u9) )).
% 0.13/0.35 cnf(matrix-13, plain, ( empty(empty_set) )).
% 0.13/0.35 cnf(matrix-14, plain, ( ( set_difference(_u10, empty_set) = _u10) )).
% 0.13/0.35 cnf(matrix-15, plain, ( ( set_difference(empty_set, _u11) = empty_set) )).
% 0.13/0.35 cnf(matrix-16, plain, ( ~empty(_u12) | ( _u12 = empty_set) )).
% 0.13/0.35 cnf(matrix-17, plain, ( ~_def0 | ~_def1 )).
% 0.13/0.35 cnf(matrix-18, plain, ( _def0 | ( set_difference(skolem3, skolem4) = empty_set) )).
% 0.13/0.35 cnf(matrix-19, plain, ( _def0 | ~subset(skolem3, skolem4) )).
% 0.13/0.35 cnf(matrix-20, plain, ( _def1 | subset(skolem3, skolem4) )).
% 0.13/0.35 cnf(matrix-21, plain, ( _def1 | ( set_difference(skolem3, skolem4) != empty_set) )).
% 0.13/0.35 cnf(matrix-22, plain, ( ( set_difference(_u19, _u17) != empty_set) | subset(_u19, _u17) )).
% 0.13/0.35 cnf(matrix-23, plain, ( ~subset(_u20, _u18) | ( set_difference(_u20, _u18) = empty_set) )).
% 0.13/0.35
% 0.13/0.35 % Proof stack:
% 0.13/0.35 cnf(proof-stack, plain,
% 0.13/0.35 proof_stack(
% 0.13/0.35 start(17),
% 0.13/0.35 left_branch(0, 19, 0, 2),
% 0.13/0.35 left_branch(0, 22, 1, 3),
% 0.13/0.35 left_branch(0, 18, 1, 4),
% 0.13/0.35 reduction(0, 0),
% 0.13/0.35 right_branch(4),
% 0.13/0.35 right_branch(3),
% 0.13/0.35 right_branch(2),
% 0.13/0.35 left_branch(0, 21, 0, 3),
% 0.13/0.35 left_branch(0, 23, 1, 4),
% 0.13/0.35 left_branch(0, 20, 1, 5),
% 0.13/0.35 reduction(0, 0),
% 0.13/0.35 right_branch(5),
% 0.13/0.35 right_branch(4),
% 0.13/0.35 right_branch(3)
% 0.13/0.35 )).
% 0.13/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------