%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : SYN089-1.002 : TPTP v8.2.0. Bugfixed v1.2.1. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % Computer : n024.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 19:04:32 EDT 2024 % Result : Unsatisfiable 0.53s 0.60s % Output : CNFRefutation 0.53s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYN089-1.002 : TPTP v8.2.0. Bugfixed v1.2.1. % 0.07/0.12 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s % 0.12/0.32 % Computer : n024.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % Memory : 8042.1875MB % 0.12/0.32 % 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 : Sun Jun 23 19:56:24 EDT 2024 % 0.12/0.33 % CPUTime : % 0.18/0.56 start to proof:theBenchmark % 0.53/0.59 %------------------------------------------- % 0.53/0.59 % File :CSE---1.7 % 0.53/0.59 % Problem :theBenchmark % 0.53/0.59 % Transform :cnf % 0.53/0.59 % Format :tptp:raw % 0.53/0.59 % Command :java -jar mcs_scs.jar %d %s % 0.53/0.59 % 0.53/0.59 % Result :Theorem 0.000000s % 0.53/0.59 % Output :CNFRefutation 0.000000s % 0.53/0.59 %------------------------------------------- % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 % File : SYN089-1.002 : TPTP v8.2.0. Bugfixed v1.2.1. % 0.53/0.60 % Domain : Syntactic % 0.53/0.60 % Problem : Plaisted problem t(2,2) % 0.53/0.60 % Version : Biased. % 0.53/0.60 % English : % 0.53/0.60 % 0.53/0.60 % Refs : [Pla94] Plaisted (1994), The Search Efficiency of Theorem Prov % 0.53/0.60 % Source : [Pla94] % 0.53/0.60 % Names : T2n [Pla94] % 0.53/0.60 % 0.53/0.60 % Status : Unsatisfiable % 0.53/0.60 % Rating : 0.33 v5.5.0, 0.00 v2.1.0 % 0.53/0.60 % Syntax : Number of clauses : 13 ( 5 unt; 0 nHn; 13 RR) % 0.53/0.60 % Number of literals : 25 ( 0 equ; 13 neg) % 0.53/0.60 % Maximal clause size : 3 ( 1 avg) % 0.53/0.60 % Maximal term depth : 0 ( 0 avg) % 0.53/0.60 % Number of predicates : 6 ( 6 usr; 6 prp; 0-0 aty) % 0.53/0.60 % Number of functors : 0 ( 0 usr; 0 con; --- aty) % 0.53/0.60 % Number of variables : 0 ( 0 sgn) % 0.53/0.60 % SPC : CNF_UNS_PRP % 0.53/0.60 % 0.53/0.60 % Comments : Biased away from various calculi. % 0.53/0.60 % : tptp2X: -f tptp -s2 SYN089-1.g % 0.53/0.60 % Bugfixes : v1.2.0 - Bugfix in SYN086-1. % 0.53/0.60 % : v1.2.1 - Bugfix in SYN086-1. % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 cnf(s2_goal_1,negated_conjecture, % 0.53/0.60 ~ p_1_2 ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type11_1,axiom, % 0.53/0.60 ( p_1_2 % 0.53/0.60 | ~ p_2_2 % 0.53/0.60 | ~ p_1_1 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type11_2,axiom, % 0.53/0.60 ( p_1_2 % 0.53/0.60 | ~ q_2_2 % 0.53/0.60 | ~ q_1_1 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type12_1,axiom, % 0.53/0.60 ( q_1_2 % 0.53/0.60 | ~ p_2_2 % 0.53/0.60 | ~ q_1_1 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type12_2,axiom, % 0.53/0.60 ( q_1_2 % 0.53/0.60 | ~ q_2_2 % 0.53/0.60 | ~ p_1_1 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type21_1,axiom, % 0.53/0.60 ( p_1_1 % 0.53/0.60 | ~ p_1_2 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type21_2,axiom, % 0.53/0.60 ( q_1_1 % 0.53/0.60 | ~ q_1_2 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type22_1,axiom, % 0.53/0.60 ( p_2_2 % 0.53/0.60 | ~ p_1_2 ) ). % 0.53/0.60 % 0.53/0.60 cnf(s2_type22_2,axiom, % 0.53/0.60 ( q_2_2 % 0.53/0.60 | ~ q_1_2 ) ). % 0.53/0.60 % 0.53/0.60 cnf(t2_1,axiom, % 0.53/0.60 p_1_1 ). % 0.53/0.60 % 0.53/0.60 cnf(t2_2,axiom, % 0.53/0.60 q_1_1 ). % 0.53/0.60 % 0.53/0.60 cnf(t2_3,axiom, % 0.53/0.60 p_2_2 ). % 0.53/0.60 % 0.53/0.60 cnf(t2_4,axiom, % 0.53/0.60 q_2_2 ). % 0.53/0.60 % 0.53/0.60 %-------------------------------------------------------------------------- % 0.53/0.60 %------------------------------------------- % 0.53/0.60 % Proof found % 0.53/0.60 % SZS status Theorem for theBenchmark % 0.53/0.60 % SZS output start Proof % 0.53/0.60 %ClaNum:13(EqnAxiom:0) % 0.53/0.60 %VarNum:0(SingletonVarNum:0) % 0.53/0.60 %MaxLitNum:3 % 0.53/0.60 %MaxfuncDepth:0 % 0.53/0.60 %SharedTerms:13 % 0.53/0.60 %goalClause: 5 % 0.53/0.60 %singleGoalClaCount:1 % 0.53/0.60 [1]P1(a5000) % 0.53/0.60 [2]P2(a5000) % 0.53/0.60 [3]P4(a5000) % 0.53/0.60 [4]P5(a5000) % 0.53/0.60 [5]~P3(a5000) % 0.53/0.60 [10]P3(a5000)+~P1(a5000)+~P2(a5000) % 0.53/0.60 [11]P3(a5000)+~P4(a5000)+~P5(a5000) % 0.53/0.60 [12]P6(a5000)+~P1(a5000)+~P5(a5000) % 0.53/0.60 [13]P6(a5000)+~P2(a5000)+~P4(a5000) % 0.53/0.60 %EqnAxiom % 0.53/0.60 % 0.53/0.60 %------------------------------------------- % 0.53/0.60 cnf(14,plain, % 0.53/0.60 ($false), % 0.53/0.60 inference(scs_inference,[],[5,1,2,10]), % 0.53/0.60 ['proof']). % 0.53/0.60 % SZS output end Proof % 0.53/0.60 % Total time :0.000000s %------------------------------------------------------------------------------