TSTP Solution File: GRP674+1 by iProver---3.8

View Problem - Process Solution

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

% Computer : n022.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 01:01:20 EDT 2023

% Result   : CounterSatisfiable 283.32s 37.94s
% Output   : Saturation 283.32s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

fof(f2,axiom,
    ! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

fof(f3,axiom,
    ! [X0,X1] : mult(rd(X1,X0),X0) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f03) ).

fof(f4,axiom,
    ! [X0,X1] : rd(mult(X1,X0),X0) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f04) ).

fof(f5,axiom,
    ! [X1] : mult(X1,unit) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f05) ).

fof(f6,axiom,
    ! [X1] : mult(unit,X1) = X1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f06) ).

fof(f7,axiom,
    ! [X2,X0,X1] : mult(X1,mult(X0,mult(X2,X1))) = mult(mult(mult(X1,X0),X2),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f07) ).

fof(f8,axiom,
    ! [X2,X0,X1] : asoc(X1,X0,X2) = ld(mult(X1,mult(X0,X2)),mult(mult(X1,X0),X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f08) ).

fof(f9,axiom,
    mult(asoc(op_x,op_y,op_z),asoc(op_x,op_y,op_t)) = asoc(op_x,op_y,mult(op_z,op_t)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f09) ).

fof(f10,conjecture,
    ( mult(op_z,asoc(op_x,op_y,op_t)) = mult(asoc(op_x,op_y,op_t),op_z)
    & mult(op_t,asoc(op_x,op_y,op_z)) = mult(asoc(op_x,op_y,op_z),op_t) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f11,negated_conjecture,
    ~ ( mult(op_z,asoc(op_x,op_y,op_t)) = mult(asoc(op_x,op_y,op_t),op_z)
      & mult(op_t,asoc(op_x,op_y,op_z)) = mult(asoc(op_x,op_y,op_z),op_t) ),
    inference(negated_conjecture,[],[f10]) ).

fof(f12,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(rectify,[],[f5]) ).

fof(f13,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(rectify,[],[f6]) ).

fof(f14,plain,
    ! [X0,X1,X2] : mult(X2,mult(X1,mult(X0,X2))) = mult(mult(mult(X2,X1),X0),X2),
    inference(rectify,[],[f7]) ).

fof(f15,plain,
    ! [X0,X1,X2] : asoc(X2,X1,X0) = ld(mult(X2,mult(X1,X0)),mult(mult(X2,X1),X0)),
    inference(rectify,[],[f8]) ).

fof(f16,plain,
    ( mult(op_z,asoc(op_x,op_y,op_t)) != mult(asoc(op_x,op_y,op_t),op_z)
    | mult(op_t,asoc(op_x,op_y,op_z)) != mult(asoc(op_x,op_y,op_z),op_t) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f17,plain,
    ! [X0,X1] : mult(X1,ld(X1,X0)) = X0,
    inference(cnf_transformation,[],[f1]) ).

fof(f18,plain,
    ! [X0,X1] : ld(X1,mult(X1,X0)) = X0,
    inference(cnf_transformation,[],[f2]) ).

fof(f19,plain,
    ! [X0,X1] : mult(rd(X1,X0),X0) = X1,
    inference(cnf_transformation,[],[f3]) ).

fof(f20,plain,
    ! [X0,X1] : rd(mult(X1,X0),X0) = X1,
    inference(cnf_transformation,[],[f4]) ).

fof(f21,plain,
    ! [X0] : mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f12]) ).

fof(f22,plain,
    ! [X0] : mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f13]) ).

fof(f23,plain,
    ! [X2,X0,X1] : mult(X2,mult(X1,mult(X0,X2))) = mult(mult(mult(X2,X1),X0),X2),
    inference(cnf_transformation,[],[f14]) ).

fof(f24,plain,
    ! [X2,X0,X1] : asoc(X2,X1,X0) = ld(mult(X2,mult(X1,X0)),mult(mult(X2,X1),X0)),
    inference(cnf_transformation,[],[f15]) ).

fof(f25,plain,
    mult(asoc(op_x,op_y,op_z),asoc(op_x,op_y,op_t)) = asoc(op_x,op_y,mult(op_z,op_t)),
    inference(cnf_transformation,[],[f9]) ).

fof(f26,plain,
    ( mult(op_z,asoc(op_x,op_y,op_t)) != mult(asoc(op_x,op_y,op_t),op_z)
    | mult(op_t,asoc(op_x,op_y,op_z)) != mult(asoc(op_x,op_y,op_z),op_t) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f27,plain,
    mult(ld(mult(op_x,mult(op_y,op_z)),mult(mult(op_x,op_y),op_z)),ld(mult(op_x,mult(op_y,op_t)),mult(mult(op_x,op_y),op_t))) = ld(mult(op_x,mult(op_y,mult(op_z,op_t))),mult(mult(op_x,op_y),mult(op_z,op_t))),
    inference(definition_unfolding,[],[f25,f24,f24,f24]) ).

fof(f28,plain,
    ( mult(op_z,ld(mult(op_x,mult(op_y,op_t)),mult(mult(op_x,op_y),op_t))) != mult(ld(mult(op_x,mult(op_y,op_t)),mult(mult(op_x,op_y),op_t)),op_z)
    | mult(op_t,ld(mult(op_x,mult(op_y,op_z)),mult(mult(op_x,op_y),op_z))) != mult(ld(mult(op_x,mult(op_y,op_z)),mult(mult(op_x,op_y),op_z)),op_t) ),
    inference(definition_unfolding,[],[f26,f24,f24,f24,f24]) ).

cnf(c_49,plain,
    mult(X0,ld(X0,X1)) = X1,
    inference(cnf_transformation,[],[f17]) ).

cnf(c_50,plain,
    ld(X0,mult(X0,X1)) = X1,
    inference(cnf_transformation,[],[f18]) ).

cnf(c_51,plain,
    mult(rd(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f19]) ).

cnf(c_52,plain,
    rd(mult(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f20]) ).

cnf(c_53,plain,
    mult(X0,unit) = X0,
    inference(cnf_transformation,[],[f21]) ).

cnf(c_54,plain,
    mult(unit,X0) = X0,
    inference(cnf_transformation,[],[f22]) ).

cnf(c_55,plain,
    mult(mult(mult(X0,X1),X2),X0) = mult(X0,mult(X1,mult(X2,X0))),
    inference(cnf_transformation,[],[f23]) ).

cnf(c_56,plain,
    mult(ld(mult(op_x,mult(op_y,op_z)),mult(mult(op_x,op_y),op_z)),ld(mult(op_x,mult(op_y,op_t)),mult(mult(op_x,op_y),op_t))) = ld(mult(op_x,mult(op_y,mult(op_z,op_t))),mult(mult(op_x,op_y),mult(op_z,op_t))),
    inference(cnf_transformation,[],[f27]) ).

cnf(c_57,negated_conjecture,
    ( mult(ld(mult(op_x,mult(op_y,op_z)),mult(mult(op_x,op_y),op_z)),op_t) != mult(op_t,ld(mult(op_x,mult(op_y,op_z)),mult(mult(op_x,op_y),op_z)))
    | mult(ld(mult(op_x,mult(op_y,op_t)),mult(mult(op_x,op_y),op_t)),op_z) != mult(op_z,ld(mult(op_x,mult(op_y,op_t)),mult(mult(op_x,op_y),op_t))) ),
    inference(cnf_transformation,[],[f28]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : GRP674+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command  : run_iprover %s %d THM
% 0.13/0.35  % Computer : n022.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 300
% 0.13/0.35  % DateTime : Mon Aug 28 23:00:09 EDT 2023
% 0.13/0.36  % CPUTime  : 
% 0.21/0.51  Running first-order theorem proving
% 0.21/0.51  Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 283.32/37.94  % SZS status Started for theBenchmark.p
% 283.32/37.94  % SZS status CounterSatisfiable for theBenchmark.p
% 283.32/37.94  
% 283.32/37.94  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 283.32/37.94  
% 283.32/37.94  ------  iProver source info
% 283.32/37.94  
% 283.32/37.94  git: date: 2023-05-31 18:12:56 +0000
% 283.32/37.94  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 283.32/37.94  git: non_committed_changes: false
% 283.32/37.94  git: last_make_outside_of_git: false
% 283.32/37.94  
% 283.32/37.94  ------ Parsing...
% 283.32/37.94  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 283.32/37.94  
% 283.32/37.94  ------ Preprocessing... sup_sim: 0  sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 283.32/37.94  
% 283.32/37.94  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 283.32/37.94  
% 283.32/37.94  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 283.32/37.94  ------ Proving...
% 283.32/37.94  ------ Problem Properties 
% 283.32/37.94  
% 283.32/37.94  
% 283.32/37.94  clauses                                 9
% 283.32/37.94  conjectures                             1
% 283.32/37.94  EPR                                     0
% 283.32/37.94  Horn                                    9
% 283.32/37.94  unary                                   8
% 283.32/37.94  binary                                  1
% 283.32/37.94  lits                                    10
% 283.32/37.94  lits eq                                 10
% 283.32/37.94  fd_pure                                 0
% 283.32/37.94  fd_pseudo                               0
% 283.32/37.94  fd_cond                                 0
% 283.32/37.94  fd_pseudo_cond                          0
% 283.32/37.94  AC symbols                              0
% 283.32/37.94  
% 283.32/37.94  ------ Input Options Time Limit: Unbounded
% 283.32/37.94  
% 283.32/37.94  
% 283.32/37.94  ------ 
% 283.32/37.94  Current options:
% 283.32/37.94  ------ 
% 283.32/37.94  
% 283.32/37.94  
% 283.32/37.94  
% 283.32/37.94  
% 283.32/37.94  ------ Proving...
% 283.32/37.94  
% 283.32/37.94  
% 283.32/37.94  % SZS status CounterSatisfiable for theBenchmark.p
% 283.32/37.94  
% 283.32/37.94  % SZS output start Saturation for theBenchmark.p
% See solution above
% 283.32/37.95  
% 283.32/37.95  
%------------------------------------------------------------------------------