TSTP Solution File: LCL646+1.001 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% Computer : n032.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:01 EDT 2023
% Result : Theorem 0.13s 0.50s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.09 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %s %d
% 0.09/0.28 % Computer : n032.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri Aug 25 00:54:27 EDT 2023
% 0.09/0.28 % CPUTime :
% 0.13/0.46 start to proof:theBenchmark
% 0.13/0.50 %-------------------------------------------
% 0.13/0.50 % File :CSE---1.6
% 0.13/0.50 % Problem :theBenchmark
% 0.13/0.50 % Transform :cnf
% 0.13/0.50 % Format :tptp:raw
% 0.13/0.50 % Command :java -jar mcs_scs.jar %d %s
% 0.13/0.50
% 0.13/0.50 % Result :Theorem 0.000000s
% 0.13/0.50 % Output :CNFRefutation 0.000000s
% 0.13/0.50 %-------------------------------------------
% 0.13/0.50 %------------------------------------------------------------------------------
% 0.13/0.50 % File : LCL646+1.001 : TPTP v8.1.2. Released v4.0.0.
% 0.13/0.50 % Domain : Logic Calculi (Modal Logic)
% 0.13/0.50 % Problem : In K, path through a labyrinth, size 1
% 0.13/0.50 % Version : Especial.
% 0.13/0.50 % English :
% 0.13/0.50
% 0.13/0.50 % Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% 0.13/0.50 % : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% 0.13/0.50 % Source : [Kam08]
% 0.13/0.50 % Names : k_path_p [BHS00]
% 0.13/0.50
% 0.13/0.50 % Status : Theorem
% 0.13/0.50 % 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.13/0.50 % Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% 0.13/0.50 % Number of atoms : 16 ( 0 equ)
% 0.13/0.50 % Maximal formula atoms : 16 ( 16 avg)
% 0.13/0.50 % Number of connectives : 29 ( 14 ~; 15 |; 0 &)
% 0.13/0.50 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.13/0.50 % Maximal formula depth : 14 ( 14 avg)
% 0.13/0.50 % Maximal term depth : 1 ( 1 avg)
% 0.13/0.50 % Number of predicates : 7 ( 7 usr; 0 prp; 1-2 aty)
% 0.13/0.50 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.13/0.50 % Number of variables : 9 ( 8 !; 1 ?)
% 0.13/0.50 % SPC : FOF_THM_EPR_NEQ
% 0.13/0.50
% 0.13/0.50 % Comments : A naive relational encoding of the modal logic problem into
% 0.13/0.50 % first-order logic.
% 0.13/0.50 %------------------------------------------------------------------------------
% 0.13/0.50 fof(main,conjecture,
% 0.13/0.50 ~ ? [X] :
% 0.13/0.50 ~ ( ~ ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p6(Y) )
% 0.13/0.50 | ~ ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p2(Y) )
% 0.13/0.50 | ~ ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p4(Y) )
% 0.13/0.50 | ~ ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p2(Y) )
% 0.13/0.50 | ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p5(Y) )
% 0.13/0.50 | ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p3(Y) )
% 0.13/0.50 | ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p2(Y) )
% 0.13/0.50 | ! [Y] :
% 0.13/0.50 ( ~ r1(X,Y)
% 0.13/0.50 | p1(Y) ) ) ).
% 0.13/0.50
% 0.13/0.50 %------------------------------------------------------------------------------
% 0.13/0.50 %-------------------------------------------
% 0.13/0.50 % Proof found
% 0.13/0.50 % SZS status Theorem for theBenchmark
% 0.13/0.50 % SZS output start Proof
% 0.13/0.50 %ClaNum:12(EqnAxiom:0)
% 0.13/0.50 %VarNum:6(SingletonVarNum:3)
% 0.13/0.50 %MaxLitNum:2
% 0.13/0.50 %MaxfuncDepth:0
% 0.13/0.50 %SharedTerms:13
% 0.13/0.50 %goalClause: 1 2 3 4 5 6 7 8 9 11 12
% 0.13/0.50 %singleGoalClaCount:8
% 0.13/0.50 [1]P1(a1,a2)
% 0.13/0.50 [2]P1(a1,a3)
% 0.13/0.50 [3]P1(a1,a4)
% 0.13/0.50 [4]P1(a1,a5)
% 0.13/0.50 [5]~P2(a4)
% 0.13/0.50 [6]~P4(a2)
% 0.13/0.50 [7]~P5(a3)
% 0.13/0.50 [8]~P3(a5)
% 0.13/0.50 [9]P7(x91)+~P1(a1,x91)
% 0.13/0.50 [11]P2(x111)+~P1(a1,x111)
% 0.13/0.50 [12]P6(x121)+~P1(a1,x121)
% 0.13/0.50 %EqnAxiom
% 0.13/0.50
% 0.13/0.50 %-------------------------------------------
% 0.13/0.50 cnf(13,plain,
% 0.13/0.50 ($false),
% 0.13/0.50 inference(scs_inference,[],[5,3,11]),
% 0.13/0.50 ['proof']).
% 0.13/0.50 % SZS output end Proof
% 0.13/0.50 % Total time :0.000000s
%------------------------------------------------------------------------------