↑ Up

iProver---3.9.4.UNS-CRf.s

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

% Computer : n026.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 01:40:00 PM UTC 2026

% Result   : Unsatisfiable 3.81s 1.21s
% Output   : CNFRefutation 3.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   15
% Syntax   : Number of formulae    :   54 (  36 unt;   3 def)
%            Number of atoms       :  113 (  38 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   69 (  35   ~;  34   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   11 (   9 usr;   4 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   31 (   0 sgn  31   !;   0   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] : gt(plus(X0,n1),n0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( def_10(X1,X0)
      | plus(X2,X1) != X0
      | minus(X0,X1) = X2 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_5) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( X1 != X0
      | ~ def_10(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_7) ).

fof(f8,plain,
    ! [X0,X1] :
      ( X0 != X1
      | ~ def_10(X0,X1) ),
    inference(reorient_equations,[],[f7]) ).

fof(f24,axiom,
    ! [X0] : plus(n0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).

fof(f26,axiom,
    ! [X0] : level(X0) = int_level(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).

fof(f29,axiom,
    ! [X0] :
      ( p_Empty(X0)
      | int_level(X0) != n0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).

fof(f30,plain,
    ! [X0] :
      ( p_Empty(X0)
      | n0 != int_level(X0) ),
    inference(reorient_equations,[],[f29]) ).

fof(f90,axiom,
    ! [X0] :
      ( int_level(plus(X0,n1)) = minus(int_level(X0),n1)
      | ~ gt(int_level(X0),n0)
      | ~ p_Rd(X0)
      | p_Wr(X0)
      | p_Reset(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_71) ).

fof(f113,negated_conjecture,
    level(t_139) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

fof(f114,plain,
    n1 = level(t_139),
    inference(reorient_equations,[],[f113]) ).

fof(f115,negated_conjecture,
    ~ p_Wr(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

fof(f116,negated_conjecture,
    p_Rd(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

fof(f117,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).

fof(f118,negated_conjecture,
    ~ p_Empty(plus(t_139,n1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).

fof(f119,plain,
    n1 = int_level(t_139),
    inference(definition_unfolding,[],[f114,f26]) ).

fof(f121,plain,
    ! [X2,X1] :
      ( def_10(X1,plus(X2,X1))
      | minus(plus(X2,X1),X1) = X2 ),
    inference(equality_resolution,[],[f5]) ).

fof(f122,plain,
    ! [X1] : ~ def_10(X1,X1),
    inference(equality_resolution,[],[f8]) ).

tcf(c_145,plain,
    ! [X0: $i] : gt(plus(X0,n1),n0),
    inference(cnf_transformation,[],[f2]) ).

tcf(c_148,plain,
    ! [X0: $i,X1: $i] :
      ( def_10(X1,plus(X0,X1))
      | ( minus(plus(X0,X1),X1) = X0 ) ),
    inference(cnf_transformation,[],[f121]) ).

tcf(c_150,plain,
    ! [X0: $i] : ~ def_10(X0,X0),
    inference(cnf_transformation,[],[f122]) ).

tcf(c_162,plain,
    ! [X0: $i] : plus(n0,X0) = X0,
    inference(cnf_transformation,[],[f24]) ).

tcf(c_166,plain,
    ! [X0: $i] :
      ( p_Empty(X0)
      | ( int_level(X0) != n0 ) ),
    inference(cnf_transformation,[],[f30]) ).

tcf(c_213,plain,
    ! [X0: $i] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ( minus(int_level(X0),n1) = int_level(plus(X0,n1)) )
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0) ),
    inference(cnf_transformation,[],[f90]) ).

tcf(c_233,negated_conjecture,
    int_level(t_139) = n1,
    inference(cnf_transformation,[],[f119]) ).

tcf(c_234,negated_conjecture,
    ~ p_Wr(t_139),
    inference(cnf_transformation,[],[f115]) ).

tcf(c_235,negated_conjecture,
    p_Rd(t_139),
    inference(cnf_transformation,[],[f116]) ).

tcf(c_236,negated_conjecture,
    ~ p_Reset(t_139),
    inference(cnf_transformation,[],[f117]) ).

tcf(c_237,negated_conjecture,
    ~ p_Empty(plus(t_139,n1)),
    inference(cnf_transformation,[],[f118]) ).

tcf(c_446,plain,
    ! [X0: $i] :
      ( ( int_level(X0) != n0 )
      | p_Empty(X0) ),
    inference(prop_impl_just,[status(thm)],[c_166]) ).

tcf(c_447,plain,
    ! [X0: $i] :
      ( p_Empty(X0)
      | ( int_level(X0) != n0 ) ),
    inference(renaming,[status(thm)],[c_446]) ).

tcf(c_1541,plain,
    ! [X0: $i] :
      ( ( int_level(X0) != n0 )
      | ( plus(t_139,n1) != X0 ) ),
    inference(resolution_lifted,[status(thm)],[c_237,c_447]) ).

tcf(c_1542,plain,
    int_level(plus(t_139,n1)) != n0,
    inference(unflattening,[status(thm)],[c_1541]) ).

tcf(c_9656,definition,
    iPr_def_10 = plus(t_139,n1),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_9657,definition,
    iPr_def_11 = int_level(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_9658,definition,
    iPr_def_12 = int_level(t_139),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_9659,plain,
    iPr_def_11 != n0,
    inference(demodulation,[status(thm)],[c_1542,c_9656,c_9657]) ).

tcf(c_9660,negated_conjecture,
    ~ p_Reset(t_139),
    inference(demodulation,[status(thm)],[c_236]) ).

tcf(c_9661,negated_conjecture,
    p_Rd(t_139),
    inference(demodulation,[status(thm)],[c_235]) ).

tcf(c_9662,negated_conjecture,
    ~ p_Wr(t_139),
    inference(demodulation,[status(thm)],[c_234]) ).

tcf(c_9663,negated_conjecture,
    iPr_def_12 = n1,
    inference(demodulation,[status(thm)],[c_233,c_9658]) ).

tcf(c_10771,plain,
    ! [X0: $i] : gt(plus(X0,iPr_def_12),n0),
    inference(light_normalisation,[status(thm)],[c_145,c_9663]) ).

tcf(c_10772,plain,
    plus(t_139,iPr_def_12) = iPr_def_10,
    inference(light_normalisation,[status(thm)],[c_9656,c_9663]) ).

tcf(c_10774,plain,
    gt(iPr_def_12,n0),
    inference(superposition,[status(thm)],[c_162,c_10771]) ).

tcf(c_11424,plain,
    ! [X0: $i] :
      ( def_10(X0,X0)
      | ( minus(plus(n0,X0),X0) = n0 ) ),
    inference(superposition,[status(thm)],[c_162,c_148]) ).

tcf(c_11436,plain,
    ! [X0: $i] :
      ( def_10(X0,X0)
      | ( minus(X0,X0) = n0 ) ),
    inference(light_normalisation,[status(thm)],[c_11424,c_162]) ).

tcf(c_11437,plain,
    ! [X0: $i] : minus(X0,X0) = n0,
    inference(forward_subsumption_resolution,[status(thm)],[c_11436,c_150]) ).

tcf(c_12572,plain,
    ! [X0: $i] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ( minus(int_level(X0),iPr_def_12) = int_level(plus(X0,iPr_def_12)) )
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0) ),
    inference(light_normalisation,[status(thm)],[c_213,c_9663]) ).

tcf(c_12595,plain,
    ( p_Reset(t_139)
    | p_Wr(t_139)
    | ( minus(int_level(t_139),iPr_def_12) = int_level(plus(t_139,iPr_def_12)) )
    | ~ p_Rd(t_139)
    | ~ gt(iPr_def_12,n0) ),
    inference(superposition,[status(thm)],[c_9658,c_12572]) ).

tcf(c_12608,plain,
    ( p_Reset(t_139)
    | p_Wr(t_139)
    | ( minus(iPr_def_12,iPr_def_12) = iPr_def_11 )
    | ~ p_Rd(t_139)
    | ~ gt(iPr_def_12,n0) ),
    inference(light_normalisation,[status(thm)],[c_12595,c_9657,c_9658,c_10772]) ).

tcf(c_12609,plain,
    minus(iPr_def_12,iPr_def_12) = iPr_def_11,
    inference(forward_subsumption_resolution,[status(thm)],[c_12608,c_9660,c_9662,c_9661,c_10774]) ).

tcf(c_12638,plain,
    n0 = iPr_def_11,
    inference(demodulation,[status(thm)],[c_12609,c_11437]) ).

tcf(c_12692,plain,
    iPr_def_11 != iPr_def_11,
    inference(demodulation,[status(thm)],[c_9659,c_12638]) ).

tcf(c_12693,plain,
    $false,
    inference(equality_resolution_simp,[status(thm)],[c_12692]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HWV023-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.38  % Computer : n026.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Wed Sep 23 16:30:09 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.12/0.43  
% 0.12/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43  
% 0.12/0.43  % Detected problem language: tptp
% 0.12/0.44  % Proving...
% 3.81/1.21  % SZS status Started for theBenchmark.p
% 3.81/1.21  % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.21  
% 3.81/1.21  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.81/1.21  
% 3.81/1.21  % ------  iProver source info
% 3.81/1.21  
% 3.81/1.21  % git: date: 2026-07-19 20:42:38 +0200
% 3.81/1.21  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.81/1.21  % git: non_committed_changes: false
% 3.81/1.21  
% 3.81/1.21  % ------ Parsing...% successful
% 3.81/1.21  
% 3.81/1.21  
% 3.81/1.21  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.81/1.21  
% 3.81/1.21  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 21 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe_e  sup_sim: 0  sf_s  rm: 4 0s  sf_e  pe_s  pe_e % 
% 3.81/1.21  
% 3.81/1.21  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.81/1.21  
% 3.81/1.21  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.81/1.21  % ------ Proving...
% 3.81/1.21  % ------ Problem Properties 
% 3.81/1.21  
% 3.81/1.21  % 
% 3.81/1.21  % clauses                               57
% 3.81/1.21  % conjectures                           4
% 3.81/1.21  % EPR                                   11
% 3.81/1.21  % Horn                                  27
% 3.81/1.21  % unary                                 13
% 3.81/1.21  % binary                                14
% 3.81/1.21  % lits                                  157
% 3.81/1.21  % lits eq                               37
% 3.81/1.21  % fd_pure                               0
% 3.81/1.21  % fd_pseudo                             0
% 3.81/1.21  % fd_cond                               1
% 3.81/1.21  % fd_pseudo_cond                        4
% 3.81/1.21  % AC symbols                            0
% 3.81/1.21  
% 3.81/1.21  % ------ Schedule dynamic 5 is on 
% 3.81/1.21  
% 3.81/1.21  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.81/1.21  
% 3.81/1.21  
% 3.81/1.21  % ------ 
% 3.81/1.21  % Current options:
% 3.81/1.21  % ------ 
% 3.81/1.21  
% 3.81/1.21  
% 3.81/1.21  % 
% 3.81/1.21  
% 3.81/1.21  % ------ Proving...
% 3.81/1.21  % 
% 3.81/1.21  
% 3.81/1.21  % SZS status Unsatisfiable for theBenchmark.p
% 3.81/1.21  
% 3.81/1.21  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.81/1.21  
%------------------------------------------------------------------------------