%------------------------------------------------------------------------------ % File : CSE---1.7 % Problem : GRP549-1 : 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 : n020.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:39:55 EDT 2024 % Result : Unsatisfiable 0.60s 0.65s % Output : CNFRefutation 0.60s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.12 % Problem : GRP549-1 : TPTP v8.2.0. Released v2.6.0. % 0.08/0.12 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %d %s % 0.12/0.33 % Computer : n020.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 : Thu Jun 20 12:47:09 EDT 2024 % 0.12/0.33 % CPUTime : % 0.41/0.61 start to proof:theBenchmark % 0.60/0.64 %------------------------------------------- % 0.60/0.64 % File :CSE---1.7 % 0.60/0.64 % Problem :theBenchmark % 0.60/0.64 % Transform :cnf % 0.60/0.64 % Format :tptp:raw % 0.60/0.64 % Command :java -jar mcs_scs.jar %d %s % 0.60/0.64 % 0.60/0.64 % Result :Theorem 0.000000s % 0.60/0.64 % Output :CNFRefutation 0.000000s % 0.60/0.64 %------------------------------------------- % 0.60/0.64 %-------------------------------------------------------------------------- % 0.60/0.64 % File : GRP549-1 : TPTP v8.2.0. Released v2.6.0. % 0.60/0.64 % Domain : Group Theory (Abelian) % 0.60/0.64 % Problem : Axiom for Abelian group theory, in division and identity, part 1 % 0.60/0.65 % Version : [McC93] (equality) axioms. % 0.60/0.65 % English : % 0.60/0.65 % 0.60/0.65 % Refs : [McC93] McCune (1993), Single Axioms for Groups and Abelian Gr % 0.60/0.65 % Source : [TPTP] % 0.60/0.65 % Names : % 0.60/0.65 % 0.60/0.65 % Status : Unsatisfiable % 0.60/0.65 % Rating : 0.00 v8.1.0, 0.05 v7.5.0, 0.04 v7.4.0, 0.09 v7.3.0, 0.05 v7.1.0, 0.06 v7.0.0, 0.05 v6.4.0, 0.11 v6.3.0, 0.12 v6.2.0, 0.14 v6.1.0, 0.00 v2.6.0 % 0.60/0.65 % Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 1 RR) % 0.60/0.65 % Number of literals : 5 ( 5 equ; 1 neg) % 0.60/0.65 % Maximal clause size : 1 ( 1 avg) % 0.60/0.65 % Maximal term depth : 5 ( 2 avg) % 0.60/0.65 % Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty) % 0.60/0.65 % Number of functors : 6 ( 6 usr; 3 con; 0-2 aty) % 0.60/0.65 % Number of variables : 7 ( 0 sgn) % 0.60/0.65 % SPC : CNF_UNS_RFO_PEQ_UEQ % 0.60/0.65 % 0.60/0.65 % Comments : A UEQ part of GRP095-1 % 0.60/0.65 %-------------------------------------------------------------------------- % 0.60/0.65 cnf(single_axiom,axiom, % 0.60/0.65 divide(divide(identity,A),divide(divide(divide(B,A),C),B)) = C ). % 0.60/0.65 % 0.60/0.65 cnf(multiply,axiom, % 0.60/0.65 multiply(A,B) = divide(A,divide(identity,B)) ). % 0.60/0.65 % 0.60/0.65 cnf(inverse,axiom, % 0.60/0.65 inverse(A) = divide(identity,A) ). % 0.60/0.65 % 0.60/0.65 cnf(identity,axiom, % 0.60/0.65 identity = divide(A,A) ). % 0.60/0.65 % 0.60/0.65 cnf(prove_these_axioms_1,negated_conjecture, % 0.60/0.65 multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ). % 0.60/0.65 % 0.60/0.65 %-------------------------------------------------------------------------- % 0.60/0.65 %------------------------------------------- % 0.60/0.65 % Proof found % 0.60/0.65 % SZS status Theorem for theBenchmark % 0.60/0.65 % SZS output start Proof % 0.60/0.65 %ClaNum:8(EqnAxiom:5) % 0.60/0.65 %VarNum:8(SingletonVarNum:4) % 0.60/0.65 %MaxLitNum:1 % 0.60/0.65 %MaxfuncDepth:4 % 0.60/0.65 %SharedTerms:8 % 0.60/0.65 %goalClause: 8 % 0.60/0.65 %singleGoalClaCount:1 % 0.60/0.65 [8]~E(f1(f1(a4,a2),f1(a4,a2)),f1(f1(a4,a3),f1(a4,a3))) % 0.60/0.65 [6]E(f1(x61,x61),a4) % 0.60/0.65 [7]E(f1(f1(a4,x71),f1(f1(f1(x72,x71),x73),x72)),x73) % 0.60/0.65 %EqnAxiom % 0.60/0.65 [1]E(x11,x11) % 0.60/0.65 [2]E(x22,x21)+~E(x21,x22) % 0.60/0.65 [3]E(x31,x33)+~E(x31,x32)+~E(x32,x33) % 0.60/0.65 [4]~E(x41,x42)+E(f1(x41,x43),f1(x42,x43)) % 0.60/0.65 [5]~E(x51,x52)+E(f1(x53,x51),f1(x53,x52)) % 0.60/0.65 % 0.60/0.65 %------------------------------------------- % 0.60/0.65 cnf(9,plain, % 0.60/0.65 (E(a4,f1(x91,x91))), % 0.60/0.65 inference(scs_inference,[],[6,2])). % 0.60/0.65 cnf(10,plain, % 0.60/0.65 (E(f1(f1(a4,x101),f1(f1(f1(x102,x101),f1(x103,x103)),x102)),a4)), % 0.60/0.65 inference(scs_inference,[],[6,7,2,3])). % 0.60/0.65 cnf(13,plain, % 0.60/0.65 ($false), % 0.60/0.65 inference(scs_inference,[],[8,9,10,6,2,3]), % 0.60/0.65 ['proof']). % 0.60/0.65 % SZS output end Proof % 0.60/0.65 % Total time :0.000000s %------------------------------------------------------------------------------