TSTP Solution File: GRP302-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP302-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n005.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:59:13 EDT 2023

% Result   : Unsatisfiable 3.63s 1.22s
% Output   : CNFRefutation 3.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   19
% Syntax   : Number of clauses     :   72 (  31 unt;  21 nHn;  59 RR)
%            Number of literals    :  162 ( 142 equ;  81 neg)
%            Maximal clause size   :   11 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   46 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,negated_conjecture,
    multiply(sk_c8,sk_c7) = sk_c6,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_1) ).

cnf(c_50,negated_conjecture,
    ( inverse(sk_c8) = sk_c7
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_2) ).

cnf(c_51,negated_conjecture,
    ( inverse(sk_c1) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_3) ).

cnf(c_52,negated_conjecture,
    ( multiply(sk_c3,sk_c7) = sk_c8
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_4) ).

cnf(c_53,negated_conjecture,
    ( inverse(sk_c1) = sk_c8
    | inverse(sk_c5) = sk_c4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_5) ).

cnf(c_54,negated_conjecture,
    ( inverse(sk_c1) = sk_c8
    | inverse(sk_c4) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_6) ).

cnf(c_55,negated_conjecture,
    ( multiply(sk_c5,sk_c8) = sk_c4
    | inverse(sk_c1) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_7) ).

cnf(c_57,negated_conjecture,
    ( multiply(sk_c1,sk_c7) = sk_c8
    | inverse(sk_c3) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_9) ).

cnf(c_58,negated_conjecture,
    ( multiply(sk_c1,sk_c7) = sk_c8
    | multiply(sk_c3,sk_c7) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_10) ).

cnf(c_59,negated_conjecture,
    ( multiply(sk_c1,sk_c7) = sk_c8
    | inverse(sk_c5) = sk_c4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_11) ).

cnf(c_60,negated_conjecture,
    ( multiply(sk_c1,sk_c7) = sk_c8
    | inverse(sk_c4) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_12) ).

cnf(c_61,negated_conjecture,
    ( multiply(sk_c1,sk_c7) = sk_c8
    | multiply(sk_c5,sk_c8) = sk_c4 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_13) ).

cnf(c_62,negated_conjecture,
    ( multiply(sk_c2,sk_c8) = sk_c6
    | inverse(sk_c8) = sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).

cnf(c_68,negated_conjecture,
    ( inverse(sk_c8) = sk_c7
    | inverse(sk_c2) = sk_c8 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_20) ).

cnf(c_74,negated_conjecture,
    ( multiply(X0,sk_c7) != sk_c8
    | multiply(X1,sk_c8) != sk_c6
    | multiply(X2,sk_c7) != sk_c8
    | multiply(X3,sk_c8) != X4
    | multiply(sk_c8,sk_c7) != sk_c6
    | inverse(X0) != sk_c8
    | inverse(X1) != sk_c8
    | inverse(X2) != sk_c8
    | inverse(X3) != X4
    | inverse(X4) != sk_c8
    | inverse(sk_c8) != sk_c7 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_26) ).

cnf(c_75,plain,
    multiply(identity,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_identity) ).

cnf(c_76,plain,
    multiply(inverse(X0),X0) = identity,
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',left_inverse) ).

cnf(c_77,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP004-0.ax',associativity) ).

cnf(c_78,negated_conjecture,
    ( inverse(multiply(X0,sk_c8)) != sk_c8
    | multiply(X1,sk_c7) != sk_c8
    | multiply(X2,sk_c8) != sk_c6
    | multiply(X3,sk_c7) != sk_c8
    | multiply(sk_c8,sk_c7) != sk_c6
    | inverse(X0) != multiply(X0,sk_c8)
    | inverse(X1) != sk_c8
    | inverse(X2) != sk_c8
    | inverse(X3) != sk_c8
    | inverse(sk_c8) != sk_c7 ),
    inference(unflattening,[status(thm)],[c_74]) ).

cnf(c_83,plain,
    ( multiply(X3,sk_c7) != sk_c8
    | multiply(X2,sk_c8) != sk_c6
    | multiply(X1,sk_c7) != sk_c8
    | inverse(multiply(X0,sk_c8)) != sk_c8
    | inverse(X0) != multiply(X0,sk_c8)
    | inverse(X1) != sk_c8
    | inverse(X2) != sk_c8
    | inverse(X3) != sk_c8
    | inverse(sk_c8) != sk_c7 ),
    inference(global_subsumption_just,[status(thm)],[c_78,c_49,c_78]) ).

cnf(c_84,negated_conjecture,
    ( inverse(multiply(X0,sk_c8)) != sk_c8
    | multiply(X1,sk_c7) != sk_c8
    | multiply(X2,sk_c8) != sk_c6
    | multiply(X3,sk_c7) != sk_c8
    | inverse(X0) != multiply(X0,sk_c8)
    | inverse(X1) != sk_c8
    | inverse(X2) != sk_c8
    | inverse(X3) != sk_c8
    | inverse(sk_c8) != sk_c7 ),
    inference(renaming,[status(thm)],[c_83]) ).

cnf(c_324,negated_conjecture,
    ( multiply(X0,sk_c8) != sk_c6
    | inverse(X0) != sk_c8
    | ~ sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_84]) ).

cnf(c_325,negated_conjecture,
    ( multiply(X0,sk_c7) != sk_c8
    | inverse(X0) != sk_c8
    | ~ sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_84]) ).

cnf(c_326,negated_conjecture,
    ( inverse(X0) != multiply(X0,sk_c8)
    | inverse(multiply(X0,sk_c8)) != sk_c8
    | ~ sP2_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_84]) ).

cnf(c_327,negated_conjecture,
    ( inverse(sk_c8) != sk_c7
    | sP0_iProver_split
    | sP1_iProver_split
    | sP2_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_84]) ).

cnf(c_329,plain,
    ( X0 != X1
    | X2 != X1
    | X2 = X0 ),
    theory(equality) ).

cnf(c_618,plain,
    ( multiply(sk_c3,multiply(sk_c7,X0)) = multiply(sk_c8,X0)
    | inverse(sk_c1) = sk_c8 ),
    inference(superposition,[status(thm)],[c_52,c_77]) ).

cnf(c_620,plain,
    ( multiply(sk_c5,multiply(sk_c8,X0)) = multiply(sk_c4,X0)
    | multiply(sk_c1,sk_c7) = sk_c8 ),
    inference(superposition,[status(thm)],[c_61,c_77]) ).

cnf(c_632,plain,
    multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
    inference(superposition,[status(thm)],[c_76,c_77]) ).

cnf(c_738,plain,
    ( inverse(inverse(sk_c8)) != sk_c8
    | sk_c6 != identity
    | ~ sP0_iProver_split ),
    inference(superposition,[status(thm)],[c_76,c_324]) ).

cnf(c_804,plain,
    ( inverse(sk_c3) != sk_c8
    | ~ sP1_iProver_split
    | multiply(sk_c1,sk_c7) = sk_c8 ),
    inference(superposition,[status(thm)],[c_58,c_325]) ).

cnf(c_806,plain,
    ( inverse(sk_c3) != sk_c8
    | ~ sP1_iProver_split
    | inverse(sk_c1) = sk_c8 ),
    inference(superposition,[status(thm)],[c_52,c_325]) ).

cnf(c_871,plain,
    ( multiply(sk_c5,sk_c8) != inverse(sk_c5)
    | inverse(sk_c4) != sk_c8
    | ~ sP2_iProver_split
    | multiply(sk_c1,sk_c7) = sk_c8 ),
    inference(superposition,[status(thm)],[c_61,c_326]) ).

cnf(c_873,plain,
    ( multiply(sk_c5,sk_c8) != inverse(sk_c5)
    | inverse(sk_c4) != sk_c8
    | ~ sP2_iProver_split
    | inverse(sk_c1) = sk_c8 ),
    inference(superposition,[status(thm)],[c_55,c_326]) ).

cnf(c_994,plain,
    multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(demodulation,[status(thm)],[c_632,c_75]) ).

cnf(c_1003,plain,
    multiply(inverse(sk_c8),sk_c6) = sk_c7,
    inference(superposition,[status(thm)],[c_49,c_994]) ).

cnf(c_1021,plain,
    multiply(inverse(inverse(X0)),identity) = X0,
    inference(superposition,[status(thm)],[c_76,c_994]) ).

cnf(c_1033,plain,
    multiply(inverse(inverse(X0)),X1) = multiply(X0,X1),
    inference(superposition,[status(thm)],[c_994,c_994]) ).

cnf(c_1192,plain,
    multiply(X0,identity) = X0,
    inference(demodulation,[status(thm)],[c_1021,c_1033]) ).

cnf(c_1237,plain,
    multiply(X0,inverse(X0)) = identity,
    inference(superposition,[status(thm)],[c_1033,c_76]) ).

cnf(c_1243,plain,
    multiply(X0,identity) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c_1033,c_1192]) ).

cnf(c_1244,plain,
    inverse(inverse(X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_1243,c_1192]) ).

cnf(c_1272,plain,
    inverse(inverse(sk_c8)) = sk_c8,
    inference(instantiation,[status(thm)],[c_1244]) ).

cnf(c_1307,plain,
    ( inverse(X0) != X1
    | X2 != X1
    | X2 = inverse(X0) ),
    inference(instantiation,[status(thm)],[c_329]) ).

cnf(c_1639,plain,
    ( multiply(sk_c2,sk_c8) = identity
    | inverse(sk_c8) = sk_c7 ),
    inference(superposition,[status(thm)],[c_68,c_1237]) ).

cnf(c_1973,plain,
    ( inverse(sk_c5) != sk_c4
    | X0 != sk_c4
    | X0 = inverse(sk_c5) ),
    inference(instantiation,[status(thm)],[c_1307]) ).

cnf(c_2406,plain,
    ( multiply(sk_c5,sk_c8) != sk_c4
    | inverse(sk_c5) != sk_c4
    | multiply(sk_c5,sk_c8) = inverse(sk_c5) ),
    inference(instantiation,[status(thm)],[c_1973]) ).

cnf(c_2614,plain,
    ( inverse(sk_c8) = sk_c7
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_1639,c_62]) ).

cnf(c_2674,plain,
    ( multiply(sk_c8,sk_c7) = identity
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_2614,c_1237]) ).

cnf(c_2685,plain,
    sk_c6 = identity,
    inference(light_normalisation,[status(thm)],[c_2674,c_49]) ).

cnf(c_2688,plain,
    multiply(inverse(sk_c8),identity) = sk_c7,
    inference(demodulation,[status(thm)],[c_1003,c_2685]) ).

cnf(c_2717,plain,
    inverse(sk_c1) = sk_c8,
    inference(global_subsumption_just,[status(thm)],[c_618,c_54,c_53,c_51,c_50,c_55,c_327,c_738,c_806,c_873,c_1272,c_2406,c_2685]) ).

cnf(c_2735,plain,
    inverse(sk_c8) = sk_c1,
    inference(superposition,[status(thm)],[c_2717,c_1244]) ).

cnf(c_2738,plain,
    multiply(sk_c8,sk_c1) = identity,
    inference(superposition,[status(thm)],[c_2717,c_76]) ).

cnf(c_2749,plain,
    ( sk_c7 != sk_c1
    | sP0_iProver_split
    | sP1_iProver_split
    | sP2_iProver_split ),
    inference(demodulation,[status(thm)],[c_327,c_2735]) ).

cnf(c_2770,plain,
    multiply(inverse(sk_c8),identity) = sk_c1,
    inference(superposition,[status(thm)],[c_2738,c_994]) ).

cnf(c_2772,plain,
    sk_c7 = sk_c1,
    inference(light_normalisation,[status(thm)],[c_2770,c_2688]) ).

cnf(c_2775,plain,
    inverse(sk_c7) = sk_c8,
    inference(demodulation,[status(thm)],[c_2717,c_2772]) ).

cnf(c_2932,plain,
    inverse(sk_c8) = sk_c7,
    inference(light_normalisation,[status(thm)],[c_2735,c_2772]) ).

cnf(c_2952,plain,
    ( sP1_iProver_split
    | sP2_iProver_split ),
    inference(global_subsumption_just,[status(thm)],[c_2749,c_738,c_1272,c_2685,c_2749,c_2772]) ).

cnf(c_3120,plain,
    multiply(sk_c1,sk_c7) = sk_c8,
    inference(global_subsumption_just,[status(thm)],[c_620,c_60,c_59,c_57,c_61,c_738,c_804,c_871,c_1272,c_2406,c_2685,c_2749,c_2772]) ).

cnf(c_3122,plain,
    multiply(sk_c7,sk_c7) = sk_c8,
    inference(light_normalisation,[status(thm)],[c_3120,c_2772]) ).

cnf(c_3123,plain,
    ( inverse(sk_c7) != sk_c8
    | ~ sP1_iProver_split ),
    inference(superposition,[status(thm)],[c_3122,c_325]) ).

cnf(c_3124,plain,
    multiply(inverse(sk_c7),sk_c8) = sk_c7,
    inference(superposition,[status(thm)],[c_3122,c_994]) ).

cnf(c_3127,plain,
    multiply(sk_c8,sk_c8) = sk_c7,
    inference(light_normalisation,[status(thm)],[c_3124,c_2775]) ).

cnf(c_3128,plain,
    ~ sP1_iProver_split,
    inference(forward_subsumption_resolution,[status(thm)],[c_3123,c_2775]) ).

cnf(c_3130,plain,
    sP2_iProver_split,
    inference(backward_subsumption_resolution,[status(thm)],[c_2952,c_3128]) ).

cnf(c_3131,plain,
    ( inverse(multiply(X0,sk_c8)) != sk_c8
    | multiply(X0,sk_c8) != inverse(X0) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_326,c_3130]) ).

cnf(c_3559,plain,
    ( multiply(sk_c8,sk_c8) != inverse(sk_c8)
    | inverse(sk_c7) != sk_c8 ),
    inference(superposition,[status(thm)],[c_3127,c_3131]) ).

cnf(c_3562,plain,
    ( inverse(sk_c7) != sk_c8
    | sk_c7 != sk_c7 ),
    inference(light_normalisation,[status(thm)],[c_3559,c_2932,c_3127]) ).

cnf(c_3563,plain,
    inverse(sk_c7) != sk_c8,
    inference(equality_resolution_simp,[status(thm)],[c_3562]) ).

cnf(c_3564,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3563,c_2775]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP302-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.13  % Command  : run_iprover %s %d THM
% 0.12/0.34  % Computer : n005.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit : 300
% 0.12/0.35  % WCLimit  : 300
% 0.12/0.35  % DateTime : Mon Aug 28 21:03:23 EDT 2023
% 0.12/0.35  % CPUTime  : 
% 0.19/0.49  Running first-order theorem proving
% 0.19/0.49  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.63/1.22  % SZS status Started for theBenchmark.p
% 3.63/1.22  % SZS status Unsatisfiable for theBenchmark.p
% 3.63/1.22  
% 3.63/1.22  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.63/1.22  
% 3.63/1.22  ------  iProver source info
% 3.63/1.22  
% 3.63/1.22  git: date: 2023-05-31 18:12:56 +0000
% 3.63/1.22  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.63/1.22  git: non_committed_changes: false
% 3.63/1.22  git: last_make_outside_of_git: false
% 3.63/1.22  
% 3.63/1.22  ------ Parsing...successful
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.63/1.22  
% 3.63/1.22  ------ Preprocessing... gs_s  sp: 4 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.63/1.22  
% 3.63/1.22  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.63/1.22  ------ Proving...
% 3.63/1.22  ------ Problem Properties 
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  clauses                                 32
% 3.63/1.22  conjectures                             29
% 3.63/1.22  EPR                                     0
% 3.63/1.22  Horn                                    7
% 3.63/1.22  unary                                   4
% 3.63/1.22  binary                                  24
% 3.63/1.22  lits                                    65
% 3.63/1.22  lits eq                                 59
% 3.63/1.22  fd_pure                                 0
% 3.63/1.22  fd_pseudo                               0
% 3.63/1.22  fd_cond                                 0
% 3.63/1.22  fd_pseudo_cond                          0
% 3.63/1.22  AC symbols                              0
% 3.63/1.22  
% 3.63/1.22  ------ Schedule dynamic 5 is on 
% 3.63/1.22  
% 3.63/1.22  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  ------ 
% 3.63/1.22  Current options:
% 3.63/1.22  ------ 
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  ------ Proving...
% 3.63/1.22  
% 3.63/1.22  
% 3.63/1.22  % SZS status Unsatisfiable for theBenchmark.p
% 3.63/1.22  
% 3.63/1.22  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.63/1.22  
% 3.63/1.23  
%------------------------------------------------------------------------------