%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN063-1 : TPTP v8.2.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n001.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:25 EDT 2024 % Result : Unsatisfiable 0.52s 0.61s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.13 % Problem : SYN063-1 : TPTP v8.2.0. Released v1.0.0. % 0.03/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.34 % Computer : n001.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 : Sun Jun 23 21:42:09 EDT 2024 % 0.13/0.34 % CPUTime : % 0.52/0.57 start to proof:theBenchmark % 0.52/0.60 %------------------------------------------- % 0.52/0.60 % File :CSE---1.7 % 0.52/0.60 % Problem :theBenchmark % 0.52/0.60 % Transform :cnf % 0.52/0.60 % Format :tptp:raw % 0.52/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.60 % 0.52/0.60 % Result :Theorem 0.000000s % 0.52/0.60 % Output :CNFRefutation 0.000000s % 0.52/0.60 %------------------------------------------- % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 % File : SYN063-1 : TPTP v8.2.0. Released v1.0.0. % 0.52/0.61 % Domain : Syntactic % 0.52/0.61 % Problem : Pelletier Problem 33 % 0.52/0.61 % Version : Especial. % 0.52/0.61 % English : % 0.52/0.61 % 0.52/0.61 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.52/0.61 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.52/0.61 % Source : [Pel86] % 0.52/0.61 % Names : Pelletier 33 [Pel86] % 0.52/0.61 % 0.52/0.61 % Status : Unsatisfiable % 0.52/0.61 % Rating : 0.00 v2.0.0 % 0.52/0.61 % Syntax : Number of clauses : 7 ( 2 unt; 3 nHn; 4 RR) % 0.52/0.61 % Number of literals : 22 ( 0 equ; 10 neg) % 0.52/0.61 % Maximal clause size : 5 ( 3 avg) % 0.52/0.61 % Maximal term depth : 1 ( 1 avg) % 0.52/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 0.52/0.61 % Number of functors : 5 ( 5 usr; 5 con; 0-0 aty) % 0.52/0.61 % Number of variables : 4 ( 4 sgn) % 0.52/0.61 % SPC : CNF_UNS_EPR_NEQ_NHN % 0.52/0.61 % 0.52/0.61 % Comments : This is a monadic predicate formulation of Pelletier 17. % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 cnf(clause_1,negated_conjecture, % 0.52/0.61 big_p(a) ). % 0.52/0.61 % 0.52/0.61 cnf(clause_2,negated_conjecture, % 0.52/0.61 ( ~ big_p(a) % 0.52/0.61 | big_p(X) % 0.52/0.61 | big_p(c) % 0.52/0.61 | big_p(Y) ) ). % 0.52/0.61 % 0.52/0.61 cnf(clause_3,negated_conjecture, % 0.52/0.61 ( ~ big_p(a) % 0.52/0.61 | ~ big_p(b) % 0.52/0.61 | big_p(c) ) ). % 0.52/0.61 % 0.52/0.61 cnf(clause_4,negated_conjecture, % 0.52/0.61 ~ big_p(c) ). % 0.52/0.61 % 0.52/0.61 cnf(clause_5,negated_conjecture, % 0.52/0.61 ( ~ big_p(e) % 0.52/0.61 | big_p(b) % 0.52/0.61 | ~ big_p(d) ) ). % 0.52/0.61 % 0.52/0.61 cnf(clause_6,negated_conjecture, % 0.52/0.61 ( ~ big_p(a) % 0.52/0.61 | big_p(X) % 0.52/0.61 | big_p(c) % 0.52/0.61 | ~ big_p(d) % 0.52/0.61 | big_p(b) ) ). % 0.52/0.61 % 0.52/0.61 cnf(clause_7,negated_conjecture, % 0.52/0.61 ( ~ big_p(e) % 0.52/0.61 | big_p(b) % 0.52/0.61 | ~ big_p(a) % 0.52/0.61 | big_p(X) % 0.52/0.61 | big_p(c) ) ). % 0.52/0.61 % 0.52/0.61 %-------------------------------------------------------------------------- % 0.52/0.61 %------------------------------------------- % 0.52/0.61 % Proof found % 0.52/0.61 % SZS status Theorem for theBenchmark % 0.52/0.61 % SZS output start Proof % 0.52/0.61 %ClaNum:7(EqnAxiom:0) % 0.52/0.61 %VarNum:2(SingletonVarNum:2) % 0.52/0.61 %MaxLitNum:4 % 0.52/0.61 %MaxfuncDepth:0 % 0.52/0.61 %SharedTerms:13 % 0.52/0.61 %goalClause: 1 2 3 4 5 % 0.52/0.61 %singleGoalClaCount:2 % 0.52/0.61 [1]P1(a1) % 0.52/0.61 [2]~P1(a2) % 0.52/0.61 [3]P1(a2)+~P1(a1)+~P1(a3) % 0.52/0.61 [4]P1(a3)+~P1(a4)+~P1(a5) % 0.52/0.61 [5]P1(x51)+P1(x52)+P1(a2)+~P1(a1) % 0.52/0.61 %EqnAxiom % 0.52/0.61 % 0.52/0.61 %------------------------------------------- % 0.52/0.61 cnf(8,plain, % 0.52/0.61 (P1(a2)+~P1(a1)), % 0.52/0.61 inference(factoring_inference,[],[5])). % 0.52/0.61 cnf(9,plain, % 0.52/0.61 ($false), % 0.52/0.61 inference(scs_inference,[],[2,1,8]), % 0.52/0.61 ['proof']). % 0.52/0.61 % SZS output end Proof % 0.52/0.61 % Total time :0.000000s %------------------------------------------------------------------------------