%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n007.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:27 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 : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.03 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.08/0.34 % Computer : n007.cluster.edu % 0.08/0.34 % Model : x86_64 x86_64 % 0.08/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.34 % Memory : 8046.5625MB % 0.08/0.34 % OS : Linux 6.8.0-71-generic % 0.08/0.34 % CPULimit : 300 % 0.08/0.34 % WCLimit : 300 % 0.08/0.34 % DateTime : Sat Sep 5 11:39:24 UTC 2026 % 0.08/0.35 % CPUTime : % 0.23/0.51 start to proof:theBenchmark % 0.23/0.51 %------------------------------------------- % 0.23/0.51 % File :CSE---1.7 % 0.23/0.51 % Problem :theBenchmark % 0.23/0.51 % Transform :cnf % 0.23/0.51 % Format :tptp:raw % 0.23/0.51 % Command :java -jar mcs_scs.jar %d %s % 0.23/0.51 % 0.23/0.51 % Result :Theorem 0.003289s % 0.23/0.51 % Output :CNFRefutation 0.003289s % 0.23/0.51 %------------------------------------------- % 0.23/0.51 %------------------------------------------------------------------------------ % 0.23/0.51 % File : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.23/0.51 % Domain : Logic Calculi (Modal Logic) % 0.23/0.51 % Problem : In K, path through a labyrinth, size 1 % 0.23/0.51 % Version : Especial. % 0.23/0.51 % English : % 0.23/0.51 % 0.23/0.51 % Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro % 0.23/0.51 % : [Kam08] Kaminski (2008), Email to G. Sutcliffe % 0.23/0.51 % Source : [Kam08] % 0.23/0.51 % Names : k_path_p [BHS00] % 0.23/0.51 % 0.23/0.51 % Status : Theorem % 0.23/0.51 % 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.23/0.51 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.23/0.51 % Number of atoms : 16 ( 0 equ) % 0.23/0.51 % Maximal formula atoms : 16 ( 16 avg) % 0.23/0.51 % Number of connectives : 29 ( 14 ~; 15 |; 0 &) % 0.23/0.51 % ( 0 <=>; 0 =>; 0 <=; 0 <~>) % 0.23/0.51 % Maximal formula depth : 14 ( 14 avg) % 0.23/0.51 % Maximal term depth : 1 ( 1 avg) % 0.23/0.51 % Number of predicates : 7 ( 7 usr; 0 prp; 1-2 aty) % 0.23/0.51 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.23/0.51 % Number of variables : 9 ( 8 !; 1 ?) % 0.23/0.51 % SPC : FOF_THM_RFO_NEQ % 0.23/0.51 % 0.23/0.51 % Comments : A naive relational encoding of the modal logic problem into % 0.23/0.51 % first-order logic. % 0.23/0.51 %------------------------------------------------------------------------------ % 0.23/0.51 fof(main,conjecture, % 0.23/0.51 ~ ? [X] : % 0.23/0.51 ~ ( ~ ! [Y] : % 0.23/0.51 ( ~ r1(X,Y) % 0.23/0.51 | p6(Y) ) % 0.23/0.51 | ~ ! [Y] : % 0.23/0.51 ( ~ r1(X,Y) % 0.23/0.51 | p2(Y) ) % 0.23/0.51 | ~ ! [Y] : % 0.23/0.51 ( ~ r1(X,Y) % 0.23/0.51 | p4(Y) ) % 0.23/0.51 | ~ ! [Y] : % 0.23/0.51 ( ~ r1(X,Y) % 0.23/0.51 | p2(Y) ) % 0.23/0.51 | ! [Y] : % 0.23/0.52 ( ~ r1(X,Y) % 0.23/0.52 | p5(Y) ) % 0.23/0.52 | ! [Y] : % 0.23/0.52 ( ~ r1(X,Y) % 0.23/0.52 | p3(Y) ) % 0.23/0.52 | ! [Y] : % 0.23/0.52 ( ~ r1(X,Y) % 0.23/0.52 | p2(Y) ) % 0.23/0.52 | ! [Y] : % 0.23/0.52 ( ~ r1(X,Y) % 0.23/0.52 | p1(Y) ) ) ). % 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:12(EqnAxiom:0) % 0.23/0.52 %VarNum:6(SingletonVarNum:3) % 0.23/0.52 %MaxLitNum:2 % 0.23/0.52 %MaxfuncDepth:0 % 0.23/0.52 %SharedTerms:13 % 0.23/0.52 %goalClause: 1 2 3 4 5 6 7 8 9 11 12 % 0.23/0.52 %singleGoalClaCount:8 % 0.23/0.52 [1]P1(a1,a2) % 0.23/0.52 [2]P1(a1,a3) % 0.23/0.52 [3]P1(a1,a4) % 0.23/0.52 [4]P1(a1,a5) % 0.23/0.52 [5]~P2(a4) % 0.23/0.52 [6]~P4(a2) % 0.23/0.52 [7]~P5(a3) % 0.23/0.52 [8]~P3(a5) % 0.23/0.52 [9]P7(x91)+~P1(a1,x91) % 0.23/0.52 [11]P2(x111)+~P1(a1,x111) % 0.23/0.52 [12]P6(x121)+~P1(a1,x121) % 0.23/0.52 %EqnAxiom % 0.23/0.52 % 0.23/0.52 %------------------------------------------- % 0.23/0.52 cnf(13,plain, % 0.23/0.52 ($false), % 0.23/0.52 inference(scs_inference,[],[5,3,11]), % 0.23/0.52 ['proof']). % 0.23/0.52 % SZS output end Proof % 0.23/0.52 % Total time :0.003289s %------------------------------------------------------------------------------