%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN084-2 : TPTP v8.2.0. Released v1.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/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:31 EDT 2024 % Result : Unsatisfiable 0.55s 0.61s % Output : CNFRefutation 0.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN084-2 : TPTP v8.2.0. Released v1.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n019.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 22:07:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.20/0.57 start to proof:theBenchmark % 0.20/0.61 %------------------------------------------- % 0.20/0.61 % File :CSE---1.7 % 0.20/0.61 % Problem :theBenchmark % 0.20/0.61 % Transform :cnf % 0.20/0.61 % Format :tptp:raw % 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.20/0.61 % 0.20/0.61 % Result :Theorem 0.000000s % 0.20/0.61 % Output :CNFRefutation 0.000000s % 0.20/0.61 %------------------------------------------- % 0.20/0.61 %-------------------------------------------------------------------------- % 0.20/0.61 % File : SYN084-2 : TPTP v8.2.0. Released v1.2.0. % 0.20/0.61 % Domain : Syntactic % 0.20/0.61 % Problem : Pelletier Problem 62 % 0.20/0.61 % Version : Especial. % 0.20/0.61 % Theorem formulation : Different clausification. % 0.20/0.61 % English : % 0.20/0.61 % 0.20/0.61 % Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au % 0.20/0.61 % : [Pel88] Pelletier (1988), Errata % 0.20/0.61 % : [Hah94] Haehnle (1994), Email to G. Sutcliffe % 0.20/0.61 % : [Pel95] Pelletier (1995), Email to G. Sutcliffe % 0.20/0.61 % Source : [Hah94] % 0.20/0.61 % Names : Pelletier 62 [Pel86] % 0.20/0.61 % 0.20/0.61 % Status : Unsatisfiable % 0.20/0.61 % Rating : 0.00 v2.0.0 % 0.20/0.61 % Syntax : Number of clauses : 7 ( 1 unt; 2 nHn; 6 RR) % 0.20/0.61 % Number of literals : 19 ( 0 equ; 11 neg) % 0.20/0.61 % Maximal clause size : 4 ( 2 avg) % 0.20/0.61 % Maximal term depth : 3 ( 2 avg) % 0.20/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 1-1 aty) % 0.20/0.61 % Number of functors : 4 ( 4 usr; 3 con; 0-1 aty) % 0.20/0.61 % Number of variables : 2 ( 0 sgn) % 0.20/0.61 % SPC : CNF_UNS_RFO_NEQ_NHN % 0.20/0.61 % 0.20/0.61 % Comments : This problem is incorrect in [Pel86] and is 'corrected' in % 0.20/0.61 % [Pel88]. The 1988 version is broken too [Pel95]. This is the % 0.20/0.61 % correct version. % 0.20/0.61 % : This CNF has been created from a corrected (<=> as the main % 0.20/0.61 % connective) version of the [Pel88] FOF version, as prescribed % 0.20/0.61 % in [Pel95]. % 0.20/0.61 %-------------------------------------------------------------------------- % 0.20/0.61 cnf(pel62_1,negated_conjecture, % 0.20/0.61 big_p(a) ). % 0.20/0.61 % 0.20/0.61 cnf(pel62_2,negated_conjecture, % 0.20/0.61 ( big_p(f(f(A))) % 0.20/0.61 | big_p(A) % 0.20/0.61 | ~ big_p(a) ) ). % 0.20/0.61 % 0.20/0.61 cnf(pel62_3,negated_conjecture, % 0.20/0.61 ( big_p(f(f(A))) % 0.20/0.61 | ~ big_p(f(A)) % 0.20/0.61 | ~ big_p(a) ) ). % 0.20/0.61 % 0.20/0.61 cnf(pel62_4,negated_conjecture, % 0.20/0.61 ( ~ big_p(f(f(sk1))) % 0.20/0.61 | ~ big_p(f(f(sk2))) ) ). % 0.20/0.61 % 0.20/0.61 cnf(pel62_5,negated_conjecture, % 0.20/0.61 ( big_p(f(sk1)) % 0.20/0.61 | big_p(f(sk2)) % 0.55/0.61 | ~ big_p(sk1) % 0.55/0.61 | ~ big_p(sk2) ) ). % 0.55/0.61 % 0.55/0.61 cnf(pel62_6,negated_conjecture, % 0.55/0.61 ( big_p(f(sk1)) % 0.55/0.61 | ~ big_p(sk1) % 0.55/0.61 | ~ big_p(f(f(sk2))) ) ). % 0.55/0.61 % 0.55/0.61 cnf(pel62_7,negated_conjecture, % 0.55/0.61 ( big_p(f(sk2)) % 0.55/0.61 | ~ big_p(sk2) % 0.55/0.61 | ~ big_p(f(f(sk1))) ) ). % 0.55/0.61 % 0.55/0.61 %-------------------------------------------------------------------------- % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % Proof found % 0.55/0.61 % SZS status Theorem for theBenchmark % 0.55/0.61 % SZS output start Proof % 0.55/0.61 %ClaNum:7(EqnAxiom:0) % 0.55/0.61 %VarNum:4(SingletonVarNum:2) % 0.55/0.61 %MaxLitNum:4 % 0.55/0.61 %MaxfuncDepth:2 % 0.55/0.61 %SharedTerms:15 % 0.55/0.61 %goalClause: 1 2 3 4 5 6 7 % 0.55/0.61 %singleGoalClaCount:1 % 0.55/0.61 [1]P1(a1) % 0.55/0.61 [7]~P1(f3(f3(a2)))+~P1(f3(f3(a4))) % 0.55/0.61 [4]~P1(a2)+~P1(f3(f3(a4)))+P1(f3(a2)) % 0.55/0.61 [5]~P1(a4)+~P1(f3(f3(a2)))+P1(f3(a4)) % 0.55/0.61 [3]P1(x31)+~P1(a1)+P1(f3(f3(x31))) % 0.55/0.61 [6]~P1(a1)+~P1(f3(x61))+P1(f3(f3(x61))) % 0.55/0.61 [2]~P1(a2)+~P1(a4)+P1(f3(a2))+P1(f3(a4)) % 0.55/0.61 %EqnAxiom % 0.55/0.61 % 0.55/0.61 %------------------------------------------- % 0.55/0.62 cnf(8,plain, % 0.55/0.62 (P1(x81)+P1(f3(f3(x81)))), % 0.55/0.62 inference(scs_inference,[],[1,3])). % 0.55/0.62 cnf(9,plain, % 0.55/0.62 (~P1(f3(x91))+P1(f3(f3(x91)))), % 0.55/0.62 inference(scs_inference,[],[1,6])). % 0.55/0.62 cnf(10,plain, % 0.55/0.62 (P1(a2)+~P1(f3(f3(a4)))), % 0.55/0.62 inference(scs_inference,[],[8,7])). % 0.55/0.62 cnf(11,plain, % 0.55/0.62 (P1(f3(a2))+~P1(f3(f3(a4)))), % 0.55/0.62 inference(scs_inference,[],[10,4])). % 0.55/0.62 cnf(12,plain, % 0.55/0.62 (P1(f3(f3(a2)))+~P1(f3(f3(a4)))), % 0.55/0.62 inference(scs_inference,[],[9,11])). % 0.55/0.62 cnf(13,plain, % 0.55/0.62 (~P1(f3(f3(a4)))), % 0.55/0.62 inference(scs_inference,[],[12,7])). % 0.55/0.62 cnf(14,plain, % 0.55/0.62 (P1(a4)), % 0.55/0.62 inference(scs_inference,[],[13,8])). % 0.55/0.62 cnf(16,plain, % 0.55/0.62 (~P1(a2)+P1(f3(a2))+P1(f3(a4))), % 0.55/0.62 inference(scs_inference,[],[14,2])). % 0.55/0.62 cnf(17,plain, % 0.55/0.62 (P1(f3(a4))+~P1(f3(f3(a2)))), % 0.55/0.62 inference(scs_inference,[],[14,5])). % 0.55/0.62 cnf(18,plain, % 0.55/0.62 (~P1(f3(f3(a2)))), % 0.55/0.62 inference(scs_inference,[],[13,17,9])). % 0.55/0.62 cnf(19,plain, % 0.55/0.62 (P1(a2)), % 0.55/0.62 inference(scs_inference,[],[18,8])). % 0.55/0.62 cnf(21,plain, % 0.55/0.62 (P1(f3(a2))+P1(f3(a4))), % 0.55/0.62 inference(scs_inference,[],[19,16])). % 0.55/0.62 cnf(22,plain, % 0.55/0.62 (P1(f3(a4))), % 0.55/0.62 inference(scs_inference,[],[18,21,9])). % 0.55/0.62 cnf(23,plain, % 0.55/0.62 ($false), % 0.55/0.62 inference(scs_inference,[],[13,22,9]), % 0.55/0.62 ['proof']). % 0.55/0.62 % SZS output end Proof % 0.55/0.62 % Total time :0.000000s %------------------------------------------------------------------------------