↑ Up

MleanCoP---1.3.CSA-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : MleanCoP---1.3
% Problem  : PLA059_1.001 : TPTP v9.0.0. Released v9.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_mleancop %s %d

% Computer : n020.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 : Tue May 14 08:53:57 EDT 2024

% Result   : CounterSatisfiable 0.50s 1.57s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : PLA059_1.001 : TPTP v9.0.0. Released v9.0.0.
% 0.04/0.14  % Command  : run_mleancop %s %d
% 0.14/0.35  % Computer : n020.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon May 13 14:14:38 EDT 2024
% 0.14/0.35  % CPUTime  : 
% 0.20/0.49  % Logic is s4
% 0.20/0.50  % Assuming rigid designation
% 0.20/0.50  % Designation is rigid
% 0.20/0.50  % Assuming local terms
% 0.20/0.50  % Terms are local
% 0.20/0.51  % Assuming constants domains
% 0.20/0.51  % Domains are const
% 0.20/0.52  ------------ Start QMF file ---------------
% 0.20/0.52  %------------------------------------------------------------------------------
% 0.20/0.52  % File     : PLA059_1.001 : TPTP v9.0.0. Released v9.0.0.
% 0.20/0.52  % Domain   : Planning
% 0.20/0.52  % Problem  : Path from the entry to the exit of a labyrinth 1
% 0.20/0.52  % Version  : Especial.
% 0.20/0.52  % English  : The formula is the path from the entry to the exit of a
% 0.20/0.52  %            labyrinth. It makes no difference whether one starts at the
% 0.20/0.52  %            entry or at the exit.
% 0.20/0.52  % Refs     : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.20/0.52  %          : [NH+22] Nalon et al. (2022), Local Reductions for the Modal Cu
% 0.20/0.52  %          : [Nal22] Nalon (2022), Email to Geoff Sutcliffe
% 0.20/0.52  %          : [NH+23] Nalon et al. (2023), Buy One Get 14 Free: Evaluating L
% 0.20/0.52  % Source   : [Nal22]
% 0.20/0.52  % Names    : s4_path_n.0001 [Nal22]
% 0.20/0.52  % Status   : CounterSatisfiable
% 0.20/0.52  % Rating   : ? v9.0.0
% 0.20/0.52  % Syntax   : Number of formulae    :   14 (   0 unt;  13 typ;   0 def)
% 0.20/0.52  %            Number of atoms       :   50 (   0 equ)
% 0.20/0.52  %            Maximal formula atoms :   50 (  50 avg)
% 0.20/0.52  %            Number of connectives :  104 (  18   ~;  37   |;  12   &)
% 0.20/0.52  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.20/0.52  %                                         (  37 {.};   0 {#})
% 0.20/0.52  %            Maximal formula depth :   43 (  43 avg)
% 0.20/0.52  %            Maximal term depth    :    0 (   0 avg)
% 0.20/0.52  %            Number of types       :    1 (   0 usr)
% 0.20/0.52  %            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
% 0.20/0.52  %            Number of predicates  :   13 (  13 usr;  13 prp; 0-0 aty)
% 0.20/0.52  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.20/0.52  %            Number of variables   :    0 (;   0   !;   0   ?;   0   :)
% 0.20/0.52  % SPC      : NX0_CSA_PRP_NEQ_NAR
% 0.20/0.52  % Comments :
% 0.20/0.52  %------------------------------------------------------------------------------
% 0.20/0.52  qmf(prove,conjecture,(~ ( ~ (  #box : (  #box : ( p11 ) ) |  #box : (  #box : ( p12 ) ) |  #box : (  #box : ( p13 ) ) |  #box : (  #box : ( p15 ) ) |  #dia : ( ~ ( p11 ) &  #box : ( p21 ) ) |  #dia : ( ~ ( p11 ) &  #box : ( p23 ) ) | false | false | false |  #dia : ( ~ ( p13 ) &  #box : ( p21 ) ) |  #dia : ( ~ ( p13 ) &  #box : ( p23 ) ) | false | false | false |  #dia : ( ~ ( p15 ) &  #box : ( p21 ) ) |  #dia : ( ~ ( p15 ) &  #box : ( p23 ) ) | false | false | false | false | false | false |  #dia : ( ~ ( p14 ) &  #box : ( p22 ) ) |  #dia : ( ~ ( p16 ) &  #box : ( p22 ) ) | false | false | false |  #dia : ( ~ ( p14 ) &  #box : ( p24 ) ) |  #dia : ( ~ ( p16 ) &  #box : ( p24 ) ) | false | false | false |  #dia : ( ~ ( p14 ) &  #box : ( p26 ) ) |  #dia : ( ~ ( p16 ) &  #box : ( p26 ) ) |  #dia : (  #dia : ( ~ ( p22 ) ) |  #dia : ( ~ ( p24 ) ) |  #dia : ( ~ ( p25 ) ) |  #dia : ( ~ ( p26 ) ) ) ) ) )).
% 0.20/0.52  %------------------------------------------------------------------------------
% 0.20/0.52  ------------ End QMF file   ---------------
% 0.50/1.57  
% 0.50/1.57  % SZS status CounterSatisfiable for $/export/starexec/sandbox/tmp/tmp.t6NWk85ljd/theBenchmark.p.qmf : (modal (s4/const))
% 0.50/1.57  % MleanCoP exiting
%------------------------------------------------------------------------------