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

View Problem - Process Solution

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

% Computer : n009.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:48 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : difference(X1,product(X1,X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos01) ).

fof(f2,axiom,
    ! [X0,X1] : product(X1,difference(X1,X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos02) ).

fof(f3,axiom,
    ! [X0,X1] : quotient(product(X1,X0),X0) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos03) ).

fof(f4,axiom,
    ! [X0,X1] : product(quotient(X1,X0),X0) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos04) ).

fof(f5,axiom,
    ! [X2,X3,X0,X1] : product(product(X1,X0),product(X3,X2)) = product(product(X1,X3),product(X0,X2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos05) ).

fof(f6,axiom,
    ! [X1] : product(X1,X1) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos06) ).

fof(f7,axiom,
    ! [X0,X1] : product(product(product(X1,X0),X0),product(X0,product(X0,X1))) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos07) ).

fof(f8,axiom,
    ! [X4,X5,X6] :
      ( d(X4,X5,X6)
    <=> product(X4,X5) = product(X5,X6) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos08) ).

fof(f9,axiom,
    ! [X7,X8,X9] :
      ( m(X7,X8,X9)
    <=> product(product(X7,X8),product(X8,X9)) = product(X7,X9) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos09) ).

fof(f10,axiom,
    d(a1,b,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos10) ).

fof(f11,axiom,
    d(a,b1,c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos11) ).

fof(f12,axiom,
    d(a,b,c1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos12) ).

fof(f13,axiom,
    d(a2,b1,c1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos13) ).

fof(f14,axiom,
    d(a1,b2,c1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos14) ).

fof(f15,axiom,
    d(a1,b1,c2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos15) ).

fof(f16,conjecture,
    m(b1,b,b2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f17,negated_conjecture,
    ~ m(b1,b,b2),
    inference(negated_conjecture,[],[f16]) ).

fof(f18,plain,
    ! [X0,X1,X2,X3] : product(product(X3,X2),product(X1,X0)) = product(product(X3,X1),product(X2,X0)),
    inference(rectify,[],[f5]) ).

fof(f19,plain,
    ! [X0] : product(X0,X0) = X0,
    inference(rectify,[],[f6]) ).

fof(f20,plain,
    ! [X0,X1,X2] :
      ( d(X0,X1,X2)
    <=> product(X0,X1) = product(X1,X2) ),
    inference(rectify,[],[f8]) ).

fof(f21,plain,
    ! [X0,X1,X2] :
      ( m(X0,X1,X2)
    <=> product(X0,X2) = product(product(X0,X1),product(X1,X2)) ),
    inference(rectify,[],[f9]) ).

fof(f22,plain,
    ~ m(b1,b,b2),
    inference(flattening,[],[f17]) ).

fof(f23,plain,
    ! [X0,X1,X2] :
      ( product(X0,X2) = product(product(X0,X1),product(X1,X2))
     => m(X0,X1,X2) ),
    inference(unused_predicate_definition_removal,[],[f21]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( d(X0,X1,X2)
     => product(X0,X1) = product(X1,X2) ),
    inference(unused_predicate_definition_removal,[],[f20]) ).

fof(f25,plain,
    ! [X0,X1,X2] :
      ( product(X0,X1) = product(X1,X2)
      | ~ d(X0,X1,X2) ),
    inference(ennf_transformation,[],[f24]) ).

fof(f26,plain,
    ! [X0,X1,X2] :
      ( m(X0,X1,X2)
      | product(X0,X2) != product(product(X0,X1),product(X1,X2)) ),
    inference(ennf_transformation,[],[f23]) ).

fof(f27,plain,
    ! [X0,X1] : difference(X1,product(X1,X0)) = X0,
    inference(cnf_transformation,[],[f1]) ).

fof(f28,plain,
    ! [X0,X1] : product(X1,difference(X1,X0)) = X0,
    inference(cnf_transformation,[],[f2]) ).

fof(f29,plain,
    ! [X0,X1] : quotient(product(X1,X0),X0) = X1,
    inference(cnf_transformation,[],[f3]) ).

fof(f30,plain,
    ! [X0,X1] : product(quotient(X1,X0),X0) = X1,
    inference(cnf_transformation,[],[f4]) ).

fof(f31,plain,
    ! [X2,X3,X0,X1] : product(product(X3,X2),product(X1,X0)) = product(product(X3,X1),product(X2,X0)),
    inference(cnf_transformation,[],[f18]) ).

fof(f32,plain,
    ! [X0] : product(X0,X0) = X0,
    inference(cnf_transformation,[],[f19]) ).

fof(f33,plain,
    ! [X0,X1] : product(product(product(X1,X0),X0),product(X0,product(X0,X1))) = X0,
    inference(cnf_transformation,[],[f7]) ).

fof(f34,plain,
    ! [X2,X0,X1] :
      ( product(X0,X1) = product(X1,X2)
      | ~ d(X0,X1,X2) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f35,plain,
    ! [X2,X0,X1] :
      ( m(X0,X1,X2)
      | product(X0,X2) != product(product(X0,X1),product(X1,X2)) ),
    inference(cnf_transformation,[],[f26]) ).

fof(f36,plain,
    d(a1,b,c),
    inference(cnf_transformation,[],[f10]) ).

fof(f37,plain,
    d(a,b1,c),
    inference(cnf_transformation,[],[f11]) ).

fof(f38,plain,
    d(a,b,c1),
    inference(cnf_transformation,[],[f12]) ).

fof(f39,plain,
    d(a2,b1,c1),
    inference(cnf_transformation,[],[f13]) ).

fof(f40,plain,
    d(a1,b2,c1),
    inference(cnf_transformation,[],[f14]) ).

fof(f41,plain,
    d(a1,b1,c2),
    inference(cnf_transformation,[],[f15]) ).

fof(f42,plain,
    ~ m(b1,b,b2),
    inference(cnf_transformation,[],[f22]) ).

cnf(c_49,plain,
    difference(X0,product(X0,X1)) = X1,
    inference(cnf_transformation,[],[f27]) ).

cnf(c_50,plain,
    product(X0,difference(X0,X1)) = X1,
    inference(cnf_transformation,[],[f28]) ).

cnf(c_51,plain,
    quotient(product(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f29]) ).

cnf(c_52,plain,
    product(quotient(X0,X1),X1) = X0,
    inference(cnf_transformation,[],[f30]) ).

cnf(c_53,plain,
    product(product(X0,X1),product(X2,X3)) = product(product(X0,X2),product(X1,X3)),
    inference(cnf_transformation,[],[f31]) ).

cnf(c_54,plain,
    product(X0,X0) = X0,
    inference(cnf_transformation,[],[f32]) ).

cnf(c_55,plain,
    product(product(product(X0,X1),X1),product(X1,product(X1,X0))) = X1,
    inference(cnf_transformation,[],[f33]) ).

cnf(c_56,plain,
    ( ~ d(X0,X1,X2)
    | product(X0,X1) = product(X1,X2) ),
    inference(cnf_transformation,[],[f34]) ).

cnf(c_57,plain,
    ( product(product(X0,X1),product(X1,X2)) != product(X0,X2)
    | m(X0,X1,X2) ),
    inference(cnf_transformation,[],[f35]) ).

cnf(c_58,plain,
    d(a1,b,c),
    inference(cnf_transformation,[],[f36]) ).

cnf(c_59,plain,
    d(a,b1,c),
    inference(cnf_transformation,[],[f37]) ).

cnf(c_60,plain,
    d(a,b,c1),
    inference(cnf_transformation,[],[f38]) ).

cnf(c_61,plain,
    d(a2,b1,c1),
    inference(cnf_transformation,[],[f39]) ).

cnf(c_62,plain,
    d(a1,b2,c1),
    inference(cnf_transformation,[],[f40]) ).

cnf(c_63,plain,
    d(a1,b1,c2),
    inference(cnf_transformation,[],[f41]) ).

cnf(c_64,negated_conjecture,
    ~ m(b1,b,b2),
    inference(cnf_transformation,[],[f42]) ).

cnf(c_111,plain,
    X0_1 = X0_1,
    theory(equality) ).

cnf(c_116,plain,
    ( X0 != X1
    | X2 != X3
    | X4 != X5
    | ~ d(X1,X3,X5)
    | d(X0,X2,X4) ),
    theory(equality) ).

cnf(c_117,plain,
    ( X0 != X1
    | X2 != X3
    | X4 != X5
    | ~ m(X1,X3,X5)
    | m(X0,X2,X4) ),
    theory(equality) ).

cnf(c_118,plain,
    ( product(product(X0,X1),product(X1,X2)) != product(X0,X2)
    | X0 != b1
    | X1 != b
    | X2 != b2 ),
    inference(resolution_lifted,[status(thm)],[c_57,c_64]) ).

cnf(c_119,plain,
    product(product(b1,b),product(b,b2)) != product(b1,b2),
    inference(unflattening,[status(thm)],[c_118]) ).

cnf(c_124,plain,
    ( X0 != a1
    | X1 != b
    | X2 != c
    | product(X0,X1) = product(X1,X2) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_58]) ).

cnf(c_125,plain,
    product(a1,b) = product(b,c),
    inference(unflattening,[status(thm)],[c_124]) ).

cnf(c_129,plain,
    ( X0 != a
    | X1 != b1
    | X2 != c
    | product(X0,X1) = product(X1,X2) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_59]) ).

cnf(c_130,plain,
    product(a,b1) = product(b1,c),
    inference(unflattening,[status(thm)],[c_129]) ).

cnf(c_134,plain,
    ( X0 != a
    | X1 != b
    | X2 != c1
    | product(X0,X1) = product(X1,X2) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_60]) ).

cnf(c_135,plain,
    product(a,b) = product(b,c1),
    inference(unflattening,[status(thm)],[c_134]) ).

cnf(c_139,plain,
    ( X0 != a2
    | X1 != b1
    | X2 != c1
    | product(X0,X1) = product(X1,X2) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_61]) ).

cnf(c_140,plain,
    product(a2,b1) = product(b1,c1),
    inference(unflattening,[status(thm)],[c_139]) ).

cnf(c_144,plain,
    ( X0 != a1
    | X1 != b2
    | X2 != c1
    | product(X0,X1) = product(X1,X2) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_62]) ).

cnf(c_145,plain,
    product(a1,b2) = product(b2,c1),
    inference(unflattening,[status(thm)],[c_144]) ).

cnf(c_149,plain,
    ( X0 != a1
    | X1 != b1
    | X2 != c2
    | product(X0,X1) = product(X1,X2) ),
    inference(resolution_lifted,[status(thm)],[c_56,c_63]) ).

cnf(c_150,plain,
    product(a1,b1) = product(b1,c2),
    inference(unflattening,[status(thm)],[c_149]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : GRP778+1 : TPTP v8.1.2. Released v4.1.0.
% 0.04/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Tue Aug 29 00:31:20 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  Running first-order theorem proving
% 0.20/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 261.66/34.88  % SZS status Started for theBenchmark.p
% 261.66/34.88  % SZS status CounterSatisfiable for theBenchmark.p
% 261.66/34.88  
% 261.66/34.88  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 261.66/34.88  
% 261.66/34.88  ------  iProver source info
% 261.66/34.88  
% 261.66/34.88  git: date: 2023-05-31 18:12:56 +0000
% 261.66/34.88  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 261.66/34.88  git: non_committed_changes: false
% 261.66/34.88  git: last_make_outside_of_git: false
% 261.66/34.88  
% 261.66/34.88  ------ Parsing...
% 261.66/34.88  ------ Clausification by vclausify_rel  & Parsing by iProver...
% 261.66/34.88  
% 261.66/34.88  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 3 0s  sf_e  pe_s  pe_e 
% 261.66/34.88  
% 261.66/34.88  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 261.66/34.88  
% 261.66/34.88  ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 261.66/34.88  ------ Proving...
% 261.66/34.88  ------ Problem Properties 
% 261.66/34.88  
% 261.66/34.88  
% 261.66/34.88  clauses                                 14
% 261.66/34.88  conjectures                             0
% 261.66/34.88  EPR                                     0
% 261.66/34.88  Horn                                    14
% 261.66/34.88  unary                                   14
% 261.66/34.88  binary                                  0
% 261.66/34.88  lits                                    14
% 261.66/34.88  lits eq                                 14
% 261.66/34.88  fd_pure                                 0
% 261.66/34.88  fd_pseudo                               0
% 261.66/34.88  fd_cond                                 0
% 261.66/34.88  fd_pseudo_cond                          0
% 261.66/34.88  AC symbols                              0
% 261.66/34.88  
% 261.66/34.88  ------ Input Options Time Limit: Unbounded
% 261.66/34.88  
% 261.66/34.88  
% 261.66/34.88  ------ 
% 261.66/34.88  Current options:
% 261.66/34.88  ------ 
% 261.66/34.88  
% 261.66/34.88  
% 261.66/34.88  
% 261.66/34.88  
% 261.66/34.88  ------ Proving...
% 261.66/34.88  
% 261.66/34.88  
% 261.66/34.88  % SZS status CounterSatisfiable for theBenchmark.p
% 261.66/34.88  
% 261.66/34.88  % SZS output start Saturation for theBenchmark.p
% See solution above
% 261.66/34.88  
% 262.04/34.89  
%------------------------------------------------------------------------------