↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SWV056+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM

% Computer : n013.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:19 PM UTC 2026

% Result   : Theorem 4.29s 16.31s
% Output   : CNFRefutation 4.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   29 (  23 unt;   0 def)
%            Number of atoms       :   49 (  24 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   35 (  15   ~;   8   |;  10   &)
%                                         (   0 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   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  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   7 con; 0-3 aty)
%            Number of variables   :   11 (   0 sgn  11   !;   0   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X0] : sum(n0,tptp_minus_1,X0) = n0,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).

fof(f28,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).

fof(f30,axiom,
    ! [X0] : plus(n1,X0) = succ(X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_plus_1_l) ).

fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).

fof(f40,axiom,
    ! [X0] : pred(succ(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).

fof(f53,conjecture,
    ( ( leq(pv25,minus(n5,n1))
      & leq(n0,pv25) )
   => ( leq(pv25,minus(n5,n1))
      & leq(n0,pv25)
      & n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0040) ).

fof(f54,negated_conjecture,
    ~ ( ( leq(pv25,minus(n5,n1))
        & leq(n0,pv25) )
     => ( leq(pv25,minus(n5,n1))
        & leq(n0,pv25)
        & n0 = sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f87,plain,
    ( leq(pv25,minus(n5,n1))
    & leq(n0,pv25)
    & ( ~ leq(pv25,minus(n5,n1))
      | ~ leq(n0,pv25)
      | n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f88,plain,
    ( leq(pv25,minus(n5,n1))
    & leq(n0,pv25)
    & ( ~ leq(pv25,minus(n5,n1))
      | ~ leq(n0,pv25)
      | n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ) ),
    inference(flattening,[],[f87]) ).

fof(f114,plain,
    leq(pv25,minus(n5,n1)),
    inference(cnf_transformation,[],[f88]) ).

fof(f115,plain,
    leq(n0,pv25),
    inference(cnf_transformation,[],[f88]) ).

fof(f116,plain,
    ( ~ leq(pv25,minus(n5,n1))
    | ~ leq(n0,pv25)
    | n0 != sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) ),
    inference(cnf_transformation,[],[f88]) ).

fof(f128,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(cnf_transformation,[],[f26]) ).

fof(f149,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f159,plain,
    n0 = succ(tptp_minus_1),
    inference(cnf_transformation,[],[f28]) ).

fof(f175,plain,
    ! [X0] : succ(X0) = plus(n1,X0),
    inference(cnf_transformation,[],[f30]) ).

fof(f178,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[],[f40]) ).

fof(f192,plain,
    n0 = plus(n1,tptp_minus_1),
    inference(definition_unfolding,[],[f159,f175]) ).

fof(f204,plain,
    ! [X0] : minus(plus(n1,X0),n1) = X0,
    inference(definition_unfolding,[],[f178,f149,f175]) ).

tcf(c_49,negated_conjecture,
    ( ~ leq(n0,pv25)
    | ~ leq(pv25,minus(n5,n1))
    | ( sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0 ) ),
    inference(cnf_transformation,[],[f116]) ).

tcf(c_50,negated_conjecture,
    leq(n0,pv25),
    inference(cnf_transformation,[],[f115]) ).

tcf(c_51,negated_conjecture,
    leq(pv25,minus(n5,n1)),
    inference(cnf_transformation,[],[f114]) ).

tcf(c_63,plain,
    ! [X0: $i] : sum(n0,tptp_minus_1,X0) = n0,
    inference(cnf_transformation,[],[f128]) ).

tcf(c_93,plain,
    plus(n1,tptp_minus_1) = n0,
    inference(cnf_transformation,[],[f192]) ).

tcf(c_111,plain,
    ! [X0: $i] : minus(plus(n1,X0),n1) = X0,
    inference(cnf_transformation,[],[f204]) ).

tcf(c_141,negated_conjecture,
    sum(n0,minus(n0,n1),a_select3(q,pv77,pv25)) != n0,
    inference(global_subsumption_just,[status(thm)],[c_49,c_50,c_51,c_49]) ).

tcf(c_1492,plain,
    minus(n0,n1) = tptp_minus_1,
    inference(superposition,[status(thm)],[c_93,c_111]) ).

tcf(c_1498,plain,
    sum(n0,tptp_minus_1,a_select3(q,pv77,pv25)) != n0,
    inference(demodulation,[status(thm)],[c_141,c_1492]) ).

tcf(c_1499,plain,
    $false,
    inference(ground_joinability,[status(thm)],[c_1498,c_63]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV056+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/15.39  % Computer : n013.cluster.edu
% 0.10/15.39  % Model    : x86_64 x86_64
% 0.10/15.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/15.39  % Memory   : 8046.5625MB
% 0.10/15.39  % OS       : Linux 6.8.0-71-generic
% 0.10/15.39  % CPULimit : 300
% 0.10/15.39  % WCLimit  : 300
% 0.10/15.39  % DateTime : Thu Sep 24 18:24:36 UTC 2026
% 0.10/15.39  % CPUTime  : 
% 0.10/15.39  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/15.43  Running first-order theorem proving
% 0.15/15.43  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.15/15.44  
% 0.15/15.44  % ======== iProver multi-core TPTP/SMT =========
% 0.15/15.44  
% 0.15/15.44  % Detected problem language: tptp
% 0.15/15.45  % Proving...
% 4.29/16.31  % SZS status Started for theBenchmark.p
% 4.29/16.31  % SZS status Theorem for theBenchmark.p
% 4.29/16.31  
% 4.29/16.31  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 4.29/16.31  
% 4.29/16.31  % ------  iProver source info
% 4.29/16.31  
% 4.29/16.31  % git: date: 2026-07-19 20:42:38 +0200
% 4.29/16.31  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 4.29/16.31  % git: non_committed_changes: false
% 4.29/16.31  
% 4.29/16.31  % ------ Parsing...
% 4.29/16.31  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 4.29/16.31  
% 4.29/16.31  % ------ Preprocessing... sup_sim: 10  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 4.29/16.31  
% 4.29/16.31  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 4.29/16.31  
% 4.29/16.31  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 4.29/16.31  % ------ Proving...
% 4.29/16.31  % ------ Problem Properties 
% 4.29/16.31  
% 4.29/16.31  % 
% 4.29/16.31  % clauses                               65
% 4.29/16.31  % conjectures                           3
% 4.29/16.31  % EPR                                   35
% 4.29/16.31  % Horn                                  58
% 4.29/16.31  % unary                                 45
% 4.29/16.31  % binary                                10
% 4.29/16.31  % lits                                  110
% 4.29/16.31  % lits eq                               42
% 4.29/16.31  % fd_pure                               0
% 4.29/16.31  % fd_pseudo                             0
% 4.29/16.31  % fd_cond                               6
% 4.29/16.31  % fd_pseudo_cond                        2
% 4.29/16.31  % AC symbols                            0
% 4.29/16.31  
% 4.29/16.31  % ------ Schedule dynamic 5 is on 
% 4.29/16.31  
% 4.29/16.31  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 4.29/16.31  
% 4.29/16.31  
% 4.29/16.31  % ------ 
% 4.29/16.31  % Current options:
% 4.29/16.31  % ------ 
% 4.29/16.31  
% 4.29/16.31  
% 4.29/16.31  % 
% 4.29/16.31  
% 4.29/16.31  % ------ Proving...
% 4.29/16.31  % 
% 4.29/16.31  
% 4.29/16.31  % SZS status Theorem for theBenchmark.p
% 4.29/16.31  
% 4.29/16.31  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.29/16.31  
% 4.29/16.31  
%------------------------------------------------------------------------------