TSTP Solution File: SEU167+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SEU167+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:25 EDT 2024
% Result : Theorem 0.12s 0.34s
% Output : Proof 0.12s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEU167+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.12/0.33 % Computer : n016.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Mar 20 14:48:54 EDT 2024
% 0.12/0.34 % CPUTime :
% 0.12/0.34 % SZS status Theorem for theBenchmark
% 0.12/0.34 % SZS output start Proof for theBenchmark
% 0.12/0.34
% 0.12/0.34 % Formula: dt_k2_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(dt_k2_zfmisc_1, axiom, $true).
% 0.12/0.34
% 0.12/0.34 % Formula: reflexivity_r1_tarski ( axiom ) converted to clauses:
% 0.12/0.34 cnf(reflexivity_r1_tarski-1, axiom, ( subset(_u1, _u1) )).
% 0.12/0.34
% 0.12/0.34 % Formula: t118_zfmisc_1 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(t118_zfmisc_1-1, axiom, ( ~subset(_u4, _u3) | subset(cartesian_product2(_u4, _u5), cartesian_product2(_u3, _u5)) )).
% 0.12/0.34 cnf(t118_zfmisc_1-2, axiom, ( ~subset(_u4, _u3) | subset(cartesian_product2(_u6, _u4), cartesian_product2(_u6, _u3)) )).
% 0.12/0.34
% 0.12/0.34 % Formula: t119_zfmisc_1 ( conjecture ) (definitionally) converted to clauses:
% 0.12/0.34 cnf(t119_zfmisc_1-1, negated_conjecture, ( subset(skolem1, skolem2) )).
% 0.12/0.34 cnf(t119_zfmisc_1-2, negated_conjecture, ( subset(skolem3, skolem4) )).
% 0.12/0.34 cnf(t119_zfmisc_1-3, negated_conjecture, ( ~subset(cartesian_product2(skolem1, skolem3), cartesian_product2(skolem2, skolem4)) )).
% 0.12/0.34
% 0.12/0.34 % Formula: t1_xboole_1 ( axiom ) converted to clauses:
% 0.12/0.34 cnf(t1_xboole_1-1, axiom, ( ~subset(_u13, _u12) | ~subset(_u12, _u11) | subset(_u13, _u11) )).
% 0.12/0.34
% 0.12/0.34 % Problem matrix:
% 0.12/0.34 cnf(matrix-0, plain, ( subset(_u1, _u1) )).
% 0.12/0.34 cnf(matrix-1, plain, ( ~subset(_u4, _u3) | subset(cartesian_product2(_u4, _u5), cartesian_product2(_u3, _u5)) )).
% 0.12/0.34 cnf(matrix-2, plain, ( ~subset(_u4, _u3) | subset(cartesian_product2(_u6, _u4), cartesian_product2(_u6, _u3)) )).
% 0.12/0.34 cnf(matrix-3, plain, ( subset(skolem1, skolem2) )).
% 0.12/0.34 cnf(matrix-4, plain, ( subset(skolem3, skolem4) )).
% 0.12/0.34 cnf(matrix-5, plain, ( ~subset(cartesian_product2(skolem1, skolem3), cartesian_product2(skolem2, skolem4)) )).
% 0.12/0.34 cnf(matrix-6, plain, ( ~subset(_u13, _u12) | ~subset(_u12, _u11) | subset(_u13, _u11) )).
% 0.12/0.34
% 0.12/0.34 % Proof stack:
% 0.12/0.34 cnf(proof-stack, plain,
% 0.12/0.34 proof_stack(
% 0.12/0.34 start(5),
% 0.12/0.34 left_branch(0, 6, 2, 2),
% 0.12/0.34 left_branch(0, 2, 1, 3),
% 0.12/0.34 left_branch(0, 4, 0, 4),
% 0.12/0.34 right_branch(4),
% 0.12/0.34 right_branch(3),
% 0.12/0.34 left_branch(0, 1, 1, 4),
% 0.12/0.34 left_branch(0, 3, 0, 5),
% 0.12/0.34 right_branch(5),
% 0.12/0.34 right_branch(4),
% 0.12/0.34 right_branch(2)
% 0.12/0.34 )).
% 0.12/0.34 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------