↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n005.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 2.20s 1.27s
% Output   : CNFRefutation 2.20s
% Verified : 
% SZS Type : ERROR: Analysing output (Could not find formula named f2ERROR: Could not build tree for root c_345ERROR: MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
fof(f14,plain,
    ( less(vd203,vd204)
    & greater(vd203,vd204) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | ? [X2] : X0 = vplus(X1,X2) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ! [X2] : vplus(X1,X2) != X0
      | X0 != X1 ),
    inference(ennf_transformation,[],[f9]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | vplus(X1,sK0(X0,X1)) = X0 ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f15]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( ( ~ greater(X1,X0)
        | ? [X2] : X1 = vplus(X0,X2) )
      & ( ! [X2] : vplus(X0,X2) != X1
        | greater(X1,X0) ) ),
    inference(nnf_transformation,[],[f5]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( ( ~ greater(X1,X0)
        | ? [X3] : vplus(X0,X3) = X1 )
      & ( ! [X2] : vplus(X0,X2) != X1
        | greater(X1,X0) ) ),
    inference(rectify,[],[f21]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ( ~ greater(X1,X0)
        | vplus(X0,sK1(X0,X1)) = X1 )
      & ( ! [X2] : vplus(X0,X2) != X1
        | greater(X1,X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f22]) ).

fof(f25,plain,
    less(vd203,vd204),
    inference(cnf_transformation,[],[f14]) ).

fof(f26,plain,
    greater(vd203,vd204),
    inference(cnf_transformation,[],[f14]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | vplus(X1,sK0(X0,X1)) = X0 ),
    inference(cnf_transformation,[],[f20]) ).

fof(f29,plain,
    ! [X0,X1] :
      ( ~ greater(X1,X0)
      | vplus(X0,sK1(X0,X1)) = X1 ),
    inference(cnf_transformation,[],[f23]) ).

fof(f34,plain,
    ! [X2,X0,X1] :
      ( vplus(X1,X2) != X0
      | X0 != X1 ),
    inference(cnf_transformation,[],[f18]) ).

fof(f36,plain,
    ! [X2,X0,X1] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
    inference(cnf_transformation,[],[f11]) ).

fof(f43,plain,
    ! [X2,X1] : vplus(X1,X2) != X1,
    inference(equality_resolution,[],[f34]) ).

tcf(c_49,negated_conjecture,
    greater(vd203,vd204),
    inference(cnf_transformation,[],[f26]) ).

tcf(c_50,negated_conjecture,
    less(vd203,vd204),
    inference(cnf_transformation,[],[f25]) ).

tcf(c_52,plain,
    ! [X0: $i,X1: $i] :
      ( ( vplus(X0,sK0(X1,X0)) = X1 )
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f28]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] :
      ( ( vplus(X1,sK1(X1,X0)) = X0 )
      | ~ greater(X0,X1) ),
    inference(cnf_transformation,[],[f29]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i] : vplus(X0,X1) != X0,
    inference(cnf_transformation,[],[f43]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i,X2: $i] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
    inference(cnf_transformation,[],[f36]) ).

tcf(c_128,plain,
    ! [X0: $i,X1: $i] :
      ( ( vplus(X0,sK0(X1,X0)) = X1 )
      | ( X1 != vd204 )
      | ( X0 != vd203 ) ),
    inference(resolution_lifted,[status(thm)],[c_50,c_52]) ).

tcf(c_129,plain,
    vplus(vd203,sK0(vd204,vd203)) = vd204,
    inference(unflattening,[status(thm)],[c_128]) ).

tcf(c_134,plain,
    ! [X0: $i,X1: $i] :
      ( ( vplus(X1,sK1(X1,X0)) = X0 )
      | ( X1 != vd204 )
      | ( X0 != vd203 ) ),
    inference(resolution_lifted,[status(thm)],[c_49,c_54]) ).

tcf(c_135,plain,
    vplus(vd204,sK1(vd204,vd203)) = vd203,
    inference(unflattening,[status(thm)],[c_134]) ).

tcf(c_182,definition,
    iPr_def_10 = sK1(vd204,vd203),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_183,definition,
    iPr_def_11 = vplus(vd204,iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_184,definition,
    iPr_def_12 = sK0(vd204,vd203),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_185,definition,
    iPr_def_13 = vplus(vd203,iPr_def_12),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_186,plain,
    iPr_def_11 = vd203,
    inference(demodulation,[status(thm)],[c_135,c_182,c_183]) ).

tcf(c_187,plain,
    iPr_def_13 = vd204,
    inference(demodulation,[status(thm)],[c_129,c_184,c_185]) ).

tcf(c_255,plain,
    vplus(iPr_def_13,iPr_def_10) = iPr_def_11,
    inference(light_normalisation,[status(thm)],[c_183,c_187]) ).

tcf(c_257,plain,
    vplus(iPr_def_11,iPr_def_12) = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_185,c_186]) ).

tcf(c_270,plain,
    ! [X0: $i] : vplus(iPr_def_13,vplus(iPr_def_10,X0)) = vplus(iPr_def_11,X0),
    inference(superposition,[status(thm)],[c_255,c_60]) ).

tcf(c_335,plain,
    ! [X0: $i] : vplus(iPr_def_11,X0) != iPr_def_13,
    inference(superposition,[status(thm)],[c_270,c_58]) ).

tcf(c_345,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[c_257,c_335]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM836+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36  % Computer : n005.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Thu Sep 24 05:32:32 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.41  
% 0.10/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41  
% 0.10/0.41  % Detected problem language: tptp
% 0.10/0.43  % Proving...
% 2.20/1.27  % SZS status Started for theBenchmark.p
% 2.20/1.27  % SZS status Theorem for theBenchmark.p
% 2.20/1.27  
% 2.20/1.27  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.20/1.27  
% 2.20/1.27  % ------  iProver source info
% 2.20/1.27  
% 2.20/1.27  % git: date: 2026-07-19 20:42:38 +0200
% 2.20/1.27  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.20/1.27  % git: non_committed_changes: false
% 2.20/1.27  
% 2.20/1.27  % ------ Parsing...
% 2.20/1.27  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.20/1.27  
% 2.20/1.27  % ------ Preprocessing... sup_sim: 2  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 % 
% 2.20/1.27  
% 2.20/1.27  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.20/1.27  
% 2.20/1.27  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e 
% 2.20/1.27  % ------ Proving...
% 2.20/1.27  % ------ Problem Properties 
% 2.20/1.27  
% 2.20/1.27  % 
% 2.20/1.27  % clauses                               12
% 2.20/1.27  % conjectures                           0
% 2.20/1.27  % EPR                                   3
% 2.20/1.27  % Horn                                  11
% 2.20/1.27  % unary                                 10
% 2.20/1.27  % binary                                1
% 2.20/1.27  % lits                                  15
% 2.20/1.27  % lits eq                               15
% 2.20/1.27  % fd_pure                               0
% 2.20/1.27  % fd_pseudo                             0
% 2.20/1.27  % fd_cond                               0
% 2.20/1.27  % fd_pseudo_cond                        1
% 2.20/1.27  % AC symbols                            0
% 2.20/1.27  
% 2.20/1.27  % ------ Schedule dynamic 5 is on 
% 2.20/1.27  
% 2.20/1.27  % ------ no conjectures: strip conj schedule 
% 2.20/1.27  
% 2.20/1.27  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 2.20/1.27  
% 2.20/1.27  
% 2.20/1.27  % ------ 
% 2.20/1.27  % Current options:
% 2.20/1.27  % ------ 
% 2.20/1.27  
% 2.20/1.27  
% 2.20/1.27  % 
% 2.20/1.27  
% 2.20/1.27  % ------ Proving...
% 2.20/1.27  % 
% 2.20/1.27  
% 2.20/1.27  % SZS status Theorem for theBenchmark.p
% 2.20/1.27  
% 2.20/1.27  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.20/1.27  
% 2.20/1.27  
%------------------------------------------------------------------------------