↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV412+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/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 03:17:34 PM UTC 2026

% Result   : Theorem 2.13s 1.16s
% Output   : CNFRefutation 2.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   23 (  11 unt;   1 def)
%            Number of atoms       :   53 (   1 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   44 (  17   ~;  10   |;  14   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   37 (   0 sgn  29   !;   8   ?;   5   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,axiom,
    ! [X0,X1,X2,X3] :
      ( ( strictly_less_than(X2,X3)
        & pair_in_list(X0,X1,X2) )
     => pair_in_list(update_slb(X0,X3),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_li3839) ).

fof(f20,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( strictly_less_than(X2,X3)
        & strictly_less_than(X1,X3)
        & pair_in_list(X0,X1,X2) )
     => pair_in_list(update_slb(X0,X3),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l48_co) ).

fof(f21,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( strictly_less_than(X2,X3)
          & strictly_less_than(X1,X3)
          & pair_in_list(X0,X1,X2) )
       => pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f30,plain,
    ! [X0,X1,X2,X3] :
      ( ~ strictly_less_than(X2,X3)
      | ~ pair_in_list(X0,X1,X2)
      | pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f31,plain,
    ! [X0,X1,X2,X3] :
      ( ~ strictly_less_than(X2,X3)
      | ~ pair_in_list(X0,X1,X2)
      | pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(flattening,[],[f30]) ).

fof(f32,plain,
    ? [X0,X1,X2,X3] :
      ( strictly_less_than(X2,X3)
      & strictly_less_than(X1,X3)
      & pair_in_list(X0,X1,X2)
      & ~ pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f33,plain,
    ? [X0,X1,X2,X3] :
      ( strictly_less_than(X2,X3)
      & strictly_less_than(X1,X3)
      & pair_in_list(X0,X1,X2)
      & ~ pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(flattening,[],[f32]) ).

fof(f40,plain,
    ( strictly_less_than(sK2,sK3)
    & strictly_less_than(sK1,sK3)
    & pair_in_list(sK0,sK1,sK2)
    & ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f33]) ).

fof(f66,plain,
    ! [X2,X3,X0,X1] :
      ( ~ strictly_less_than(X2,X3)
      | ~ pair_in_list(X0,X1,X2)
      | pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(cnf_transformation,[],[f31]) ).

fof(f67,plain,
    strictly_less_than(sK2,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f69,plain,
    pair_in_list(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f40]) ).

fof(f70,plain,
    ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3),
    inference(cnf_transformation,[],[f40]) ).

tcf(c_74,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ strictly_less_than(X2,X3)
      | ~ pair_in_list(X0,X1,X2) ),
    inference(cnf_transformation,[],[f66]) ).

tcf(c_75,negated_conjecture,
    ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3),
    inference(cnf_transformation,[],[f70]) ).

tcf(c_76,negated_conjecture,
    pair_in_list(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f69]) ).

tcf(c_78,negated_conjecture,
    strictly_less_than(sK2,sK3),
    inference(cnf_transformation,[],[f67]) ).

tcf(c_788,definition,
    iPr_def_10 = update_slb(sK0,sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_789,negated_conjecture,
    strictly_less_than(sK2,sK3),
    inference(demodulation,[status(thm)],[c_78]) ).

tcf(c_791,negated_conjecture,
    pair_in_list(sK0,sK1,sK2),
    inference(demodulation,[status(thm)],[c_76]) ).

tcf(c_792,negated_conjecture,
    ~ pair_in_list(iPr_def_10,sK1,sK3),
    inference(demodulation,[status(thm)],[c_75,c_788]) ).

tcf(c_1252,plain,
    ! [X0: $i] :
      ( pair_in_list(update_slb(sK0,X0),sK1,X0)
      | ~ strictly_less_than(sK2,X0) ),
    inference(superposition,[status(thm)],[c_791,c_74]) ).

tcf(c_1355,plain,
    ( pair_in_list(iPr_def_10,sK1,sK3)
    | ~ strictly_less_than(sK2,sK3) ),
    inference(superposition,[status(thm)],[c_788,c_1252]) ).

tcf(c_1357,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1355,c_792,c_789]) ).


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