%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : LAT270-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 : n023.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:30 EDT 2024 % Result : Unsatisfiable 0.56s 0.62s % Output : CNFRefutation 0.56s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.06/0.12 % Problem : LAT270-2 : TPTP v8.2.0. Released v3.2.0. % 0.06/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.32 % Computer : n023.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % WCLimit : 300 % 0.11/0.32 % DateTime : Fri Jun 21 20:17:09 EDT 2024 % 0.11/0.33 % CPUTime : % 0.18/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 : LAT270-2 : TPTP v8.2.0. Released v3.2.0. % 0.56/0.62 % Domain : Analysis % 0.56/0.62 % Problem : Problem about Tarski's fixed point theorem % 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.10 v5.2.0, 0.00 v3.2.0 % 0.56/0.62 % Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR) % 0.56/0.62 % Number of literals : 8 ( 0 equ; 4 neg) % 0.56/0.62 % Maximal clause size : 4 ( 1 avg) % 0.56/0.62 % Maximal term depth : 2 ( 1 avg) % 0.56/0.62 % Number of predicates : 2 ( 2 usr; 0 prp; 3-3 aty) % 0.56/0.62 % Number of functors : 8 ( 8 usr; 6 con; 0-4 aty) % 0.56/0.62 % Number of variables : 3 ( 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(v_a,v_A,t_a) ). % 0.56/0.62 % 0.56/0.62 cnf(cls_conjecture_1,negated_conjecture, % 0.56/0.62 c_in(v_b,v_A,t_a) ). % 0.56/0.62 % 0.56/0.62 cnf(cls_conjecture_2,negated_conjecture, % 0.56/0.62 c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)) ). % 0.56/0.62 % 0.56/0.62 cnf(cls_conjecture_6,negated_conjecture, % 0.56/0.62 ~ c_lessequals(v_S,v_A,tc_set(t_a)) ). % 0.56/0.62 % 0.56/0.62 cnf(cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0,axiom, % 0.56/0.62 ( ~ c_in(V_b,v_A,t_a) % 0.56/0.62 | ~ c_in(V_a,v_A,t_a) % 0.56/0.62 | ~ c_lessequals(V_S,c_Tarski_Ointerval(v_r,V_a,V_b,t_a),tc_set(t_a)) % 0.56/0.62 | c_lessequals(V_S,v_A,tc_set(t_a)) ) ). % 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.63 %ClaNum:5(EqnAxiom:0) % 0.56/0.63 %VarNum:6(SingletonVarNum:3) % 0.56/0.63 %MaxLitNum:4 % 0.56/0.63 %MaxfuncDepth:1 % 0.56/0.63 %SharedTerms:12 % 0.56/0.63 %goalClause: 1 2 3 4 % 0.56/0.63 %singleGoalClaCount:4 % 0.56/0.63 [1]P1(a1,a2,a3) % 0.56/0.63 [2]P1(a7,a2,a3) % 0.56/0.63 [3]P2(a6,f4(a8,a1,a7,a3),f5(a3)) % 0.56/0.63 [4]~P2(a6,a2,f5(a3)) % 0.56/0.63 [5]~P2(x51,f4(a8,x52,x53,a3),f5(a3))+~P1(x52,a2,a3)+~P1(x53,a2,a3)+P2(x51,a2,f5(a3)) % 0.56/0.63 %EqnAxiom % 0.56/0.63 % 0.56/0.63 %------------------------------------------- % 0.56/0.63 cnf(6,plain, % 0.56/0.63 ($false), % 0.56/0.63 inference(scs_inference,[],[3,1,2,4,5]), % 0.56/0.63 ['proof']). % 0.56/0.63 % SZS output end Proof % 0.56/0.63 % Total time :0.000000s %------------------------------------------------------------------------------