TSTP Solution File: GRP125-1.003 by CSE---1.6
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE---1.6
% Problem : GRP125-1.003 : TPTP v8.1.2. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% Computer : n031.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 : Thu Aug 31 00:11:04 EDT 2023
% Result : Unsatisfiable 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP125-1.003 : TPTP v8.1.2. Released v1.2.0.
% 0.13/0.13 % Command : java -jar /export/starexec/sandbox/solver/bin/mcs_scs.jar %s %d
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 23:55:25 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.55 start to proof:theBenchmark
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % File :CSE---1.6
% 0.20/0.61 % Problem :theBenchmark
% 0.20/0.61 % Transform :cnf
% 0.20/0.61 % Format :tptp:raw
% 0.20/0.61 % Command :java -jar mcs_scs.jar %d %s
% 0.20/0.61
% 0.20/0.61 % Result :Theorem 0.000000s
% 0.20/0.61 % Output :CNFRefutation 0.000000s
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 % File : GRP125-1.003 : TPTP v8.1.2. Released v1.2.0.
% 0.20/0.61 % Domain : Group Theory (Quasigroups)
% 0.20/0.61 % Problem : (a.b).(b.a) = a
% 0.20/0.61 % Version : [Sla93] axioms.
% 0.20/0.61 % English : Generate the multiplication table for the specified quasi-
% 0.20/0.61 % group with 3 elements.
% 0.20/0.61
% 0.20/0.61 % Refs : [FSB93] Fujita et al. (1993), Automatic Generation of Some Res
% 0.20/0.61 % : [Sla93] Slaney (1993), Email to G. Sutcliffe
% 0.20/0.61 % : [SFS95] Slaney et al. (1995), Automated Reasoning and Exhausti
% 0.20/0.61 % Source : [Sla93]
% 0.20/0.61 % Names : QG3 [Sla93]
% 0.20/0.61 % : QG3 [FSB93]
% 0.20/0.61 % : QG3 [SFS95]
% 0.20/0.61 % : Bennett QG3 [TPTP]
% 0.20/0.61
% 0.20/0.61 % Status : Unsatisfiable
% 0.20/0.61 % Rating : 0.00 v2.1.0
% 0.20/0.61 % Syntax : Number of clauses : 15 ( 10 unt; 1 nHn; 14 RR)
% 0.20/0.61 % Number of literals : 27 ( 0 equ; 16 neg)
% 0.20/0.61 % Maximal clause size : 5 ( 1 avg)
% 0.20/0.61 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.61 % Number of predicates : 3 ( 3 usr; 0 prp; 1-3 aty)
% 0.20/0.61 % Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% 0.20/0.61 % Number of variables : 19 ( 0 sgn)
% 0.20/0.61 % SPC : CNF_UNS_EPR_NEQ_NHN
% 0.20/0.61
% 0.20/0.61 % Comments : [SFS93]'s axiomatization has been modified for this.
% 0.20/0.61 % : Substitution axioms are not needed, as any positive equality
% 0.20/0.61 % literals should resolve on negative ones directly.
% 0.20/0.61 % : tptp2X: -f tptp -s3 GRP125-1.g
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 cnf(element_1,axiom,
% 0.20/0.61 group_element(e_1) ).
% 0.20/0.61
% 0.20/0.61 cnf(element_2,axiom,
% 0.20/0.61 group_element(e_2) ).
% 0.20/0.61
% 0.20/0.61 cnf(element_3,axiom,
% 0.20/0.61 group_element(e_3) ).
% 0.20/0.61
% 0.20/0.61 cnf(e_1_is_not_e_2,axiom,
% 0.20/0.61 ~ equalish(e_1,e_2) ).
% 0.20/0.61
% 0.20/0.61 cnf(e_1_is_not_e_3,axiom,
% 0.20/0.61 ~ equalish(e_1,e_3) ).
% 0.20/0.61
% 0.20/0.61 cnf(e_2_is_not_e_1,axiom,
% 0.20/0.61 ~ equalish(e_2,e_1) ).
% 0.20/0.61
% 0.20/0.61 cnf(e_2_is_not_e_3,axiom,
% 0.20/0.61 ~ equalish(e_2,e_3) ).
% 0.20/0.61
% 0.20/0.61 cnf(e_3_is_not_e_1,axiom,
% 0.20/0.61 ~ equalish(e_3,e_1) ).
% 0.20/0.61
% 0.20/0.61 cnf(e_3_is_not_e_2,axiom,
% 0.20/0.61 ~ equalish(e_3,e_2) ).
% 0.20/0.61
% 0.20/0.61 cnf(product_total_function1,axiom,
% 0.20/0.61 ( ~ group_element(X)
% 0.20/0.61 | ~ group_element(Y)
% 0.20/0.61 | product(X,Y,e_1)
% 0.20/0.61 | product(X,Y,e_2)
% 0.20/0.61 | product(X,Y,e_3) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(product_total_function2,axiom,
% 0.20/0.61 ( ~ product(X,Y,W)
% 0.20/0.61 | ~ product(X,Y,Z)
% 0.20/0.61 | equalish(W,Z) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(product_right_cancellation,axiom,
% 0.20/0.61 ( ~ product(X,W,Y)
% 0.20/0.61 | ~ product(X,Z,Y)
% 0.20/0.61 | equalish(W,Z) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(product_left_cancellation,axiom,
% 0.20/0.61 ( ~ product(W,Y,X)
% 0.20/0.61 | ~ product(Z,Y,X)
% 0.20/0.61 | equalish(W,Z) ) ).
% 0.20/0.61
% 0.20/0.61 cnf(product_idempotence,axiom,
% 0.20/0.61 product(X,X,X) ).
% 0.20/0.61
% 0.20/0.61 cnf(qg3,negated_conjecture,
% 0.20/0.61 ( ~ product(X,Y,Z1)
% 0.20/0.61 | ~ product(Y,X,Z2)
% 0.20/0.61 | product(Z1,Z2,X) ) ).
% 0.20/0.61
% 0.20/0.61 %--------------------------------------------------------------------------
% 0.20/0.61 %-------------------------------------------
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark
% 0.20/0.61 % SZS output start Proof
% 0.20/0.61 %ClaNum:15(EqnAxiom:0)
% 0.20/0.61 %VarNum:44(SingletonVarNum:19)
% 0.20/0.61 %MaxLitNum:5
% 0.20/0.61 %MaxfuncDepth:0
% 0.20/0.61 %SharedTerms:12
% 0.20/0.61 %goalClause: 15
% 0.20/0.61 [1]P1(a1)
% 0.20/0.61 [2]P1(a2)
% 0.20/0.61 [3]P1(a3)
% 0.20/0.61 [5]~P2(a1,a2)
% 0.20/0.61 [6]~P2(a1,a3)
% 0.20/0.61 [7]~P2(a2,a1)
% 0.20/0.61 [8]~P2(a2,a3)
% 0.20/0.61 [9]~P2(a3,a1)
% 0.20/0.61 [10]~P2(a3,a2)
% 0.20/0.61 [4]P3(x41,x41,x41)
% 0.20/0.61 [12]~P3(x123,x124,x121)+P2(x121,x122)+~P3(x123,x124,x122)
% 0.20/0.61 [13]~P3(x133,x131,x134)+P2(x131,x132)+~P3(x133,x132,x134)
% 0.20/0.61 [14]~P3(x141,x143,x144)+P2(x141,x142)+~P3(x142,x143,x144)
% 0.20/0.61 [15]~P3(x153,x154,x151)+P3(x151,x152,x153)+~P3(x154,x153,x152)
% 0.20/0.62 [11]~P1(x112)+~P1(x111)+P3(x111,x112,a2)+P3(x111,x112,a3)+P3(x111,x112,a1)
% 0.20/0.62 %EqnAxiom
% 0.20/0.62
% 0.20/0.62 %-------------------------------------------
% 0.20/0.62 cnf(18,plain,
% 0.20/0.62 (P3(x181,x181,x181)),
% 0.20/0.62 inference(rename_variables,[],[4])).
% 0.20/0.62 cnf(25,plain,
% 0.20/0.62 (P3(a1,a2,a3)+P3(a1,a2,a2)),
% 0.20/0.62 inference(scs_inference,[],[1,4,18,2,5,14,13,12,15,11])).
% 0.20/0.62 cnf(28,plain,
% 0.20/0.62 (P3(x281,x281,x281)),
% 0.20/0.62 inference(rename_variables,[],[4])).
% 0.20/0.62 cnf(31,plain,
% 0.20/0.62 (P3(x311,x311,x311)),
% 0.20/0.62 inference(rename_variables,[],[4])).
% 0.20/0.62 cnf(33,plain,
% 0.20/0.62 (~P3(a3,a3,a1)),
% 0.20/0.62 inference(scs_inference,[],[6,4,28,31,14,13,12])).
% 0.20/0.62 cnf(40,plain,
% 0.20/0.62 (~P3(a2,a1,a1)),
% 0.20/0.62 inference(scs_inference,[],[7,4,14])).
% 0.20/0.62 cnf(65,plain,
% 0.20/0.62 (P3(x651,x651,x651)),
% 0.20/0.62 inference(rename_variables,[],[4])).
% 0.20/0.62 cnf(70,plain,
% 0.20/0.62 (P3(a1,a2,a3)),
% 0.20/0.62 inference(scs_inference,[],[9,5,4,65,13,14,25])).
% 0.20/0.62 cnf(86,plain,
% 0.20/0.62 (P3(a2,a1,a2)),
% 0.20/0.62 inference(scs_inference,[],[4,33,70,40,2,1,13,15,11])).
% 0.20/0.62 cnf(90,plain,
% 0.20/0.62 ($false),
% 0.20/0.62 inference(scs_inference,[],[4,7,86,12,13]),
% 0.20/0.62 ['proof']).
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time :0.000000s
%------------------------------------------------------------------------------