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