%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL122-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 : n013.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:17 EDT 2024 % Result : Unsatisfiable 0.57s 0.66s % Output : CNFRefutation 0.57s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : COL122-2 : TPTP v8.2.0. Released v3.2.0. % 0.04/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.13/0.35 % Computer : n013.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:43:24 EDT 2024 % 0.13/0.35 % CPUTime : % 0.48/0.64 start to proof:theBenchmark % 0.57/0.66 %------------------------------------------- % 0.57/0.66 % File :CSE---1.7 % 0.57/0.66 % Problem :theBenchmark % 0.57/0.66 % Transform :cnf % 0.57/0.66 % Format :tptp:raw % 0.57/0.66 % Command :java -jar mcs_scs.jar %d %s % 0.57/0.66 % 0.57/0.66 % Result :Theorem 0.000000s % 0.57/0.66 % Output :CNFRefutation 0.000000s % 0.57/0.66 %------------------------------------------- % 0.57/0.66 %------------------------------------------------------------------------------ % 0.57/0.66 % File : COL122-2 : TPTP v8.2.0. Released v3.2.0. % 0.57/0.66 % Domain : Combinatory Logic % 0.57/0.66 % Problem : Problem about combinators % 0.57/0.66 % Version : [Pau06] axioms : Reduced > Especial. % 0.57/0.66 % English : % 0.57/0.66 % 0.57/0.66 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.57/0.66 % Source : [Pau06] % 0.57/0.66 % Names : % 0.57/0.66 % 0.57/0.66 % Status : Unsatisfiable % 0.57/0.66 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.15 v5.2.0, 0.00 v3.2.0 % 0.57/0.66 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 0.57/0.66 % Number of literals : 4 ( 0 equ; 2 neg) % 0.57/0.66 % Maximal clause size : 2 ( 1 avg) % 0.57/0.66 % Maximal term depth : 2 ( 1 avg) % 0.57/0.66 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.57/0.66 % Number of functors : 7 ( 7 usr; 4 con; 0-4 aty) % 0.57/0.66 % Number of variables : 4 ( 1 sgn) % 0.57/0.66 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.57/0.66 % 0.57/0.66 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.57/0.66 % of which only a small selection are required for the refutation. % 0.57/0.66 % The mission is to find those few axioms, after which a refutation % 0.57/0.66 % can be quite easily found. This version has only the necessary % 0.57/0.66 % axioms. % 0.57/0.66 %------------------------------------------------------------------------------ % 0.57/0.66 cnf(cls_conjecture_0,negated_conjecture, % 0.57/0.66 c_in(c_Pair(v_x,v_xaa,t_a,t_a),v_r,tc_prod(t_a,t_a)) ). % 0.57/0.66 % 0.57/0.66 cnf(cls_conjecture_1,negated_conjecture, % 0.57/0.66 ( ~ c_in(c_Pair(v_x,V_U,t_a,t_a),v_r,tc_prod(t_a,t_a)) % 0.57/0.66 | ~ c_in(c_Pair(v_xaa,V_U,t_a,t_a),c_Transitive__Closure_Ortrancl(v_r,t_a),tc_prod(t_a,t_a)) ) ). % 0.57/0.66 % 0.57/0.66 cnf(cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0,axiom, % 0.57/0.66 c_in(c_Pair(V_a,V_a,T_a,T_a),c_Transitive__Closure_Ortrancl(V_r,T_a),tc_prod(T_a,T_a)) ). % 0.57/0.66 % 0.57/0.66 %------------------------------------------------------------------------------ % 0.57/0.66 %------------------------------------------- % 0.57/0.66 % Proof found % 0.57/0.66 % SZS status Theorem for theBenchmark % 0.57/0.66 % SZS output start Proof % 0.57/0.67 %ClaNum:3(EqnAxiom:0) % 0.57/0.67 %VarNum:10(SingletonVarNum:4) % 0.57/0.67 %MaxLitNum:2 % 0.57/0.67 %MaxfuncDepth:1 % 0.57/0.67 %SharedTerms:8 % 0.57/0.67 %goalClause: 1 3 % 0.57/0.67 %singleGoalClaCount:1 % 0.57/0.67 [1]P1(f3(a1,a7,a2,a2),a5,f6(a2,a2)) % 0.57/0.67 [2]P1(f3(x21,x21,x22,x22),f4(x23,x22),f6(x22,x22)) % 0.57/0.67 [3]~P1(f3(a7,x31,a2,a2),f4(a5,a2),f6(a2,a2))+~P1(f3(a1,x31,a2,a2),a5,f6(a2,a2)) % 0.57/0.67 %EqnAxiom % 0.57/0.67 % 0.57/0.67 %------------------------------------------- % 0.57/0.67 cnf(4,plain, % 0.57/0.67 ($false), % 0.57/0.67 inference(scs_inference,[],[2,1,3]), % 0.57/0.67 ['proof']). % 0.57/0.67 % SZS output end Proof % 0.57/0.67 % Total time :0.000000s %------------------------------------------------------------------------------