TSTP Solution File: SYO607+1 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : SYO607+1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n031.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:44:59 EDT 2024
% Result : Theorem 12.30s 12.45s
% Output : Proof 12.30s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SYO607+1 : TPTP v8.1.2. Released v7.0.0.
% 0.06/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n031.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 21:20:33 EDT 2024
% 0.12/0.33 % CPUTime :
% 12.30/12.45 % SZS status Theorem for theBenchmark
% 12.30/12.45 % SZS output start Proof for theBenchmark
% 12.30/12.45
% 12.30/12.45 % Formula: nc6 ( conjecture ) (definitionally) converted to clauses:
% 12.30/12.45 cnf(nc6-1, negated_conjecture, ( ~g_false_only(a, _u1) | ~g_false_only(_u1, _u0) )).
% 12.30/12.45 cnf(nc6-2, negated_conjecture, ( ~g_true_only(_u3, skolem1(_u3)) )).
% 12.30/12.45 cnf(nc6-3, negated_conjecture, ( ~_def0(_u4, _u7) | g_true_only(a, _u7) | g_true_only(_u7, _u6) | ~_def1 | ~g_both(_u12, _u10) | g_false_only(_u12, skolem5(_u12)) | g_true_only(skolem6, _u13) )).
% 12.30/12.45 cnf(nc6-4, negated_conjecture, ( _def0(_u4, _u7) | ~g_both(a, _u7) )).
% 12.30/12.45 cnf(nc6-5, negated_conjecture, ( _def0(_u4, _u7) | ~g_both(_u7, _u4) | g_false_only(_u7, skolem2(_u7)) )).
% 12.30/12.45 cnf(nc6-6, negated_conjecture, ( _def1 | g_false_only(a, skolem3) )).
% 12.30/12.45 cnf(nc6-7, negated_conjecture, ( _def1 | g_false_only(skolem3, skolem4) )).
% 12.30/12.45
% 12.30/12.45 % Formula: true_only_g ( axiom ) converted to clauses:
% 12.30/12.45 cnf(true_only_g-1, axiom, ( ~g_true_only(_u19, _u17) | g_true(_u19, _u17) )).
% 12.30/12.45 cnf(true_only_g-2, axiom, ( ~g_true_only(_u19, _u17) | ~g_false(_u19, _u17) )).
% 12.30/12.45 cnf(true_only_g-3, axiom, ( ~g_true(_u20, _u18) | g_false(_u20, _u18) | g_true_only(_u20, _u18) )).
% 12.30/12.45
% 12.30/12.45 % Formula: both_g ( axiom ) converted to clauses:
% 12.30/12.45 cnf(both_g-1, axiom, ( ~g_both(_u25, _u23) | g_true(_u25, _u23) )).
% 12.30/12.45 cnf(both_g-2, axiom, ( ~g_both(_u25, _u23) | g_false(_u25, _u23) )).
% 12.30/12.45 cnf(both_g-3, axiom, ( ~g_true(_u26, _u24) | ~g_false(_u26, _u24) | g_both(_u26, _u24) )).
% 12.30/12.45
% 12.30/12.45 % Formula: false_only_g ( axiom ) converted to clauses:
% 12.30/12.45 cnf(false_only_g-1, axiom, ( ~g_false_only(_u31, _u29) | g_false(_u31, _u29) )).
% 12.30/12.45 cnf(false_only_g-2, axiom, ( ~g_false_only(_u31, _u29) | ~g_true(_u31, _u29) )).
% 12.30/12.45 cnf(false_only_g-3, axiom, ( ~g_false(_u32, _u30) | g_true(_u32, _u30) | g_false_only(_u32, _u30) )).
% 12.30/12.45
% 12.30/12.45 % Formula: exhaustion_g ( axiom ) converted to clauses:
% 12.30/12.45 cnf(exhaustion_g-1, axiom, ( g_true_only(_u34, _u33) | g_both(_u34, _u33) | g_false_only(_u34, _u33) )).
% 12.30/12.45
% 12.30/12.45 % Problem matrix:
% 12.30/12.45 cnf(matrix-0, plain, ( ~g_false_only(a, _u1) | ~g_false_only(_u1, _u0) )).
% 12.30/12.45 cnf(matrix-1, plain, ( ~g_true_only(_u3, skolem1(_u3)) )).
% 12.30/12.45 cnf(matrix-2, plain, ( ~_def0(_u4, _u7) | g_true_only(a, _u7) | g_true_only(_u7, _u6) | ~_def1 | ~g_both(_u12, _u10) | g_false_only(_u12, skolem5(_u12)) | g_true_only(skolem6, _u13) )).
% 12.30/12.45 cnf(matrix-3, plain, ( _def0(_u4, _u7) | ~g_both(a, _u7) )).
% 12.30/12.45 cnf(matrix-4, plain, ( _def0(_u4, _u7) | ~g_both(_u7, _u4) | g_false_only(_u7, skolem2(_u7)) )).
% 12.30/12.45 cnf(matrix-5, plain, ( _def1 | g_false_only(a, skolem3) )).
% 12.30/12.45 cnf(matrix-6, plain, ( _def1 | g_false_only(skolem3, skolem4) )).
% 12.30/12.45 cnf(matrix-7, plain, ( ~g_true_only(_u19, _u17) | g_true(_u19, _u17) )).
% 12.30/12.45 cnf(matrix-8, plain, ( ~g_true_only(_u19, _u17) | ~g_false(_u19, _u17) )).
% 12.30/12.45 cnf(matrix-9, plain, ( ~g_true(_u20, _u18) | g_false(_u20, _u18) | g_true_only(_u20, _u18) )).
% 12.30/12.45 cnf(matrix-10, plain, ( ~g_both(_u25, _u23) | g_true(_u25, _u23) )).
% 12.30/12.45 cnf(matrix-11, plain, ( ~g_both(_u25, _u23) | g_false(_u25, _u23) )).
% 12.30/12.45 cnf(matrix-12, plain, ( ~g_true(_u26, _u24) | ~g_false(_u26, _u24) | g_both(_u26, _u24) )).
% 12.30/12.45 cnf(matrix-13, plain, ( ~g_false_only(_u31, _u29) | g_false(_u31, _u29) )).
% 12.30/12.46 cnf(matrix-14, plain, ( ~g_false_only(_u31, _u29) | ~g_true(_u31, _u29) )).
% 12.30/12.46 cnf(matrix-15, plain, ( ~g_false(_u32, _u30) | g_true(_u32, _u30) | g_false_only(_u32, _u30) )).
% 12.30/12.46 cnf(matrix-16, plain, ( g_true_only(_u34, _u33) | g_both(_u34, _u33) | g_false_only(_u34, _u33) )).
% 12.30/12.46
% 12.30/12.46 % Proof stack:
% 12.30/12.46 cnf(proof-stack, plain,
% 12.30/12.46 proof_stack(
% 12.30/12.46 start(2),
% 12.30/12.46 left_branch(0, 4, 0, 2),
% 12.30/12.46 left_branch(0, 0, 1, 3),
% 12.30/12.46 left_branch(0, 16, 2, 4),
% 12.30/12.46 left_branch(0, 1, 0, 5),
% 12.30/12.46 right_branch(5),
% 12.30/12.46 left_branch(0, 3, 1, 6),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(6),
% 12.30/12.46 right_branch(4),
% 12.30/12.46 right_branch(3),
% 12.30/12.46 left_branch(0, 16, 1, 4),
% 12.30/12.46 left_branch(0, 1, 0, 5),
% 12.30/12.46 right_branch(5),
% 12.30/12.46 left_branch(0, 0, 1, 6),
% 12.30/12.46 left_branch(0, 16, 2, 7),
% 12.30/12.46 left_branch(0, 1, 0, 8),
% 12.30/12.46 right_branch(8),
% 12.30/12.46 left_branch(0, 3, 1, 9),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(9),
% 12.30/12.46 right_branch(7),
% 12.30/12.46 right_branch(6),
% 12.30/12.46 right_branch(4),
% 12.30/12.46 right_branch(2),
% 12.30/12.46 left_branch(0, 1, 0, 3),
% 12.30/12.46 right_branch(3),
% 12.30/12.46 left_branch(0, 14, 0, 4),
% 12.30/12.46 left_branch(0, 7, 1, 5),
% 12.30/12.46 left_branch(0, 2, 1, 6),
% 12.30/12.46 left_branch(0, 4, 0, 7),
% 12.30/12.46 left_branch(0, 0, 1, 8),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(8),
% 12.30/12.46 left_branch(0, 16, 1, 9),
% 12.30/12.46 left_branch(0, 1, 0, 10),
% 12.30/12.46 right_branch(10),
% 12.30/12.46 left_branch(0, 0, 1, 11),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(11),
% 12.30/12.46 right_branch(9),
% 12.30/12.46 right_branch(7),
% 12.30/12.46 left_branch(0, 0, 1, 8),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(8),
% 12.30/12.46 left_branch(0, 16, 1, 9),
% 12.30/12.46 left_branch(0, 1, 0, 10),
% 12.30/12.46 right_branch(10),
% 12.30/12.46 left_branch(0, 0, 1, 11),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(11),
% 12.30/12.46 right_branch(9),
% 12.30/12.46 left_branch(0, 6, 0, 10),
% 12.30/12.46 left_branch(0, 0, 1, 11),
% 12.30/12.46 left_branch(0, 5, 1, 12),
% 12.30/12.46 reduction(0, 3),
% 12.30/12.46 right_branch(12),
% 12.30/12.46 right_branch(11),
% 12.30/12.46 right_branch(10),
% 12.30/12.46 left_branch(0, 1, 0, 11),
% 12.30/12.46 right_branch(11),
% 12.30/12.46 left_branch(0, 1, 0, 12),
% 12.30/12.46 right_branch(12),
% 12.30/12.46 right_branch(6),
% 12.30/12.46 right_branch(5),
% 12.30/12.46 right_branch(4),
% 12.30/12.46 left_branch(0, 16, 1, 5),
% 12.30/12.46 left_branch(0, 1, 0, 6),
% 12.30/12.46 right_branch(6),
% 12.30/12.46 left_branch(0, 0, 0, 7),
% 12.30/12.46 left_branch(0, 2, 5, 8),
% 12.30/12.46 left_branch(0, 4, 0, 9),
% 12.30/12.46 left_branch(0, 0, 1, 10),
% 12.30/12.46 reduction(0, 1),
% 12.30/12.46 right_branch(10),
% 12.30/12.46 left_branch(0, 16, 1, 11),
% 12.30/12.46 left_branch(0, 1, 0, 12),
% 12.30/12.46 right_branch(12),
% 12.30/12.46 left_branch(0, 0, 1, 13),
% 12.30/12.46 reduction(0, 1),
% 12.30/12.46 right_branch(13),
% 12.30/12.46 right_branch(11),
% 12.30/12.46 right_branch(9),
% 12.30/12.46 left_branch(0, 1, 0, 10),
% 12.30/12.46 right_branch(10),
% 12.30/12.46 left_branch(0, 16, 1, 11),
% 12.30/12.46 left_branch(0, 1, 0, 12),
% 12.30/12.46 right_branch(12),
% 12.30/12.46 left_branch(0, 0, 1, 13),
% 12.30/12.46 reduction(0, 1),
% 12.30/12.46 right_branch(13),
% 12.30/12.46 right_branch(11),
% 12.30/12.46 left_branch(0, 6, 0, 12),
% 12.30/12.46 left_branch(0, 0, 1, 13),
% 12.30/12.46 left_branch(0, 5, 1, 14),
% 12.30/12.46 reduction(0, 3),
% 12.30/12.46 right_branch(14),
% 12.30/12.46 right_branch(13),
% 12.30/12.46 right_branch(12),
% 12.30/12.46 left_branch(0, 1, 0, 13),
% 12.30/12.46 right_branch(13),
% 12.30/12.46 lemmata(0, 3),
% 12.30/12.46 right_branch(8),
% 12.30/12.46 right_branch(7),
% 12.30/12.46 right_branch(5),
% 12.30/12.46 left_branch(0, 6, 0, 6),
% 12.30/12.46 left_branch(0, 0, 1, 7),
% 12.30/12.46 left_branch(0, 5, 1, 8),
% 12.30/12.46 reduction(0, 0),
% 12.30/12.46 right_branch(8),
% 12.30/12.46 right_branch(7),
% 12.30/12.46 right_branch(6),
% 12.30/12.46 left_branch(0, 1, 0, 7),
% 12.30/12.46 right_branch(7),
% 12.30/12.46 left_branch(0, 8, 0, 8),
% 12.30/12.46 left_branch(0, 11, 1, 9),
% 12.30/12.46 lemmata(0, 3),
% 12.30/12.46 right_branch(9),
% 12.30/12.46 right_branch(8)
% 12.30/12.46 )).
% 12.30/12.46 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------