↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n012.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:23:44 PM UTC 2026

% Result   : Theorem 1.64s 1.16s
% Output   : CNFRefutation 1.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   7 unt;   0 def)
%            Number of atoms       :   36 (   6 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   37 (  16   ~;   7   |;  11   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :   16 (   0 sgn  14   !;   2   ?;   2   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f284,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
    <=> ( X1 != X0
        & ~ less(X1,X0) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_property) ).

fof(f402,conjecture,
    ? [X0] :
      ( ( less(X0,n1)
        & less(nn1,X0) )
     => sum(n21,X0,n21) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_something_n0_samething) ).

fof(f403,negated_conjecture,
    ~ ? [X0] :
        ( ( less(X0,n1)
          & less(nn1,X0) )
       => sum(n21,X0,n21) ),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f450,plain,
    ! [X0] :
      ( less(X0,n1)
      & less(nn1,X0)
      & ~ sum(n21,X0,n21) ),
    inference(ennf_transformation,[],[f403]) ).

fof(f451,plain,
    ! [X0] :
      ( less(X0,n1)
      & less(nn1,X0)
      & ~ sum(n21,X0,n21) ),
    inference(flattening,[],[f450]) ).

fof(f452,plain,
    ! [X0,X1] :
      ( ( ~ less(X0,X1)
        | ( X1 != X0
          & ~ less(X1,X0) ) )
      & ( X0 = X1
        | less(X1,X0)
        | less(X0,X1) ) ),
    inference(nnf_transformation,[],[f284]) ).

fof(f453,plain,
    ! [X0,X1] :
      ( ( ~ less(X0,X1)
        | ( X1 != X0
          & ~ less(X1,X0) ) )
      & ( X0 = X1
        | less(X1,X0)
        | less(X0,X1) ) ),
    inference(flattening,[],[f452]) ).

fof(f738,plain,
    ! [X0,X1] :
      ( ~ less(X0,X1)
      | X0 != X1 ),
    inference(cnf_transformation,[],[f453]) ).

fof(f859,plain,
    ! [X0] : less(X0,n1),
    inference(cnf_transformation,[],[f451]) ).

fof(f862,plain,
    ! [X1] : ~ less(X1,X1),
    inference(equality_resolution,[],[f738]) ).

tcf(c_334,plain,
    ! [X0: $i] : ~ less(X0,X0),
    inference(cnf_transformation,[],[f862]) ).

tcf(c_455,negated_conjecture,
    ! [X0: $i] : less(X0,n1),
    inference(cnf_transformation,[],[f859]) ).

tcf(c_456,plain,
    less(n1,n1),
    inference(instantiation,[status(thm)],[c_455]) ).

tcf(c_458,plain,
    ~ less(n1,n1),
    inference(instantiation,[status(thm)],[c_334]) ).

tcf(c_459,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_458,c_456]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM343+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.36  % Computer : n012.cluster.edu
% 0.02/0.36  % Model    : x86_64 x86_64
% 0.02/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.36  % Memory   : 8046.5625MB
% 0.02/0.36  % OS       : Linux 6.8.0-71-generic
% 0.02/0.36  % CPULimit : 300
% 0.02/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Thu Sep 24 03:39:06 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.02/0.40  Running first-order theorem proving
% 0.02/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.02/0.41  
% 0.02/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.41  
% 0.02/0.41  % Detected problem language: tptp
% 0.02/0.42  % Proving...
% 1.64/1.16  % SZS status Started for theBenchmark.p
% 1.64/1.16  % SZS status Theorem for theBenchmark.p
% 1.64/1.16  
% 1.64/1.16  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.64/1.16  
% 1.64/1.16  % ------  iProver source info
% 1.64/1.16  
% 1.64/1.16  % git: date: 2026-07-19 20:42:38 +0200
% 1.64/1.16  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.64/1.16  % git: non_committed_changes: false
% 1.64/1.16  
% 1.64/1.16  % ------ Parsing...
% 1.64/1.16  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.64/1.16  
% 1.64/1.16  % ------ Preprocessing...% 
% 1.64/1.16  
% 1.64/1.16  % SZS status Theorem for theBenchmark.p
% 1.64/1.16  
% 1.64/1.16  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.64/1.16  
% 1.64/1.16  
%------------------------------------------------------------------------------