TSTP Solution File: GRP012+5 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : GRP012+5 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% Computer : n029.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:13:10 EDT 2024
% Result : Theorem 12.22s 12.39s
% Output : Proof 12.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP012+5 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.34 % Computer : n029.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Thu Mar 21 07:30:18 EDT 2024
% 0.12/0.34 % CPUTime :
% 12.22/12.39 % SZS status Theorem for theBenchmark
% 12.22/12.39 % SZS output start Proof for theBenchmark
% 12.22/12.39
% 12.22/12.39 % Formula: prove_distribution ( conjecture ) (definitionally) converted to clauses:
% 12.22/12.39 cnf(prove_distribution-1, negated_conjecture, ( product(_u2, _u1, skolem2(_u2, _u1)) )).
% 12.22/12.39 cnf(prove_distribution-2, negated_conjecture, ( ~product(_u8, _u7, _u5) | ~product(_u7, _u6, _u4) | ~product(_u5, _u6, _u3) | product(_u8, _u4, _u3) )).
% 12.22/12.39 cnf(prove_distribution-3, negated_conjecture, ( ~product(_u14, _u13, _u11) | ~product(_u13, _u12, _u10) | ~product(_u14, _u10, _u9) | product(_u11, _u12, _u9) )).
% 12.22/12.39 cnf(prove_distribution-4, negated_conjecture, ( product(_u15, skolem1, _u15) )).
% 12.22/12.39 cnf(prove_distribution-5, negated_conjecture, ( product(skolem1, _u16, _u16) )).
% 12.22/12.39 cnf(prove_distribution-6, negated_conjecture, ( product(_u17, inverse(_u17), skolem1) )).
% 12.22/12.39 cnf(prove_distribution-7, negated_conjecture, ( product(inverse(_u18), _u18, skolem1) )).
% 12.22/12.39 cnf(prove_distribution-8, negated_conjecture, ( product(inverse(skolem3), inverse(skolem4), skolem5) )).
% 12.22/12.39 cnf(prove_distribution-9, negated_conjecture, ( product(skolem4, skolem3, skolem6) )).
% 12.22/12.39 cnf(prove_distribution-10, negated_conjecture, ( ~product(inverse(skolem5), inverse(skolem6), skolem1) )).
% 12.22/12.39
% 12.22/12.39 % Problem matrix:
% 12.22/12.39 cnf(matrix-0, plain, ( product(_u2, _u1, skolem2(_u2, _u1)) )).
% 12.22/12.39 cnf(matrix-1, plain, ( ~product(_u8, _u7, _u5) | ~product(_u7, _u6, _u4) | ~product(_u5, _u6, _u3) | product(_u8, _u4, _u3) )).
% 12.22/12.39 cnf(matrix-2, plain, ( ~product(_u14, _u13, _u11) | ~product(_u13, _u12, _u10) | ~product(_u14, _u10, _u9) | product(_u11, _u12, _u9) )).
% 12.22/12.39 cnf(matrix-3, plain, ( product(_u15, skolem1, _u15) )).
% 12.22/12.39 cnf(matrix-4, plain, ( product(skolem1, _u16, _u16) )).
% 12.22/12.39 cnf(matrix-5, plain, ( product(_u17, inverse(_u17), skolem1) )).
% 12.22/12.39 cnf(matrix-6, plain, ( product(inverse(_u18), _u18, skolem1) )).
% 12.22/12.39 cnf(matrix-7, plain, ( product(inverse(skolem3), inverse(skolem4), skolem5) )).
% 12.22/12.39 cnf(matrix-8, plain, ( product(skolem4, skolem3, skolem6) )).
% 12.22/12.39 cnf(matrix-9, plain, ( ~product(inverse(skolem5), inverse(skolem6), skolem1) )).
% 12.22/12.39
% 12.22/12.39 % Proof stack:
% 12.22/12.39 cnf(proof-stack, plain,
% 12.22/12.39 proof_stack(
% 12.22/12.39 start(2),
% 12.22/12.39 left_branch(0, 8, 0, 2),
% 12.22/12.39 right_branch(2),
% 12.22/12.39 left_branch(0, 2, 0, 3),
% 12.22/12.39 left_branch(0, 9, 0, 4),
% 12.22/12.39 right_branch(4),
% 12.22/12.39 left_branch(0, 5, 0, 5),
% 12.22/12.39 right_branch(5),
% 12.22/12.39 left_branch(0, 4, 0, 6),
% 12.22/12.39 right_branch(6),
% 12.22/12.39 right_branch(3),
% 12.22/12.39 left_branch(0, 1, 3, 4),
% 12.22/12.39 left_branch(0, 8, 0, 5),
% 12.22/12.39 right_branch(5),
% 12.22/12.39 left_branch(0, 1, 3, 6),
% 12.22/12.39 left_branch(0, 5, 0, 7),
% 12.22/12.39 right_branch(7),
% 12.22/12.39 left_branch(0, 4, 0, 8),
% 12.22/12.39 right_branch(8),
% 12.22/12.39 left_branch(0, 0, 0, 9),
% 12.22/12.39 right_branch(9),
% 12.22/12.39 right_branch(6),
% 12.22/12.39 left_branch(0, 0, 0, 7),
% 12.22/12.39 right_branch(7),
% 12.22/12.39 right_branch(4),
% 12.22/12.39 left_branch(0, 1, 3, 5),
% 12.22/12.39 left_branch(0, 5, 0, 6),
% 12.22/12.39 right_branch(6),
% 12.22/12.39 left_branch(0, 4, 0, 7),
% 12.22/12.39 right_branch(7),
% 12.22/12.39 left_branch(0, 1, 3, 8),
% 12.22/12.39 left_branch(0, 7, 0, 9),
% 12.22/12.39 right_branch(9),
% 12.22/12.39 left_branch(0, 5, 0, 10),
% 12.22/12.39 right_branch(10),
% 12.22/12.39 left_branch(0, 1, 3, 11),
% 12.22/12.39 left_branch(0, 6, 0, 12),
% 12.22/12.39 right_branch(12),
% 12.22/12.39 left_branch(0, 4, 0, 13),
% 12.22/12.39 right_branch(13),
% 12.22/12.39 lemmata(0, 2),
% 12.22/12.39 right_branch(11),
% 12.22/12.39 right_branch(8),
% 12.22/12.39 right_branch(5)
% 12.22/12.39 )).
% 12.22/12.39 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------