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