↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUM835+1 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n015.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Fri Sep 25 02:26:50 PM UTC 2026

% Result   : Theorem 1.33s 1.49s
% Output   : CNFRefutation 1.33s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f21ERROR: Could not build tree for root c_527ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f83,plain,
    ! [X0,X1] :
      ( ( ~ m(X1)
        | ? [X3] : X1 = vplus(X0,X3)
        | ? [X2] : X0 = vplus(X1,X2)
        | X0 = X1 )
      & ( ( ! [X3] : vplus(X0,X3) != X1
          & ! [X2] : vplus(X1,X2) != X0
          & X0 != X1 )
        | m(X1) ) ),
    inference(nnf_transformation,[],[f21]) ).

fof(f84,plain,
    ! [X0,X1] :
      ( ( ~ m(X1)
        | ? [X3] : X1 = vplus(X0,X3)
        | ? [X2] : X0 = vplus(X1,X2)
        | X0 = X1 )
      & ( ( ! [X3] : vplus(X0,X3) != X1
          & ! [X2] : vplus(X1,X2) != X0
          & X0 != X1 )
        | m(X1) ) ),
    inference(flattening,[],[f83]) ).

fof(f85,plain,
    ! [X0,X1] :
      ( ( ~ m(X1)
        | ? [X5] : vplus(X0,X5) = X1
        | ? [X4] : vplus(X1,X4) = X0
        | X0 = X1 )
      & ( ( ! [X3] : vplus(X0,X3) != X1
          & ! [X2] : vplus(X1,X2) != X0
          & X0 != X1 )
        | m(X1) ) ),
    inference(rectify,[],[f84]) ).

fof(f86,plain,
    ! [X0,X1] :
      ( ( ~ m(X1)
        | vplus(X0,sK2(X0,X1)) = X1
        | vplus(X1,sK1(X0,X1)) = X0
        | X0 = X1 )
      & ( ( ! [X3] : vplus(X0,X3) != X1
          & ! [X2] : vplus(X1,X2) != X0
          & X0 != X1 )
        | m(X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2]),skolemize(X4,sK1(X0,X1)),skolemize(X5,sK2(X0,X1))],[f85]) ).

fof(f87,plain,
    vd165 != vd151,
    inference(cnf_transformation,[],[f41]) ).

fof(f88,plain,
    ! [X1] : vd151 != vplus(vd165,X1),
    inference(cnf_transformation,[],[f41]) ).

fof(f89,plain,
    ! [X0] : vd165 != vplus(vd151,X0),
    inference(cnf_transformation,[],[f41]) ).

fof(f113,plain,
    ! [X0,X1] :
      ( ~ m(X1)
      | vplus(X0,sK2(X0,X1)) = X1
      | vplus(X1,sK1(X0,X1)) = X0
      | X0 = X1 ),
    inference(cnf_transformation,[],[f86]) ).

fof(f115,plain,
    ! [X2,X0,X1] :
      ( vplus(X1,X2) != X0
      | m(X1) ),
    inference(cnf_transformation,[],[f86]) ).

fof(f170,plain,
    ! [X1] : m(X1),
    inference(equality_resolution,[],[f115]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i] : vplus(vd151,X0) != vd165,
    inference(cnf_transformation,[],[f89]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i] : vplus(vd165,X0) != vd151,
    inference(cnf_transformation,[],[f88]) ).

tcf(c_51,negated_conjecture,
    vd165 != vd151,
    inference(cnf_transformation,[],[f87]) ).

tcf(c_69,plain,
    ! [X0: $i] : m(X0),
    inference(cnf_transformation,[],[f170]) ).

tcf(c_71,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ( vplus(X1,sK2(X1,X0)) = X0 )
      | ( vplus(X0,sK1(X1,X0)) = X1 )
      | ~ m(X0) ),
    inference(cnf_transformation,[],[f113]) ).

tcf(c_125,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ( vplus(X1,sK2(X1,X0)) = X0 )
      | ( vplus(X0,sK1(X1,X0)) = X1 ) ),
    inference(global_subsumption_just,[status(thm)],[c_71,c_69,c_71]) ).

tcf(c_246,negated_conjecture,
    vd165 != vd151,
    inference(demodulation,[status(thm)],[c_51]) ).

tcf(c_247,negated_conjecture,
    ! [X0: $i] : vplus(vd165,X0) != vd151,
    inference(demodulation,[status(thm)],[c_50]) ).

tcf(c_248,negated_conjecture,
    ! [X0: $i] : vplus(vd151,X0) != vd165,
    inference(demodulation,[status(thm)],[c_49]) ).

tcf(c_323,plain,
    ! [X0: $i] :
      ( ( X0 = vd151 )
      | ( vplus(X0,sK1(vd151,X0)) = vd151 )
      | ( X0 != vd165 ) ),
    inference(superposition,[status(thm)],[c_125,c_248]) ).

tcf(c_526,plain,
    ( ( vd165 = vd151 )
    | ( vplus(vd165,sK1(vd151,vd165)) = vd151 ) ),
    inference(equality_resolution,[status(thm)],[c_323]) ).

tcf(c_527,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_526,c_246,c_247]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM835+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.57  % Computer : n015.cluster.edu
% 0.08/0.57  % Model    : x86_64 x86_64
% 0.08/0.57  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.57  % Memory   : 8046.5625MB
% 0.08/0.57  % OS       : Linux 6.8.0-71-generic
% 0.08/0.57  % CPULimit : 300
% 0.08/0.57  % WCLimit  : 300
% 0.08/0.57  % DateTime : Thu Sep 24 05:35:41 UTC 2026
% 0.08/0.57  % CPUTime  : 
% 0.08/0.57  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.61  Running first-order theorem proving
% 0.08/0.61  Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.62  
% 0.08/0.62  % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.62  
% 0.08/0.62  % Detected problem language: tptp
% 0.14/0.64  % Proving...
% 1.33/1.49  % SZS status Started for theBenchmark.p
% 1.33/1.49  % SZS status Theorem for theBenchmark.p
% 1.33/1.49  
% 1.33/1.49  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.33/1.49  
% 1.33/1.49  % ------  iProver source info
% 1.33/1.49  
% 1.33/1.49  % git: date: 2026-07-19 20:42:38 +0200
% 1.33/1.49  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.33/1.49  % git: non_committed_changes: false
% 1.33/1.49  
% 1.33/1.49  % ------ Parsing...
% 1.33/1.49  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.33/1.49  
% 1.33/1.49  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 2 0s  sf_e  pe_s  pe_e  sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.33/1.49  
% 1.33/1.49  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.33/1.49  
% 1.33/1.49  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 1.33/1.49  % ------ Proving...
% 1.33/1.49  % ------ Problem Properties 
% 1.33/1.49  
% 1.33/1.49  % 
% 1.33/1.49  % clauses                               12
% 1.33/1.49  % conjectures                           3
% 1.33/1.49  % EPR                                   1
% 1.33/1.49  % Horn                                  9
% 1.33/1.49  % unary                                 8
% 1.33/1.49  % binary                                3
% 1.33/1.49  % lits                                  17
% 1.33/1.49  % lits eq                               17
% 1.33/1.49  % fd_pure                               0
% 1.33/1.49  % fd_pseudo                             0
% 1.33/1.49  % fd_cond                               0
% 1.33/1.49  % fd_pseudo_cond                        1
% 1.33/1.49  % AC symbols                            1
% 1.33/1.49  
% 1.33/1.49  % ------ Schedule dynamic 5 is on 
% 1.33/1.49  
% 1.33/1.49  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.33/1.49  
% 1.33/1.49  
% 1.33/1.49  % ------ 
% 1.33/1.49  % Current options:
% 1.33/1.49  % ------ 
% 1.33/1.49  
% 1.33/1.49  
% 1.33/1.49  % 
% 1.33/1.49  
% 1.33/1.49  % ------ Proving...
% 1.33/1.49  % 
% 1.33/1.49  
% 1.33/1.49  % SZS status Theorem for theBenchmark.p
% 1.33/1.49  
% 1.33/1.49  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.33/1.49  
% 1.33/1.49  
%------------------------------------------------------------------------------