↑ Up

CSE---1.7.THM-Ass.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE---1.7
% Problem  : LCL662+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s

% Computer : n019.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:19:32 AM UTC 2026

% Result   : Theorem 0.23s 0.52s
% Output   : Assurance 0s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem    : LCL662+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command    : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit   : 300
% 0.08/0.36  % WCLimit    : 300
% 0.08/0.36  % DateTime   : Sat Sep  5 15:02:38 UTC 2026
% 0.12/0.36  % CPUTime    : 
% 0.23/0.52  start to proof:theBenchmark
% 0.23/0.52  %-------------------------------------------
% 0.23/0.52  % File        :CSE---1.7
% 0.23/0.52  % Problem     :theBenchmark
% 0.23/0.52  % Transform   :cnf
% 0.23/0.52  % Format      :tptp:raw
% 0.23/0.52  % Command     :java -jar mcs_scs.jar %d %s
% 0.23/0.52  
% 0.23/0.52  % Result      :Theorem 0.002223s
% 0.23/0.52  % Output      :CNFRefutation 0.002223s
% 0.23/0.52  %-------------------------------------------
% 0.23/0.52  %------------------------------------------------------------------------------
% 0.23/0.52  % File     : LCL662+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.23/0.52  % Domain   : Logic Calculi (Modal Logic)
% 0.23/0.52  % Problem  : In KT, in backward search find a way through box and dia, size 1
% 0.23/0.52  % Version  : Especial.
% 0.23/0.52  % English  :
% 0.23/0.52  
% 0.23/0.52  % Refs     : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.23/0.52  %          : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% 0.23/0.52  % Source   : [Kam08]
% 0.23/0.52  % Names    : kt_md_p [BHS00]
% 0.23/0.52  
% 0.23/0.52  % Status   : Theorem
% 0.23/0.52  % Rating   : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.0.0
% 0.23/0.52  % Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
% 0.23/0.52  %            Number of atoms       :    2 (   0 equ)
% 0.23/0.52  %            Maximal formula atoms :    2 (   2 avg)
% 0.23/0.52  %            Number of connectives :    4 (   3   ~;   1   |;   0   &)
% 0.23/0.52  %                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
% 0.23/0.52  %            Maximal formula depth :    6 (   6 avg)
% 0.23/0.52  %            Maximal term depth    :    1 (   1 avg)
% 0.23/0.52  %            Number of predicates  :    1 (   1 usr;   0 prp; 1-1 aty)
% 0.23/0.52  %            Number of functors    :    0 (   0 usr;   0 con; --- aty)
% 0.23/0.52  %            Number of variables   :    1 (   0   !;   1   ?)
% 0.23/0.52  % SPC      : FOF_THM_RFO_NEQ
% 0.23/0.52  
% 0.23/0.52  % Comments : A naive relational encoding of the modal logic problem into
% 0.23/0.52  %            first-order logic.
% 0.23/0.52  %------------------------------------------------------------------------------
% 0.23/0.52  
% 0.23/0.52  fof(main,conjecture,
% 0.23/0.52      ~ ? [X] :
% 0.23/0.52          ~ ( ~ p1(X)
% 0.23/0.52            | p1(X) ) ).
% 0.23/0.52  
% 0.23/0.52  %------------------------------------------------------------------------------
% 0.23/0.52  %-------------------------------------------
% 0.23/0.52  % Proof found
% 0.23/0.52  % SZS status Theorem for theBenchmark
% 0.23/0.52  % SZS output start Proof
% 0.23/0.52  %ClaNum:2(EqnAxiom:0)
% 0.23/0.52  %VarNum:0(SingletonVarNum:0)
% 0.23/0.52  %MaxLitNum:1
% 0.23/0.52  %MaxfuncDepth:0
% 0.23/0.52  %SharedTerms:3
% 0.23/0.52  %goalClause: 1 2
% 0.23/0.52  %singleGoalClaCount:2
% 0.23/0.52  [1]P1(a1)
% 0.23/0.52  [2]~P1(a1)
% 0.23/0.52  %EqnAxiom
% 0.23/0.52  
% 0.23/0.52  %-------------------------------------------
% 0.23/0.53  cnf(3,plain,
% 0.23/0.53     ($false),
% 0.23/0.53     inference(scs_inference,[],[1,2]),
% 0.23/0.53     ['proof']).
% 0.23/0.53  % SZS output end Proof
% 0.23/0.53  % Total time :0.002223s
%------------------------------------------------------------------------------