↑ Up

DT2H2X---1.9.5.CSA-Sat.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : DT2H2X---1.9.5
% Problem  : LCL965^15 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon Sep  7 11:35:17 AM UTC 2026

% Result   : CounterSatisfiable 0.19s 0.48s
% Output   : Saturation 0.19s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL965^15 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37  % Computer : n018.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep  5 19:15:19 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running /export/starexec/sandbox/solver/bin/run_DT2H2X /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.40  ---- Original DTF file ---
% 0.10/0.40  thf(spec,logic,$$dhol).
% 0.10/0.40  %------------------------------------------------------------------------------
% 0.10/0.40  % File     : LCL965^15 : TPTP v9.3.1. Released v8.1.0.
% 0.10/0.40  % Domain   : Logic Calculi
% 0.10/0.40  % Problem  : Goedel translation of SET027+3 (from TPTP-v5.0.0)
% 0.10/0.40  % Version  : [BP13] axioms.
% 0.10/0.40  % English  : 
% 0.10/0.40  
% 0.10/0.40  % Refs     : [RO12]  Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.10/0.40  %          : [BP13]  Benzmueller & Paulson (2013), Quantified Multimodal Lo
% 0.10/0.40  %          : [Ste22] Steen (2022), An Extensible Logic Embedding Tool for L
% 0.10/0.40  % Source   : [TPTP]
% 0.10/0.40  % Names    : GSE027+1 [QMLTP]
% 0.10/0.40  
% 0.10/0.40  % Status   : CounterSatisfiable
% 0.10/0.40  % Rating   : 1.00 v9.0.0, 0.75 v8.2.0, 1.00 v8.1.0
% 0.10/0.40  % Syntax   : Number of formulae    :   32 (  12 unt;  16 typ;  10 def)
% 0.10/0.40  %            Number of atoms       :   80 (  10 equ;   0 cnn)
% 0.10/0.40  %            Maximal formula atoms :   30 (   5 avg)
% 0.10/0.40  %            Number of connectives :  113 (   1   ~;   1   |;   4   &; 102   @)
% 0.10/0.40  %                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
% 0.10/0.40  %            Maximal formula depth :   21 (   5 avg)
% 0.10/0.40  %            Number of types       :    3 (   1 usr)
% 0.10/0.40  %            Number of type conns  :   65 (  65   >;   0   *;   0   +;   0  <<)
% 0.10/0.40  %            Number of symbols     :   16 (  15 usr;   1 con; 0-3 aty)
% 0.10/0.40  %            Number of variables   :   42 (  31   ^;   7   !;   4   ?;  42   :)
% 0.10/0.40  % SPC      : TH0_CSA_EQU_NAR_NDT
% 0.10/0.40  
% 0.10/0.40  % Comments : This output was generated by embedproblem, version 1.7.1 (library
% 0.10/0.40  %            version 1.3). Generated on Thu Apr 28 13:18:18 EDT 2022 using
% 0.10/0.40  %            'modal' embedding, version 1.5.2. Logic specification used:
% 0.10/0.40  %            $modal == [$constants == $rigid,$quantification == $cumulative,
% 0.10/0.40  %            $modalities == $modal_system_D].
% 0.10/0.40  %------------------------------------------------------------------------------
% 0.10/0.40  thf(mworld,type,
% 0.10/0.40      mworld: $tType ).
% 0.10/0.40  
% 0.10/0.40  thf(mrel_type,type,
% 0.10/0.40      mrel: mworld > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mactual_type,type,
% 0.10/0.40      mactual: mworld ).
% 0.10/0.40  
% 0.10/0.40  thf(mlocal_type,type,
% 0.10/0.40      mlocal: ( mworld > $o ) > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mlocal_def,definition,
% 0.10/0.40      ( mlocal
% 0.10/0.40      = ( ^ [Phi: mworld > $o] : ( Phi @ mactual ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mnot_type,type,
% 0.10/0.40      mnot: ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mand_type,type,
% 0.10/0.40      mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mor_type,type,
% 0.10/0.40      mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mimplies_type,type,
% 0.10/0.40      mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mequiv_type,type,
% 0.10/0.40      mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mnot_def,definition,
% 0.10/0.40      ( mnot
% 0.10/0.40      = ( ^ [A: mworld > $o,W: mworld] :
% 0.10/0.40            ~ ( A @ W ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mand_def,definition,
% 0.10/0.40      ( mand
% 0.10/0.40      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.10/0.40            ( ( A @ W )
% 0.10/0.40            & ( B @ W ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mor_def,definition,
% 0.10/0.40      ( mor
% 0.10/0.40      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.10/0.40            ( ( A @ W )
% 0.10/0.40            | ( B @ W ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mimplies_def,definition,
% 0.10/0.40      ( mimplies
% 0.10/0.40      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.10/0.40            ( ( A @ W )
% 0.10/0.40           => ( B @ W ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mequiv_def,definition,
% 0.10/0.40      ( mequiv
% 0.10/0.40      = ( ^ [A: mworld > $o,B: mworld > $o,W: mworld] :
% 0.10/0.40            ( ( A @ W )
% 0.10/0.40          <=> ( B @ W ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mbox_type,type,
% 0.10/0.40      mbox: ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mbox_def,definition,
% 0.10/0.40      ( mbox
% 0.10/0.40      = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.10/0.40          ! [V: mworld] :
% 0.10/0.40            ( ( mrel @ W @ V )
% 0.10/0.40           => ( Phi @ V ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mdia_type,type,
% 0.10/0.40      mdia: ( mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mdia_def,definition,
% 0.10/0.40      ( mdia
% 0.10/0.40      = ( ^ [Phi: mworld > $o,W: mworld] :
% 0.10/0.40          ? [V: mworld] :
% 0.10/0.40            ( ( mrel @ W @ V )
% 0.10/0.40            & ( Phi @ V ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mrel_serial,axiom,
% 0.10/0.40      ! [W: mworld] :
% 0.10/0.40      ? [V: mworld] : ( mrel @ W @ V ) ).
% 0.10/0.40  
% 0.10/0.40  thf(eiw_di_type,type,
% 0.10/0.40      eiw_di: $i > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(eiw_di_nonempty,axiom,
% 0.10/0.40      ! [W: mworld] :
% 0.10/0.40      ? [X: $i] : ( eiw_di @ X @ W ) ).
% 0.10/0.40  
% 0.10/0.40  thf(eiw_di_cumul,axiom,
% 0.10/0.40      ! [W: mworld,V: mworld,X: $i] :
% 0.10/0.40        ( ( ( eiw_di @ X @ W )
% 0.10/0.40          & ( mrel @ W @ V ) )
% 0.10/0.40       => ( eiw_di @ X @ V ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mforall_di_type,type,
% 0.10/0.40      mforall_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mforall_di_def,definition,
% 0.10/0.40      ( mforall_di
% 0.10/0.40      = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.10/0.40          ! [X: $i] :
% 0.10/0.40            ( ( eiw_di @ X @ W )
% 0.10/0.40           => ( A @ X @ W ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(mexists_di_type,type,
% 0.10/0.40      mexists_di: ( $i > mworld > $o ) > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(mexists_di_def,definition,
% 0.10/0.40      ( mexists_di
% 0.10/0.40      = ( ^ [A: $i > mworld > $o,W: mworld] :
% 0.10/0.40          ? [X: $i] :
% 0.10/0.40            ( ( eiw_di @ X @ W )
% 0.10/0.40            & ( A @ X @ W ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(member_decl,type,
% 0.10/0.40      member: $i > $i > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(subset_decl,type,
% 0.10/0.40      subset: $i > $i > mworld > $o ).
% 0.10/0.40  
% 0.10/0.40  thf(subset_defn,axiom,
% 0.10/0.40      ( mlocal
% 0.10/0.40      @ ( mbox
% 0.10/0.40        @ ( mforall_di
% 0.10/0.40          @ ^ [B: $i] :
% 0.10/0.40              ( mbox
% 0.10/0.40              @ ( mforall_di
% 0.10/0.40                @ ^ [C: $i] :
% 0.10/0.40                    ( mand
% 0.10/0.40                    @ ( mbox
% 0.10/0.40                      @ ( mimplies @ ( mbox @ ( subset @ B @ C ) )
% 0.10/0.40                        @ ( mbox
% 0.10/0.40                          @ ( mforall_di
% 0.10/0.40                            @ ^ [D: $i] : ( mbox @ ( mimplies @ ( mbox @ ( member @ D @ B ) ) @ ( mbox @ ( member @ D @ C ) ) ) ) ) ) ) )
% 0.10/0.40                    @ ( mbox
% 0.10/0.40                      @ ( mimplies
% 0.10/0.40                        @ ( mbox
% 0.10/0.40                          @ ( mforall_di
% 0.10/0.40                            @ ^ [D: $i] : ( mbox @ ( mimplies @ ( mbox @ ( member @ D @ B ) ) @ ( mbox @ ( member @ D @ C ) ) ) ) ) )
% 0.10/0.40                        @ ( mbox @ ( subset @ B @ C ) ) ) ) ) ) ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(reflexivity_of_subset,axiom,
% 0.10/0.40      ( mlocal
% 0.10/0.40      @ ( mbox
% 0.10/0.40        @ ( mforall_di
% 0.10/0.40          @ ^ [B: $i] : ( mbox @ ( subset @ B @ B ) ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  thf(prove_transitivity_of_subset,conjecture,
% 0.10/0.40      ( mlocal
% 0.10/0.40      @ ( mbox
% 0.10/0.40        @ ( mforall_di
% 0.10/0.40          @ ^ [B: $i] :
% 0.10/0.40              ( mbox
% 0.10/0.40              @ ( mforall_di
% 0.10/0.40                @ ^ [C: $i] :
% 0.10/0.40                    ( mbox
% 0.10/0.40                    @ ( mforall_di
% 0.10/0.40                      @ ^ [D: $i] : ( mbox @ ( mimplies @ ( mand @ ( mbox @ ( subset @ B @ C ) ) @ ( mbox @ ( subset @ C @ D ) ) ) @ ( mbox @ ( subset @ B @ D ) ) ) ) ) ) ) ) ) ) ) ).
% 0.10/0.40  
% 0.10/0.40  %------------------------------------------------------------------------------
% 0.10/0.40  ------------------------
% 0.10/0.40  /starexec/sw/sutcliffe/jdk-11.0.2/bin/java: Command not found.
% 0.10/0.41  ---- Embedded in THF ---
% 0.10/0.41  ------------------------
% 0.10/0.43  ---- Cleaned THF ---
% 0.10/0.43  ------------------------
% 0.19/0.47  % (1252035)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on DTF2THF_1252017 for (2999ds/27Mi)
% 0.19/0.47  % (1252035)Refutation not found, incomplete strategy
% 0.19/0.47  % (1252035)------------------------------
% 0.19/0.47  % (1252035)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.19/0.47  % (1252035)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  % (1252035)Memory used [KB]: 5373
% 0.19/0.47  % (1252035)Time elapsed: 0.002 s
% 0.19/0.47  % (1252035)Instructions burned: 1 (million)
% 0.19/0.47  % (1252035)------------------------------
% 0.19/0.47  % (1252035)------------------------------
% 0.19/0.47  % (1252033)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on DTF2THF_1252017 for (2999ds/183Mi)
% 0.19/0.47  % (1252034)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on DTF2THF_1252017 for (2999ds/4Mi)
% 0.19/0.48  % (1252036)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on DTF2THF_1252017 for (2999ds/2Mi)
% 0.19/0.48  % (1252033)First to succeed.
% 0.19/0.48  % (1252037)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on DTF2THF_1252017 for (2999ds/2Mi)
% 0.19/0.48  % (1252034)Also succeeded, but the first one will report.
% 0.19/0.48  % (1252038)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on DTF2THF_1252017 for (2999ds/275Mi)
% 0.19/0.48  % (1252037)Refutation not found, incomplete strategy
% 0.19/0.48  % (1252037)------------------------------
% 0.19/0.48  % (1252037)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.19/0.48  % (1252037)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  % (1252037)Memory used [KB]: 5373
% 0.19/0.48  % (1252037)Time elapsed: 0.002 s
% 0.19/0.48  % (1252037)------------------------------
% 0.19/0.48  % (1252037)------------------------------
% 0.19/0.48  % (1252038)Refutation not found, incomplete strategy
% 0.19/0.48  % (1252038)------------------------------
% 0.19/0.48  % (1252038)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.19/0.48  % (1252038)Termination reason: Refutation not found, incomplete strategy
% 0.19/0.48  
% 0.19/0.48  
% 0.19/0.48  % (1252038)Memory used [KB]: 5373
% 0.19/0.48  % (1252038)Time elapsed: 0.002 s
% 0.19/0.48  % (1252038)------------------------------
% 0.19/0.48  % (1252038)------------------------------
% 0.19/0.48  % SZS status Satisfiable for DTF2THF_1252017
% 0.19/0.48  % (1252033)# SZS output start Saturation.
% 0.19/0.48  % (1252033)# SZS output end Saturation.
% 0.19/0.48  % (1252033)------------------------------
% 0.19/0.48  % (1252033)Version: Vampire 4.8 (commit 7b44b1c2f on 2025-07-15 09:50:17 +0100)
% 0.19/0.48  % (1252033)Termination reason: Satisfiable
% 0.19/0.48  
% 0.19/0.48  % (1252033)Memory used [KB]: 5373
% 0.19/0.48  % (1252033)Time elapsed: 0.003 s
% 0.19/0.48  % (1252033)------------------------------
% 0.19/0.48  % (1252033)------------------------------
% 0.19/0.48  % (1252032)Success in time 0.019 s
%------------------------------------------------------------------------------