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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : GRP112-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n032.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:57:33 EDT 2023

% Result   : Satisfiable 3.77s 1.05s
% Output   : Saturation 3.77s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    multiply(multiply(multiply(X0,X1),X2),multiply(X0,X2)) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

cnf(c_50,negated_conjecture,
    ( multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
    | multiply(a4,a4) != multiply(b4,b4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).

cnf(c_112,plain,
    multiply(multiply(X0,X1),multiply(multiply(multiply(X2,X0),X3),X1)) = multiply(X2,X3),
    inference(superposition,[status(thm)],[c_49,c_49]) ).

cnf(c_113,plain,
    multiply(X0,multiply(multiply(X1,X0),multiply(X1,X2))) = X2,
    inference(superposition,[status(thm)],[c_49,c_49]) ).

cnf(c_151,plain,
    multiply(multiply(X0,multiply(X1,X2)),X0) = multiply(X1,X2),
    inference(superposition,[status(thm)],[c_49,c_112]) ).

cnf(c_210,plain,
    multiply(multiply(X0,X1),X0) = X1,
    inference(superposition,[status(thm)],[c_49,c_151]) ).

cnf(c_227,plain,
    multiply(X0,multiply(multiply(X1,X0),X2)) = multiply(X1,X2),
    inference(superposition,[status(thm)],[c_49,c_210]) ).

cnf(c_230,plain,
    multiply(X0,multiply(X1,X0)) = X1,
    inference(superposition,[status(thm)],[c_210,c_210]) ).

cnf(c_234,plain,
    multiply(X0,multiply(X1,X1)) = X0,
    inference(superposition,[status(thm)],[c_210,c_49]) ).

cnf(c_241,plain,
    multiply(X0,multiply(X0,X1)) = X1,
    inference(demodulation,[status(thm)],[c_113,c_227]) ).

cnf(c_297,plain,
    multiply(X0,X0) = multiply(X1,X1),
    inference(superposition,[status(thm)],[c_234,c_210]) ).

cnf(c_301,plain,
    ( multiply(multiply(inverse(b2),b2),a2) != a2
    | multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
    | multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
    inference(backward_subsumption_resolution,[status(thm)],[c_50,c_297]) ).

cnf(c_310,plain,
    multiply(X0,X1) = multiply(X1,X0),
    inference(superposition,[status(thm)],[c_241,c_210]) ).

cnf(c_315,plain,
    multiply(X0,multiply(X1,multiply(X0,X2))) = multiply(X2,X1),
    inference(superposition,[status(thm)],[c_230,c_227]) ).

cnf(c_322,plain,
    multiply(multiply(X0,X1),X2) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[status(thm)],[c_227,c_241]) ).

cnf(c_373,plain,
    ( multiply(b2,multiply(a2,inverse(b2))) != a2
    | multiply(a3,multiply(b3,c3)) != multiply(b3,multiply(a3,c3))
    | multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)) ),
    inference(demodulation,[status(thm)],[c_301,c_310,c_322]) ).

cnf(c_390,plain,
    multiply(X0,multiply(X1,multiply(X2,X0))) = multiply(X2,X1),
    inference(superposition,[status(thm)],[c_310,c_315]) ).

cnf(c_396,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X2,X1)),
    inference(superposition,[status(thm)],[c_241,c_315]) ).

cnf(c_398,plain,
    multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X2,X0)),
    inference(superposition,[status(thm)],[c_315,c_241]) ).

cnf(c_407,plain,
    ( multiply(b2,multiply(a2,inverse(b2))) != a2
    | multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(c3,b3))
    | multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)) ),
    inference(demodulation,[status(thm)],[c_373,c_398]) ).

cnf(c_414,plain,
    ( multiply(b2,multiply(a2,inverse(b2))) != a2
    | multiply(a3,multiply(b3,c3)) != multiply(a3,multiply(b3,c3))
    | multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)) ),
    inference(demodulation,[status(thm)],[c_407,c_310]) ).

cnf(c_415,plain,
    ( multiply(b2,multiply(a2,inverse(b2))) != a2
    | multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)) ),
    inference(equality_resolution_simp,[status(thm)],[c_414]) ).

cnf(c_475,plain,
    multiply(X0,multiply(X1,X2)) = multiply(X1,multiply(X0,X2)),
    inference(superposition,[status(thm)],[c_396,c_310]) ).

cnf(c_605,plain,
    multiply(multiply(X0,X1),X2) = multiply(X0,multiply(X1,X2)),
    inference(superposition,[status(thm)],[c_398,c_310]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : GRP112-1 : TPTP v8.1.2. Released v1.0.0.
% 0.06/0.11  % Command  : run_iprover %s %d THM
% 0.11/0.31  % Computer : n032.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit : 300
% 0.11/0.31  % WCLimit  : 300
% 0.11/0.31  % DateTime : Mon Aug 28 21:48:01 EDT 2023
% 0.11/0.31  % CPUTime  : 
% 0.17/0.41  Running first-order theorem proving
% 0.17/0.41  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.77/1.05  % SZS status Started for theBenchmark.p
% 3.77/1.05  % SZS status Satisfiable for theBenchmark.p
% 3.77/1.05  
% 3.77/1.05  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.77/1.05  
% 3.77/1.05  ------  iProver source info
% 3.77/1.05  
% 3.77/1.05  git: date: 2023-05-31 18:12:56 +0000
% 3.77/1.05  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.77/1.05  git: non_committed_changes: false
% 3.77/1.05  git: last_make_outside_of_git: false
% 3.77/1.05  
% 3.77/1.05  ------ Parsing...successful
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 3.77/1.05  
% 3.77/1.05  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 3.77/1.05  
% 3.77/1.05  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 3.77/1.05  ------ Proving...
% 3.77/1.05  ------ Problem Properties 
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  clauses                                 2
% 3.77/1.05  conjectures                             1
% 3.77/1.05  EPR                                     0
% 3.77/1.05  Horn                                    2
% 3.77/1.05  unary                                   1
% 3.77/1.05  binary                                  0
% 3.77/1.05  lits                                    5
% 3.77/1.05  lits eq                                 5
% 3.77/1.05  fd_pure                                 0
% 3.77/1.05  fd_pseudo                               0
% 3.77/1.05  fd_cond                                 0
% 3.77/1.05  fd_pseudo_cond                          0
% 3.77/1.05  AC symbols                              0
% 3.77/1.05  
% 3.77/1.05  ------ Schedule dynamic 5 is on 
% 3.77/1.05  
% 3.77/1.05  ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  ------ 
% 3.77/1.05  Current options:
% 3.77/1.05  ------ 
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  ------ Proving...
% 3.77/1.05  
% 3.77/1.05  
% 3.77/1.05  % SZS status Satisfiable for theBenchmark.p
% 3.77/1.05  
% 3.77/1.05  % SZS output start Saturation for theBenchmark.p
% See solution above
% 3.77/1.05  
% 3.77/1.05  
%------------------------------------------------------------------------------