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

View Problem - Process Solution

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

% Computer : n023.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 14:08:29 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
cnf(c_49,plain,
    multiply(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',one_times_x) ).

cnf(c_50,plain,
    ( ~ positive_integer(X0)
    | add(X0,multiply(X1,X0)) = multiply(successor(X1),X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',times_by_adding) ).

cnf(c_51,plain,
    positive_integer(one),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',one) ).

cnf(c_52,plain,
    ( ~ positive_integer(X0)
    | positive_integer(successor(X0)) ),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-1.ax',next_integer) ).

cnf(c_53,plain,
    add(X0,X1) = add(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',commutativity_of_add) ).

cnf(c_54,plain,
    add(add(X0,X1),X2) = add(X0,add(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',associativity_of_add) ).

cnf(c_55,plain,
    negate(add(negate(add(X0,X1)),negate(add(X0,negate(X1))))) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/ROB001-0.ax',robbins_axiom) ).

cnf(c_86,plain,
    X0 = X0,
    theory(equality) ).

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

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

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

cnf(c_90,plain,
    ( X0 != X1
    | ~ positive_integer(X1)
    | positive_integer(X0) ),
    theory(equality) ).

cnf(c_91,plain,
    ( X0 != X1
    | X2 != X3
    | add(X0,X2) = add(X1,X3) ),
    theory(equality) ).

cnf(c_92,plain,
    ( X0 != X1
    | negate(X0) = negate(X1) ),
    theory(equality) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : ROB029-1 : TPTP v8.1.2. Released v2.5.0.
% 0.11/0.12  % Command  : run_iprover %s %d THM
% 0.12/0.33  % Computer : n023.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 300
% 0.12/0.33  % DateTime : Mon Aug 28 07:08:10 EDT 2023
% 0.12/0.33  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.44/0.60  WARNING - Could not infer the problem pformat. Setting FOF as default
% 0.46/1.16  % SZS status Started for theBenchmark.p
% 0.46/1.16  % SZS status Satisfiable for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.46/1.16  
% 0.46/1.16  ------  iProver source info
% 0.46/1.16  
% 0.46/1.16  git: date: 2023-05-31 18:12:56 +0000
% 0.46/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.46/1.16  git: non_committed_changes: false
% 0.46/1.16  git: last_make_outside_of_git: false
% 0.46/1.16  
% 0.46/1.16  ------ Parsing...successful
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 14 0s  sf_e  pe_s  pe_e  sf_s  rm: 7 0s  sf_e  pe_s  pe_e 
% 0.46/1.16  
% 0.46/1.16  ------ Preprocessing...------  preprocesses with Option_epr_horn
% 0.46/1.16   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.46/1.16  ------ Proving...
% 0.46/1.16  ------ Problem Properties 
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  clauses                                 0
% 0.46/1.16  conjectures                             0
% 0.46/1.16  EPR                                     0
% 0.46/1.16  Horn                                    0
% 0.46/1.16  unary                                   0
% 0.46/1.16  binary                                  0
% 0.46/1.16  lits                                    0
% 0.46/1.16  lits eq                                 0
% 0.46/1.16  fd_pure                                 0
% 0.46/1.16  fd_pseudo                               0
% 0.46/1.16  fd_cond                                 0
% 0.46/1.16  fd_pseudo_cond                          0
% 0.46/1.16  AC symbols                              0
% 0.46/1.16  
% 0.46/1.16  ------ Schedule EPR Horn non eq is on
% 0.46/1.16  
% 0.46/1.16  ------ no conjectures: strip conj schedule 
% 0.46/1.16  
% 0.46/1.16  ------ no equalities: superposition off 
% 0.46/1.16  
% 0.46/1.16  ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  
% 0.46/1.16  % SZS status Satisfiable for theBenchmark.p
% 0.46/1.16  
% 0.46/1.16  % SZS output start Saturation for theBenchmark.p
% See solution above
% 0.46/1.16  
% 0.46/1.16  
%------------------------------------------------------------------------------