%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : GRP028-4 : TPTP v8.2.0. Released v2.6.0. % Transfm : none % Format : tptp:raw % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % Computer : n022.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 06:38:32 EDT 2024 % Result : Unsatisfiable 0.55s 0.65s % Output : CNFRefutation 0.55s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.04/0.12 % Problem : GRP028-4 : TPTP v8.2.0. Released v2.6.0. % 0.04/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.11/0.33 % Computer : n022.cluster.edu % 0.11/0.33 % Model : x86_64 x86_64 % 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.33 % Memory : 8042.1875MB % 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.33 % CPULimit : 300 % 0.11/0.33 % WCLimit : 300 % 0.11/0.33 % DateTime : Thu Jun 20 08:34:38 EDT 2024 % 0.11/0.33 % CPUTime : % 0.46/0.59 start to proof:theBenchmark % 0.55/0.65 %------------------------------------------- % 0.55/0.65 % File :CSE---1.7 % 0.55/0.65 % Problem :theBenchmark % 0.55/0.65 % Transform :cnf % 0.55/0.65 % Format :tptp:raw % 0.55/0.65 % Command :java -jar mcs_scs.jar %d %s % 0.55/0.65 % 0.55/0.65 % Result :Theorem 0.000000s % 0.55/0.65 % Output :CNFRefutation 0.000000s % 0.55/0.65 %------------------------------------------- % 0.55/0.65 %-------------------------------------------------------------------------- % 0.55/0.65 % File : GRP028-4 : TPTP v8.2.0. Released v2.6.0. % 0.55/0.65 % Domain : Group Theory (Semigroups) % 0.55/0.65 % Problem : In semigroups, left and right solutions => right id exists % 0.55/0.65 % Version : [CL73] axioms. % 0.55/0.65 % English : If there are left and right solutions, then there is a right % 0.55/0.65 % identity element. % 0.55/0.65 % 0.55/0.65 % Refs : [Cha70] Chang (1970), The Unit Proof and the Input Proof in Th % 0.55/0.65 % : [CL73] Chang & Lee (1973), Symbolic Logic and Mechanical Theo % 0.55/0.65 % Source : [CL73] % 0.55/0.65 % Names : Example 1 [CL73] % 0.55/0.65 % 0.55/0.65 % Status : Unsatisfiable % 0.55/0.65 % Rating : 0.00 v5.4.0, 0.06 v5.3.0, 0.10 v5.2.0, 0.00 v2.6.0 % 0.55/0.65 % Syntax : Number of clauses : 5 ( 3 unt; 0 nHn; 3 RR) % 0.55/0.65 % Number of literals : 11 ( 0 equ; 7 neg) % 0.55/0.65 % Maximal clause size : 4 ( 2 avg) % 0.55/0.65 % Maximal term depth : 2 ( 1 avg) % 0.55/0.65 % Number of predicates : 1 ( 1 usr; 0 prp; 3-3 aty) % 0.55/0.65 % Number of functors : 3 ( 3 usr; 0 con; 1-2 aty) % 0.55/0.65 % Number of variables : 17 ( 0 sgn) % 0.55/0.65 % SPC : CNF_UNS_RFO_NEQ_HRN % 0.55/0.65 % 0.55/0.65 % Comments : % 0.55/0.65 %-------------------------------------------------------------------------- % 0.55/0.65 cnf(associativity1,axiom, % 0.55/0.65 ( ~ product(X,Y,U) % 0.55/0.65 | ~ product(Y,Z,V) % 0.55/0.65 | ~ product(X,V,W) % 0.55/0.65 | product(U,Z,W) ) ). % 0.55/0.65 % 0.55/0.65 cnf(associativity2,axiom, % 0.55/0.65 ( ~ product(X,Y,U) % 0.55/0.65 | ~ product(Y,Z,V) % 0.55/0.65 | ~ product(U,Z,W) % 0.55/0.65 | product(X,V,W) ) ). % 0.55/0.65 % 0.55/0.65 cnf(left_soln,hypothesis, % 0.55/0.65 product(left_solution(X,Y),X,Y) ). % 0.55/0.65 % 0.55/0.65 cnf(right_soln,hypothesis, % 0.55/0.65 product(X,right_solution(X,Y),Y) ). % 0.55/0.65 % 0.55/0.65 %----There is an element for which no X is identity % 0.55/0.65 cnf(prove_there_is_a_right_identity,negated_conjecture, % 0.55/0.65 ~ product(not_identity(X),X,not_identity(X)) ). % 0.55/0.65 % 0.55/0.65 %-------------------------------------------------------------------------- % 0.55/0.65 %------------------------------------------- % 0.55/0.65 % Proof found % 0.55/0.65 % SZS status Theorem for theBenchmark % 0.55/0.65 % SZS output start Proof % 0.55/0.66 %ClaNum:5(EqnAxiom:0) % 0.55/0.66 %VarNum:35(SingletonVarNum:17) % 0.55/0.66 %MaxLitNum:4 % 0.55/0.66 %MaxfuncDepth:1 % 0.55/0.66 %SharedTerms:0 % 0.55/0.66 %goalClause: 3 % 0.55/0.66 %singleGoalClaCount:1 % 0.55/0.66 [3]~P1(f3(x31),x31,f3(x31)) % 0.55/0.66 [1]P1(x11,f1(x11,x12),x12) % 0.55/0.66 [2]P1(f2(x21,x22),x21,x22) % 0.55/0.66 [4]~P1(x46,x44,x41)+P1(x41,x42,x43)+~P1(x44,x42,x45)+~P1(x46,x45,x43) % 0.55/0.66 [5]~P1(x51,x56,x54)+P1(x51,x52,x53)+~P1(x54,x55,x53)+~P1(x56,x55,x52) % 0.55/0.66 %EqnAxiom % 0.55/0.66 % 0.55/0.66 %------------------------------------------- % 0.55/0.66 cnf(6,plain, % 0.55/0.66 (P1(f2(x61,x61),x62,x62)), % 0.55/0.66 inference(scs_inference,[],[1,2,5])). % 0.55/0.66 cnf(20,plain, % 0.55/0.66 (P1(f2(x201,x202),x201,x202)), % 0.55/0.66 inference(rename_variables,[],[2])). % 0.55/0.66 cnf(21,plain, % 0.55/0.66 (P1(f2(x211,x211),x212,x212)), % 0.55/0.66 inference(rename_variables,[],[6])). % 0.55/0.66 cnf(23,plain, % 0.55/0.66 ($false), % 0.55/0.66 inference(scs_inference,[],[2,20,3,6,21,1,5,4]), % 0.55/0.66 ['proof']). % 0.55/0.67 % SZS output end Proof % 0.55/0.67 % Total time :0.000000s %------------------------------------------------------------------------------