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