TSTP Solution File: LCL664+1.001 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL664+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 : 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 : Thu Aug 31 06:50:14 EDT 2023
% Result : Theorem 0.19s 0.61s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : LCL664+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri Aug 25 05:22:53 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.55 start to proof:theBenchmark
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 % File :CSE---1.6
% 0.19/0.60 % Problem :theBenchmark
% 0.19/0.60 % Transform :cnf
% 0.19/0.60 % Format :tptp:raw
% 0.19/0.60 % Command :java -jar mcs_scs.jar %d %s
% 0.19/0.60
% 0.19/0.60 % Result :Theorem 0.000000s
% 0.19/0.60 % Output :CNFRefutation 0.000000s
% 0.19/0.60 %-------------------------------------------
% 0.19/0.60 %------------------------------------------------------------------------------
% 0.19/0.60 % File : LCL664+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.19/0.60 % Domain : Logic Calculi (Modal Logic)
% 0.19/0.60 % Problem : In KT, path through a labyrinth, size 1
% 0.19/0.60 % Version : Especial.
% 0.19/0.60 % English :
% 0.19/0.60
% 0.19/0.60 % Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.19/0.60 % : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% 0.19/0.60 % Source : [Kam08]
% 0.19/0.60 % Names : kt_path_p [BHS00]
% 0.19/0.60
% 0.19/0.60 % Status : Theorem
% 0.19/0.60 % Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v4.1.0, 0.06 v4.0.1, 0.05 v4.0.0
% 0.19/0.60 % Syntax : Number of formulae : 2 ( 1 unt; 0 def)
% 0.19/0.60 % Number of atoms : 17 ( 0 equ)
% 0.19/0.60 % Maximal formula atoms : 16 ( 8 avg)
% 0.19/0.60 % Number of connectives : 29 ( 14 ~; 15 |; 0 &)
% 0.19/0.60 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.19/0.60 % Maximal formula depth : 14 ( 8 avg)
% 0.19/0.60 % Maximal term depth : 1 ( 1 avg)
% 0.19/0.60 % Number of predicates : 7 ( 7 usr; 0 prp; 1-2 aty)
% 0.19/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.19/0.60 % Number of variables : 10 ( 9 !; 1 ?)
% 0.19/0.60 % SPC : FOF_THM_EPR_NEQ
% 0.19/0.60
% 0.19/0.60 % Comments : A naive relational encoding of the modal logic problem into
% 0.19/0.60 % first-order logic.
% 0.19/0.60 %------------------------------------------------------------------------------
% 0.19/0.60 fof(reflexivity,axiom,
% 0.19/0.60 ! [X] : r1(X,X) ).
% 0.19/0.60
% 0.19/0.60 fof(main,conjecture,
% 0.19/0.60 ~ ? [X] :
% 0.19/0.60 ~ ( ~ ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p16(Y) )
% 0.19/0.60 | ~ ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p12(Y) )
% 0.19/0.60 | ~ ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p14(Y) )
% 0.19/0.60 | ~ ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p12(Y) )
% 0.19/0.60 | ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p15(Y) )
% 0.19/0.60 | ! [Y] :
% 0.19/0.60 ( ~ r1(X,Y)
% 0.19/0.60 | p13(Y) )
% 0.19/0.60 | ! [Y] :
% 0.19/0.61 ( ~ r1(X,Y)
% 0.19/0.61 | p12(Y) )
% 0.19/0.61 | ! [Y] :
% 0.19/0.61 ( ~ r1(X,Y)
% 0.19/0.61 | p11(Y) ) ) ).
% 0.19/0.61
% 0.19/0.61 %------------------------------------------------------------------------------
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 % Proof found
% 0.19/0.61 % SZS status Theorem for theBenchmark
% 0.19/0.61 % SZS output start Proof
% 0.19/0.61 %ClaNum:13(EqnAxiom:0)
% 0.19/0.61 %VarNum:8(SingletonVarNum:4)
% 0.19/0.61 %MaxLitNum:2
% 0.19/0.61 %MaxfuncDepth:0
% 0.19/0.61 %SharedTerms:13
% 0.19/0.61 %goalClause: 1 2 3 4 6 7 8 9 10 12 13
% 0.19/0.61 %singleGoalClaCount:8
% 0.19/0.61 [1]P1(a1,a2)
% 0.19/0.61 [2]P1(a1,a3)
% 0.19/0.61 [3]P1(a1,a4)
% 0.19/0.61 [4]P1(a1,a5)
% 0.19/0.61 [6]~P2(a4)
% 0.19/0.61 [7]~P4(a2)
% 0.19/0.61 [8]~P5(a3)
% 0.19/0.61 [9]~P3(a5)
% 0.19/0.61 [5]P1(x51,x51)
% 0.19/0.61 [10]P7(x101)+~P1(a1,x101)
% 0.19/0.61 [12]P2(x121)+~P1(a1,x121)
% 0.19/0.61 [13]P6(x131)+~P1(a1,x131)
% 0.19/0.61 %EqnAxiom
% 0.19/0.61
% 0.19/0.61 %-------------------------------------------
% 0.19/0.61 cnf(14,plain,
% 0.19/0.61 ($false),
% 0.19/0.61 inference(scs_inference,[],[6,3,12]),
% 0.19/0.61 ['proof']).
% 0.19/0.61 % SZS output end Proof
% 0.19/0.61 % Total time :0.000000s
%------------------------------------------------------------------------------