↑ Up

iProver---3.9.4.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV005-1 : TPTP v9.3.1. Released v1.0.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 03:16:12 PM UTC 2026

% Result   : Unsatisfiable 1.67s 1.46s
% Output   : CNFRefutation 1.67s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   20 (  15 unt;   3 def)
%            Number of atoms       :   41 (   3 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   25 (  13   ~;  12   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 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  :    6 (   4 usr;   4 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :    4 (   0 sgn   4   !;   0   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,negated_conjecture,
    ~ less_than(n,k),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_1) ).

fof(f16,negated_conjecture,
    ~ less_than(k,l),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_2) ).

fof(f19,negated_conjecture,
    less_than(one,l),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_5) ).

fof(f20,negated_conjecture,
    less_than(a(k),a(predecessor(l))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_6) ).

fof(f22,negated_conjecture,
    ! [X0] :
      ( ~ less_than(a(X0),a(predecessor(l)))
      | ~ less_than(one,l)
      | less_than(n,X0)
      | less_than(X0,l) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause_8) ).

tcf(c_80,negated_conjecture,
    ~ less_than(n,k),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_81,negated_conjecture,
    ~ less_than(k,l),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_84,negated_conjecture,
    less_than(one,l),
    inference(cnf_transformation,[],[f19]) ).

tcf(c_85,negated_conjecture,
    less_than(a(k),a(predecessor(l))),
    inference(cnf_transformation,[],[f20]) ).

tcf(c_87,negated_conjecture,
    ! [X0: $i] :
      ( less_than(n,X0)
      | less_than(X0,l)
      | ~ less_than(one,l)
      | ~ less_than(a(X0),a(predecessor(l))) ),
    inference(cnf_transformation,[],[f22]) ).

tcf(c_99,negated_conjecture,
    ! [X0: $i] :
      ( less_than(n,X0)
      | less_than(X0,l)
      | ~ less_than(a(X0),a(predecessor(l))) ),
    inference(global_subsumption_just,[status(thm)],[c_87,c_84,c_87]) ).

tcf(c_213,definition,
    iPr_def_10 = predecessor(l),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_214,definition,
    iPr_def_11 = a(iPr_def_10),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_215,definition,
    iPr_def_12 = a(k),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_217,negated_conjecture,
    ! [X0: $i] :
      ( less_than(n,X0)
      | less_than(X0,l)
      | ~ less_than(a(X0),iPr_def_11) ),
    inference(demodulation,[status(thm)],[c_99,c_213,c_214]) ).

tcf(c_220,negated_conjecture,
    less_than(iPr_def_12,iPr_def_11),
    inference(demodulation,[status(thm)],[c_85]) ).

tcf(c_224,negated_conjecture,
    ~ less_than(k,l),
    inference(demodulation,[status(thm)],[c_81]) ).

tcf(c_225,negated_conjecture,
    ~ less_than(n,k),
    inference(demodulation,[status(thm)],[c_80]) ).

tcf(c_579,plain,
    ( less_than(k,l)
    | less_than(n,k)
    | ~ less_than(iPr_def_12,iPr_def_11) ),
    inference(superposition,[status(thm)],[c_215,c_217]) ).

tcf(c_580,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_579,c_224,c_225,c_220]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV005-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.54  % Computer : n015.cluster.edu
% 0.08/0.54  % Model    : x86_64 x86_64
% 0.08/0.54  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.54  % Memory   : 8046.5625MB
% 0.08/0.54  % OS       : Linux 6.8.0-71-generic
% 0.08/0.54  % CPULimit : 300
% 0.08/0.54  % WCLimit  : 300
% 0.08/0.54  % DateTime : Thu Sep 24 18:20:42 UTC 2026
% 0.08/0.55  % CPUTime  : 
% 0.08/0.55  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/0.58  Running first-order theorem proving
% 0.14/0.59  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.14/0.60  
% 0.14/0.60  % ======== iProver multi-core TPTP/SMT =========
% 0.14/0.60  
% 0.14/0.60  % Detected problem language: tptp
% 0.14/0.61  % Proving...
% 1.67/1.46  % SZS status Started for theBenchmark.p
% 1.67/1.46  % SZS status Unsatisfiable for theBenchmark.p
% 1.67/1.46  
% 1.67/1.46  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.67/1.46  
% 1.67/1.46  % ------  iProver source info
% 1.67/1.46  
% 1.67/1.46  % git: date: 2026-07-19 20:42:38 +0200
% 1.67/1.46  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.67/1.46  % git: non_committed_changes: false
% 1.67/1.46  
% 1.67/1.46  % ------ Parsing...% successful
% 1.67/1.46  
% 1.67/1.46  
% 1.67/1.46  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.67/1.46  
% 1.67/1.46  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 1.67/1.46  
% 1.67/1.46  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 1.67/1.46  
% 1.67/1.46  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 1.67/1.46  % ------ Proving...
% 1.67/1.46  % ------ Problem Properties 
% 1.67/1.46  
% 1.67/1.46  % 
% 1.67/1.46  % clauses                               23
% 1.67/1.46  % conjectures                           9
% 1.67/1.46  % EPR                                   10
% 1.67/1.46  % Horn                                  21
% 1.67/1.46  % unary                                 15
% 1.67/1.46  % binary                                3
% 1.67/1.46  % lits                                  36
% 1.67/1.46  % lits eq                               11
% 1.67/1.46  % fd_pure                               0
% 1.67/1.46  % fd_pseudo                             0
% 1.67/1.46  % fd_cond                               0
% 1.67/1.46  % fd_pseudo_cond                        3
% 1.67/1.46  % AC symbols                            0
% 1.67/1.46  
% 1.67/1.46  % ------ Schedule dynamic 5 is on 
% 1.67/1.46  
% 1.67/1.46  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.67/1.46  
% 1.67/1.46  
% 1.67/1.46  % ------ 
% 1.67/1.46  % Current options:
% 1.67/1.46  % ------ 
% 1.67/1.46  
% 1.67/1.46  
% 1.67/1.46  % 
% 1.67/1.46  
% 1.67/1.46  % ------ Proving...
% 1.67/1.46  % 
% 1.67/1.46  
% 1.67/1.46  % SZS status Unsatisfiable for theBenchmark.p
% 1.67/1.46  
% 1.67/1.46  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.67/1.46  
% 1.67/1.46  
%------------------------------------------------------------------------------