%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LAT261-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 : n001.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 10:18:26 EDT 2024 % Result : Unsatisfiable 0.46s 0.61s % Output : CNFRefutation 0.46s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : LAT261-2 : TPTP v8.2.0. Released v3.2.0. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n001.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 : Fri Jun 21 21:00:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.46/0.57 start to proof:theBenchmark % 0.46/0.60 %------------------------------------------- % 0.46/0.60 % File :CSE---1.7 % 0.46/0.60 % Problem :theBenchmark % 0.46/0.60 % Transform :cnf % 0.46/0.60 % Format :tptp:raw % 0.46/0.60 % Command :java -jar mcs_scs.jar %d %s % 0.46/0.60 % 0.46/0.60 % Result :Theorem 0.000000s % 0.46/0.60 % Output :CNFRefutation 0.000000s % 0.46/0.60 %------------------------------------------- % 0.46/0.61 %------------------------------------------------------------------------------ % 0.46/0.61 % File : LAT261-2 : TPTP v8.2.0. Released v3.2.0. % 0.46/0.61 % Domain : Analysis % 0.46/0.61 % Problem : Problem about Tarski's fixed point theorem % 0.46/0.61 % Version : [Pau06] axioms : Reduced > Especial. % 0.46/0.61 % English : % 0.46/0.61 % 0.46/0.61 % Refs : [Pau06] Paulson (2006), Email to G. Sutcliffe % 0.46/0.61 % Source : [Pau06] % 0.46/0.61 % Names : % 0.46/0.61 % 0.46/0.61 % Status : Unsatisfiable % 0.46/0.61 % Rating : 0.33 v8.1.0, 0.00 v7.3.0, 0.20 v7.2.0, 0.22 v7.1.0, 0.14 v7.0.0, 0.00 v6.2.0, 0.12 v6.0.0, 0.00 v3.3.0, 0.33 v3.2.0 % 0.46/0.61 % Syntax : Number of clauses : 2 ( 2 unt; 0 nHn; 2 RR) % 0.46/0.61 % Number of literals : 2 ( 0 equ; 1 neg) % 0.46/0.61 % Maximal clause size : 1 ( 1 avg) % 0.46/0.61 % Maximal term depth : 2 ( 1 avg) % 0.46/0.61 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.46/0.61 % Number of functors : 6 ( 6 usr; 4 con; 0-2 aty) % 0.46/0.61 % Number of variables : 0 ( 0 sgn) % 0.46/0.61 % SPC : CNF_UNS_EPR_NEQ_HRN % 0.46/0.61 % 0.46/0.61 % Comments : The problems in the [Pau06] collection each have very many axioms, % 0.46/0.61 % of which only a small selection are required for the refutation. % 0.46/0.61 % The mission is to find those few axioms, after which a refutation % 0.46/0.61 % can be quite easily found. This version has only the necessary % 0.46/0.61 % axioms. % 0.46/0.61 %------------------------------------------------------------------------------ % 0.46/0.61 cnf(cls_conjecture_1,negated_conjecture, % 0.46/0.61 ~ c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ). % 0.46/0.61 % 0.46/0.61 cnf(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0,axiom, % 0.46/0.61 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) ). % 0.46/0.61 % 0.46/0.61 %------------------------------------------------------------------------------ % 0.46/0.61 %------------------------------------------- % 0.46/0.61 % Proof found % 0.46/0.61 % SZS status Theorem for theBenchmark % 0.46/0.61 % SZS output start Proof % 0.46/0.61 %ClaNum:2(EqnAxiom:0) % 0.46/0.61 %VarNum:0(SingletonVarNum:0) % 0.46/0.61 %MaxLitNum:1 % 0.46/0.61 %MaxfuncDepth:1 % 0.46/0.61 %SharedTerms:8 % 0.46/0.61 %goalClause: 2 % 0.46/0.61 %singleGoalClaCount:1 % 0.46/0.61 [1]P1(f3(a1,a2),a4,f6(a2,a5)) % 0.46/0.61 [2]~P1(f3(a1,a2),a4,f6(a2,a5)) % 0.46/0.61 %EqnAxiom % 0.46/0.61 % 0.46/0.61 %------------------------------------------- % 0.46/0.61 cnf(3,plain, % 0.46/0.61 ($false), % 0.46/0.61 inference(scs_inference,[],[2,1]), % 0.46/0.61 ['proof']). % 0.46/0.61 % SZS output end Proof % 0.46/0.61 % Total time :0.000000s %------------------------------------------------------------------------------