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

View Problem - Process Solution

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

% Computer : n026.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:10 EDT 2023

% Result   : Unsatisfiable 3.52s 1.15s
% Output   : CNFRefutation 4.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   48 (  18 unt;  14 nHn;  37 RR)
%            Number of literals    :  104 (  79 equ;  56 neg)
%            Maximal clause size   :    9 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   4 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   27 (   1 sgn)

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

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

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

cnf(c_62,negated_conjecture,
    ( multiply(sk_c3,sk_c4) = sk_c6
    | multiply(sk_c2,sk_c5) = sk_c6 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_14) ).

cnf(c_66,negated_conjecture,
    ( multiply(sk_c3,sk_c4) = sk_c6
    | inverse(sk_c2) = sk_c5 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_18) ).

cnf(c_69,negated_conjecture,
    ( multiply(X0,X1) != sk_c6
    | multiply(X1,sk_c5) != sk_c6
    | multiply(X2,sk_c7) != sk_c6
    | multiply(X3,sk_c5) != sk_c6
    | multiply(sk_c7,sk_c6) != sk_c5
    | multiply(sk_c5,sk_c6) != sk_c7
    | inverse(X0) != X1
    | inverse(X2) != sk_c7
    | inverse(X3) != sk_c5 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this_21) ).

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

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

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

cnf(c_73,negated_conjecture,
    ( multiply(X0,inverse(X0)) != sk_c6
    | multiply(inverse(X0),sk_c5) != sk_c6
    | multiply(X1,sk_c7) != sk_c6
    | multiply(X2,sk_c5) != sk_c6
    | multiply(sk_c7,sk_c6) != sk_c5
    | multiply(sk_c5,sk_c6) != sk_c7
    | inverse(X1) != sk_c7
    | inverse(X2) != sk_c5 ),
    inference(unflattening,[status(thm)],[c_69]) ).

cnf(c_278,negated_conjecture,
    ( multiply(X0,sk_c7) != sk_c6
    | inverse(X0) != sk_c7
    | ~ sP0_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP0_iProver_split])],[c_73]) ).

cnf(c_279,negated_conjecture,
    ( multiply(X0,sk_c5) != sk_c6
    | inverse(X0) != sk_c5
    | ~ sP1_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP1_iProver_split])],[c_73]) ).

cnf(c_280,negated_conjecture,
    ( multiply(X0,inverse(X0)) != sk_c6
    | multiply(inverse(X0),sk_c5) != sk_c6
    | ~ sP2_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[sP2_iProver_split])],[c_73]) ).

cnf(c_281,negated_conjecture,
    ( multiply(sk_c7,sk_c6) != sk_c5
    | multiply(sk_c5,sk_c6) != sk_c7
    | sP0_iProver_split
    | sP1_iProver_split
    | sP2_iProver_split ),
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_73]) ).

cnf(c_527,plain,
    ( inverse(inverse(sk_c7)) != sk_c7
    | sk_c6 != identity
    | ~ sP0_iProver_split ),
    inference(superposition,[status(thm)],[c_71,c_278]) ).

cnf(c_565,plain,
    multiply(inverse(X0),multiply(X0,X1)) = multiply(identity,X1),
    inference(superposition,[status(thm)],[c_71,c_72]) ).

cnf(c_647,plain,
    multiply(inverse(X0),multiply(X0,X1)) = X1,
    inference(demodulation,[status(thm)],[c_565,c_70]) ).

cnf(c_669,plain,
    multiply(inverse(inverse(X0)),identity) = X0,
    inference(superposition,[status(thm)],[c_71,c_647]) ).

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

cnf(c_775,plain,
    multiply(X0,identity) = X0,
    inference(demodulation,[status(thm)],[c_669,c_673]) ).

cnf(c_804,plain,
    multiply(X0,inverse(X0)) = identity,
    inference(superposition,[status(thm)],[c_673,c_71]) ).

cnf(c_806,plain,
    multiply(X0,identity) = inverse(inverse(X0)),
    inference(superposition,[status(thm)],[c_673,c_775]) ).

cnf(c_807,plain,
    inverse(inverse(X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_806,c_775]) ).

cnf(c_859,plain,
    ( inverse(inverse(sk_c5)) != sk_c5
    | sk_c6 != identity
    | ~ sP1_iProver_split ),
    inference(superposition,[status(thm)],[c_71,c_279]) ).

cnf(c_874,plain,
    ( sk_c6 != identity
    | ~ sP1_iProver_split ),
    inference(forward_subsumption_resolution,[status(thm)],[c_859,c_807]) ).

cnf(c_925,plain,
    ( multiply(inverse(X0),sk_c5) != sk_c6
    | sk_c6 != identity
    | ~ sP2_iProver_split ),
    inference(light_normalisation,[status(thm)],[c_280,c_804]) ).

cnf(c_932,plain,
    ( sk_c6 != identity
    | ~ sP2_iProver_split ),
    inference(superposition,[status(thm)],[c_71,c_925]) ).

cnf(c_1188,plain,
    ( multiply(sk_c1,sk_c7) = identity
    | inverse(sk_c3) = sk_c4 ),
    inference(superposition,[status(thm)],[c_59,c_804]) ).

cnf(c_1337,plain,
    ( inverse(sk_c3) = sk_c4
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_1188,c_55]) ).

cnf(c_1425,plain,
    ( multiply(sk_c3,sk_c4) = identity
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_1337,c_804]) ).

cnf(c_2417,plain,
    ( inverse(sk_c2) = sk_c5
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_1425,c_66]) ).

cnf(c_2436,plain,
    ( multiply(sk_c2,sk_c5) = identity
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_2417,c_804]) ).

cnf(c_3716,plain,
    ( multiply(sk_c3,sk_c4) = sk_c6
    | sk_c6 = identity ),
    inference(superposition,[status(thm)],[c_2436,c_62]) ).

cnf(c_3816,plain,
    sk_c6 = identity,
    inference(superposition,[status(thm)],[c_3716,c_1425]) ).

cnf(c_3819,plain,
    ~ sP2_iProver_split,
    inference(backward_subsumption_resolution,[status(thm)],[c_932,c_3816]) ).

cnf(c_3820,plain,
    ~ sP1_iProver_split,
    inference(backward_subsumption_resolution,[status(thm)],[c_874,c_3816]) ).

cnf(c_3846,plain,
    ( multiply(sk_c7,identity) != sk_c5
    | multiply(sk_c5,identity) != sk_c7
    | sP0_iProver_split
    | sP1_iProver_split
    | sP2_iProver_split ),
    inference(demodulation,[status(thm)],[c_281,c_3816]) ).

cnf(c_3860,plain,
    ( multiply(sk_c7,identity) = sk_c5
    | multiply(sk_c5,identity) = sk_c7 ),
    inference(demodulation,[status(thm)],[c_49,c_3816]) ).

cnf(c_3902,plain,
    ( multiply(sk_c7,identity) != sk_c5
    | multiply(sk_c5,identity) != sk_c7
    | sP0_iProver_split ),
    inference(forward_subsumption_resolution,[status(thm)],[c_3846,c_3819,c_3820]) ).

cnf(c_4574,plain,
    sk_c7 = sk_c5,
    inference(demodulation,[status(thm)],[c_3860,c_775]) ).

cnf(c_4821,plain,
    ( inverse(inverse(sk_c7)) != sk_c7
    | ~ sP0_iProver_split ),
    inference(global_subsumption_just,[status(thm)],[c_527,c_527,c_3816]) ).

cnf(c_4823,plain,
    ( inverse(inverse(sk_c5)) != sk_c5
    | ~ sP0_iProver_split ),
    inference(light_normalisation,[status(thm)],[c_4821,c_4574]) ).

cnf(c_4824,plain,
    ( sk_c5 != sk_c5
    | ~ sP0_iProver_split ),
    inference(demodulation,[status(thm)],[c_4823,c_807]) ).

cnf(c_4825,plain,
    ~ sP0_iProver_split,
    inference(equality_resolution_simp,[status(thm)],[c_4824]) ).

cnf(c_6124,plain,
    ( multiply(sk_c5,identity) != sk_c5
    | sP0_iProver_split ),
    inference(light_normalisation,[status(thm)],[c_3902,c_4574]) ).

cnf(c_6125,plain,
    ( sk_c5 != sk_c5
    | sP0_iProver_split ),
    inference(demodulation,[status(thm)],[c_6124,c_775]) ).

cnf(c_6126,plain,
    sP0_iProver_split,
    inference(equality_resolution_simp,[status(thm)],[c_6125]) ).

cnf(c_6127,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_6126,c_4825]) ).


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