%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL101-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 : n020.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:09 EDT 2024 % Result : Unsatisfiable 0.52s 0.59s % Output : CNFRefutation 0.52s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.13 % Problem : COL101-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.12/0.34 % Computer : n020.cluster.edu % 0.12/0.34 % Model : x86_64 x86_64 % 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.34 % Memory : 8042.1875MB % 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.34 % CPULimit : 300 % 0.12/0.34 % WCLimit : 300 % 0.12/0.34 % DateTime : Tue Jun 18 16:03:24 EDT 2024 % 0.12/0.34 % CPUTime : % 0.20/0.55 start to proof:theBenchmark % 0.52/0.58 %------------------------------------------- % 0.52/0.58 % File :CSE---1.7 % 0.52/0.58 % Problem :theBenchmark % 0.52/0.58 % Transform :cnf % 0.52/0.58 % Format :tptp:raw % 0.52/0.58 % Command :java -jar mcs_scs.jar %d %s % 0.52/0.58 % 0.52/0.58 % Result :Theorem 0.000000s % 0.52/0.58 % Output :CNFRefutation 0.000000s % 0.52/0.58 %------------------------------------------- % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 % File : COL101-2 : TPTP v8.2.0. Released v3.2.0. % 0.52/0.59 % Domain : Combinatory Logic % 0.52/0.59 % Problem : Problem about combinators % 0.52/0.59 % Version : [Pau06] axioms : Reduced > Especial. % 0.52/0.59 % English : % 0.52/0.59 % 0.52/0.59 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.52/0.59 % Source : [Pau06] % 0.52/0.59 % Names : % 0.52/0.59 % 0.52/0.59 % Status : Unsatisfiable % 0.52/0.59 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v3.2.0 % 0.52/0.59 % Syntax : Number of clauses : 2 ( 2 unt; 0 nHn; 1 RR) % 0.52/0.59 % Number of literals : 2 ( 0 equ; 1 neg) % 0.52/0.59 % Maximal clause size : 1 ( 1 avg) % 0.52/0.59 % Maximal term depth : 3 ( 1 avg) % 0.52/0.59 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.52/0.59 % Number of functors : 8 ( 8 usr; 4 con; 0-4 aty) % 0.52/0.59 % Number of variables : 3 ( 1 sgn) % 0.52/0.59 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.52/0.59 % 0.52/0.59 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.52/0.59 % of which only a small selection are required for the refutation. % 0.52/0.59 % The mission is to find those few axioms, after which a refutation % 0.52/0.59 % can be quite easily found. This version has only the necessary % 0.52/0.59 % axioms. % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 cnf(cls_conjecture_0,negated_conjecture, % 0.52/0.59 ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),c_Comb_Ocomb_Oop_A_D_D(v_x,v_z),tc_Comb_Ocomb,tc_Comb_Ocomb),c_Transitive__Closure_Ortrancl(c_Comb_Ocontract,tc_Comb_Ocomb),tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ). % 0.52/0.59 % 0.52/0.59 cnf(cls_Transitive__Closure_Ortrancl_Ortrancl__refl_0,axiom, % 0.52/0.59 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.52/0.59 % 0.52/0.59 %------------------------------------------------------------------------------ % 0.52/0.59 %------------------------------------------- % 0.52/0.59 % Proof found % 0.52/0.59 % SZS status Theorem for theBenchmark % 0.52/0.59 % SZS output start Proof % 0.52/0.59 %ClaNum:2(EqnAxiom:0) % 0.52/0.59 %VarNum:8(SingletonVarNum:3) % 0.52/0.59 %MaxLitNum:1 % 0.52/0.59 %MaxfuncDepth:2 % 0.52/0.59 %SharedTerms:9 % 0.52/0.59 %goalClause: 2 % 0.52/0.59 %singleGoalClaCount:1 % 0.52/0.59 [2]~P1(f1(f2(a7,a8),f2(a7,a8),a6,a6),f4(a3,a6),f5(a6,a6)) % 0.52/0.59 [1]P1(f1(x11,x11,x12,x12),f4(x13,x12),f5(x12,x12)) % 0.52/0.59 %EqnAxiom % 0.52/0.59 % 0.52/0.59 %------------------------------------------- % 0.52/0.59 cnf(3,plain, % 0.52/0.59 ($false), % 0.52/0.59 inference(scs_inference,[],[2,1]), % 0.52/0.59 ['proof']). % 0.52/0.59 % SZS output end Proof % 0.52/0.59 % Total time :0.000000s %------------------------------------------------------------------------------