%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN005-1.010 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n028.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 19:04:12 EDT 2024 % Result : Unsatisfiable 0.55s 0.62s % Output : CNFRefutation 0.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.14 % Problem : SYN005-1.010 : TPTP v8.2.0. Released v1.0.0. % 0.08/0.14 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.14/0.34 % Computer : n028.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.35 % WCLimit : 300 % 0.14/0.35 % DateTime : Sun Jun 23 23:03:24 EDT 2024 % 0.14/0.35 % CPUTime : % 0.21/0.58 start to proof:theBenchmark % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % File :CSE---1.7 % 0.55/0.61 % Problem :theBenchmark % 0.55/0.61 % Transform :cnf % 0.55/0.61 % Format :tptp:raw % 0.55/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.55/0.61 % 0.55/0.61 % Result :Theorem 0.000000s % 0.55/0.61 % Output :CNFRefutation 0.000000s % 0.55/0.61 %------------------------------------------- % 0.55/0.61 %-------------------------------------------------------------------------- % 0.55/0.61 % File : SYN005-1.010 : TPTP v8.2.0. Released v1.0.0. % 0.55/0.61 % Domain : Syntactic % 0.55/0.61 % Problem : Disjunctions that form a contradiction % 0.55/0.61 % Version : Biased. % 0.55/0.61 % English : ~p1(X1,X2) v ~p2(X2,X3) v ... v ~p10(X10,X1). % 0.55/0.62 % p1(a,a) p2(a,a) ... p10(a,a) % 0.55/0.62 % 0.55/0.62 % Refs : [Pla82] Plaisted (1982), A Simplified Problem Reduction Format % 0.55/0.62 % Source : [Pla82] % 0.55/0.62 % Names : Problem 5.4 [Pla82] % 0.55/0.62 % 0.55/0.62 % Status : Unsatisfiable % 0.55/0.62 % Rating : 0.00 v2.1.0 % 0.55/0.62 % Syntax : Number of clauses : 11 ( 10 unt; 0 nHn; 11 RR) % 0.55/0.62 % Number of literals : 20 ( 0 equ; 10 neg) % 0.55/0.62 % Maximal clause size : 10 ( 1 avg) % 0.55/0.62 % Maximal term depth : 1 ( 1 avg) % 0.55/0.62 % Number of predicates : 10 ( 10 usr; 0 prp; 2-2 aty) % 0.55/0.62 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.55/0.62 % Number of variables : 10 ( 0 sgn) % 0.55/0.62 % SPC : CNF_UNS_EPR_NEQ_HRN % 0.55/0.62 % 0.55/0.62 % Comments : "On this example locking resolution (even with a bad choice % 0.55/0.62 % of indices) and SL-resolution generate search spaces of size % 0.55/0.62 % polynomial in n, but positive unit resolution, all-negative % 0.55/0.62 % resolution, set-of-support strategy, ancestry-filter form, % 0.55/0.62 % and input resolution all generate search spaces of size % 0.55/0.62 % exponential in n." [Pla82] p.244. % 0.55/0.62 % : tptp2X: -f tptp -s10 SYN005-1.g % 0.55/0.62 %-------------------------------------------------------------------------- % 0.55/0.62 cnf(disjunction,negated_conjecture, % 0.55/0.62 ( ~ p_1(X1,X2) % 0.55/0.62 | ~ p_2(X2,X3) % 0.55/0.62 | ~ p_3(X3,X4) % 0.55/0.62 | ~ p_4(X4,X5) % 0.55/0.62 | ~ p_5(X5,X6) % 0.55/0.62 | ~ p_6(X6,X7) % 0.55/0.62 | ~ p_7(X7,X8) % 0.55/0.62 | ~ p_8(X8,X9) % 0.55/0.62 | ~ p_9(X9,X10) % 0.55/0.62 | ~ p_10(X10,X1) ) ). % 0.55/0.62 % 0.55/0.62 cnf(p_1,negated_conjecture, % 0.55/0.62 p_1(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_2,negated_conjecture, % 0.55/0.62 p_2(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_3,negated_conjecture, % 0.55/0.62 p_3(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_4,negated_conjecture, % 0.55/0.62 p_4(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_5,negated_conjecture, % 0.55/0.62 p_5(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_6,negated_conjecture, % 0.55/0.62 p_6(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_7,negated_conjecture, % 0.55/0.62 p_7(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_8,negated_conjecture, % 0.55/0.62 p_8(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_9,negated_conjecture, % 0.55/0.62 p_9(a,a) ). % 0.55/0.62 % 0.55/0.62 cnf(p_10,negated_conjecture, % 0.55/0.62 p_10(a,a) ). % 0.55/0.62 % 0.55/0.62 %-------------------------------------------------------------------------- % 0.55/0.62 %------------------------------------------- % 0.55/0.62 % Proof found % 0.55/0.62 % SZS status Theorem for theBenchmark % 0.55/0.62 % SZS output start Proof % 0.55/0.62 %ClaNum:11(EqnAxiom:0) % 0.55/0.62 %VarNum:20(SingletonVarNum:10) % 0.55/0.62 %MaxLitNum:10 % 0.55/0.62 %MaxfuncDepth:0 % 0.55/0.62 %SharedTerms:11 % 0.55/0.62 %goalClause: 1 2 3 4 5 6 7 8 9 10 11 % 0.55/0.62 %singleGoalClaCount:10 % 0.55/0.62 [1]P1(a1,a1) % 0.55/0.62 [2]P2(a1,a1) % 0.55/0.62 [3]P4(a1,a1) % 0.55/0.62 [4]P5(a1,a1) % 0.55/0.62 [5]P6(a1,a1) % 0.55/0.62 [6]P7(a1,a1) % 0.55/0.62 [7]P8(a1,a1) % 0.55/0.62 [8]P9(a1,a1) % 0.55/0.62 [9]P10(a1,a1) % 0.55/0.62 [10]P3(a1,a1) % 0.55/0.62 [11]~P3(x1110,x111)+~P1(x111,x112)+~P2(x112,x113)+~P4(x113,x114)+~P5(x114,x115)+~P6(x115,x116)+~P7(x116,x117)+~P8(x117,x118)+~P9(x118,x119)+~P10(x119,x1110) % 0.55/0.62 %EqnAxiom % 0.55/0.62 % 0.55/0.62 %------------------------------------------- % 0.58/0.62 cnf(12,plain, % 0.58/0.62 ($false), % 0.58/0.62 inference(scs_inference,[],[10,1,2,3,4,5,6,7,8,9,11]), % 0.58/0.62 ['proof']). % 0.58/0.62 % SZS output end Proof % 0.58/0.62 % Total time :0.000000s %------------------------------------------------------------------------------