TSTP Solution File: LCL686+1.001 by ConnectPP---0.3.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.3.0
% Problem : LCL686+1.001 : 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 : n011.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:21:02 EDT 2024
% Result : Theorem 0.14s 0.35s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL686+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.13 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Mar 20 18:52:27 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.14/0.35 % SZS status Theorem for theBenchmark
% 0.14/0.35 % SZS output start Proof for theBenchmark
% 0.14/0.35
% 0.14/0.35 % Formula: reflexivity ( axiom ) converted to clauses:
% 0.14/0.35 cnf(reflexivity-1, axiom, ( r1(_u0, _u0) )).
% 0.14/0.35
% 0.14/0.35 % Formula: transitivity ( axiom ) converted to clauses:
% 0.14/0.35 cnf(transitivity-1, axiom, ( ~r1(_u3, _u2) | ~r1(_u2, _u1) | r1(_u3, _u1) )).
% 0.14/0.35
% 0.14/0.35 % Formula: main ( conjecture ) (definitionally) converted to clauses:
% 0.14/0.35 cnf(main-1, negated_conjecture, ( r1(skolem1, skolem2) )).
% 0.14/0.35 cnf(main-2, negated_conjecture, ( p3(skolem2) )).
% 0.14/0.35 cnf(main-3, negated_conjecture, ( r1(skolem2, skolem3) )).
% 0.14/0.35 cnf(main-4, negated_conjecture, ( p1(skolem3) )).
% 0.14/0.35 cnf(main-5, negated_conjecture, ( r1(skolem1, skolem4) )).
% 0.14/0.35 cnf(main-6, negated_conjecture, ( ~r1(skolem4, _u10) | ~_def1(_u10, _u7) )).
% 0.14/0.35 cnf(main-7, negated_conjecture, ( _def1(_u10, _u7) | r1(_u10, skolem5(_u10)) )).
% 0.14/0.35 cnf(main-8, negated_conjecture, ( _def1(_u10, _u7) | ~r1(_u10, _u7) | ~_def0(_u7) )).
% 0.14/0.35 cnf(main-9, negated_conjecture, ( _def1(_u10, _u7) | r1(_u10, skolem6(_u10)) )).
% 0.14/0.35 cnf(main-10, negated_conjecture, ( _def1(_u10, _u7) | ~p3(skolem6(_u10)) )).
% 0.14/0.35 cnf(main-11, negated_conjecture, ( _def1(_u10, _u7) | r1(_u10, skolem7(_u10)) )).
% 0.14/0.35 cnf(main-12, negated_conjecture, ( _def1(_u10, _u7) | p1(skolem7(_u10)) | p2(skolem7(_u10)) )).
% 0.14/0.35 cnf(main-13, negated_conjecture, ( _def1(_u10, _u7) | ~p2(skolem7(_u10)) | ~p1(skolem7(_u10)) )).
% 0.14/0.35 cnf(main-14, negated_conjecture, ( _def0(_u7) | ~p2(_u7) | p1(_u7) )).
% 0.14/0.35 cnf(main-15, negated_conjecture, ( _def0(_u7) | p2(_u7) | ~p1(_u7) )).
% 0.14/0.35
% 0.14/0.35 % Problem matrix:
% 0.14/0.35 cnf(matrix-0, plain, ( r1(_u0, _u0) )).
% 0.14/0.35 cnf(matrix-1, plain, ( ~r1(_u3, _u2) | ~r1(_u2, _u1) | r1(_u3, _u1) )).
% 0.14/0.35 cnf(matrix-2, plain, ( r1(skolem1, skolem2) )).
% 0.14/0.35 cnf(matrix-3, plain, ( p3(skolem2) )).
% 0.14/0.35 cnf(matrix-4, plain, ( r1(skolem2, skolem3) )).
% 0.14/0.35 cnf(matrix-5, plain, ( p1(skolem3) )).
% 0.14/0.35 cnf(matrix-6, plain, ( r1(skolem1, skolem4) )).
% 0.14/0.35 cnf(matrix-7, plain, ( ~r1(skolem4, _u10) | ~_def1(_u10, _u7) )).
% 0.14/0.35 cnf(matrix-8, plain, ( _def1(_u10, _u7) | r1(_u10, skolem5(_u10)) )).
% 0.14/0.35 cnf(matrix-9, plain, ( _def1(_u10, _u7) | ~r1(_u10, _u7) | ~_def0(_u7) )).
% 0.14/0.35 cnf(matrix-10, plain, ( _def1(_u10, _u7) | r1(_u10, skolem6(_u10)) )).
% 0.14/0.35 cnf(matrix-11, plain, ( _def1(_u10, _u7) | ~p3(skolem6(_u10)) )).
% 0.14/0.35 cnf(matrix-12, plain, ( _def1(_u10, _u7) | r1(_u10, skolem7(_u10)) )).
% 0.14/0.35 cnf(matrix-13, plain, ( _def1(_u10, _u7) | p1(skolem7(_u10)) | p2(skolem7(_u10)) )).
% 0.14/0.35 cnf(matrix-14, plain, ( _def1(_u10, _u7) | ~p2(skolem7(_u10)) | ~p1(skolem7(_u10)) )).
% 0.14/0.35 cnf(matrix-15, plain, ( _def0(_u7) | ~p2(_u7) | p1(_u7) )).
% 0.14/0.35 cnf(matrix-16, plain, ( _def0(_u7) | p2(_u7) | ~p1(_u7) )).
% 0.14/0.35
% 0.14/0.35 % Proof stack:
% 0.14/0.35 cnf(proof-stack, plain,
% 0.14/0.35 proof_stack(
% 0.14/0.35 start(7),
% 0.14/0.35 left_branch(0, 12, 1, 2),
% 0.14/0.35 left_branch(0, 7, 1, 3),
% 0.14/0.35 left_branch(0, 0, 0, 4),
% 0.14/0.35 right_branch(4),
% 0.14/0.35 right_branch(3),
% 0.14/0.35 right_branch(2),
% 0.14/0.35 left_branch(0, 14, 0, 3),
% 0.14/0.35 left_branch(0, 15, 2, 4),
% 0.14/0.35 left_branch(0, 9, 2, 5),
% 0.14/0.35 reduction(0, 0),
% 0.14/0.35 left_branch(0, 12, 1, 7),
% 0.14/0.35 reduction(0, 0),
% 0.14/0.35 right_branch(7),
% 0.14/0.35 right_branch(5),
% 0.14/0.35 left_branch(0, 13, 2, 6),
% 0.14/0.35 reduction(0, 0),
% 0.14/0.35 reduction(0, 1),
% 0.14/0.35 right_branch(6),
% 0.14/0.35 right_branch(4),
% 0.14/0.35 left_branch(0, 16, 1, 5),
% 0.14/0.35 left_branch(0, 9, 2, 6),
% 0.14/0.35 reduction(0, 0),
% 0.14/0.35 left_branch(0, 12, 1, 8),
% 0.14/0.35 reduction(0, 0),
% 0.14/0.35 right_branch(8),
% 0.14/0.35 right_branch(6),
% 0.14/0.35 lemmata(0, 1),
% 0.14/0.35 right_branch(5),
% 0.14/0.35 right_branch(3)
% 0.14/0.35 )).
% 0.14/0.35 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------