TSTP Solution File: SWV106+1 by Princess---230619

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Princess---230619
% Problem  : SWV106+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s

% Computer : n009.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 : Thu Aug 31 22:54:55 EDT 2023

% Result   : Theorem 10.30s 2.15s
% Output   : Proof 15.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SWV106+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.03/0.13  % Command  : princess -inputFormat=tptp +threads -portfolio=casc +printProof -timeoutSec=%d %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 03:52:05 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.54/0.60  ________       _____
% 0.54/0.60  ___  __ \_________(_)________________________________
% 0.54/0.60  __  /_/ /_  ___/_  /__  __ \  ___/  _ \_  ___/_  ___/
% 0.54/0.60  _  ____/_  /   _  / _  / / / /__ /  __/(__  )_(__  )
% 0.54/0.60  /_/     /_/    /_/  /_/ /_/\___/ \___//____/ /____/
% 0.54/0.60  
% 0.54/0.60  A Theorem Prover for First-Order Logic modulo Linear Integer Arithmetic
% 0.54/0.60  (2023-06-19)
% 0.54/0.60  
% 0.54/0.60  (c) Philipp Rümmer, 2009-2023
% 0.54/0.60  Contributors: Peter Backeman, Peter Baumgartner, Angelo Brillout, Zafer Esen,
% 0.54/0.60                Amanda Stjerna.
% 0.54/0.60  Free software under BSD-3-Clause.
% 0.54/0.60  
% 0.54/0.60  For more information, visit http://www.philipp.ruemmer.org/princess.shtml
% 0.54/0.60  
% 0.54/0.60  Loading /export/starexec/sandbox/benchmark/theBenchmark.p ...
% 0.54/0.62  Running up to 7 provers in parallel.
% 0.54/0.63  Prover 0: Options:  +triggersInConjecture +genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1042961893
% 0.54/0.63  Prover 1: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1571432423
% 0.54/0.63  Prover 3: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=1922548996
% 0.54/0.63  Prover 2: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMinimalAndEmpty -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1065072994
% 0.54/0.63  Prover 4: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=1868514696
% 0.54/0.63  Prover 5: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allMaximal -realRatSaturationRounds=1 -ignoreQuantifiers -constructProofs=never -generateTriggers=complete -randomSeed=1259561288
% 0.54/0.63  Prover 6: Options:  -triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=none +reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximalOutermost -realRatSaturationRounds=0 -ignoreQuantifiers -constructProofs=never -generateTriggers=all -randomSeed=-1399714365
% 4.60/1.40  Prover 4: Preprocessing ...
% 4.60/1.43  Prover 1: Preprocessing ...
% 5.13/1.46  Prover 3: Preprocessing ...
% 5.13/1.46  Prover 5: Preprocessing ...
% 5.13/1.46  Prover 2: Preprocessing ...
% 5.13/1.46  Prover 0: Preprocessing ...
% 5.13/1.46  Prover 6: Preprocessing ...
% 9.96/2.10  Prover 5: Constructing countermodel ...
% 10.30/2.14  Prover 5: proved (1514ms)
% 10.30/2.14  
% 10.30/2.15  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.30/2.15  
% 10.30/2.15  Prover 7: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple +reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-236303470
% 10.99/2.26  Prover 3: Constructing countermodel ...
% 10.99/2.26  Prover 3: stopped
% 10.99/2.28  Prover 8: Options:  +triggersInConjecture +genTotalityAxioms -tightFunctionScopes -clausifier=none -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-200781089
% 11.42/2.29  Prover 6: Constructing countermodel ...
% 11.42/2.29  Prover 6: stopped
% 11.42/2.29  Prover 10: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=919308125
% 11.42/2.29  Prover 1: Warning: ignoring some quantifiers
% 11.42/2.31  Prover 7: Preprocessing ...
% 12.15/2.38  Prover 1: Constructing countermodel ...
% 12.49/2.44  Prover 8: Preprocessing ...
% 12.69/2.45  Prover 4: Warning: ignoring some quantifiers
% 12.69/2.45  Prover 10: Preprocessing ...
% 12.69/2.51  Prover 2: Constructing countermodel ...
% 12.69/2.51  Prover 2: stopped
% 12.69/2.51  Prover 11: Options:  +triggersInConjecture -genTotalityAxioms +tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation -boolFunsAsPreds -triggerStrategy=allUni -realRatSaturationRounds=1 +ignoreQuantifiers -constructProofs=always -generateTriggers=all -randomSeed=-1509710984
% 13.29/2.56  Prover 0: Constructing countermodel ...
% 13.29/2.56  Prover 0: stopped
% 13.29/2.57  Prover 1: Found proof (size 5)
% 13.29/2.57  Prover 1: proved (1946ms)
% 13.29/2.57  Prover 13: Options:  +triggersInConjecture -genTotalityAxioms -tightFunctionScopes -clausifier=simple -reverseFunctionalityPropagation +boolFunsAsPreds -triggerStrategy=maximal -realRatSaturationRounds=0 +ignoreQuantifiers -constructProofs=always -generateTriggers=complete -randomSeed=1138197443
% 13.72/2.59  Prover 4: Constructing countermodel ...
% 13.72/2.62  Prover 11: Preprocessing ...
% 13.72/2.63  Prover 10: Warning: ignoring some quantifiers
% 13.72/2.63  Prover 7: Warning: ignoring some quantifiers
% 13.72/2.64  Prover 4: stopped
% 14.47/2.68  Prover 13: Preprocessing ...
% 14.47/2.68  Prover 10: Constructing countermodel ...
% 14.47/2.70  Prover 11: stopped
% 14.47/2.71  Prover 10: stopped
% 14.47/2.72  Prover 7: Constructing countermodel ...
% 14.86/2.75  Prover 7: stopped
% 15.05/2.76  Prover 8: Warning: ignoring some quantifiers
% 15.05/2.78  Prover 8: Constructing countermodel ...
% 15.05/2.80  Prover 13: stopped
% 15.05/2.81  Prover 8: stopped
% 15.05/2.81  
% 15.05/2.81  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.05/2.81  
% 15.05/2.81  % SZS output start Proof for theBenchmark
% 15.05/2.81  Assumptions after simplification:
% 15.05/2.81  ---------------------------------
% 15.05/2.81  
% 15.05/2.81    (quaternion_ds1_inuse_0018)
% 15.48/2.85    $i(z_defuse) & $i(xinit_noise_defuse) & $i(xinit_mean_defuse) &
% 15.48/2.85    $i(xinit_defuse) & $i(u_defuse) & $i(n_steps) & $i(sigma_defuse) &
% 15.48/2.85    $i(n_statevars) & $i(rho_defuse) & $i(m_measvars) & $i(use) & $i(n2) & $i(n1)
% 15.48/2.85    & $i(n0) &  ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (minus(n_steps, n1) = v2
% 15.48/2.85      & minus(n_statevars, n1) = v1 & minus(m_measvars, n1) = v0 & $i(v2) & $i(v1)
% 15.48/2.85      & $i(v0) &  ~ true &  ! [v3: $i] :  ! [v4: $i] : ( ~ (leq(v4, v2) = 0) |  ~
% 15.48/2.85        (leq(v3, v0) = 0) |  ~ $i(v4) |  ~ $i(v3) |  ? [v5: any] :  ? [v6: any] : 
% 15.48/2.85        ? [v7: $i] : (a_select3(z_defuse, v3, v4) = v7 & leq(n0, v4) = v6 &
% 15.48/2.85          leq(n0, v3) = v5 & $i(v7) & ( ~ (v6 = 0) |  ~ (v5 = 0) | v7 = use))) & 
% 15.48/2.85      ! [v3: $i] :  ! [v4: $i] : ( ~ (leq(v4, v2) = 0) |  ~ (leq(v3, n2) = 0) |  ~
% 15.48/2.85        $i(v4) |  ~ $i(v3) |  ? [v5: any] :  ? [v6: any] :  ? [v7: $i] :
% 15.48/2.85        (a_select3(u_defuse, v3, v4) = v7 & leq(n0, v4) = v6 & leq(n0, v3) = v5 &
% 15.48/2.85          $i(v7) & ( ~ (v6 = 0) |  ~ (v5 = 0) | v7 = use))) &  ! [v3: $i] : ( ~
% 15.48/2.85        (leq(v3, v1) = 0) |  ~ $i(v3) |  ? [v4: any] :  ? [v5: $i] :
% 15.48/2.85        (a_select2(xinit_noise_defuse, v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~
% 15.48/2.85            (v4 = 0) | v5 = use))) &  ! [v3: $i] : ( ~ (leq(v3, v1) = 0) |  ~
% 15.48/2.85        $i(v3) |  ? [v4: any] :  ? [v5: $i] : (a_select2(xinit_mean_defuse, v3) =
% 15.48/2.85          v5 & leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 = use))) &  ! [v3:
% 15.48/2.85        $i] : ( ~ (leq(v3, v1) = 0) |  ~ $i(v3) |  ? [v4: any] :  ? [v5: $i] :
% 15.48/2.85        (a_select2(xinit_defuse, v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 =
% 15.48/2.85              0) | v5 = use))) &  ! [v3: $i] : ( ~ (leq(v3, v1) = 0) |  ~ $i(v3) |
% 15.48/2.85         ? [v4: any] :  ? [v5: $i] : (a_select2(sigma_defuse, v3) = v5 & leq(n0,
% 15.48/2.85            v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 = use))) &  ! [v3: $i] : ( ~
% 15.48/2.85        (leq(v3, v0) = 0) |  ~ $i(v3) |  ? [v4: any] :  ? [v5: $i] :
% 15.48/2.85        (a_select2(rho_defuse, v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 = 0)
% 15.48/2.85            | v5 = use))))
% 15.48/2.85  
% 15.48/2.85    (ttrue)
% 15.48/2.85    true
% 15.48/2.85  
% 15.48/2.85  Further assumptions not needed in the proof:
% 15.48/2.85  --------------------------------------------
% 15.48/2.86  const_array1_select, const_array2_select, defuse, finite_domain_0,
% 15.48/2.86  finite_domain_1, finite_domain_2, finite_domain_3, finite_domain_4,
% 15.48/2.86  finite_domain_5, gt_0_tptp_minus_1, gt_1_0, gt_1_tptp_minus_1, gt_2_0, gt_2_1,
% 15.48/2.86  gt_2_tptp_minus_1, gt_3_0, gt_3_1, gt_3_2, gt_3_tptp_minus_1, gt_4_0, gt_4_1,
% 15.48/2.86  gt_4_2, gt_4_3, gt_4_tptp_minus_1, gt_5_0, gt_5_1, gt_5_2, gt_5_3, gt_5_4,
% 15.48/2.86  gt_5_tptp_minus_1, gt_succ, irreflexivity_gt, leq_geq, leq_gt1, leq_gt2,
% 15.48/2.86  leq_gt_pred, leq_minus, leq_succ, leq_succ_gt, leq_succ_gt_equiv, leq_succ_succ,
% 15.48/2.86  lt_gt, matrix_symm_aba1, matrix_symm_aba2, matrix_symm_add, matrix_symm_inv,
% 15.48/2.86  matrix_symm_joseph_update, matrix_symm_sub, matrix_symm_trans,
% 15.48/2.86  matrix_symm_update_diagonal, pred_minus_1, pred_succ, reflexivity_leq,
% 15.48/2.86  sel2_update_1, sel2_update_2, sel2_update_3, sel3_update_1, sel3_update_2,
% 15.48/2.86  sel3_update_3, succ_plus_1_l, succ_plus_1_r, succ_plus_2_l, succ_plus_2_r,
% 15.48/2.86  succ_plus_3_l, succ_plus_3_r, succ_plus_4_l, succ_plus_4_r, succ_plus_5_l,
% 15.48/2.86  succ_plus_5_r, succ_pred, succ_tptp_minus_1, successor_1, successor_2,
% 15.48/2.86  successor_3, successor_4, successor_5, sum_plus_base, sum_plus_base_float,
% 15.48/2.86  totality, transitivity_gt, transitivity_leq, uniform_int_rand_ranges_hi,
% 15.48/2.86  uniform_int_rand_ranges_lo
% 15.48/2.86  
% 15.48/2.86  Those formulas are unsatisfiable:
% 15.48/2.86  ---------------------------------
% 15.48/2.86  
% 15.48/2.86  Begin of proof
% 15.48/2.86  | 
% 15.48/2.86  | ALPHA: (quaternion_ds1_inuse_0018) implies:
% 15.48/2.86  |   (1)   ? [v0: $i] :  ? [v1: $i] :  ? [v2: $i] : (minus(n_steps, n1) = v2 &
% 15.48/2.86  |          minus(n_statevars, n1) = v1 & minus(m_measvars, n1) = v0 & $i(v2) &
% 15.48/2.86  |          $i(v1) & $i(v0) &  ~ true &  ! [v3: $i] :  ! [v4: $i] : ( ~ (leq(v4,
% 15.48/2.86  |                v2) = 0) |  ~ (leq(v3, v0) = 0) |  ~ $i(v4) |  ~ $i(v3) |  ?
% 15.48/2.86  |            [v5: any] :  ? [v6: any] :  ? [v7: $i] : (a_select3(z_defuse, v3,
% 15.48/2.86  |                v4) = v7 & leq(n0, v4) = v6 & leq(n0, v3) = v5 & $i(v7) & ( ~
% 15.48/2.86  |                (v6 = 0) |  ~ (v5 = 0) | v7 = use))) &  ! [v3: $i] :  ! [v4:
% 15.48/2.86  |            $i] : ( ~ (leq(v4, v2) = 0) |  ~ (leq(v3, n2) = 0) |  ~ $i(v4) |  ~
% 15.48/2.86  |            $i(v3) |  ? [v5: any] :  ? [v6: any] :  ? [v7: $i] :
% 15.48/2.86  |            (a_select3(u_defuse, v3, v4) = v7 & leq(n0, v4) = v6 & leq(n0, v3)
% 15.48/2.86  |              = v5 & $i(v7) & ( ~ (v6 = 0) |  ~ (v5 = 0) | v7 = use))) &  !
% 15.48/2.86  |          [v3: $i] : ( ~ (leq(v3, v1) = 0) |  ~ $i(v3) |  ? [v4: any] :  ? [v5:
% 15.48/2.86  |              $i] : (a_select2(xinit_noise_defuse, v3) = v5 & leq(n0, v3) = v4
% 15.48/2.86  |              & $i(v5) & ( ~ (v4 = 0) | v5 = use))) &  ! [v3: $i] : ( ~
% 15.48/2.86  |            (leq(v3, v1) = 0) |  ~ $i(v3) |  ? [v4: any] :  ? [v5: $i] :
% 15.48/2.86  |            (a_select2(xinit_mean_defuse, v3) = v5 & leq(n0, v3) = v4 & $i(v5)
% 15.48/2.86  |              & ( ~ (v4 = 0) | v5 = use))) &  ! [v3: $i] : ( ~ (leq(v3, v1) =
% 15.48/2.86  |              0) |  ~ $i(v3) |  ? [v4: any] :  ? [v5: $i] :
% 15.48/2.86  |            (a_select2(xinit_defuse, v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~
% 15.48/2.86  |                (v4 = 0) | v5 = use))) &  ! [v3: $i] : ( ~ (leq(v3, v1) = 0) | 
% 15.48/2.86  |            ~ $i(v3) |  ? [v4: any] :  ? [v5: $i] : (a_select2(sigma_defuse,
% 15.48/2.86  |                v3) = v5 & leq(n0, v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 =
% 15.48/2.86  |                use))) &  ! [v3: $i] : ( ~ (leq(v3, v0) = 0) |  ~ $i(v3) |  ?
% 15.48/2.86  |            [v4: any] :  ? [v5: $i] : (a_select2(rho_defuse, v3) = v5 & leq(n0,
% 15.48/2.86  |                v3) = v4 & $i(v5) & ( ~ (v4 = 0) | v5 = use))))
% 15.48/2.86  | 
% 15.48/2.86  | DELTA: instantiating (1) with fresh symbols all_74_0, all_74_1, all_74_2
% 15.48/2.86  |        gives:
% 15.48/2.87  |   (2)  minus(n_steps, n1) = all_74_0 & minus(n_statevars, n1) = all_74_1 &
% 15.48/2.87  |        minus(m_measvars, n1) = all_74_2 & $i(all_74_0) & $i(all_74_1) &
% 15.48/2.87  |        $i(all_74_2) &  ~ true &  ! [v0: $i] :  ! [v1: $i] : ( ~ (leq(v1,
% 15.48/2.87  |              all_74_0) = 0) |  ~ (leq(v0, all_74_2) = 0) |  ~ $i(v1) |  ~
% 15.48/2.87  |          $i(v0) |  ? [v2: any] :  ? [v3: any] :  ? [v4: $i] :
% 15.48/2.87  |          (a_select3(z_defuse, v0, v1) = v4 & leq(n0, v1) = v3 & leq(n0, v0) =
% 15.48/2.87  |            v2 & $i(v4) & ( ~ (v3 = 0) |  ~ (v2 = 0) | v4 = use))) &  ! [v0:
% 15.48/2.87  |          $i] :  ! [v1: $i] : ( ~ (leq(v1, all_74_0) = 0) |  ~ (leq(v0, n2) =
% 15.48/2.87  |            0) |  ~ $i(v1) |  ~ $i(v0) |  ? [v2: any] :  ? [v3: any] :  ? [v4:
% 15.48/2.87  |            $i] : (a_select3(u_defuse, v0, v1) = v4 & leq(n0, v1) = v3 &
% 15.48/2.87  |            leq(n0, v0) = v2 & $i(v4) & ( ~ (v3 = 0) |  ~ (v2 = 0) | v4 =
% 15.48/2.87  |              use))) &  ! [v0: $i] : ( ~ (leq(v0, all_74_1) = 0) |  ~ $i(v0) | 
% 15.48/2.87  |          ? [v1: any] :  ? [v2: $i] : (a_select2(xinit_noise_defuse, v0) = v2 &
% 15.48/2.87  |            leq(n0, v0) = v1 & $i(v2) & ( ~ (v1 = 0) | v2 = use))) &  ! [v0:
% 15.48/2.87  |          $i] : ( ~ (leq(v0, all_74_1) = 0) |  ~ $i(v0) |  ? [v1: any] :  ?
% 15.48/2.87  |          [v2: $i] : (a_select2(xinit_mean_defuse, v0) = v2 & leq(n0, v0) = v1
% 15.48/2.87  |            & $i(v2) & ( ~ (v1 = 0) | v2 = use))) &  ! [v0: $i] : ( ~ (leq(v0,
% 15.48/2.87  |              all_74_1) = 0) |  ~ $i(v0) |  ? [v1: any] :  ? [v2: $i] :
% 15.48/2.87  |          (a_select2(xinit_defuse, v0) = v2 & leq(n0, v0) = v1 & $i(v2) & ( ~
% 15.48/2.87  |              (v1 = 0) | v2 = use))) &  ! [v0: $i] : ( ~ (leq(v0, all_74_1) =
% 15.48/2.87  |            0) |  ~ $i(v0) |  ? [v1: any] :  ? [v2: $i] :
% 15.48/2.87  |          (a_select2(sigma_defuse, v0) = v2 & leq(n0, v0) = v1 & $i(v2) & ( ~
% 15.48/2.87  |              (v1 = 0) | v2 = use))) &  ! [v0: $i] : ( ~ (leq(v0, all_74_2) =
% 15.48/2.87  |            0) |  ~ $i(v0) |  ? [v1: any] :  ? [v2: $i] :
% 15.48/2.87  |          (a_select2(rho_defuse, v0) = v2 & leq(n0, v0) = v1 & $i(v2) & ( ~ (v1
% 15.48/2.87  |                = 0) | v2 = use)))
% 15.48/2.87  | 
% 15.48/2.87  | ALPHA: (2) implies:
% 15.48/2.87  |   (3)   ~ true
% 15.48/2.87  | 
% 15.48/2.87  | PRED_UNIFY: (3), (ttrue) imply:
% 15.48/2.87  |   (4)  $false
% 15.48/2.87  | 
% 15.48/2.87  | CLOSE: (4) is inconsistent.
% 15.48/2.87  | 
% 15.48/2.87  End of proof
% 15.48/2.87  % SZS output end Proof for theBenchmark
% 15.48/2.87  
% 15.48/2.87  2267ms
%------------------------------------------------------------------------------