TSTP Solution File: SYO471^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : SYO471^1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% 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 : Fri Sep 1 04:16:03 EDT 2023
% Result : Theorem 0.22s 0.55s
% Output : Proof 0.22s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SYO471^1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % Command : do_cvc5 %s %d
% 0.15/0.35 % Computer : n029.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat Aug 26 08:20:55 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.22/0.49 %----Proving TH0
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 % File : SYO471^1 : TPTP v8.1.2. Released v4.0.0.
% 0.22/0.50 % Domain : Syntactic
% 0.22/0.50 % Problem : Ted Sider's propositional modal logic wff 22
% 0.22/0.50 % Version : Especial.
% 0.22/0.50 % : Theorem formulation : Uses system K axioms.
% 0.22/0.50 % English :
% 0.22/0.50
% 0.22/0.50 % Refs : [Sid09] Sider (2009), Logic for Philosophy
% 0.22/0.50 % Source : [Sid09]
% 0.22/0.50 % Names :
% 0.22/0.50
% 0.22/0.50 % Status : CounterCounterSatisfiable
% 0.22/0.50 % Rating : 0.25 v8.1.0, 0.40 v7.5.0, 0.20 v7.4.0, 0.25 v7.2.0, 0.33 v6.4.0, 0.00 v6.3.0, 0.33 v6.2.0, 0.00 v5.0.0, 0.33 v4.1.0, 0.50 v4.0.0
% 0.22/0.50 % Syntax : Number of formulae : 70 ( 33 unt; 36 typ; 33 def)
% 0.22/0.50 % Number of atoms : 108 ( 38 equ; 0 cnn)
% 0.22/0.50 % Maximal formula atoms : 8 ( 3 avg)
% 0.22/0.50 % Number of connectives : 138 ( 5 ~; 5 |; 8 &; 112 @)
% 0.22/0.50 % ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% 0.22/0.50 % Maximal formula depth : 6 ( 1 avg)
% 0.22/0.50 % Number of types : 3 ( 1 usr)
% 0.22/0.50 % Number of type conns : 179 ( 179 >; 0 *; 0 +; 0 <<)
% 0.22/0.50 % Number of symbols : 41 ( 39 usr; 5 con; 0-3 aty)
% 0.22/0.50 % Number of variables : 88 ( 52 ^; 30 !; 6 ?; 88 :)
% 0.22/0.50 % SPC : TH0_CSA_EQU_NAR
% 0.22/0.50
% 0.22/0.50 % Comments :
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 %----Include axioms for Modal logic K
% 0.22/0.50 %------------------------------------------------------------------------------
% 0.22/0.50 %----Declaration of additional base type mu
% 0.22/0.50 thf(mu_type,type,
% 0.22/0.50 mu: $tType ).
% 0.22/0.50
% 0.22/0.50 %----Equality
% 0.22/0.50 thf(meq_ind_type,type,
% 0.22/0.50 meq_ind: mu > mu > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(meq_ind,definition,
% 0.22/0.50 ( meq_ind
% 0.22/0.50 = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(meq_prop_type,type,
% 0.22/0.50 meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(meq_prop,definition,
% 0.22/0.50 ( meq_prop
% 0.22/0.50 = ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
% 0.22/0.50 ( ( X @ W )
% 0.22/0.50 = ( Y @ W ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %----Modal operators not, or, box, Pi
% 0.22/0.50 thf(mnot_type,type,
% 0.22/0.50 mnot: ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mnot,definition,
% 0.22/0.50 ( mnot
% 0.22/0.50 = ( ^ [Phi: $i > $o,W: $i] :
% 0.22/0.50 ~ ( Phi @ W ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mor_type,type,
% 0.22/0.50 mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mor,definition,
% 0.22/0.50 ( mor
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
% 0.22/0.50 ( ( Phi @ W )
% 0.22/0.50 | ( Psi @ W ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mand_type,type,
% 0.22/0.50 mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mand,definition,
% 0.22/0.50 ( mand
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mimplies_type,type,
% 0.22/0.50 mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mimplies,definition,
% 0.22/0.50 ( mimplies
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mimplied_type,type,
% 0.22/0.50 mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mimplied,definition,
% 0.22/0.50 ( mimplied
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mequiv_type,type,
% 0.22/0.50 mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mequiv,definition,
% 0.22/0.50 ( mequiv
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mxor_type,type,
% 0.22/0.50 mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mxor,definition,
% 0.22/0.50 ( mxor
% 0.22/0.50 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %----Universal quantification: individuals
% 0.22/0.50 thf(mforall_ind_type,type,
% 0.22/0.50 mforall_ind: ( mu > $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mforall_ind,definition,
% 0.22/0.50 ( mforall_ind
% 0.22/0.50 = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.22/0.50 ! [X: mu] : ( Phi @ X @ W ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mforall_prop_type,type,
% 0.22/0.50 mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mforall_prop,definition,
% 0.22/0.50 ( mforall_prop
% 0.22/0.50 = ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
% 0.22/0.50 ! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mexists_ind_type,type,
% 0.22/0.50 mexists_ind: ( mu > $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mexists_ind,definition,
% 0.22/0.50 ( mexists_ind
% 0.22/0.50 = ( ^ [Phi: mu > $i > $o] :
% 0.22/0.50 ( mnot
% 0.22/0.50 @ ( mforall_ind
% 0.22/0.50 @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mexists_prop_type,type,
% 0.22/0.50 mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mexists_prop,definition,
% 0.22/0.50 ( mexists_prop
% 0.22/0.50 = ( ^ [Phi: ( $i > $o ) > $i > $o] :
% 0.22/0.50 ( mnot
% 0.22/0.50 @ ( mforall_prop
% 0.22/0.50 @ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mtrue_type,type,
% 0.22/0.50 mtrue: $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mtrue,definition,
% 0.22/0.50 ( mtrue
% 0.22/0.50 = ( ^ [W: $i] : $true ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mfalse_type,type,
% 0.22/0.50 mfalse: $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mfalse,definition,
% 0.22/0.50 ( mfalse
% 0.22/0.50 = ( mnot @ mtrue ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mbox_type,type,
% 0.22/0.50 mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mbox,definition,
% 0.22/0.50 ( mbox
% 0.22/0.50 = ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
% 0.22/0.50 ! [V: $i] :
% 0.22/0.50 ( ~ ( R @ W @ V )
% 0.22/0.50 | ( Phi @ V ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mdia_type,type,
% 0.22/0.50 mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mdia,definition,
% 0.22/0.50 ( mdia
% 0.22/0.50 = ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %----Definition of properties of accessibility relations
% 0.22/0.50 thf(mreflexive_type,type,
% 0.22/0.50 mreflexive: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mreflexive,definition,
% 0.22/0.50 ( mreflexive
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i] : ( R @ S @ S ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(msymmetric_type,type,
% 0.22/0.50 msymmetric: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(msymmetric,definition,
% 0.22/0.50 ( msymmetric
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i] :
% 0.22/0.50 ( ( R @ S @ T )
% 0.22/0.50 => ( R @ T @ S ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mserial_type,type,
% 0.22/0.50 mserial: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mserial,definition,
% 0.22/0.50 ( mserial
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i] :
% 0.22/0.50 ? [T: $i] : ( R @ S @ T ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mtransitive_type,type,
% 0.22/0.50 mtransitive: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mtransitive,definition,
% 0.22/0.50 ( mtransitive
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i,U: $i] :
% 0.22/0.50 ( ( ( R @ S @ T )
% 0.22/0.50 & ( R @ T @ U ) )
% 0.22/0.50 => ( R @ S @ U ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(meuclidean_type,type,
% 0.22/0.50 meuclidean: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(meuclidean,definition,
% 0.22/0.50 ( meuclidean
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i,U: $i] :
% 0.22/0.50 ( ( ( R @ S @ T )
% 0.22/0.50 & ( R @ S @ U ) )
% 0.22/0.50 => ( R @ T @ U ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mpartially_functional_type,type,
% 0.22/0.50 mpartially_functional: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mpartially_functional,definition,
% 0.22/0.50 ( mpartially_functional
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i,U: $i] :
% 0.22/0.50 ( ( ( R @ S @ T )
% 0.22/0.50 & ( R @ S @ U ) )
% 0.22/0.50 => ( T = U ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mfunctional_type,type,
% 0.22/0.50 mfunctional: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mfunctional,definition,
% 0.22/0.50 ( mfunctional
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i] :
% 0.22/0.50 ? [T: $i] :
% 0.22/0.50 ( ( R @ S @ T )
% 0.22/0.50 & ! [U: $i] :
% 0.22/0.50 ( ( R @ S @ U )
% 0.22/0.50 => ( T = U ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mweakly_dense_type,type,
% 0.22/0.50 mweakly_dense: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mweakly_dense,definition,
% 0.22/0.50 ( mweakly_dense
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i,U: $i] :
% 0.22/0.50 ( ( R @ S @ T )
% 0.22/0.50 => ? [U: $i] :
% 0.22/0.50 ( ( R @ S @ U )
% 0.22/0.50 & ( R @ U @ T ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mweakly_connected_type,type,
% 0.22/0.50 mweakly_connected: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mweakly_connected,definition,
% 0.22/0.50 ( mweakly_connected
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i,U: $i] :
% 0.22/0.50 ( ( ( R @ S @ T )
% 0.22/0.50 & ( R @ S @ U ) )
% 0.22/0.50 => ( ( R @ T @ U )
% 0.22/0.50 | ( T = U )
% 0.22/0.50 | ( R @ U @ T ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 thf(mweakly_directed_type,type,
% 0.22/0.50 mweakly_directed: ( $i > $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mweakly_directed,definition,
% 0.22/0.50 ( mweakly_directed
% 0.22/0.50 = ( ^ [R: $i > $i > $o] :
% 0.22/0.50 ! [S: $i,T: $i,U: $i] :
% 0.22/0.50 ( ( ( R @ S @ T )
% 0.22/0.50 & ( R @ S @ U ) )
% 0.22/0.50 => ? [V: $i] :
% 0.22/0.50 ( ( R @ T @ V )
% 0.22/0.50 & ( R @ U @ V ) ) ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %----Definition of validity
% 0.22/0.50 thf(mvalid_type,type,
% 0.22/0.50 mvalid: ( $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(mvalid,definition,
% 0.22/0.50 ( mvalid
% 0.22/0.50 = ( ^ [Phi: $i > $o] :
% 0.22/0.50 ! [W: $i] : ( Phi @ W ) ) ) ).
% 0.22/0.50
% 0.22/0.50 %----Definition of invalidity
% 0.22/0.50 thf(minvalid_type,type,
% 0.22/0.50 minvalid: ( $i > $o ) > $o ).
% 0.22/0.50
% 0.22/0.50 thf(minvalid,definition,
% 0.22/0.50 ( minvalid
% 0.22/0.50 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ! [W: $i] :
% 0.22/0.51 ~ ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of satisfiability
% 0.22/0.51 thf(msatisfiable_type,type,
% 0.22/0.51 msatisfiable: ( $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(msatisfiable,definition,
% 0.22/0.51 ( msatisfiable
% 0.22/0.51 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ? [W: $i] : ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %----Definition of countersatisfiability
% 0.22/0.51 thf(mcountersatisfiable_type,type,
% 0.22/0.51 mcountersatisfiable: ( $i > $o ) > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mcountersatisfiable,definition,
% 0.22/0.51 ( mcountersatisfiable
% 0.22/0.51 = ( ^ [Phi: $i > $o] :
% 0.22/0.51 ? [W: $i] :
% 0.22/0.51 ~ ( Phi @ W ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 %----We reserve an accessibility relation constant rel_k
% 0.22/0.51 thf(rel_k_type,type,
% 0.22/0.51 rel_k: $i > $i > $o ).
% 0.22/0.51
% 0.22/0.51 %----We define mbox_k and mdia_k based on rel_k
% 0.22/0.51 thf(mbox_k_type,type,
% 0.22/0.51 mbox_k: ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mbox_k,definition,
% 0.22/0.51 ( mbox_k
% 0.22/0.51 = ( ^ [Phi: $i > $o,W: $i] :
% 0.22/0.51 ! [V: $i] :
% 0.22/0.51 ( ~ ( rel_k @ W @ V )
% 0.22/0.51 | ( Phi @ V ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 thf(mdia_k_type,type,
% 0.22/0.51 mdia_k: ( $i > $o ) > $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(mdia_k,definition,
% 0.22/0.51 ( mdia_k
% 0.22/0.51 = ( ^ [Phi: $i > $o] : ( mnot @ ( mbox_k @ ( mnot @ Phi ) ) ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 thf(p_type,type,
% 0.22/0.51 p: $i > $o ).
% 0.22/0.51
% 0.22/0.51 thf(prove,conjecture,
% 0.22/0.51 mvalid @ ( mimplies @ ( mdia_k @ ( mdia_k @ p ) ) @ ( mbox_k @ ( mdia_k @ p ) ) ) ).
% 0.22/0.51
% 0.22/0.51 %------------------------------------------------------------------------------
% 0.22/0.51 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.Hm3YPZhOyl/cvc5---1.0.5_24747.p...
% 0.22/0.51 (declare-sort $$unsorted 0)
% 0.22/0.51 (declare-sort tptp.mu 0)
% 0.22/0.51 (declare-fun tptp.meq_ind (tptp.mu tptp.mu $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.meq_ind (lambda ((X tptp.mu) (Y tptp.mu) (W $$unsorted)) (= X Y))))
% 0.22/0.51 (declare-fun tptp.meq_prop ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))
% 0.22/0.51 (declare-fun tptp.mnot ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))
% 0.22/0.51 (declare-fun tptp.mor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))
% 0.22/0.51 (declare-fun tptp.mand ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mimplies ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mimplied ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mequiv ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mxor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mforall_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (@ (@ Phi X) W)))))
% 0.22/0.51 (declare-fun tptp.mforall_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))
% 0.22/0.51 (declare-fun tptp.mexists_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mexists_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mtrue ($$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mtrue (lambda ((W $$unsorted)) true)))
% 0.22/0.51 (declare-fun tptp.mfalse ($$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))
% 0.22/0.51 (declare-fun tptp.mbox ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))
% 0.22/0.51 (declare-fun tptp.mdia ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.51 (assert (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.22/0.51 (declare-fun tptp.mreflexive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))
% 0.22/0.51 (declare-fun tptp.msymmetric ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))
% 0.22/0.51 (declare-fun tptp.mserial ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))
% 0.22/0.51 (declare-fun tptp.mtransitive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))
% 0.22/0.51 (declare-fun tptp.meuclidean ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))
% 0.22/0.51 (declare-fun tptp.mpartially_functional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))
% 0.22/0.51 (declare-fun tptp.mfunctional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))
% 0.22/0.51 (declare-fun tptp.mweakly_dense ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))
% 0.22/0.51 (declare-fun tptp.mweakly_connected ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.51 (assert (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))
% 0.22/0.51 (declare-fun tptp.mweakly_directed ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.22/0.55 (assert (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))
% 0.22/0.55 (declare-fun tptp.mvalid ((-> $$unsorted Bool)) Bool)
% 0.22/0.55 (assert (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))
% 0.22/0.55 (declare-fun tptp.minvalid ((-> $$unsorted Bool)) Bool)
% 0.22/0.55 (assert (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))
% 0.22/0.55 (declare-fun tptp.msatisfiable ((-> $$unsorted Bool)) Bool)
% 0.22/0.55 (assert (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))
% 0.22/0.55 (declare-fun tptp.mcountersatisfiable ((-> $$unsorted Bool)) Bool)
% 0.22/0.55 (assert (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))
% 0.22/0.55 (declare-fun tptp.rel_k ($$unsorted $$unsorted) Bool)
% 0.22/0.55 (declare-fun tptp.mbox_k ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.55 (assert (= tptp.mbox_k (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ tptp.rel_k W) V)) (@ Phi V))))))
% 0.22/0.55 (declare-fun tptp.mdia_k ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.22/0.55 (assert (= tptp.mdia_k (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mbox_k (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.22/0.55 (declare-fun tptp.p ($$unsorted) Bool)
% 0.22/0.55 (assert (let ((_let_1 (@ tptp.mdia_k tptp.p))) (not (@ tptp.mvalid (@ (@ tptp.mimplies (@ tptp.mdia_k _let_1)) (@ tptp.mbox_k _let_1))))))
% 0.22/0.55 (set-info :filename cvc5---1.0.5_24747)
% 0.22/0.55 (check-sat-assuming ( true ))
% 0.22/0.55 ------- get file name : TPTP file name is SYO471^1
% 0.22/0.55 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_24747.smt2...
% 0.22/0.55 --- Run --ho-elim --full-saturate-quant at 10...
% 0.22/0.55 % SZS status Theorem for SYO471^1
% 0.22/0.55 % SZS output start Proof for SYO471^1
% 0.22/0.55 (
% 0.22/0.55 (let ((_let_1 (@ tptp.mdia_k tptp.p))) (let ((_let_2 (not (@ tptp.mvalid (@ (@ tptp.mimplies (@ tptp.mdia_k _let_1)) (@ tptp.mbox_k _let_1)))))) (let ((_let_3 (= tptp.mdia_k (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mbox_k (@ tptp.mnot Phi))) __flatten_var_0))))) (let ((_let_4 (= tptp.mbox_k (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ tptp.rel_k W) V)) (@ Phi V))))))) (let ((_let_5 (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))) (let ((_let_6 (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))) (let ((_let_7 (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))) (let ((_let_8 (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))) (let ((_let_9 (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))) (let ((_let_10 (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))) (let ((_let_11 (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))) (let ((_let_12 (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))) (let ((_let_13 (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))) (let ((_let_14 (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))) (let ((_let_15 (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))) (let ((_let_16 (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))) (let ((_let_17 (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))) (let ((_let_18 (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))) (let ((_let_19 (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))) (let ((_let_20 (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))) (let ((_let_21 (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))) (let ((_let_22 (= tptp.mtrue (lambda ((W $$unsorted)) true)))) (let ((_let_23 (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))) (let ((_let_24 (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))) (let ((_let_25 (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))) (let ((_let_26 (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (@ (@ Phi X) W)))))) (let ((_let_27 (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))) (let ((_let_28 (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))) (let ((_let_29 (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))) (let ((_let_30 (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))) (let ((_let_31 (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))) (let ((_let_32 (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))) (let ((_let_33 (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))) (let ((_let_34 (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))) (let ((_let_35 (= tptp.meq_ind (lambda ((X tptp.mu) (Y tptp.mu) (W $$unsorted)) (= X Y))))) (let ((_let_36 (forall ((BOUND_VARIABLE_1685 $$unsorted)) (or (not (ho_4 (ho_3 k_2 BOUND_VARIABLE_1685) BOUND_VARIABLE_1685)) (not (ho_4 k_5 BOUND_VARIABLE_1685)))))) (let ((_let_37 (forall ((BOUND_VARIABLE_1648 $$unsorted)) (or (not (ho_4 (ho_3 k_2 BOUND_VARIABLE_1648) BOUND_VARIABLE_1648)) (not (ho_4 k_5 BOUND_VARIABLE_1648)))))) (let ((_let_38 (not _let_36))) (let ((_let_39 (ASSUME :args (_let_35)))) (let ((_let_40 (ASSUME :args (_let_34)))) (let ((_let_41 (ASSUME :args (_let_33)))) (let ((_let_42 (ASSUME :args (_let_32)))) (let ((_let_43 (EQ_RESOLVE (ASSUME :args (_let_31)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_42 _let_41 _let_40 _let_39) :args (_let_31 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_44 (EQ_RESOLVE (ASSUME :args (_let_30)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_30 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_45 (EQ_RESOLVE (ASSUME :args (_let_29)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_29 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_46 (EQ_RESOLVE (ASSUME :args (_let_28)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_28 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_47 (EQ_RESOLVE (ASSUME :args (_let_27)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_27 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_48 (ASSUME :args (_let_26)))) (let ((_let_49 (ASSUME :args (_let_25)))) (let ((_let_50 (EQ_RESOLVE (ASSUME :args (_let_24)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_49 _let_48 _let_47 _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_24 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_51 (EQ_RESOLVE (ASSUME :args (_let_23)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_50 _let_49 _let_48 _let_47 _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_23 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_52 (EQ_RESOLVE (ASSUME :args (_let_22)) (MACRO_SR_EQ_INTRO :args (_let_22 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_53 (EQ_RESOLVE (ASSUME :args (_let_21)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_52 _let_51 _let_50 _let_49 _let_48 _let_47 _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_21 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_54 (ASSUME :args (_let_20)))) (let ((_let_55 (EQ_RESOLVE (ASSUME :args (_let_19)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_54 _let_53 _let_52 _let_51 _let_50 _let_49 _let_48 _let_47 _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_19 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_56 (ASSUME :args (_let_18)))) (let ((_let_57 (EQ_RESOLVE (ASSUME :args (_let_17)) (MACRO_SR_EQ_INTRO :args (_let_17 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_58 (EQ_RESOLVE (ASSUME :args (_let_16)) (MACRO_SR_EQ_INTRO :args (_let_16 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_59 (EQ_RESOLVE (ASSUME :args (_let_15)) (MACRO_SR_EQ_INTRO :args (_let_15 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_60 (EQ_RESOLVE (ASSUME :args (_let_14)) (MACRO_SR_EQ_INTRO :args (_let_14 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_61 (EQ_RESOLVE (ASSUME :args (_let_13)) (MACRO_SR_EQ_INTRO :args (_let_13 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_62 (EQ_RESOLVE (ASSUME :args (_let_12)) (MACRO_SR_EQ_INTRO :args (_let_12 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_63 (EQ_RESOLVE (ASSUME :args (_let_11)) (MACRO_SR_EQ_INTRO :args (_let_11 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_64 (EQ_RESOLVE (ASSUME :args (_let_10)) (MACRO_SR_EQ_INTRO :args (_let_10 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_65 (EQ_RESOLVE (ASSUME :args (_let_9)) (MACRO_SR_EQ_INTRO :args (_let_9 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_66 (ASSUME :args (_let_8)))) (let ((_let_67 (ASSUME :args (_let_7)))) (let ((_let_68 (EQ_RESOLVE (ASSUME :args (_let_6)) (MACRO_SR_EQ_INTRO :args (_let_6 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_69 (EQ_RESOLVE (ASSUME :args (_let_5)) (MACRO_SR_EQ_INTRO :args (_let_5 SB_DEFAULT SBA_FIXPOINT))))) (let ((_let_70 (ASSUME :args (_let_4)))) (let ((_let_71 (EQ_RESOLVE (ASSUME :args (_let_2)) (TRANS (MACRO_SR_EQ_INTRO (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_3)) (MACRO_SR_EQ_INTRO (AND_INTRO _let_70 _let_69 _let_68 _let_67 _let_66 _let_65 _let_64 _let_63 _let_62 _let_61 _let_60 _let_59 _let_58 _let_57 _let_56 _let_55 _let_54 _let_53 _let_52 _let_51 _let_50 _let_49 _let_48 _let_47 _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_3 SB_DEFAULT SBA_FIXPOINT))) _let_70 _let_69 _let_68 _let_67 _let_66 _let_65 _let_64 _let_63 _let_62 _let_61 _let_60 _let_59 _let_58 _let_57 _let_56 _let_55 _let_54 _let_53 _let_52 _let_51 _let_50 _let_49 _let_48 _let_47 _let_46 _let_45 _let_44 _let_43 _let_42 _let_41 _let_40 _let_39) :args (_let_2 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (not (or (forall ((BOUND_VARIABLE_1648 $$unsorted)) (or (not (@ (@ tptp.rel_k BOUND_VARIABLE_1648) BOUND_VARIABLE_1648)) (not (@ tptp.p BOUND_VARIABLE_1648)))) (not (forall ((BOUND_VARIABLE_1685 $$unsorted)) (or (not (@ (@ tptp.rel_k BOUND_VARIABLE_1685) BOUND_VARIABLE_1685)) (not (@ tptp.p BOUND_VARIABLE_1685))))) (forall ((W $$unsorted) (V $$unsorted)) (not (@ (@ tptp.rel_k W) V))))) (not (or _let_37 _let_38 (forall ((W $$unsorted) (V $$unsorted)) (not (ho_4 (ho_3 k_2 W) V)))))))))))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (NOT_NOT_ELIM (NOT_OR_ELIM _let_71 :args (1))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM1 (SYMM (ALPHA_EQUIV :args (_let_37 (= BOUND_VARIABLE_1648 BOUND_VARIABLE_1685))))) (NOT_OR_ELIM _let_71 :args (0)) :args (_let_38 true _let_37)) :args (false true _let_36)) :args (_let_35 _let_34 _let_33 _let_32 _let_31 _let_30 _let_29 _let_28 _let_27 _let_26 _let_25 _let_24 _let_23 _let_22 _let_21 _let_20 _let_19 _let_18 _let_17 _let_16 _let_15 _let_14 _let_13 _let_12 _let_11 _let_10 _let_9 _let_8 _let_7 _let_6 _let_5 _let_4 _let_3 _let_2 true))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.22/0.55 )
% 0.22/0.55 % SZS output end Proof for SYO471^1
% 0.22/0.55 % cvc5---1.0.5 exiting
% 0.22/0.56 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------