%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL114-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 : n021.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.56s 0.64s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : COL114-2 : TPTP v8.2.0. Released v3.2.0. % 0.03/0.11 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n021.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 15:36:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.47/0.61 start to proof:theBenchmark % 0.56/0.64 %------------------------------------------- % 0.56/0.64 % File :CSE---1.7 % 0.56/0.64 % Problem :theBenchmark % 0.56/0.64 % Transform :cnf % 0.56/0.64 % Format :tptp:raw % 0.56/0.64 % Command :java -jar mcs_scs.jar %d %s % 0.56/0.64 % 0.56/0.64 % Result :Theorem 0.000000s % 0.56/0.64 % Output :CNFRefutation 0.000000s % 0.56/0.64 %------------------------------------------- % 0.56/0.64 %------------------------------------------------------------------------------ % 0.56/0.64 % File : COL114-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 : 3 ( 2 unt; 0 nHn; 2 RR) % 0.56/0.64 % Number of literals : 4 ( 0 equ; 2 neg) % 0.56/0.64 % Maximal clause size : 2 ( 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 : 9 ( 9 usr; 6 con; 0-4 aty) % 0.56/0.64 % Number of variables : 3 ( 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_1,negated_conjecture, % 0.56/0.64 c_in(c_Pair(v_x,v_x_H,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_conjecture_2,negated_conjecture, % 0.56/0.64 ( ~ c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,v_x_H),v_w),V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) % 0.56/0.64 | ~ c_in(c_Pair(v_x,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__2_0,axiom, % 0.56/0.64 c_in(c_Pair(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_Oop_A_D_D(c_Comb_Ocomb_OK,V_x),V_y),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.64 %ClaNum:3(EqnAxiom:0) % 0.56/0.64 %VarNum:5(SingletonVarNum:3) % 0.56/0.64 %MaxLitNum:2 % 0.56/0.64 %MaxfuncDepth:3 % 0.56/0.64 %SharedTerms:11 % 0.56/0.64 %goalClause: 1 3 % 0.56/0.64 %singleGoalClaCount:1 % 0.56/0.64 [1]P1(f3(a1,a9,a2,a2),a4,f7(a2,a2)) % 0.56/0.64 [2]P1(f3(f6(f6(a5,x21),x22),x21,a2,a2),a4,f7(a2,a2)) % 0.56/0.64 [3]~P1(f3(a1,x31,a2,a2),a4,f7(a2,a2))+~P1(f3(f6(f6(a5,a9),a8),x31,a2,a2),a4,f7(a2,a2)) % 0.56/0.64 %EqnAxiom % 0.56/0.64 % 0.56/0.64 %------------------------------------------- % 0.56/0.65 cnf(4,plain, % 0.56/0.65 ($false), % 0.56/0.65 inference(scs_inference,[],[1,2,3]), % 0.56/0.65 ['proof']). % 0.56/0.65 % SZS output end Proof % 0.56/0.65 % Total time :0.000000s %------------------------------------------------------------------------------