TSTP Solution File: SWV397+1 by ConnectPP---0.2.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ConnectPP---0.2.2
% Problem : SWV397+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 : n008.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:24:29 EST 2024
% Result : Theorem 1.01s 1.17s
% Output : Proof 1.01s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV397+1 : TPTP v8.1.2. Released v3.3.0.
% 0.03/0.12 % Command : connect++ --verbosity 0 --no-colour --tptp-proof --schedule default %s
% 0.12/0.33 % Computer : n008.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 : Mon Mar 4 10:40:30 EST 2024
% 0.12/0.33 % CPUTime :
% 1.01/1.17 % SZS status Theorem for theBenchmark
% 1.01/1.17 % SZS output start Proof for theBenchmark
% 1.01/1.17
% 1.01/1.17 % Formula: transitivity ( axiom ) converted to clauses:
% 1.01/1.17 cnf(transitivity-1, axiom, ( ~less_than(_u2, _u1) | ~less_than(_u1, _u0) | less_than(_u2, _u0) )).
% 1.01/1.17
% 1.01/1.17 % Formula: totality ( axiom ) converted to clauses:
% 1.01/1.17 cnf(totality-1, axiom, ( less_than(_u4, _u3) | less_than(_u3, _u4) )).
% 1.01/1.17
% 1.01/1.17 % Formula: reflexivity ( axiom ) converted to clauses:
% 1.01/1.17 cnf(reflexivity-1, axiom, ( less_than(_u5, _u5) )).
% 1.01/1.17
% 1.01/1.17 % Formula: stricly_smaller_definition ( axiom ) converted to clauses:
% 1.01/1.17 cnf(stricly_smaller_definition-1, axiom, ( ~strictly_less_than(_u10, _u8) | less_than(_u10, _u8) )).
% 1.01/1.17 cnf(stricly_smaller_definition-2, axiom, ( ~strictly_less_than(_u10, _u8) | ~less_than(_u8, _u10) )).
% 1.01/1.17 cnf(stricly_smaller_definition-3, axiom, ( ~less_than(_u11, _u9) | less_than(_u9, _u11) | strictly_less_than(_u11, _u9) )).
% 1.01/1.17
% 1.01/1.17 % Formula: bottom_smallest ( axiom ) converted to clauses:
% 1.01/1.17 cnf(bottom_smallest-1, axiom, ( less_than(bottom, _u12) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax18 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax18-1, axiom, ( ~isnonempty_slb(create_slb) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax19 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax19-1, axiom, ( isnonempty_slb(insert_slb(_u15, pair(_u14, _u13))) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax20 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax20-1, axiom, ( ~contains_slb(create_slb, _u16) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax21 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax21-1, axiom, ( contains_slb(_u27, _u23) | ( _u25 = _u23) | ~contains_slb(insert_slb(_u27, pair(_u25, _u21)), _u23) )).
% 1.01/1.17 cnf(ax21-2, axiom, ( contains_slb(insert_slb(_u28, pair(_u26, _u22)), _u24) | ~contains_slb(_u28, _u24) )).
% 1.01/1.17 cnf(ax21-3, axiom, ( contains_slb(insert_slb(_u28, pair(_u26, _u22)), _u24) | ( _u26 != _u24) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax22 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax22-1, axiom, ( ~pair_in_list(create_slb, _u30, _u29) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax23 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax23-1, axiom, ( ~pair_in_list(insert_slb(_u44, pair(_u42, _u38)), _u40, _u36) | pair_in_list(_u44, _u40, _u36) | ( _u42 = _u40) )).
% 1.01/1.17 cnf(ax23-2, axiom, ( ~pair_in_list(insert_slb(_u44, pair(_u42, _u38)), _u40, _u36) | pair_in_list(_u44, _u40, _u36) | ( _u38 = _u36) )).
% 1.01/1.17 cnf(ax23-3, axiom, ( pair_in_list(insert_slb(_u45, pair(_u43, _u39)), _u41, _u37) | ~pair_in_list(_u45, _u41, _u37) )).
% 1.01/1.17 cnf(ax23-4, axiom, ( pair_in_list(insert_slb(_u45, pair(_u43, _u39)), _u41, _u37) | ( _u43 != _u41) | ( _u39 != _u37) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax24 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax24-1, axiom, ( ( remove_slb(insert_slb(_u48, pair(_u47, _u46)), _u47) = _u48) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax25 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax25-1, axiom, ( ( _u51 = _u50) | ~contains_slb(_u52, _u50) | ( remove_slb(insert_slb(_u52, pair(_u51, _u49)), _u50) = insert_slb(remove_slb(_u52, _u50), pair(_u51, _u49))) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax26 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax26-1, axiom, ( ( lookup_slb(insert_slb(_u55, pair(_u54, _u53)), _u54) = _u53) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax27 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax27-1, axiom, ( ( _u58 = _u57) | ~contains_slb(_u59, _u57) | ( lookup_slb(insert_slb(_u59, pair(_u58, _u56)), _u57) = lookup_slb(_u59, _u57)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax28 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax28-1, axiom, ( ( update_slb(create_slb, _u60) = create_slb) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax29 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax29-1, axiom, ( ~strictly_less_than(_u61, _u62) | ( update_slb(insert_slb(_u64, pair(_u63, _u61)), _u62) = insert_slb(update_slb(_u64, _u62), pair(_u63, _u62))) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax30 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax30-1, axiom, ( ~less_than(_u66, _u65) | ( update_slb(insert_slb(_u68, pair(_u67, _u65)), _u66) = insert_slb(update_slb(_u68, _u66), pair(_u67, _u65))) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax31 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax31-1, axiom, ( succ_cpq(_u69, _u69) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax32 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax32-1, axiom, ( ~succ_cpq(_u72, _u71) | succ_cpq(_u72, insert_cpq(_u71, _u70)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax33 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax33-1, axiom, ( ~succ_cpq(_u75, _u74) | succ_cpq(_u75, remove_cpq(_u74, _u73)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax34 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax34-1, axiom, ( ~succ_cpq(_u77, _u76) | succ_cpq(_u77, findmin_cpq_eff(_u76)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax35 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax35-1, axiom, ( ~succ_cpq(_u79, _u78) | succ_cpq(_u79, removemin_cpq_eff(_u78)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax36 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax36-1, axiom, ( check_cpq(triple(_u81, create_slb, _u80)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax37 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax37-1, axiom, ( ~less_than(_u82, _u83) | ~check_cpq(triple(_u86, insert_slb(_u85, pair(_u83, _u82)), _u84)) | check_cpq(triple(_u86, _u85, _u84)) )).
% 1.01/1.17 cnf(ax37-2, axiom, ( ~less_than(_u82, _u83) | ~check_cpq(triple(_u86, _u85, _u84)) | check_cpq(triple(_u86, insert_slb(_u85, pair(_u83, _u82)), _u84)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax38 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax38-1, axiom, ( ~strictly_less_than(_u88, _u87) | ~check_cpq(triple(_u91, insert_slb(_u90, pair(_u88, _u87)), _u89)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax39 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax39-1, axiom, ( ~contains_cpq(triple(_u102, _u100, _u98), _u96) | contains_slb(_u100, _u96) )).
% 1.01/1.17 cnf(ax39-2, axiom, ( ~contains_slb(_u101, _u97) | contains_cpq(triple(_u103, _u101, _u99), _u97) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax40 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax40-1, axiom, ( ~ok(triple(_u108, _u106, bad)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax41 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax41-1, axiom, ( ok(triple(_u112, _u111, _u110)) | ( _u110 = bad) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax42 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax42-1, axiom, ( ( insert_cpq(triple(_u116, _u115, _u114), _u113) = triple(insert_pqp(_u116, _u113), insert_slb(_u115, pair(_u113, bottom)), _u114)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax43 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax43-1, axiom, ( contains_slb(_u119, _u117) | ( remove_cpq(triple(_u120, _u119, _u118), _u117) = triple(_u120, _u119, bad)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax44 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax44-1, axiom, ( ~contains_slb(_u123, _u121) | ~less_than(lookup_slb(_u123, _u121), _u121) | ( remove_cpq(triple(_u124, _u123, _u122), _u121) = triple(remove_pqp(_u124, _u121), remove_slb(_u123, _u121), _u122)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax45 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax45-1, axiom, ( ~contains_slb(_u127, _u125) | ~strictly_less_than(_u125, lookup_slb(_u127, _u125)) | ( remove_cpq(triple(_u128, _u127, _u126), _u125) = triple(remove_pqp(_u128, _u125), remove_slb(_u127, _u125), bad)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax46 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax46-1, axiom, ( ( findmin_cpq_eff(triple(_u130, create_slb, _u129)) = triple(_u130, create_slb, bad)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax47 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax47-1, axiom, ( ( _u133 = create_slb) | contains_slb(_u133, findmin_pqp_res(_u134)) | ( findmin_cpq_eff(triple(_u134, _u133, _u132)) = triple(_u134, update_slb(_u133, findmin_pqp_res(_u134)), bad)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax48 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax48-1, axiom, ( ( _u137 = create_slb) | ~contains_slb(_u137, findmin_pqp_res(_u138)) | ~strictly_less_than(findmin_pqp_res(_u138), lookup_slb(_u137, findmin_pqp_res(_u138))) | ( findmin_cpq_eff(triple(_u138, _u137, _u136)) = triple(_u138, update_slb(_u137, findmin_pqp_res(_u138)), bad)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax49 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax49-1, axiom, ( ( _u141 = create_slb) | ~contains_slb(_u141, findmin_pqp_res(_u142)) | ~less_than(lookup_slb(_u141, findmin_pqp_res(_u142)), findmin_pqp_res(_u142)) | ( findmin_cpq_eff(triple(_u142, _u141, _u140)) = triple(_u142, update_slb(_u141, findmin_pqp_res(_u142)), _u140)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax50 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax50-1, axiom, ( ( findmin_cpq_res(triple(_u144, create_slb, _u143)) = bottom) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax51 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax51-1, axiom, ( ( _u147 = create_slb) | ( findmin_cpq_res(triple(_u148, _u147, _u146)) = findmin_pqp_res(_u148)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax52 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax52-1, axiom, ( ( removemin_cpq_eff(_u149) = remove_cpq(findmin_cpq_eff(_u149), findmin_cpq_res(_u149))) )).
% 1.01/1.17
% 1.01/1.17 % Formula: ax53 ( axiom ) converted to clauses:
% 1.01/1.17 cnf(ax53-1, axiom, ( ( removemin_cpq_res(_u150) = findmin_cpq_res(_u150)) )).
% 1.01/1.17
% 1.01/1.17 % Formula: l33_co ( conjecture ) converted to clauses:
% 1.01/1.17 cnf(l33_co-1, negated_conjecture, ( ok(remove_cpq(triple(skolem1, skolem2, skolem3), skolem4)) )).
% 1.01/1.17 cnf(l33_co-2, negated_conjecture, ( ~contains_slb(skolem2, skolem4) )).
% 1.01/1.17
% 1.01/1.17 % Problem matrix:
% 1.01/1.17 cnf(matrix-0, plain, ( ( __eqx_0 = __eqx_0) )).
% 1.01/1.17 cnf(matrix-1, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 = __eqx_0) )).
% 1.01/1.17 cnf(matrix-2, plain, ( ( __eqx_0 != __eqx_1) | ( __eqx_1 != __eqx_2) | ( __eqx_0 = __eqx_2) )).
% 1.01/1.17 cnf(matrix-3, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( pair(__eqx_0, __eqx_1) = pair(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-4, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( insert_slb(__eqx_0, __eqx_1) = insert_slb(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-5, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( remove_slb(__eqx_0, __eqx_1) = remove_slb(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-6, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( lookup_slb(__eqx_0, __eqx_1) = lookup_slb(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-7, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( update_slb(__eqx_0, __eqx_1) = update_slb(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-8, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( insert_cpq(__eqx_0, __eqx_1) = insert_cpq(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-9, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( remove_cpq(__eqx_0, __eqx_1) = remove_cpq(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-10, plain, ( ( __eqx_0 != __eqy_0) | ( findmin_cpq_eff(__eqx_0) = findmin_cpq_eff(__eqy_0)) )).
% 1.01/1.17 cnf(matrix-11, plain, ( ( __eqx_0 != __eqy_0) | ( removemin_cpq_eff(__eqx_0) = removemin_cpq_eff(__eqy_0)) )).
% 1.01/1.17 cnf(matrix-12, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ( triple(__eqx_0, __eqx_1, __eqx_2) = triple(__eqy_0, __eqy_1, __eqy_2)) )).
% 1.01/1.17 cnf(matrix-13, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( insert_pqp(__eqx_0, __eqx_1) = insert_pqp(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-14, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( remove_pqp(__eqx_0, __eqx_1) = remove_pqp(__eqy_0, __eqy_1)) )).
% 1.01/1.17 cnf(matrix-15, plain, ( ( __eqx_0 != __eqy_0) | ( findmin_pqp_res(__eqx_0) = findmin_pqp_res(__eqy_0)) )).
% 1.01/1.17 cnf(matrix-16, plain, ( ( __eqx_0 != __eqy_0) | ( findmin_cpq_res(__eqx_0) = findmin_cpq_res(__eqy_0)) )).
% 1.01/1.17 cnf(matrix-17, plain, ( ( __eqx_0 != __eqy_0) | ( removemin_cpq_res(__eqx_0) = removemin_cpq_res(__eqy_0)) )).
% 1.01/1.17 cnf(matrix-18, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~less_than(__eqx_0, __eqx_1) | less_than(__eqy_0, __eqy_1) )).
% 1.01/1.17 cnf(matrix-19, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~strictly_less_than(__eqx_0, __eqx_1) | strictly_less_than(__eqy_0, __eqy_1) )).
% 1.01/1.17 cnf(matrix-20, plain, ( ( __eqx_0 != __eqy_0) | ~isnonempty_slb(__eqx_0) | isnonempty_slb(__eqy_0) )).
% 1.01/1.17 cnf(matrix-21, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~contains_slb(__eqx_0, __eqx_1) | contains_slb(__eqy_0, __eqy_1) )).
% 1.01/1.17 cnf(matrix-22, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ( __eqx_2 != __eqy_2) | ~pair_in_list(__eqx_0, __eqx_1, __eqx_2) | pair_in_list(__eqy_0, __eqy_1, __eqy_2) )).
% 1.01/1.17 cnf(matrix-23, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~succ_cpq(__eqx_0, __eqx_1) | succ_cpq(__eqy_0, __eqy_1) )).
% 1.01/1.17 cnf(matrix-24, plain, ( ( __eqx_0 != __eqy_0) | ~check_cpq(__eqx_0) | check_cpq(__eqy_0) )).
% 1.01/1.17 cnf(matrix-25, plain, ( ( __eqx_0 != __eqy_0) | ( __eqx_1 != __eqy_1) | ~contains_cpq(__eqx_0, __eqx_1) | contains_cpq(__eqy_0, __eqy_1) )).
% 1.01/1.17 cnf(matrix-26, plain, ( ( __eqx_0 != __eqy_0) | ~ok(__eqx_0) | ok(__eqy_0) )).
% 1.01/1.17 cnf(matrix-27, plain, ( ~less_than(_u2, _u1) | ~less_than(_u1, _u0) | less_than(_u2, _u0) )).
% 1.01/1.17 cnf(matrix-28, plain, ( less_than(_u4, _u3) | less_than(_u3, _u4) )).
% 1.01/1.17 cnf(matrix-29, plain, ( less_than(_u5, _u5) )).
% 1.01/1.17 cnf(matrix-30, plain, ( ~strictly_less_than(_u10, _u8) | less_than(_u10, _u8) )).
% 1.01/1.17 cnf(matrix-31, plain, ( ~strictly_less_than(_u10, _u8) | ~less_than(_u8, _u10) )).
% 1.01/1.17 cnf(matrix-32, plain, ( ~less_than(_u11, _u9) | less_than(_u9, _u11) | strictly_less_than(_u11, _u9) )).
% 1.01/1.17 cnf(matrix-33, plain, ( less_than(bottom, _u12) )).
% 1.01/1.17 cnf(matrix-34, plain, ( ~isnonempty_slb(create_slb) )).
% 1.01/1.17 cnf(matrix-35, plain, ( isnonempty_slb(insert_slb(_u15, pair(_u14, _u13))) )).
% 1.01/1.17 cnf(matrix-36, plain, ( ~contains_slb(create_slb, _u16) )).
% 1.01/1.17 cnf(matrix-37, plain, ( contains_slb(_u27, _u23) | ( _u25 = _u23) | ~contains_slb(insert_slb(_u27, pair(_u25, _u21)), _u23) )).
% 1.01/1.17 cnf(matrix-38, plain, ( contains_slb(insert_slb(_u28, pair(_u26, _u22)), _u24) | ~contains_slb(_u28, _u24) )).
% 1.01/1.17 cnf(matrix-39, plain, ( contains_slb(insert_slb(_u28, pair(_u26, _u22)), _u24) | ( _u26 != _u24) )).
% 1.01/1.17 cnf(matrix-40, plain, ( ~pair_in_list(create_slb, _u30, _u29) )).
% 1.01/1.17 cnf(matrix-41, plain, ( ~pair_in_list(insert_slb(_u44, pair(_u42, _u38)), _u40, _u36) | pair_in_list(_u44, _u40, _u36) | ( _u42 = _u40) )).
% 1.01/1.17 cnf(matrix-42, plain, ( ~pair_in_list(insert_slb(_u44, pair(_u42, _u38)), _u40, _u36) | pair_in_list(_u44, _u40, _u36) | ( _u38 = _u36) )).
% 1.01/1.17 cnf(matrix-43, plain, ( pair_in_list(insert_slb(_u45, pair(_u43, _u39)), _u41, _u37) | ~pair_in_list(_u45, _u41, _u37) )).
% 1.01/1.17 cnf(matrix-44, plain, ( pair_in_list(insert_slb(_u45, pair(_u43, _u39)), _u41, _u37) | ( _u43 != _u41) | ( _u39 != _u37) )).
% 1.01/1.17 cnf(matrix-45, plain, ( ( remove_slb(insert_slb(_u48, pair(_u47, _u46)), _u47) = _u48) )).
% 1.01/1.17 cnf(matrix-46, plain, ( ( _u51 = _u50) | ~contains_slb(_u52, _u50) | ( remove_slb(insert_slb(_u52, pair(_u51, _u49)), _u50) = insert_slb(remove_slb(_u52, _u50), pair(_u51, _u49))) )).
% 1.01/1.17 cnf(matrix-47, plain, ( ( lookup_slb(insert_slb(_u55, pair(_u54, _u53)), _u54) = _u53) )).
% 1.01/1.17 cnf(matrix-48, plain, ( ( _u58 = _u57) | ~contains_slb(_u59, _u57) | ( lookup_slb(insert_slb(_u59, pair(_u58, _u56)), _u57) = lookup_slb(_u59, _u57)) )).
% 1.01/1.17 cnf(matrix-49, plain, ( ( update_slb(create_slb, _u60) = create_slb) )).
% 1.01/1.17 cnf(matrix-50, plain, ( ~strictly_less_than(_u61, _u62) | ( update_slb(insert_slb(_u64, pair(_u63, _u61)), _u62) = insert_slb(update_slb(_u64, _u62), pair(_u63, _u62))) )).
% 1.01/1.17 cnf(matrix-51, plain, ( ~less_than(_u66, _u65) | ( update_slb(insert_slb(_u68, pair(_u67, _u65)), _u66) = insert_slb(update_slb(_u68, _u66), pair(_u67, _u65))) )).
% 1.01/1.17 cnf(matrix-52, plain, ( succ_cpq(_u69, _u69) )).
% 1.01/1.17 cnf(matrix-53, plain, ( ~succ_cpq(_u72, _u71) | succ_cpq(_u72, insert_cpq(_u71, _u70)) )).
% 1.01/1.17 cnf(matrix-54, plain, ( ~succ_cpq(_u75, _u74) | succ_cpq(_u75, remove_cpq(_u74, _u73)) )).
% 1.01/1.17 cnf(matrix-55, plain, ( ~succ_cpq(_u77, _u76) | succ_cpq(_u77, findmin_cpq_eff(_u76)) )).
% 1.01/1.17 cnf(matrix-56, plain, ( ~succ_cpq(_u79, _u78) | succ_cpq(_u79, removemin_cpq_eff(_u78)) )).
% 1.01/1.17 cnf(matrix-57, plain, ( check_cpq(triple(_u81, create_slb, _u80)) )).
% 1.01/1.17 cnf(matrix-58, plain, ( ~less_than(_u82, _u83) | ~check_cpq(triple(_u86, insert_slb(_u85, pair(_u83, _u82)), _u84)) | check_cpq(triple(_u86, _u85, _u84)) )).
% 1.01/1.17 cnf(matrix-59, plain, ( ~less_than(_u82, _u83) | ~check_cpq(triple(_u86, _u85, _u84)) | check_cpq(triple(_u86, insert_slb(_u85, pair(_u83, _u82)), _u84)) )).
% 1.01/1.17 cnf(matrix-60, plain, ( ~strictly_less_than(_u88, _u87) | ~check_cpq(triple(_u91, insert_slb(_u90, pair(_u88, _u87)), _u89)) )).
% 1.01/1.17 cnf(matrix-61, plain, ( ~contains_cpq(triple(_u102, _u100, _u98), _u96) | contains_slb(_u100, _u96) )).
% 1.01/1.17 cnf(matrix-62, plain, ( ~contains_slb(_u101, _u97) | contains_cpq(triple(_u103, _u101, _u99), _u97) )).
% 1.01/1.17 cnf(matrix-63, plain, ( ~ok(triple(_u108, _u106, bad)) )).
% 1.01/1.17 cnf(matrix-64, plain, ( ok(triple(_u112, _u111, _u110)) | ( _u110 = bad) )).
% 1.01/1.17 cnf(matrix-65, plain, ( ( insert_cpq(triple(_u116, _u115, _u114), _u113) = triple(insert_pqp(_u116, _u113), insert_slb(_u115, pair(_u113, bottom)), _u114)) )).
% 1.01/1.17 cnf(matrix-66, plain, ( contains_slb(_u119, _u117) | ( remove_cpq(triple(_u120, _u119, _u118), _u117) = triple(_u120, _u119, bad)) )).
% 1.01/1.17 cnf(matrix-67, plain, ( ~contains_slb(_u123, _u121) | ~less_than(lookup_slb(_u123, _u121), _u121) | ( remove_cpq(triple(_u124, _u123, _u122), _u121) = triple(remove_pqp(_u124, _u121), remove_slb(_u123, _u121), _u122)) )).
% 1.01/1.17 cnf(matrix-68, plain, ( ~contains_slb(_u127, _u125) | ~strictly_less_than(_u125, lookup_slb(_u127, _u125)) | ( remove_cpq(triple(_u128, _u127, _u126), _u125) = triple(remove_pqp(_u128, _u125), remove_slb(_u127, _u125), bad)) )).
% 1.01/1.17 cnf(matrix-69, plain, ( ( findmin_cpq_eff(triple(_u130, create_slb, _u129)) = triple(_u130, create_slb, bad)) )).
% 1.01/1.17 cnf(matrix-70, plain, ( ( _u133 = create_slb) | contains_slb(_u133, findmin_pqp_res(_u134)) | ( findmin_cpq_eff(triple(_u134, _u133, _u132)) = triple(_u134, update_slb(_u133, findmin_pqp_res(_u134)), bad)) )).
% 1.01/1.17 cnf(matrix-71, plain, ( ( _u137 = create_slb) | ~contains_slb(_u137, findmin_pqp_res(_u138)) | ~strictly_less_than(findmin_pqp_res(_u138), lookup_slb(_u137, findmin_pqp_res(_u138))) | ( findmin_cpq_eff(triple(_u138, _u137, _u136)) = triple(_u138, update_slb(_u137, findmin_pqp_res(_u138)), bad)) )).
% 1.01/1.17 cnf(matrix-72, plain, ( ( _u141 = create_slb) | ~contains_slb(_u141, findmin_pqp_res(_u142)) | ~less_than(lookup_slb(_u141, findmin_pqp_res(_u142)), findmin_pqp_res(_u142)) | ( findmin_cpq_eff(triple(_u142, _u141, _u140)) = triple(_u142, update_slb(_u141, findmin_pqp_res(_u142)), _u140)) )).
% 1.01/1.17 cnf(matrix-73, plain, ( ( findmin_cpq_res(triple(_u144, create_slb, _u143)) = bottom) )).
% 1.01/1.17 cnf(matrix-74, plain, ( ( _u147 = create_slb) | ( findmin_cpq_res(triple(_u148, _u147, _u146)) = findmin_pqp_res(_u148)) )).
% 1.01/1.17 cnf(matrix-75, plain, ( ( removemin_cpq_eff(_u149) = remove_cpq(findmin_cpq_eff(_u149), findmin_cpq_res(_u149))) )).
% 1.01/1.17 cnf(matrix-76, plain, ( ( removemin_cpq_res(_u150) = findmin_cpq_res(_u150)) )).
% 1.01/1.17 cnf(matrix-77, plain, ( ok(remove_cpq(triple(skolem1, skolem2, skolem3), skolem4)) )).
% 1.01/1.17 cnf(matrix-78, plain, ( ~contains_slb(skolem2, skolem4) )).
% 1.01/1.17
% 1.01/1.17 % Proof stack:
% 1.01/1.17 cnf(proof-stack, plain,
% 1.01/1.17 proof_stack(
% 1.01/1.17 start(78),
% 1.01/1.17 left_branch(0, 66, 0, 2),
% 1.01/1.17 left_branch(0, 26, 0, 3),
% 1.01/1.17 left_branch(0, 63, 0, 4),
% 1.01/1.17 right_branch(4),
% 1.01/1.17 left_branch(0, 77, 0, 5),
% 1.01/1.17 right_branch(5),
% 1.01/1.17 right_branch(3),
% 1.01/1.17 right_branch(2)
% 1.01/1.17 )).
% 1.01/1.17 % SZS output end Proof for theBenchmark
%------------------------------------------------------------------------------