%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL119-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n009.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 04:45:16 EDT 2024 % Result : Unsatisfiable 0.55s 0.62s % Output : CNFRefutation 0.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.13 % Problem : COL119-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.35 % Computer : n009.cluster.edu % 0.13/0.35 % Model : x86_64 x86_64 % 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.35 % Memory : 8042.1875MB % 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 300 % 0.13/0.35 % DateTime : Tue Jun 18 15:54:24 EDT 2024 % 0.13/0.35 % CPUTime : % 0.55/0.58 start to proof:theBenchmark % 0.55/0.61 %------------------------------------------- % 0.55/0.61 % File :CSE---1.7 % 0.55/0.61 % Problem :theBenchmark % 0.55/0.61 % Transform :cnf % 0.55/0.61 % Format :tptp:raw % 0.55/0.61 % Command :java -jar mcs_scs.jar %d %s % 0.55/0.61 % 0.55/0.61 % Result :Theorem 0.000000s % 0.55/0.61 % Output :CNFRefutation 0.000000s % 0.55/0.61 %------------------------------------------- % 0.55/0.62 %------------------------------------------------------------------------------ % 0.55/0.62 % File : COL119-2 : TPTP v8.2.0. Released v3.2.0. % 0.55/0.62 % Domain : Combinatory Logic % 0.55/0.62 % Problem : Problem about combinators % 0.55/0.62 % Version : [Pau06] axioms : Reduced > Especial. % 0.55/0.62 % English : % 0.55/0.62 % 0.55/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.55/0.62 % Source : [Pau06] % 0.55/0.62 % Names : % 0.55/0.62 % 0.55/0.62 % Status : Unsatisfiable % 0.55/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.55/0.62 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 0.55/0.62 % Number of literals : 4 ( 0 equ; 2 neg) % 0.55/0.62 % Maximal clause size : 2 ( 1 avg) % 0.55/0.62 % Maximal term depth : 4 ( 1 avg) % 0.55/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.55/0.62 % Number of functors : 9 ( 9 usr; 6 con; 0-4 aty) % 0.55/0.62 % Number of variables : 3 ( 1 sgn) % 0.55/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.55/0.62 % 0.55/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.55/0.62 % of which only a small selection are required for the refutation. % 0.55/0.62 % The mission is to find those few axioms, after which a refutation % 0.55/0.62 % can be quite easily found. This version has only the necessary % 0.55/0.62 % axioms. % 0.55/0.62 %------------------------------------------------------------------------------ % 0.55/0.62 cnf(cls_conjecture_1,negated_conjecture, % 0.55/0.62 c_in(c_Pair(v_y_H,v_x_H,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ). % 0.55/0.62 % 0.55/0.62 cnf(cls_conjecture_2,negated_conjecture, % 0.55/0.62 ( ~ c_in(c_Pair(v_y_H,V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) % 0.55/0.62 | ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x_H),v_w),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ) ). % 0.55/0.62 % 0.55/0.62 cnf(cls_Comb_Oparcontract_Ointros__2_0,axiom, % 0.55/0.62 c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,V_x),V_y),V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ). % 0.55/0.62 % 0.55/0.62 %------------------------------------------------------------------------------ % 0.55/0.62 %------------------------------------------- % 0.55/0.62 % Proof found % 0.55/0.62 % SZS status Theorem for theBenchmark % 0.55/0.62 % SZS output start Proof % 0.55/0.62 %ClaNum:3(EqnAxiom:0) % 0.55/0.62 %VarNum:5(SingletonVarNum:3) % 0.55/0.62 %MaxLitNum:2 % 0.55/0.62 %MaxfuncDepth:3 % 0.55/0.62 %SharedTerms:11 % 0.55/0.62 %goalClause: 1 3 % 0.55/0.62 %singleGoalClaCount:1 % 0.55/0.62 [1]P1(f4(a1,a2,a3,a3),a5,f8(a3,a3)) % 0.55/0.62 [2]P1(f4(f7(f7(a6,x21),x22),x21,a3,a3),a5,f8(a3,a3)) % 0.55/0.62 [3]~P1(f4(a1,x31,a3,a3),a5,f8(a3,a3))+~P1(f4(f7(f7(a6,a2),a9),x31,a3,a3),a5,f8(a3,a3)) % 0.55/0.62 %EqnAxiom % 0.55/0.62 % 0.55/0.62 %------------------------------------------- % 0.55/0.62 cnf(4,plain, % 0.55/0.62 ($false), % 0.55/0.62 inference(scs_inference,[],[1,2,3]), % 0.55/0.62 ['proof']). % 0.55/0.62 % SZS output end Proof % 0.55/0.62 % Total time :0.000000s %------------------------------------------------------------------------------