↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n003.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:08:10 PM UTC 2026

% Result   : Theorem 1.20s 1.30s
% Output   : CNFRefutation 1.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   19 (   9 unt;   0 def)
%            Number of atoms       :   62 (   0 equ)
%            Maximal formula atoms :    6 (   3 avg)
%            Number of connectives :   95 (  52   ~;  29   |;  14   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 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 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :   27 (   0 sgn  21   !;   6   ?;   3   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : r1(X0,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity) ).

fof(f3,conjecture,
    ~ ? [X0] :
        ~ ( ~ ( p101(X0)
              & p201(X0) )
          | ~ ! [X1] :
                ( ! [X0] :
                    ( ~ ( p101(X0)
                        & p201(X0) )
                    | ~ r1(X1,X0) )
                | ~ r1(X0,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',main) ).

fof(f4,negated_conjecture,
    ~ ~ ? [X0] :
          ~ ( ~ ( p101(X0)
                & p201(X0) )
            | ~ ! [X1] :
                  ( ! [X0] :
                      ( ~ ( p101(X0)
                          & p201(X0) )
                      | ~ r1(X1,X0) )
                  | ~ r1(X0,X1) ) ),
    inference(negated_conjecture,[status(cth)],[f3]) ).

fof(f5,plain,
    ~ ~ ? [X0] :
          ~ ( ~ ( p101(X0)
                & p201(X0) )
            | ~ ! [X1] :
                  ( ! [X2] :
                      ( ~ ( p101(X2)
                          & p201(X2) )
                      | ~ r1(X1,X2) )
                  | ~ r1(X0,X1) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ? [X0] :
      ~ ( ~ ( p101(X0)
            & p201(X0) )
        | ~ ! [X1] :
              ( ! [X2] :
                  ( ~ ( p101(X2)
                      & p201(X2) )
                  | ~ r1(X1,X2) )
              | ~ r1(X0,X1) ) ),
    inference(flattening,[],[f5]) ).

fof(f9,plain,
    ? [X0] :
      ( p101(X0)
      & p201(X0)
      & ! [X1] :
          ( ! [X2] :
              ( ~ p101(X2)
              | ~ p201(X2)
              | ~ r1(X1,X2) )
          | ~ r1(X0,X1) ) ),
    inference(ennf_transformation,[],[f6]) ).

fof(f10,plain,
    ? [X0] :
      ( p101(X0)
      & p201(X0)
      & ! [X1] :
          ( ! [X2] :
              ( ~ p101(X2)
              | ~ p201(X2)
              | ~ r1(X1,X2) )
          | ~ r1(X0,X1) ) ),
    inference(flattening,[],[f9]) ).

fof(f11,plain,
    ( p101(sK0)
    & p201(sK0)
    & ! [X1] :
        ( ! [X2] :
            ( ~ p101(X2)
            | ~ p201(X2)
            | ~ r1(X1,X2) )
        | ~ r1(sK0,X1) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f10]) ).

fof(f12,plain,
    ! [X0] : r1(X0,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f14,plain,
    p101(sK0),
    inference(cnf_transformation,[],[f11]) ).

fof(f15,plain,
    p201(sK0),
    inference(cnf_transformation,[],[f11]) ).

fof(f16,plain,
    ! [X2,X1] :
      ( ~ p101(X2)
      | ~ p201(X2)
      | ~ r1(X1,X2)
      | ~ r1(sK0,X1) ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_49,plain,
    ! [X0: $i] : r1(X0,X0),
    inference(cnf_transformation,[],[f12]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( ~ p101(X1)
      | ~ p201(X1)
      | ~ r1(sK0,X0)
      | ~ r1(X0,X1) ),
    inference(cnf_transformation,[],[f16]) ).

tcf(c_52,negated_conjecture,
    p201(sK0),
    inference(cnf_transformation,[],[f15]) ).

tcf(c_53,negated_conjecture,
    p101(sK0),
    inference(cnf_transformation,[],[f14]) ).

tcf(c_54,plain,
    r1(sK0,sK0),
    inference(instantiation,[status(thm)],[c_49]) ).

tcf(c_55,plain,
    ( ~ p101(sK0)
    | ~ p201(sK0)
    | ~ r1(sK0,sK0) ),
    inference(instantiation,[status(thm)],[c_51]) ).

tcf(c_56,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_55,c_54,c_52,c_53]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL684+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38  % Computer : n003.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Thu Sep 24 00:20:21 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.12/0.43  
% 0.12/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.43  
% 0.12/0.43  % Detected problem language: tptp
% 0.12/0.45  % Proving...
% 1.20/1.30  % SZS status Started for theBenchmark.p
% 1.20/1.30  % SZS status Theorem for theBenchmark.p
% 1.20/1.30  
% 1.20/1.30  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.20/1.30  
% 1.20/1.30  % ------  iProver source info
% 1.20/1.30  
% 1.20/1.30  % git: date: 2026-07-19 20:42:38 +0200
% 1.20/1.30  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.20/1.30  % git: non_committed_changes: false
% 1.20/1.30  
% 1.20/1.30  % ------ Parsing...
% 1.20/1.30  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_horn
% 1.20/1.30  % 
% 1.20/1.30  
% 1.20/1.30  % ------ Preprocessing...% 
% 1.20/1.30  
% 1.20/1.30  % SZS status Theorem for theBenchmark.p
% 1.20/1.30  
% 1.20/1.30  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.20/1.30  
% 1.20/1.30  
%------------------------------------------------------------------------------