%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL115-2 : TPTP v8.2.0. Released v3.2.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n011.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:14 EDT 2024 % Result : Unsatisfiable 0.54s 0.61s % Output : CNFRefutation 0.54s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.12 % Problem : COL115-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n011.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 : Tue Jun 18 16:14:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.50/0.57 start to proof:theBenchmark % 0.54/0.60 %------------------------------------------- % 0.54/0.60 % File :CSE---1.7 % 0.54/0.60 % Problem :theBenchmark % 0.54/0.60 % Transform :cnf % 0.54/0.60 % Format :tptp:raw % 0.54/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.54/0.60 % 0.54/0.60 % Result :Theorem 0.000000s % 0.54/0.60 % Output :CNFRefutation 0.000000s % 0.54/0.60 %------------------------------------------- % 0.54/0.60 %------------------------------------------------------------------------------ % 0.54/0.60 % File : COL115-2 : TPTP v8.2.0. Released v3.2.0. % 0.54/0.60 % Domain : Combinatory Logic % 0.54/0.60 % Problem : Problem about combinators % 0.54/0.60 % Version : [Pau06] axioms : Reduced > Especial. % 0.54/0.60 % English : % 0.54/0.60 % 0.54/0.60 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.54/0.60 % Source : [Pau06] % 0.54/0.60 % Names : % 0.54/0.60 % 0.54/0.60 % Status : Unsatisfiable % 0.54/0.60 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.54/0.60 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 1 RR) % 0.54/0.60 % Number of literals : 4 ( 0 equ; 2 neg) % 0.54/0.60 % Maximal clause size : 2 ( 1 avg) % 0.54/0.60 % Maximal term depth : 5 ( 2 avg) % 0.54/0.60 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.54/0.60 % Number of functors : 9 ( 9 usr; 6 con; 0-4 aty) % 0.54/0.60 % Number of variables : 5 ( 0 sgn) % 0.54/0.60 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.54/0.60 % 0.54/0.60 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.54/0.60 % of which only a small selection are required for the refutation. % 0.54/0.60 % The mission is to find those few axioms, after which a refutation % 0.54/0.60 % can be quite easily found. This version has only the necessary % 0.54/0.60 % axioms. % 0.54/0.60 %------------------------------------------------------------------------------ % 0.54/0.60 cnf(cls_conjecture_0,negated_conjecture, % 0.54/0.60 ( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,v_x),v_ya),v_z),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) % 0.54/0.60 | ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_ya,v_z)),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ) ). % 0.54/0.60 % 0.54/0.60 cnf(cls_Comb_Oparcontract_Ointros__1_0,axiom, % 0.54/0.61 c_in(c_Pair(V_x,V_x,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ). % 0.54/0.61 % 0.54/0.61 cnf(cls_Comb_Oparcontract_Ointros__3_0,axiom, % 0.54/0.61 c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OS,V_x),V_y),V_z),c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(V_x,V_z),c_Comb_Ocomb_Oop_A_D_D(V_y,V_z)),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ). % 0.54/0.61 % 0.54/0.61 %------------------------------------------------------------------------------ % 0.54/0.61 %------------------------------------------- % 0.54/0.61 % Proof found % 0.54/0.61 % SZS status Theorem for theBenchmark % 0.54/0.61 % SZS output start Proof % 0.54/0.61 %ClaNum:3(EqnAxiom:0) % 0.54/0.61 %VarNum:11(SingletonVarNum:5) % 0.54/0.61 %MaxLitNum:2 % 0.54/0.61 %MaxfuncDepth:4 % 0.54/0.61 %SharedTerms:13 % 0.54/0.61 %goalClause: 3 % 0.54/0.61 [1]P1(f2(x11,x11,a1,a1),a3,f6(a1,a1)) % 0.54/0.61 [2]P1(f2(f5(f5(f5(a4,x21),x22),x23),f5(f5(x21,x23),f5(x22,x23)),a1,a1),a3,f6(a1,a1)) % 0.54/0.61 [3]~P1(f2(f5(f5(a7,a8),f5(a9,a8)),x31,a1,a1),a3,f6(a1,a1))+~P1(f2(f5(f5(f5(a4,a7),a9),a8),x31,a1,a1),a3,f6(a1,a1)) % 0.54/0.61 %EqnAxiom % 0.54/0.61 % 0.54/0.61 %------------------------------------------- % 0.54/0.61 cnf(4,plain, % 0.54/0.61 ($false), % 0.54/0.61 inference(scs_inference,[],[1,2,3]), % 0.54/0.61 ['proof']). % 0.54/0.61 % SZS output end Proof % 0.54/0.61 % Total time :0.000000s %------------------------------------------------------------------------------