%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LCL648+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 : 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.21s 0.53s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.02 % Problem : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.00/0.02 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.08/0.36 % Computer : n007.cluster.edu % 0.08/0.36 % Model : x86_64 x86_64 % 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.08/0.36 % Memory : 8046.5625MB % 0.08/0.36 % OS : Linux 6.8.0-71-generic % 0.08/0.36 % CPULimit : 300 % 0.08/0.36 % WCLimit : 300 % 0.08/0.36 % DateTime : Fri Sep 4 12:24:26 UTC 2026 % 0.08/0.37 % CPUTime : % 0.21/0.53 start to proof:theBenchmark % 0.21/0.53 %------------------------------------------- % 0.21/0.53 % File :CSE---1.7 % 0.21/0.53 % Problem :theBenchmark % 0.21/0.53 % Transform :cnf % 0.21/0.53 % Format :tptp:raw % 0.21/0.53 % Command :java -jar mcs_scs.jar %d %s % 0.21/0.53 % 0.21/0.53 % Result :Theorem 0.003300s % 0.21/0.53 % Output :CNFRefutation 0.003300s % 0.21/0.53 %------------------------------------------- % 0.21/0.53 %------------------------------------------------------------------------------ % 0.21/0.53 % File : LCL648+1.001 : TPTP v9.3.1. Released v4.0.0. % 0.21/0.53 % Domain : Logic Calculi (Modal Logic) % 0.21/0.53 % Problem : In K, pigeonhole formulae, size 1 % 0.21/0.53 % Version : Especial. % 0.21/0.53 % English : % 0.21/0.53 % 0.21/0.53 % Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro % 0.21/0.53 % : [Kam08] Kaminski (2008), Email to G. Sutcliffe % 0.21/0.53 % Source : [Kam08] % 0.21/0.53 % Names : k_ph_p [BHS00] % 0.21/0.53 % 0.21/0.53 % Status : Theorem % 0.21/0.53 % 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.21/0.53 % Syntax : Number of formulae : 1 ( 0 unt; 0 def) % 0.21/0.53 % Number of atoms : 6 ( 0 equ) % 0.21/0.53 % Maximal formula atoms : 6 ( 6 avg) % 0.21/0.53 % Number of connectives : 12 ( 7 ~; 3 |; 2 &) % 0.21/0.53 % ( 0 <=>; 0 =>; 0 <=; 0 <~>) % 0.21/0.53 % Maximal formula depth : 10 ( 10 avg) % 0.21/0.53 % Maximal term depth : 1 ( 1 avg) % 0.21/0.53 % Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty) % 0.21/0.53 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.21/0.53 % Number of variables : 3 ( 2 !; 1 ?) % 0.21/0.53 % SPC : FOF_THM_RFO_NEQ % 0.21/0.53 % 0.21/0.53 % Comments : A naive relational encoding of the modal logic problem into % 0.21/0.53 % first-order logic. % 0.21/0.53 %------------------------------------------------------------------------------ % 0.21/0.53 fof(main,conjecture, % 0.21/0.53 ~ ? [X] : % 0.21/0.53 ~ ( ~ ! [Y] : % 0.21/0.53 ( ~ r1(X,Y) % 0.21/0.53 | ~ ( p201(Y) % 0.21/0.53 & p101(Y) ) ) % 0.21/0.53 | ! [Y] : % 0.21/0.53 ( ~ r1(X,Y) % 0.21/0.53 | ~ ( p201(Y) % 0.21/0.53 & p101(Y) ) ) ) ). % 0.21/0.53 % 0.21/0.53 %------------------------------------------------------------------------------ % 0.21/0.53 %------------------------------------------- % 0.21/0.53 % Proof found % 0.21/0.53 % SZS status Theorem for theBenchmark % 0.21/0.53 % SZS output start Proof % 0.21/0.53 %ClaNum:4(EqnAxiom:0) % 0.21/0.53 %VarNum:3(SingletonVarNum:1) % 0.21/0.53 %MaxLitNum:3 % 0.21/0.53 %MaxfuncDepth:0 % 0.21/0.53 %SharedTerms:5 % 0.21/0.53 %goalClause: 1 2 3 4 % 0.21/0.53 %singleGoalClaCount:3 % 0.21/0.53 [1]P1(a1) % 0.21/0.53 [2]P2(a1) % 0.21/0.53 [3]P3(a2,a1) % 0.21/0.53 [4]~P2(x41)+~P1(x41)+~P3(a2,x41) % 0.21/0.53 %EqnAxiom % 0.21/0.53 % 0.21/0.53 %------------------------------------------- % 0.21/0.53 cnf(5,plain, % 0.21/0.53 ($false), % 0.21/0.53 inference(scs_inference,[],[2,1,3,4]), % 0.21/0.53 ['proof']). % 0.21/0.53 % SZS output end Proof % 0.21/0.53 % Total time :0.003300s %------------------------------------------------------------------------------