%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN054-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 : n021.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:22 EDT 2024 % Result : Unsatisfiable 0.48s 0.54s % Output : CNFRefutation 0.48s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : SYN054-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 : n021.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 18:18:54 EDT 2024 % 0.13/0.34 % CPUTime : % 0.20/0.50 start to proof:theBenchmark % 0.48/0.53 %------------------------------------------- % 0.48/0.53 % File :CSE---1.7 % 0.48/0.53 % Problem :theBenchmark % 0.48/0.53 % Transform :cnf % 0.48/0.53 % Format :tptp:raw % 0.48/0.53 % Command :java -jar mcs_scs.jar %d %s % 0.48/0.53 % 0.48/0.53 % Result :Theorem 0.000000s % 0.48/0.53 % Output :CNFRefutation 0.000000s % 0.48/0.53 %------------------------------------------- % 0.48/0.53 %-------------------------------------------------------------------------- % 0.48/0.53 % File : SYN054-1 : TPTP v8.2.0. Released v1.0.0. % 0.48/0.53 % Domain : Syntactic % 0.48/0.53 % Problem : Pelletier Problem 24 % 0.48/0.53 % Version : Especial. % 0.48/0.53 % English : % 0.48/0.53 % 0.48/0.53 % Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal % 0.48/0.53 % : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.48/0.53 % Source : [Pel86] % 0.48/0.53 % Names : Pelletier 24 [Pel86] % 0.48/0.53 % 0.48/0.53 % Status : Unsatisfiable % 0.48/0.54 % Rating : 0.00 v2.0.0 % 0.48/0.54 % Syntax : Number of clauses : 6 ( 0 unt; 2 nHn; 6 RR) % 0.48/0.54 % Number of literals : 13 ( 0 equ; 7 neg) % 0.48/0.54 % Maximal clause size : 3 ( 2 avg) % 0.48/0.54 % Maximal term depth : 1 ( 1 avg) % 0.48/0.54 % Number of predicates : 4 ( 4 usr; 0 prp; 1-1 aty) % 0.48/0.54 % Number of functors : 2 ( 2 usr; 2 con; 0-0 aty) % 0.48/0.54 % Number of variables : 5 ( 0 sgn) % 0.48/0.54 % SPC : CNF_UNS_EPR_NEQ_NHN % 0.48/0.54 % 0.48/0.54 % Comments : % 0.48/0.54 %-------------------------------------------------------------------------- % 0.48/0.54 cnf(clause_1,axiom, % 0.48/0.54 ( ~ big_s(X) % 0.48/0.54 | ~ big_q(X) ) ). % 0.48/0.54 % 0.48/0.54 cnf(clause_2,axiom, % 0.48/0.54 ( ~ big_p(X) % 0.48/0.54 | big_q(X) % 0.48/0.54 | big_r(X) ) ). % 0.48/0.54 % 0.48/0.54 cnf(clause_3,axiom, % 0.48/0.54 ( big_p(a) % 0.48/0.54 | big_q(b) ) ). % 0.48/0.54 % 0.48/0.54 cnf(clause_4,axiom, % 0.48/0.54 ( ~ big_q(X) % 0.48/0.54 | big_s(X) ) ). % 0.48/0.54 % 0.48/0.54 cnf(clause_5,negated_conjecture, % 0.48/0.54 ( ~ big_r(X) % 0.48/0.54 | big_s(X) ) ). % 0.48/0.54 % 0.48/0.54 cnf(clause_6,negated_conjecture, % 0.48/0.54 ( ~ big_p(X) % 0.48/0.54 | ~ big_r(X) ) ). % 0.48/0.54 % 0.48/0.54 %-------------------------------------------------------------------------- % 0.48/0.54 %------------------------------------------- % 0.48/0.54 % Proof found % 0.48/0.54 % SZS status Theorem for theBenchmark % 0.48/0.54 % SZS output start Proof % 0.48/0.54 %ClaNum:6(EqnAxiom:0) % 0.48/0.54 %VarNum:11(SingletonVarNum:5) % 0.48/0.54 %MaxLitNum:3 % 0.48/0.54 %MaxfuncDepth:0 % 0.48/0.54 %SharedTerms:4 % 0.48/0.54 %goalClause: 3 5 % 0.48/0.54 [1]P1(a1)+P2(a2) % 0.48/0.54 [2]~P1(x21)+P3(x21) % 0.48/0.54 [3]~P4(x31)+P3(x31) % 0.48/0.54 [4]~P1(x41)+~P3(x41) % 0.48/0.54 [5]~P4(x51)+~P2(x51) % 0.48/0.54 [6]P4(x61)+~P2(x61)+P1(x61) % 0.48/0.54 %EqnAxiom % 0.48/0.54 % 0.48/0.54 %------------------------------------------- % 0.48/0.54 cnf(7,plain, % 0.48/0.54 (P3(a1)+P2(a2)), % 0.48/0.54 inference(scs_inference,[],[1,2])). % 0.48/0.54 cnf(9,plain, % 0.48/0.54 (~P4(a2)+P3(a1)), % 0.48/0.54 inference(scs_inference,[],[5,7])). % 0.48/0.54 cnf(11,plain, % 0.48/0.54 (~P2(a2)+P1(a2)+P3(a1)), % 0.48/0.54 inference(scs_inference,[],[9,6])). % 0.48/0.54 cnf(14,plain, % 0.48/0.54 (P1(a2)+P3(a1)), % 0.48/0.54 inference(scs_inference,[],[11,7])). % 0.48/0.54 cnf(15,plain, % 0.48/0.54 (P3(a2)+P3(a1)), % 0.48/0.54 inference(scs_inference,[],[14,2])). % 0.48/0.54 cnf(16,plain, % 0.48/0.54 (~P1(a2)+P3(a1)), % 0.48/0.54 inference(scs_inference,[],[15,4])). % 0.48/0.54 cnf(17,plain, % 0.48/0.54 (P3(a1)), % 0.48/0.54 inference(scs_inference,[],[16,14])). % 0.48/0.54 cnf(23,plain, % 0.48/0.54 (P1(a2)), % 0.48/0.54 inference(scs_inference,[],[17,4,1,5,6])). % 0.48/0.54 cnf(25,plain, % 0.48/0.54 (P3(a2)), % 0.48/0.54 inference(scs_inference,[],[17,4,1,5,6,2])). % 0.48/0.54 cnf(27,plain, % 0.48/0.54 ($false), % 0.48/0.54 inference(scs_inference,[],[23,25,4]), % 0.48/0.54 ['proof']). % 0.48/0.54 % SZS output end Proof % 0.48/0.54 % Total time :0.000000s %------------------------------------------------------------------------------