%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN061-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 : n024.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:24 EDT 2024 % Result : Unsatisfiable 0.61s 0.68s % Output : CNFRefutation 0.61s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN061-1 : TPTP v8.2.0. Released v1.0.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n024.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 : Sun Jun 23 18:26:24 EDT 2024 % 0.12/0.34 % CPUTime : % 0.61/0.64 start to proof:theBenchmark % 0.61/0.68 %------------------------------------------- % 0.61/0.68 % File :CSE---1.7 % 0.61/0.68 % Problem :theBenchmark % 0.61/0.68 % Transform :cnf % 0.61/0.68 % Format :tptp:raw % 0.61/0.68 % Command :java -jar mcs_scs.jar %d %s % 0.61/0.68 % 0.61/0.68 % Result :Theorem 0.000000s % 0.61/0.68 % Output :CNFRefutation 0.000000s % 0.61/0.68 %------------------------------------------- % 0.61/0.68 %-------------------------------------------------------------------------- % 0.61/0.68 % File : SYN061-1 : TPTP v8.2.0. Released v1.0.0. % 0.61/0.68 % Domain : Syntactic % 0.61/0.68 % Problem : Pelletier Problem 31 % 0.61/0.68 % Version : Especial. % 0.61/0.68 % English : % 0.61/0.68 % 0.61/0.68 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.61/0.68 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.61/0.68 % Source : [Pel86] % 0.61/0.68 % Names : Pelletier 31 [Pel86] % 0.61/0.68 % 0.61/0.68 % Status : Unsatisfiable % 0.61/0.68 % Rating : 0.00 v2.0.0 % 0.61/0.68 % Syntax : Number of clauses : 6 ( 2 unt; 1 nHn; 5 RR) % 0.61/0.68 % Number of literals : 10 ( 0 equ; 6 neg) % 0.61/0.68 % Maximal clause size : 2 ( 1 avg) % 0.61/0.68 % Maximal term depth : 1 ( 1 avg) % 0.61/0.68 % Number of predicates : 5 ( 5 usr; 0 prp; 1-1 aty) % 0.61/0.68 % Number of functors : 1 ( 1 usr; 1 con; 0-0 aty) % 0.61/0.68 % Number of variables : 4 ( 0 sgn) % 0.61/0.68 % SPC : CNF_UNS_EPR_NEQ_NHN % 0.61/0.68 % 0.61/0.68 % Comments : % 0.61/0.68 %-------------------------------------------------------------------------- % 0.61/0.68 cnf(clause_1,axiom, % 0.61/0.68 ( ~ big_f(X) % 0.61/0.68 | ~ big_g(X) ) ). % 0.61/0.68 % 0.61/0.68 cnf(clause_2,axiom, % 0.61/0.68 ( ~ big_f(X) % 0.61/0.68 | ~ big_h(X) ) ). % 0.61/0.68 % 0.61/0.68 cnf(clause_3,axiom, % 0.61/0.68 big_i(a) ). % 0.61/0.68 % 0.61/0.68 cnf(clause_4,axiom, % 0.61/0.68 big_f(a) ). % 0.61/0.68 % 0.61/0.68 cnf(clause_5,axiom, % 0.61/0.68 ( big_h(X) % 0.61/0.68 | big_j(X) ) ). % 0.61/0.68 % 0.61/0.68 cnf(clause_6,negated_conjecture, % 0.61/0.68 ( ~ big_i(X) % 0.61/0.68 | ~ big_j(X) ) ). % 0.61/0.68 % 0.61/0.68 %-------------------------------------------------------------------------- % 0.61/0.68 %------------------------------------------- % 0.61/0.68 % Proof found % 0.61/0.68 % SZS status Theorem for theBenchmark % 0.61/0.68 % SZS output start Proof % 0.61/0.69 %ClaNum:6(EqnAxiom:0) % 0.61/0.69 %VarNum:8(SingletonVarNum:4) % 0.61/0.69 %MaxLitNum:2 % 0.61/0.69 %MaxfuncDepth:0 % 0.61/0.69 %SharedTerms:3 % 0.61/0.69 %goalClause: 6 % 0.61/0.69 [1]P1(a1) % 0.61/0.69 [2]P2(a1) % 0.61/0.69 [3]P5(x31)+P3(x31) % 0.61/0.69 [4]~P4(x41)+~P1(x41) % 0.61/0.69 [5]~P3(x51)+~P1(x51) % 0.61/0.69 [6]~P5(x61)+~P2(x61) % 0.61/0.69 %EqnAxiom % 0.61/0.69 % 0.61/0.69 %------------------------------------------- % 0.61/0.69 cnf(11,plain, % 0.61/0.69 ($false), % 0.61/0.69 inference(scs_inference,[],[1,2,6,5,3]), % 0.61/0.69 ['proof']). % 0.61/0.69 % SZS output end Proof % 0.61/0.69 % Total time :0.000000s %------------------------------------------------------------------------------