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