TSTP Solution File: LCL662+1.001 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL662+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n005.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 06:50:13 EDT 2023
% Result : Theorem 0.19s 0.59s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL662+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.12/0.33 % Computer : n005.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Fri Aug 25 01:00:23 EDT 2023
% 0.12/0.34 % CPUTime :
% 0.19/0.54 start to proof:theBenchmark
% 0.19/0.58 %-------------------------------------------
% 0.19/0.58 % File :CSE---1.6
% 0.19/0.58 % Problem :theBenchmark
% 0.19/0.58 % Transform :cnf
% 0.19/0.58 % Format :tptp:raw
% 0.19/0.58 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.58
% 0.19/0.58 % Result :Theorem 0.000000s
% 0.19/0.58 % Output :CNFRefutation 0.000000s
% 0.19/0.58 %-------------------------------------------
% 0.19/0.59 %------------------------------------------------------------------------------
% 0.19/0.59 % File : LCL662+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.19/0.59 % Domain : Logic Calculi (Modal Logic)
% 0.19/0.59 % Problem : In KT, in backward search find a way through box and dia, size 1
% 0.19/0.59 % Version : Especial.
% 0.19/0.59 % English :
% 0.19/0.59
% 0.19/0.59 % Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.19/0.59 % : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% 0.19/0.59 % Source : [Kam08]
% 0.19/0.59 % Names : kt_md_p [BHS00]
% 0.19/0.59
% 0.19/0.59 % Status : Theorem
% 0.19/0.59 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.0.0
% 0.19/0.59 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.19/0.59 % Number of atoms : 2 ( 0 equ)
% 0.19/0.59 % Maximal formula atoms : 2 ( 2 avg)
% 0.19/0.59 % Number of connectives : 4 ( 3 ~; 1 |; 0 &)
% 0.19/0.59 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.59 % Maximal formula depth : 6 ( 6 avg)
% 0.19/0.59 % Maximal term depth : 1 ( 1 avg)
% 0.19/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty)
% 0.19/0.59 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.19/0.59 % Number of variables : 1 ( 0 !; 1 ?)
% 0.19/0.59 % SPC : FOF_THM_EPR_NEQ
% 0.19/0.59
% 0.19/0.59 % Comments : A naive relational encoding of the modal logic problem into
% 0.19/0.59 % first-order logic.
% 0.19/0.59 %------------------------------------------------------------------------------
% 0.19/0.59
% 0.19/0.59 fof(main,conjecture,
% 0.19/0.59 ~ ? [X] :
% 0.19/0.59 ~ ( ~ p1(X)
% 0.19/0.59 | p1(X) ) ).
% 0.19/0.59
% 0.19/0.59 %------------------------------------------------------------------------------
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 % Proof found
% 0.19/0.59 % SZS status Theorem for theBenchmark
% 0.19/0.59 % SZS output start Proof
% 0.19/0.59 %ClaNum:2(EqnAxiom:0)
% 0.19/0.59 %VarNum:0(SingletonVarNum:0)
% 0.19/0.59 %MaxLitNum:1
% 0.19/0.59 %MaxfuncDepth:0
% 0.19/0.59 %SharedTerms:3
% 0.19/0.59 %goalClause: 1 2
% 0.19/0.59 %singleGoalClaCount:2
% 0.19/0.59 [1]P1(a1)
% 0.19/0.59 [2]~P1(a1)
% 0.19/0.59 %EqnAxiom
% 0.19/0.59
% 0.19/0.59 %-------------------------------------------
% 0.19/0.59 cnf(3,plain,
% 0.19/0.59 ($false),
% 0.19/0.59 inference(scs_inference,[],[1,2]),
% 0.19/0.59 ['proof']).
% 0.19/0.59 % SZS output end Proof
% 0.19/0.59 % Total time :0.000000s
%------------------------------------------------------------------------------