TSTP Solution File: SET047+1 by ConnectPP---0.2.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ConnectPP---0.2.2
% Problem  : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s

% Computer : n003.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 : Wed Mar  6 09:18:34 EST 2024

% Result   : Theorem 12.56s 12.74s
% Output   : Proof 12.56s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET047+1 : TPTP v8.1.2. Released v2.0.0.
% 0.11/0.13  % Command  : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.14/0.33  % Computer : n003.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit : 300
% 0.14/0.33  % WCLimit  : 300
% 0.14/0.33  % DateTime : Sun Mar  3 19:41:38 EST 2024
% 0.14/0.34  % CPUTime  : 
% 12.56/12.74  % SZS status Theorem for theBenchmark
% 12.56/12.74  % SZS output start Proof for theBenchmark
% 12.56/12.74  
% 12.56/12.74  % Formula: pel43_1 ( axiom ) converted to clauses:
% 12.56/12.74  cnf(pel43_1-1, axiom, ( ~set_equal(_u10, _u8) | ~element(_u4, _u10) | element(_u4, _u8) )).
% 12.56/12.74  cnf(pel43_1-2, axiom, ( ~set_equal(_u10, _u8) | ~element(_u5, _u8) | element(_u5, _u10) )).
% 12.56/12.74  cnf(pel43_1-3, axiom, ( set_equal(_u11, _u9) | element(skolem1(_u11, _u9), _u11) | element(skolem2(_u11, _u9), _u9) )).
% 12.56/12.74  cnf(pel43_1-4, axiom, ( set_equal(_u11, _u9) | element(skolem1(_u11, _u9), _u11) | ~element(skolem2(_u11, _u9), _u11) )).
% 12.56/12.74  cnf(pel43_1-5, axiom, ( set_equal(_u11, _u9) | ~element(skolem1(_u11, _u9), _u9) | element(skolem2(_u11, _u9), _u9) )).
% 12.56/12.74  cnf(pel43_1-6, axiom, ( set_equal(_u11, _u9) | ~element(skolem1(_u11, _u9), _u9) | ~element(skolem2(_u11, _u9), _u11) )).
% 12.56/12.74  
% 12.56/12.74  % Formula: pel43 ( conjecture ) converted to clauses:
% 12.56/12.74  cnf(pel43-1, negated_conjecture, ( set_equal(skolem3, skolem4) | set_equal(skolem6, skolem5) )).
% 12.56/12.74  cnf(pel43-2, negated_conjecture, ( set_equal(skolem3, skolem4) | ~set_equal(skolem5, skolem6) )).
% 12.56/12.74  cnf(pel43-3, negated_conjecture, ( ~set_equal(skolem4, skolem3) | set_equal(skolem6, skolem5) )).
% 12.56/12.74  cnf(pel43-4, negated_conjecture, ( ~set_equal(skolem4, skolem3) | ~set_equal(skolem5, skolem6) )).
% 12.56/12.74  
% 12.56/12.74  % Problem matrix:
% 12.56/12.74  cnf(matrix-0, plain, ( ~set_equal(_u10, _u8) | ~element(_u4, _u10) | element(_u4, _u8) )).
% 12.56/12.74  cnf(matrix-1, plain, ( ~set_equal(_u10, _u8) | ~element(_u5, _u8) | element(_u5, _u10) )).
% 12.56/12.74  cnf(matrix-2, plain, ( set_equal(_u11, _u9) | element(skolem1(_u11, _u9), _u11) | element(skolem2(_u11, _u9), _u9) )).
% 12.56/12.74  cnf(matrix-3, plain, ( set_equal(_u11, _u9) | element(skolem1(_u11, _u9), _u11) | ~element(skolem2(_u11, _u9), _u11) )).
% 12.56/12.74  cnf(matrix-4, plain, ( set_equal(_u11, _u9) | ~element(skolem1(_u11, _u9), _u9) | element(skolem2(_u11, _u9), _u9) )).
% 12.56/12.74  cnf(matrix-5, plain, ( set_equal(_u11, _u9) | ~element(skolem1(_u11, _u9), _u9) | ~element(skolem2(_u11, _u9), _u11) )).
% 12.56/12.74  cnf(matrix-6, plain, ( set_equal(skolem3, skolem4) | set_equal(skolem6, skolem5) )).
% 12.56/12.74  cnf(matrix-7, plain, ( set_equal(skolem3, skolem4) | ~set_equal(skolem5, skolem6) )).
% 12.56/12.74  cnf(matrix-8, plain, ( ~set_equal(skolem4, skolem3) | set_equal(skolem6, skolem5) )).
% 12.56/12.74  cnf(matrix-9, plain, ( ~set_equal(skolem4, skolem3) | ~set_equal(skolem5, skolem6) )).
% 12.56/12.74  
% 12.56/12.74  % Proof stack:
% 12.56/12.74  cnf(proof-stack, plain, 
% 12.56/12.74  proof_stack(
% 12.56/12.74  start(6), 
% 12.56/12.74  left_branch(0, 1, 0, 2), 
% 12.56/12.74  left_branch(0, 5, 1, 3), 
% 12.56/12.74  left_branch(0, 8, 0, 4), 
% 12.56/12.74  left_branch(0, 1, 0, 5), 
% 12.56/12.74  left_branch(0, 5, 1, 6), 
% 12.56/12.74  left_branch(0, 9, 1, 7), 
% 12.56/12.74  reduction(0, 2), 
% 12.56/12.74  right_branch(7), 
% 12.56/12.74  left_branch(0, 0, 2, 8), 
% 12.56/12.74  reduction(0, 3), 
% 12.56/12.74  left_branch(0, 4, 2, 10), 
% 12.56/12.74  lemmata(0, 0), 
% 12.56/12.74  reduction(0, 4), 
% 12.56/12.74  right_branch(10), 
% 12.56/12.74  right_branch(8), 
% 12.56/12.74  right_branch(6), 
% 12.56/12.74  left_branch(0, 3, 1, 7), 
% 12.56/12.74  left_branch(0, 9, 1, 8), 
% 12.56/12.74  reduction(0, 2), 
% 12.56/12.74  right_branch(8), 
% 12.56/12.74  left_branch(0, 0, 2, 9), 
% 12.56/12.74  reduction(0, 3), 
% 12.56/12.74  left_branch(0, 2, 2, 11), 
% 12.56/12.74  lemmata(0, 1), 
% 12.56/12.74  reduction(0, 4), 
% 12.56/12.74  right_branch(11), 
% 12.56/12.74  right_branch(9), 
% 12.56/12.74  right_branch(7), 
% 12.56/12.74  right_branch(5), 
% 12.56/12.74  right_branch(4), 
% 12.56/12.74  left_branch(0, 0, 2, 5), 
% 12.56/12.74  reduction(0, 0), 
% 12.56/12.74  left_branch(0, 4, 2, 7), 
% 12.56/12.74  lemmata(0, 0), 
% 12.56/12.74  reduction(0, 1), 
% 12.56/12.74  right_branch(7), 
% 12.56/12.74  right_branch(5), 
% 12.56/12.74  right_branch(3), 
% 12.56/12.74  left_branch(0, 3, 1, 4), 
% 12.56/12.74  left_branch(0, 8, 0, 5), 
% 12.56/12.74  left_branch(0, 1, 0, 6), 
% 12.56/12.74  left_branch(0, 5, 1, 7), 
% 12.56/12.74  left_branch(0, 9, 1, 8), 
% 12.56/12.74  reduction(0, 2), 
% 12.56/12.74  right_branch(8), 
% 12.56/12.74  left_branch(0, 0, 2, 9), 
% 12.56/12.74  reduction(0, 3), 
% 12.56/12.74  left_branch(0, 4, 2, 11), 
% 12.56/12.74  lemmata(0, 1), 
% 12.56/12.74  reduction(0, 4), 
% 12.56/12.74  right_branch(11), 
% 12.56/12.74  right_branch(9), 
% 12.56/12.74  right_branch(7), 
% 12.56/12.74  left_branch(0, 3, 1, 8), 
% 12.56/12.74  left_branch(0, 9, 1, 9), 
% 12.56/12.74  reduction(0, 2), 
% 12.56/12.74  right_branch(9), 
% 12.56/12.74  left_branch(0, 0, 2, 10), 
% 12.56/12.74  reduction(0, 3), 
% 12.56/12.74  left_branch(0, 2, 2, 12), 
% 12.56/12.74  lemmata(0, 2), 
% 12.56/12.74  reduction(0, 4), 
% 12.56/12.74  right_branch(12), 
% 12.56/12.74  right_branch(10), 
% 12.56/12.74  right_branch(8), 
% 12.56/12.74  right_branch(6), 
% 12.56/12.74  right_branch(5), 
% 12.56/12.74  left_branch(0, 0, 2, 6), 
% 12.56/12.74  reduction(0, 0), 
% 12.56/12.74  left_branch(0, 2, 2, 8), 
% 12.56/12.74  lemmata(0, 1), 
% 12.56/12.74  reduction(0, 1), 
% 12.56/12.74  right_branch(8), 
% 12.56/12.74  right_branch(6), 
% 12.56/12.74  right_branch(4), 
% 12.56/12.74  right_branch(2), 
% 12.56/12.74  left_branch(0, 1, 0, 3), 
% 12.56/12.74  left_branch(0, 5, 1, 4), 
% 12.56/12.74  left_branch(0, 7, 1, 5), 
% 12.56/12.74  lemmata(0, 0), 
% 12.56/12.74  right_branch(5), 
% 12.56/12.74  left_branch(0, 0, 2, 6), 
% 12.56/12.74  reduction(0, 0), 
% 12.56/12.74  left_branch(0, 4, 2, 8), 
% 12.56/12.74  lemmata(0, 1), 
% 12.56/12.74  reduction(0, 1), 
% 12.56/12.74  right_branch(8), 
% 12.56/12.74  right_branch(6), 
% 12.56/12.74  right_branch(4), 
% 12.56/12.74  left_branch(0, 3, 1, 5), 
% 12.56/12.74  left_branch(0, 7, 1, 6), 
% 12.56/12.74  lemmata(0, 0), 
% 12.56/12.74  right_branch(6), 
% 12.56/12.74  left_branch(0, 0, 2, 7), 
% 12.56/12.74  reduction(0, 0), 
% 12.56/12.74  left_branch(0, 2, 2, 9), 
% 12.56/12.74  lemmata(0, 2), 
% 12.56/12.74  reduction(0, 1), 
% 12.56/12.74  right_branch(9), 
% 12.56/12.74  right_branch(7), 
% 12.56/12.74  right_branch(5), 
% 12.56/12.74  right_branch(3)
% 12.56/12.74  )).
% 12.56/12.74  % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------