↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : NUN082+2 : TPTP v9.3.1. Released v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM

% Computer : n017.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:29:59 PM UTC 2026

% Result   : Theorem 2.71s 1.19s
% Output   : CNFRefutation 2.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   75 (  41 unt;   0 def)
%            Number of atoms       :  163 (  63 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :  156 (  68   ~;  50   |;  38   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 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;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   1 con; 0-2 aty)
%            Number of variables   :  160 (   0 sgn 138   !;  22   ?;  74   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ? [X0] :
    ! [X1] :
      ( ( X1 = X0
        & r1(X1) )
      | ( X1 != X0
        & ~ r1(X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_1) ).

fof(f3,axiom,
    ! [X0,X1] :
    ? [X2] :
    ! [X3] :
      ( ( X3 = X2
        & r3(X0,X1,X3) )
      | ( X3 != X2
        & ~ r3(X0,X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_3) ).

fof(f4,axiom,
    ! [X0,X1] :
    ? [X2] :
    ! [X3] :
      ( ( X3 = X2
        & r4(X0,X1,X3) )
      | ( X3 != X2
        & ~ r4(X0,X1,X3) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4) ).

fof(f6,axiom,
    ! [X0,X1] :
    ? [X2] :
      ( ? [X5] :
          ( r4(X0,X1,X5)
          & r3(X5,X0,X2) )
      & ? [X3] :
          ( X3 = X2
          & ? [X4] :
              ( r4(X0,X4,X3)
              & r2(X1,X4) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_2a) ).

fof(f8,axiom,
    ! [X0] :
    ? [X1] :
      ( X1 = X0
      & ? [X2] :
          ( r3(X0,X2,X1)
          & r1(X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_4a) ).

fof(f9,axiom,
    ! [X0] :
    ? [X1] :
      ( ? [X3] :
          ( X1 = X3
          & r1(X3) )
      & ? [X2] :
          ( r4(X0,X2,X1)
          & r1(X2) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM008+0.ax',axiom_5a) ).

fof(f12,conjecture,
    ? [X0,X1] :
      ( ? [X4] :
          ( X1 = X4
          & r1(X4) )
      & ? [X2] :
          ( ? [X3] :
              ( r2(X3,X2)
              & r1(X3) )
          & r4(X0,X2,X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xtimesoneeqzero) ).

fof(f13,negated_conjecture,
    ~ ? [X0,X1] :
        ( ? [X4] :
            ( X1 = X4
            & r1(X4) )
        & ? [X2] :
            ( ? [X3] :
                ( r2(X3,X2)
                & r1(X3) )
            & r4(X0,X2,X1) ) ),
    inference(negated_conjecture,[status(cth)],[f12]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ! [X4] :
          ( X1 != X4
          | ~ r1(X4) )
      | ! [X2] :
          ( ! [X3] :
              ( ~ r2(X3,X2)
              | ~ r1(X3) )
          | ~ r4(X0,X2,X1) ) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f15,plain,
    ! [X1] :
      ( ( sK0 = X1
        & r1(X1) )
      | ( sK0 != X1
        & ~ r1(X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f1]) ).

fof(f17,plain,
    ! [X0,X1,X3] :
      ( ( sK2(X0,X1) = X3
        & r3(X0,X1,X3) )
      | ( sK2(X0,X1) != X3
        & ~ r3(X0,X1,X3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(X2,sK2(X0,X1))],[f3]) ).

fof(f18,plain,
    ! [X0,X1,X3] :
      ( ( sK3(X0,X1) = X3
        & r4(X0,X1,X3) )
      | ( sK3(X0,X1) != X3
        & ~ r4(X0,X1,X3) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0,X1))],[f4]) ).

fof(f20,plain,
    ! [X0,X1] :
      ( r4(X0,X1,sK11(X0,X1))
      & r3(sK11(X0,X1),X0,sK8(X0,X1))
      & sK8(X0,X1) = sK9(X0,X1)
      & r4(X0,sK10(X0,X1),sK9(X0,X1))
      & r2(X1,sK10(X0,X1)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK8,sK9,sK10,sK11]),skolemize(X2,sK8(X0,X1)),skolemize(X3,sK9(X0,X1)),skolemize(X4,sK10(X0,X1)),skolemize(X5,sK11(X0,X1))],[f6]) ).

fof(f21,plain,
    ! [X0] :
      ( sK12(X0) = X0
      & r3(X0,sK13(X0),sK12(X0))
      & r1(sK13(X0)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK12,sK13]),skolemize(X1,sK12(X0)),skolemize(X2,sK13(X0))],[f8]) ).

fof(f22,plain,
    ! [X0] :
      ( sK14(X0) = sK16(X0)
      & r1(sK16(X0))
      & r4(X0,sK15(X0),sK14(X0))
      & r1(sK15(X0)) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15,sK16]),skolemize(X1,sK14(X0)),skolemize(X2,sK15(X0)),skolemize(X3,sK16(X0))],[f9]) ).

fof(f25,plain,
    ! [X1] :
      ( r1(X1)
      | sK0 != X1 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f26,plain,
    ! [X1] :
      ( sK0 = X1
      | ~ r1(X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f34,plain,
    ! [X3,X0,X1] :
      ( sK2(X0,X1) = X3
      | ~ r3(X0,X1,X3) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f38,plain,
    ! [X3,X0,X1] :
      ( sK3(X0,X1) = X3
      | ~ r4(X0,X1,X3) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f45,plain,
    ! [X0,X1] : r4(X0,X1,sK11(X0,X1)),
    inference(cnf_transformation,[],[f20]) ).

fof(f46,plain,
    ! [X0,X1] : r3(sK11(X0,X1),X0,sK8(X0,X1)),
    inference(cnf_transformation,[],[f20]) ).

fof(f47,plain,
    ! [X0,X1] : sK8(X0,X1) = sK9(X0,X1),
    inference(cnf_transformation,[],[f20]) ).

fof(f48,plain,
    ! [X0,X1] : r4(X0,sK10(X0,X1),sK9(X0,X1)),
    inference(cnf_transformation,[],[f20]) ).

fof(f49,plain,
    ! [X0,X1] : r2(X1,sK10(X0,X1)),
    inference(cnf_transformation,[],[f20]) ).

fof(f51,plain,
    ! [X0] : sK12(X0) = X0,
    inference(cnf_transformation,[],[f21]) ).

fof(f52,plain,
    ! [X0] : r3(X0,sK13(X0),sK12(X0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f53,plain,
    ! [X0] : r1(sK13(X0)),
    inference(cnf_transformation,[],[f21]) ).

fof(f54,plain,
    ! [X0] : sK14(X0) = sK16(X0),
    inference(cnf_transformation,[],[f22]) ).

fof(f55,plain,
    ! [X0] : r1(sK16(X0)),
    inference(cnf_transformation,[],[f22]) ).

fof(f56,plain,
    ! [X0] : r4(X0,sK15(X0),sK14(X0)),
    inference(cnf_transformation,[],[f22]) ).

fof(f57,plain,
    ! [X0] : r1(sK15(X0)),
    inference(cnf_transformation,[],[f22]) ).

fof(f63,plain,
    ! [X2,X3,X0,X1,X4] :
      ( X1 != X4
      | ~ r1(X4)
      | ~ r2(X3,X2)
      | ~ r1(X3)
      | ~ r4(X0,X2,X1) ),
    inference(cnf_transformation,[],[f14]) ).

fof(f65,plain,
    ! [X0,X1] : r3(sK11(X0,X1),X0,sK9(X0,X1)),
    inference(definition_unfolding,[],[f46,f47]) ).

fof(f66,plain,
    ! [X0] : r4(X0,sK15(X0),sK16(X0)),
    inference(definition_unfolding,[],[f56,f54]) ).

fof(f67,plain,
    r1(sK0),
    inference(equality_resolution,[],[f25]) ).

fof(f77,plain,
    ! [X2,X3,X0,X4] :
      ( ~ r1(X4)
      | ~ r2(X3,X2)
      | ~ r1(X3)
      | ~ r4(X0,X2,X4) ),
    inference(equality_resolution,[],[f63]) ).

tcf(c_49,plain,
    ! [X0: $i] :
      ( ( X0 = sK0 )
      | ~ r1(X0) ),
    inference(cnf_transformation,[],[f26]) ).

tcf(c_50,plain,
    r1(sK0),
    inference(cnf_transformation,[],[f67]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( sK2(X0,X1) = X2 )
      | ~ r3(X0,X1,X2) ),
    inference(cnf_transformation,[],[f34]) ).

tcf(c_55,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ( sK3(X0,X1) = X2 )
      | ~ r4(X0,X1,X2) ),
    inference(cnf_transformation,[],[f38]) ).

tcf(c_61,plain,
    ! [X0: $i,X1: $i] : r2(X0,sK10(X1,X0)),
    inference(cnf_transformation,[],[f49]) ).

tcf(c_62,plain,
    ! [X0: $i,X1: $i] : r4(X0,sK10(X0,X1),sK9(X0,X1)),
    inference(cnf_transformation,[],[f48]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i] : r3(sK11(X0,X1),X0,sK9(X0,X1)),
    inference(cnf_transformation,[],[f65]) ).

tcf(c_64,plain,
    ! [X0: $i,X1: $i] : r4(X0,X1,sK11(X0,X1)),
    inference(cnf_transformation,[],[f45]) ).

tcf(c_66,plain,
    ! [X0: $i] : r1(sK13(X0)),
    inference(cnf_transformation,[],[f53]) ).

tcf(c_67,plain,
    ! [X0: $i] : r3(X0,sK13(X0),sK12(X0)),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_68,plain,
    ! [X0: $i] : sK12(X0) = X0,
    inference(cnf_transformation,[],[f51]) ).

tcf(c_69,plain,
    ! [X0: $i] : r1(sK15(X0)),
    inference(cnf_transformation,[],[f57]) ).

tcf(c_70,plain,
    ! [X0: $i] : r4(X0,sK15(X0),sK16(X0)),
    inference(cnf_transformation,[],[f66]) ).

tcf(c_71,plain,
    ! [X0: $i] : r1(sK16(X0)),
    inference(cnf_transformation,[],[f55]) ).

tcf(c_77,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ~ r1(X3)
      | ~ r1(X2)
      | ~ r2(X3,X1)
      | ~ r4(X0,X1,X2) ),
    inference(cnf_transformation,[],[f77]) ).

tcf(c_191,plain,
    ! [X0: $i] : r3(X0,sK13(X0),X0),
    inference(light_normalisation,[status(thm)],[c_67,c_68]) ).

tcf(c_262,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ( sK2(X2,X3) = X4 )
      | ( X0 != X3 )
      | ( sK11(X0,X1) != X2 )
      | ( sK9(X0,X1) != X4 ) ),
    inference(resolution_lifted,[status(thm)],[c_53,c_63]) ).

tcf(c_263,plain,
    ! [X0: $i,X1: $i] : sK2(sK11(X0,X1),X0) = sK9(X0,X1),
    inference(unflattening,[status(thm)],[c_262]) ).

tcf(c_268,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( sK2(X0,X2) = X3 )
      | ( X1 != X3 )
      | ( X0 != X1 )
      | ( sK13(X1) != X2 ) ),
    inference(resolution_lifted,[status(thm)],[c_53,c_191]) ).

tcf(c_269,plain,
    ! [X0: $i] : sK2(X0,sK13(X0)) = X0,
    inference(unflattening,[status(thm)],[c_268]) ).

tcf(c_291,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
      ( ~ r1(X5)
      | ~ r1(X4)
      | ~ r2(X5,X3)
      | ( X0 != X1 )
      | ( sK9(X1,X2) != X4 )
      | ( sK10(X1,X2) != X3 ) ),
    inference(resolution_lifted,[status(thm)],[c_77,c_62]) ).

tcf(c_292,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ r1(X0)
      | ~ r1(sK9(X1,X2))
      | ~ r2(X0,sK10(X1,X2)) ),
    inference(unflattening,[status(thm)],[c_291]) ).

tcf(c_320,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
      ( ( sK3(X0,X2) = X4 )
      | ( X2 != X3 )
      | ( X0 != X1 )
      | ( sK11(X1,X3) != X4 ) ),
    inference(resolution_lifted,[status(thm)],[c_55,c_64]) ).

tcf(c_321,plain,
    ! [X0: $i,X1: $i] : sK3(X0,X1) = sK11(X0,X1),
    inference(unflattening,[status(thm)],[c_320]) ).

tcf(c_339,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( ( sK3(X0,X2) = X3 )
      | ( X0 != X1 )
      | ( sK16(X1) != X3 )
      | ( sK15(X1) != X2 ) ),
    inference(resolution_lifted,[status(thm)],[c_55,c_70]) ).

tcf(c_340,plain,
    ! [X0: $i] : sK3(X0,sK15(X0)) = sK16(X0),
    inference(unflattening,[status(thm)],[c_339]) ).

tcf(c_470,plain,
    ! [X0: $i,X1: $i] : sK2(sK3(X0,X1),X0) = sK9(X0,X1),
    inference(light_normalisation,[status(thm)],[c_263,c_321]) ).

tcf(c_648,plain,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ r1(X0)
      | ~ r1(sK9(X1,X2))
      | ~ r2(X0,sK10(X1,X2)) ),
    inference(demodulation,[status(thm)],[c_292]) ).

tcf(c_904,plain,
    ! [X0: $i,X1: $i] :
      ( ~ r1(X1)
      | ~ r1(sK9(X0,X1)) ),
    inference(superposition,[status(thm)],[c_61,c_648]) ).

tcf(c_913,plain,
    ! [X0: $i] : sK13(X0) = sK0,
    inference(superposition,[status(thm)],[c_66,c_49]) ).

tcf(c_914,plain,
    ! [X0: $i] : sK15(X0) = sK0,
    inference(superposition,[status(thm)],[c_69,c_49]) ).

tcf(c_915,plain,
    ! [X0: $i] : sK16(X0) = sK0,
    inference(superposition,[status(thm)],[c_71,c_49]) ).

tcf(c_945,plain,
    ! [X0: $i] : sK2(X0,sK0) = X0,
    inference(light_normalisation,[status(thm)],[c_269,c_913]) ).

tcf(c_1034,plain,
    ! [X0: $i] : sK3(X0,sK0) = sK0,
    inference(light_normalisation,[status(thm)],[c_340,c_914,c_915]) ).

tcf(c_1121,plain,
    ! [X0: $i] : sK2(sK0,X0) = sK9(X0,sK0),
    inference(superposition,[status(thm)],[c_1034,c_470]) ).

tcf(c_1137,plain,
    ! [X0: $i] :
      ( ~ r1(sK0)
      | ~ r1(sK2(sK0,X0)) ),
    inference(superposition,[status(thm)],[c_1121,c_904]) ).

tcf(c_1138,plain,
    ! [X0: $i] : ~ r1(sK2(sK0,X0)),
    inference(forward_subsumption_resolution,[status(thm)],[c_1137,c_50]) ).

tcf(c_1140,plain,
    ~ r1(sK0),
    inference(superposition,[status(thm)],[c_945,c_1138]) ).

tcf(c_1142,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1140,c_50]) ).


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