%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : COL105-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 : n006.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:11 EDT 2024 % Result : Unsatisfiable 0.56s 0.62s % Output : CNFRefutation 0.58s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : COL105-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n006.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 16:19:54 EDT 2024 % 0.12/0.33 % CPUTime : % 0.19/0.58 start to proof:theBenchmark % 0.56/0.62 %------------------------------------------- % 0.56/0.62 % File :CSE---1.7 % 0.56/0.62 % Problem :theBenchmark % 0.56/0.62 % Transform :cnf % 0.56/0.62 % Format :tptp:raw % 0.56/0.62 % Command :java -jar mcs_scs.jar %d %s % 0.56/0.62 % 0.56/0.62 % Result :Theorem 0.000000s % 0.56/0.62 % Output :CNFRefutation 0.000000s % 0.56/0.62 %------------------------------------------- % 0.56/0.62 %------------------------------------------------------------------------------ % 0.56/0.62 % File : COL105-2 : TPTP v8.2.0. Released v3.2.0. % 0.56/0.62 % Domain : Combinatory Logic % 0.56/0.62 % Problem : Problem about combinators % 0.56/0.62 % Version : [Pau06] axioms : Reduced > Especial. % 0.56/0.62 % English : % 0.56/0.62 % 0.56/0.62 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.56/0.62 % Source : [Pau06] % 0.56/0.62 % Names : % 0.56/0.62 % 0.56/0.62 % Status : Unsatisfiable % 0.56/0.62 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.15 v5.2.0, 0.00 v3.2.0 % 0.56/0.62 % Syntax : Number of clauses : 3 ( 2 unt; 0 nHn; 2 RR) % 0.56/0.62 % Number of literals : 4 ( 0 equ; 2 neg) % 0.56/0.62 % Maximal clause size : 2 ( 1 avg) % 0.56/0.62 % Maximal term depth : 2 ( 1 avg) % 0.56/0.62 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.56/0.62 % Number of functors : 6 ( 6 usr; 4 con; 0-4 aty) % 0.56/0.62 % Number of variables : 2 ( 0 sgn) % 0.56/0.62 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.56/0.62 % 0.56/0.62 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.56/0.62 % of which only a small selection are required for the refutation. % 0.56/0.62 % The mission is to find those few axioms, after which a refutation % 0.56/0.62 % can be quite easily found. This version has only the necessary % 0.56/0.62 % axioms. % 0.56/0.62 %------------------------------------------------------------------------------ % 0.56/0.62 cnf(cls_conjecture_0,negated_conjecture, % 0.56/0.62 c_in(c_Pair(v_x,v_xb,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) ). % 0.56/0.62 % 0.56/0.62 cnf(cls_conjecture_1,negated_conjecture, % 0.56/0.62 ( ~ c_in(c_Pair(v_xb,V_U,tc_Comb_Ocomb,tc_Comb_Ocomb),c_Comb_Oparcontract,tc_prod(tc_Comb_Ocomb,tc_Comb_Ocomb)) % 0.56/0.62 | ~ 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.62 % 0.56/0.62 cnf(cls_Comb_Oparcontract_Ointros__1_0,axiom, % 0.56/0.62 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.62 % 0.56/0.62 %------------------------------------------------------------------------------ % 0.56/0.62 %------------------------------------------- % 0.56/0.62 % Proof found % 0.56/0.62 % SZS status Theorem for theBenchmark % 0.56/0.62 % SZS output start Proof % 0.56/0.62 %ClaNum:3(EqnAxiom:0) % 0.56/0.62 %VarNum:4(SingletonVarNum:2) % 0.56/0.62 %MaxLitNum:2 % 0.56/0.62 %MaxfuncDepth:1 % 0.56/0.62 %SharedTerms:7 % 0.56/0.62 %goalClause: 1 3 % 0.56/0.62 %singleGoalClaCount:1 % 0.56/0.62 [1]P1(f3(a1,a6,a2,a2),a4,f5(a2,a2)) % 0.56/0.62 [2]P1(f3(x21,x21,a2,a2),a4,f5(a2,a2)) % 0.56/0.62 [3]~P1(f3(a6,x31,a2,a2),a4,f5(a2,a2))+~P1(f3(a1,x31,a2,a2),a4,f5(a2,a2)) % 0.56/0.62 %EqnAxiom % 0.56/0.62 % 0.56/0.62 %------------------------------------------- % 0.58/0.63 cnf(4,plain, % 0.58/0.63 ($false), % 0.58/0.63 inference(scs_inference,[],[2,1,3]), % 0.58/0.63 ['proof']). % 0.58/0.63 % SZS output end Proof % 0.58/0.63 % Total time :0.000000s %------------------------------------------------------------------------------