%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : MSC015-1.005 : TPTP v8.2.0. Released v3.5.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n018.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 11:52:13 EDT 2024 % Result : Unsatisfiable 0.55s 0.61s % Output : CNFRefutation 0.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : MSC015-1.005 : TPTP v8.2.0. Released v3.5.0. % 0.10/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.14/0.34 % Computer : n018.cluster.edu % 0.14/0.34 % Model : x86_64 x86_64 % 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.14/0.34 % Memory : 8042.1875MB % 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.14/0.34 % CPULimit : 300 % 0.14/0.34 % WCLimit : 300 % 0.14/0.34 % DateTime : Sat Jun 22 05:48:39 EDT 2024 % 0.14/0.34 % CPUTime : % 0.21/0.57 start to proof:theBenchmark % 0.53/0.61 %------------------------------------------- % 0.53/0.61 % File :CSE---1.7 % 0.53/0.61 % Problem :theBenchmark % 0.53/0.61 % Transform :cnf % 0.53/0.61 % Format :tptp:raw % 0.53/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.61 % 0.53/0.61 % Result :Theorem 0.000000s % 0.53/0.61 % Output :CNFRefutation 0.000000s % 0.53/0.61 %------------------------------------------- % 0.53/0.61 %------------------------------------------------------------------------------ % 0.53/0.61 % File : MSC015-1.005 : TPTP v8.2.0. Released v3.5.0. % 0.55/0.61 % Domain : Miscellaneous % 0.55/0.61 % Problem : Binary counter k=05 % 0.55/0.61 % Version : Especial. % 0.55/0.61 % English : Each instance of the problem asserts % 0.55/0.61 % p(0*). // p[0] % 0.55/0.61 % p(x*01*) -> p(x*10*). // p[i] -> p[i + 1] % 0.55/0.61 % not p(1*). // not p[2^n - 1] % 0.55/0.61 % These problems are unsatisfiable and have exponentially large % 0.55/0.61 % propositional resolution refutations, while there is a short % 0.55/0.61 % (quadratic) first order refutation. % 0.55/0.61 % 0.55/0.61 % Refs : [NV07a] Navarro (2007), Email to Geoff Sutcliffe % 0.55/0.61 % [NV07b] Navarro & Voronkov (2007), Planning with Effectively P % 0.55/0.61 % Source : [NV07a] % 0.55/0.61 % Names : bincount-k05 [NV07a] % 0.55/0.61 % 0.55/0.61 % Status : Unsatisfiable % 0.55/0.61 % Rating : 0.00 v3.5.0 % 0.55/0.61 % Syntax : Number of clauses : 7 ( 2 unt; 0 nHn; 7 RR) % 0.55/0.61 % Number of literals : 12 ( 0 equ; 6 neg) % 0.55/0.61 % Maximal clause size : 2 ( 1 avg) % 0.55/0.61 % Maximal term depth : 1 ( 1 avg) % 0.55/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 5-5 aty) % 0.55/0.61 % Number of functors : 2 ( 2 usr; 2 con; 0-0 aty) % 0.55/0.61 % Number of variables : 10 ( 0 sgn) % 0.55/0.61 % SPC : CNF_UNS_EPR_NEQ_HRN % 0.55/0.61 % 0.55/0.61 % Comments : k >= 23 not solved by any prover in less than 1 hr. (2007) % 0.55/0.61 %------------------------------------------------------------------------------ % 0.55/0.61 cnf(init,axiom, % 0.55/0.61 p(s0,s0,s0,s0,s0) ). % 0.55/0.61 % 0.55/0.61 cnf(rule1,axiom, % 0.55/0.61 ( ~ p(X0,X1,X2,X3,s0) % 0.55/0.61 | p(X0,X1,X2,X3,s1) ) ). % 0.55/0.61 % 0.55/0.61 cnf(rule2,axiom, % 0.55/0.61 ( ~ p(X0,X1,X2,s0,s1) % 0.55/0.61 | p(X0,X1,X2,s1,s0) ) ). % 0.55/0.61 % 0.55/0.61 cnf(rule3,axiom, % 0.55/0.61 ( ~ p(X0,X1,s0,s1,s1) % 0.55/0.61 | p(X0,X1,s1,s0,s0) ) ). % 0.55/0.61 % 0.55/0.61 cnf(rule4,axiom, % 0.55/0.61 ( ~ p(X0,s0,s1,s1,s1) % 0.55/0.61 | p(X0,s1,s0,s0,s0) ) ). % 0.55/0.61 % 0.55/0.61 cnf(rule5,axiom, % 0.55/0.61 ( ~ p(s0,s1,s1,s1,s1) % 0.55/0.61 | p(s1,s0,s0,s0,s0) ) ). % 0.55/0.61 % 0.55/0.61 cnf(goal,negated_conjecture, % 0.55/0.61 ~ p(s1,s1,s1,s1,s1) ). % 0.55/0.61 % 0.55/0.61 %------------------------------------------------------------------------------ % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % Proof found % 0.55/0.61 % SZS status Theorem for theBenchmark % 0.55/0.61 % SZS output start Proof % 0.55/0.61 %ClaNum:7(EqnAxiom:0) % 0.55/0.61 %VarNum:20(SingletonVarNum:10) % 0.55/0.61 %MaxLitNum:2 % 0.55/0.61 %MaxfuncDepth:0 % 0.55/0.61 %SharedTerms:6 % 0.55/0.61 %goalClause: 2 % 0.55/0.61 %singleGoalClaCount:1 % 0.55/0.61 [1]P1(a1,a1,a1,a1,a1) % 0.55/0.61 [2]~P1(a2,a2,a2,a2,a2) % 0.55/0.61 [3]P1(a2,a1,a1,a1,a1)+~P1(a1,a2,a2,a2,a2) % 0.55/0.61 [4]~P1(x41,a1,a2,a2,a2)+P1(x41,a2,a1,a1,a1) % 0.55/0.61 [5]~P1(x51,x52,a1,a2,a2)+P1(x51,x52,a2,a1,a1) % 0.55/0.61 [6]~P1(x61,x62,x63,a1,a2)+P1(x61,x62,x63,a2,a1) % 0.55/0.62 [7]~P1(x71,x72,x73,x74,a1)+P1(x71,x72,x73,x74,a2) % 0.55/0.62 %EqnAxiom % 0.55/0.62 % 0.55/0.62 %------------------------------------------- % 0.55/0.62 cnf(10,plain, % 0.55/0.62 (~P1(a2,a2,a2,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[2,7,6])). % 0.55/0.62 cnf(14,plain, % 0.55/0.62 (~P1(a2,a2,a1,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[10,7,5])). % 0.55/0.62 cnf(18,plain, % 0.55/0.62 (~P1(a2,a2,a1,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[14,7,6])). % 0.55/0.62 cnf(22,plain, % 0.55/0.62 (~P1(a2,a1,a2,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[18,7,4])). % 0.55/0.62 cnf(26,plain, % 0.55/0.62 (~P1(a2,a1,a2,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[22,7,6])). % 0.55/0.62 cnf(30,plain, % 0.55/0.62 (~P1(a2,a1,a1,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[26,7,5])). % 0.55/0.62 cnf(34,plain, % 0.55/0.62 (~P1(a2,a1,a1,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[30,7,6])). % 0.55/0.62 cnf(38,plain, % 0.55/0.62 (~P1(a1,a2,a2,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[34,7,3])). % 0.55/0.62 cnf(41,plain, % 0.55/0.62 (~P1(a1,a2,a2,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[38,7,6])). % 0.55/0.62 cnf(45,plain, % 0.55/0.62 (~P1(a1,a2,a1,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[41,7,5])). % 0.55/0.62 cnf(49,plain, % 0.55/0.62 (~P1(a1,a2,a1,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[45,7,6])). % 0.55/0.62 cnf(53,plain, % 0.55/0.62 (~P1(a1,a1,a2,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[49,7,4])). % 0.55/0.62 cnf(57,plain, % 0.55/0.62 (~P1(a1,a1,a2,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[53,7,6])). % 0.55/0.62 cnf(61,plain, % 0.55/0.62 (~P1(a1,a1,a1,a2,a2)), % 0.55/0.62 inference(scs_inference,[],[57,7,5])). % 0.55/0.62 cnf(65,plain, % 0.55/0.62 (~P1(a1,a1,a1,a1,a2)), % 0.55/0.62 inference(scs_inference,[],[61,7,6])). % 0.55/0.62 cnf(67,plain, % 0.55/0.62 ($false), % 0.55/0.62 inference(scs_inference,[],[65,1,7]), % 0.55/0.62 ['proof']). % 0.55/0.62 % SZS output end Proof % 0.55/0.62 % Total time :0.000000s %------------------------------------------------------------------------------