TSTP Solution File: NUM531+2 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : NUM531+2 : 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 : n023.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:27:03 EDT 2024
% Result : Theorem 0.13s 0.34s
% Output : Proof 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM531+2 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.13/0.33 % Computer : n023.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 20:04:27 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.13/0.34 % SZS status Theorem for theBenchmark
% 0.13/0.34 % SZS output start Proof for theBenchmark
% 0.13/0.34
% 0.13/0.34 % Formula: mSetSort ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mSetSort, axiom, $true).
% 0.13/0.34
% 0.13/0.34 % Formula: mElmSort ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mElmSort, axiom, $true).
% 0.13/0.34
% 0.13/0.34 % Formula: mEOfElem ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mEOfElem-1, axiom, ( ~aSet0(_u3) | ~aElementOf0(_u2, _u3) | aElement0(_u2) )).
% 0.13/0.34
% 0.13/0.34 % Formula: mFinRel ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mFinRel, axiom, $true).
% 0.13/0.34
% 0.13/0.34 % Formula: mDefEmp ( definition ) converted to clauses:
% 0.13/0.34 cnf(mDefEmp-1, definition, ( ( _u8 != slcrc0) | aSet0(_u8) )).
% 0.13/0.34 cnf(mDefEmp-2, definition, ( ( _u8 != slcrc0) | ~aElementOf0(_u5, _u8) )).
% 0.13/0.34 cnf(mDefEmp-3, definition, ( ~aSet0(_u9) | aElementOf0(skolem1(_u9), _u9) | ( _u9 = slcrc0) )).
% 0.13/0.34
% 0.13/0.34 % Formula: mEmpFin ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mEmpFin-1, axiom, ( isFinite0(slcrc0) )).
% 0.13/0.34
% 0.13/0.34 % Formula: mCntRel ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mCntRel, axiom, $true).
% 0.13/0.34
% 0.13/0.34 % Formula: mCountNFin ( axiom ) converted to clauses:
% 0.13/0.34 cnf(mCountNFin-1, axiom, ( ~aSet0(_u11) | ~isCountable0(_u11) | ~isFinite0(_u11) )).
% 0.13/0.34
% 0.13/0.34 % Formula: m__ ( conjecture ) (definitionally) converted to clauses:
% 0.13/0.34 cnf(m__-1, negated_conjecture, ( aSet0(skolem2) )).
% 0.13/0.34 cnf(m__-2, negated_conjecture, ( isCountable0(skolem2) )).
% 0.13/0.34 cnf(m__-3, negated_conjecture, ( ~aElementOf0(_u12, skolem2) )).
% 0.13/0.34 cnf(m__-4, negated_conjecture, ( ( skolem2 = slcrc0) )).
% 0.13/0.34
% 0.13/0.34 % Problem matrix:
% 0.13/0.34 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 0.13/0.34 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 0.13/0.34 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( skolem1(__eqx_0) = skolem1(__eqy_0)) )).
% 0.13/0.34 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ~aSet0(__eqx_0) | aSet0(__eqy_0) )).
% 0.13/0.34 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ~aElement0(__eqx_0) | aElement0(__eqy_0) )).
% 0.13/0.34 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~aElementOf0(__eqx_0, __eqx_1) | aElementOf0(__eqy_0, __eqy_1) )).
% 0.13/0.34 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ~isFinite0(__eqx_0) | isFinite0(__eqy_0) )).
% 0.13/0.34 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ~isCountable0(__eqx_0) | isCountable0(__eqy_0) )).
% 0.13/0.34 cnf(matrix-9, plain, ( ~aSet0(_u3) | ~aElementOf0(_u2, _u3) | aElement0(_u2) )).
% 0.13/0.34 cnf(matrix-10, plain, ( ( _u8 != slcrc0) | aSet0(_u8) )).
% 0.13/0.34 cnf(matrix-11, plain, ( ( _u8 != slcrc0) | ~aElementOf0(_u5, _u8) )).
% 0.13/0.34 cnf(matrix-12, plain, ( ~aSet0(_u9) | aElementOf0(skolem1(_u9), _u9) | ( _u9 = slcrc0) )).
% 0.13/0.34 cnf(matrix-13, plain, ( isFinite0(slcrc0) )).
% 0.13/0.34 cnf(matrix-14, plain, ( ~aSet0(_u11) | ~isCountable0(_u11) | ~isFinite0(_u11) )).
% 0.13/0.34 cnf(matrix-15, plain, ( aSet0(skolem2) )).
% 0.13/0.34 cnf(matrix-16, plain, ( isCountable0(skolem2) )).
% 0.13/0.34 cnf(matrix-17, plain, ( ~aElementOf0(_u12, skolem2) )).
% 0.13/0.34 cnf(matrix-18, plain, ( ( skolem2 = slcrc0) )).
% 0.13/0.34
% 0.13/0.34 % Proof stack:
% 0.13/0.34 cnf(proof-stack, plain,
% 0.13/0.34 proof_stack(
% 0.13/0.34 start(14),
% 0.13/0.34 left_branch(0, 15, 0, 2),
% 0.13/0.34 right_branch(2),
% 0.13/0.34 left_branch(0, 7, 2, 3),
% 0.13/0.34 left_branch(0, 1, 1, 4),
% 0.13/0.34 left_branch(0, 18, 0, 5),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 right_branch(4),
% 0.13/0.34 left_branch(0, 13, 0, 5),
% 0.13/0.34 right_branch(5),
% 0.13/0.34 right_branch(3),
% 0.13/0.34 left_branch(0, 16, 0, 4),
% 0.13/0.34 right_branch(4)
% 0.13/0.34 )).
% 0.13/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------