%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : PUZ063-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n013.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 : Mon Jun 24 13:42:17 EDT 2024 % Result : Unsatisfiable 0.52s 0.58s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.12 % Problem : PUZ063-2 : TPTP v8.2.0. Released v3.2.0. % 0.12/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n013.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 : Tue Jun 18 09:58:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.55 start to proof:theBenchmark % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % File :CSE---1.7 % 0.52/0.58 % Problem :theBenchmark % 0.52/0.58 % Transform :cnf % 0.52/0.58 % Format :tptp:raw % 0.52/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.58 % 0.52/0.58 % Result :Theorem 0.000000s % 0.52/0.58 % Output :CNFRefutation 0.000000s % 0.52/0.58 %------------------------------------------- % 0.52/0.58 %------------------------------------------------------------------------------ % 0.52/0.58 % File : PUZ063-2 : TPTP v8.2.0. Released v3.2.0. % 0.52/0.58 % Domain : Puzzles % 0.52/0.58 % Problem : Problem about mutilated chessboard problem % 0.52/0.58 % Version : [Pau06] axioms : Reduced > Especial. % 0.52/0.58 % English : % 0.52/0.58 % 0.52/0.58 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.52/0.58 % Source : [Pau06] % 0.52/0.58 % Names : % 0.52/0.58 % 0.52/0.58 % Status : Unsatisfiable % 0.52/0.58 % Rating : 0.00 v5.3.0, 0.08 v5.2.0, 0.00 v5.1.0, 0.14 v4.1.0, 0.22 v4.0.1, 0.33 v3.7.0, 0.17 v3.3.0, 0.14 v3.2.0 % 0.52/0.58 % Syntax : Number of clauses : 3 ( 3 unt; 0 nHn; 2 RR) % 0.52/0.58 % Number of literals : 3 ( 1 equ; 1 neg) % 0.52/0.58 % Maximal clause size : 1 ( 1 avg) % 0.52/0.58 % Maximal term depth : 2 ( 1 avg) % 0.52/0.58 % Number of predicates : 2 ( 1 usr; 0 prp; 2-3 aty) % 0.52/0.58 % Number of functors : 7 ( 7 usr; 4 con; 0-3 aty) % 0.52/0.58 % Number of variables : 2 ( 1 sgn) % 0.52/0.58 % SPC : CNF_UNS_RFO_SEQ_HRN % 0.52/0.58 % 0.52/0.58 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.52/0.58 % of which only a small selection are required for the refutation. % 0.52/0.58 % The mission is to find those few axioms, after which a refutation % 0.52/0.58 % can be quite easily found. This version has only the necessary % 0.52/0.58 % axioms. % 0.52/0.58 %------------------------------------------------------------------------------ % 0.52/0.58 cnf(cls_conjecture_0,negated_conjecture, % 0.52/0.58 c_in(v_u,c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ). % 0.52/0.58 % 0.52/0.58 cnf(cls_conjecture_2,negated_conjecture, % 0.52/0.58 ~ c_in(c_union(c_emptyset,v_u,t_a),c_Mutil_Otiling(v_A,t_a),tc_set(t_a)) ). % 0.52/0.58 % 0.52/0.58 cnf(cls_Set_OUn__empty__left_0,axiom, % 0.52/0.58 c_union(c_emptyset,V_y,T_a) = V_y ). % 0.52/0.58 % 0.52/0.58 %------------------------------------------------------------------------------ % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % Proof found % 0.52/0.58 % SZS status Theorem for theBenchmark % 0.52/0.58 % SZS output start Proof % 0.52/0.58 %ClaNum:15(EqnAxiom:12) % 0.52/0.58 %VarNum:3(SingletonVarNum:2) % 0.52/0.58 %MaxLitNum:1 % 0.52/0.58 %MaxfuncDepth:1 % 0.52/0.58 %SharedTerms:9 % 0.52/0.58 %goalClause: 14 15 % 0.52/0.58 %singleGoalClaCount:2 % 0.52/0.58 [14]P1(a4,f2(a5,a6),f7(a6)) % 0.52/0.58 [15]~P1(f3(a1,a4,a6),f2(a5,a6),f7(a6)) % 0.52/0.58 [13]E(f3(a1,x131,x132),x131) % 0.52/0.58 %EqnAxiom % 0.52/0.58 [1]E(x11,x11) % 0.52/0.58 [2]E(x22,x21)+~E(x21,x22) % 0.52/0.58 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.52/0.58 [4]~E(x41,x42)+E(f3(x41,x43,x44),f3(x42,x43,x44)) % 0.52/0.58 [5]~E(x51,x52)+E(f3(x53,x51,x54),f3(x53,x52,x54)) % 0.52/0.58 [6]~E(x61,x62)+E(f3(x63,x64,x61),f3(x63,x64,x62)) % 0.52/0.58 [7]~E(x71,x72)+E(f2(x71,x73),f2(x72,x73)) % 0.52/0.58 [8]~E(x81,x82)+E(f2(x83,x81),f2(x83,x82)) % 0.52/0.58 [9]~E(x91,x92)+E(f7(x91),f7(x92)) % 0.52/0.58 [10]P1(x102,x103,x104)+~E(x101,x102)+~P1(x101,x103,x104) % 0.52/0.58 [11]P1(x113,x112,x114)+~E(x111,x112)+~P1(x113,x111,x114) % 0.52/0.58 [12]P1(x123,x124,x122)+~E(x121,x122)+~P1(x123,x124,x121) % 0.52/0.58 % 0.52/0.58 %------------------------------------------- % 0.52/0.59 cnf(17,plain, % 0.52/0.59 ($false), % 0.52/0.59 inference(scs_inference,[],[14,15,13,2,10]), % 0.52/0.59 ['proof']). % 0.52/0.59 % SZS output end Proof % 0.52/0.59 % Total time :0.000000s %------------------------------------------------------------------------------