↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : SYN965+1 : TPTP v9.3.1. Released v3.1.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 03:45:32 PM UTC 2026

% Result   : Theorem 1.14s 1.26s
% Output   : CNFRefutation 1.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   14 (   3 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   40 (  14   ~;   9   |;  13   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   6 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   0 con; 1-1 aty)
%            Number of variables   :   39 (   0 sgn  31   !;   8   ?;  12   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ? [X0] :
    ! [X1] :
    ? [X2] :
      ( ( ( p(X2,X0)
          & p(X0,X2) )
       => p(X2,X1) )
      & ( p(X2,X1)
       => ? [X3] : p(X3,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f2,negated_conjecture,
    ~ ? [X0] :
      ! [X1] :
      ? [X2] :
        ( ( ( p(X2,X0)
            & p(X0,X2) )
         => p(X2,X1) )
        & ( p(X2,X1)
         => ? [X3] : p(X3,X2) ) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( p(X2,X0)
        & p(X0,X2)
        & ~ p(X2,X1) )
      | ( p(X2,X1)
        & ! [X3] : ~ p(X3,X2) ) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ! [X0] :
    ? [X1] :
    ! [X2] :
      ( ( p(X2,X0)
        & p(X0,X2)
        & ~ p(X2,X1) )
      | ( p(X2,X1)
        & ! [X3] : ~ p(X3,X2) ) ),
    inference(flattening,[],[f3]) ).

fof(f5,plain,
    ! [X0,X2] :
      ( ( p(X2,X0)
        & p(X0,X2)
        & ~ p(X2,sK0(X0)) )
      | ( p(X2,sK0(X0))
        & ! [X3] : ~ p(X3,X2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f4]) ).

fof(f7,plain,
    ! [X2,X0] :
      ( p(X0,X2)
      | p(X2,sK0(X0)) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f9,plain,
    ! [X2,X3,X0] :
      ( p(X2,X0)
      | ~ p(X3,X2) ),
    inference(cnf_transformation,[],[f5]) ).

fof(f11,plain,
    ! [X2,X3,X0] :
      ( ~ p(X2,sK0(X0))
      | ~ p(X3,X2) ),
    inference(cnf_transformation,[],[f5]) ).

tcf(c_49,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ p(X2,X0)
      | ~ p(X0,sK0(X1)) ),
    inference(cnf_transformation,[],[f11]) ).

tcf(c_51,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( p(X1,X2)
      | ~ p(X0,X1) ),
    inference(cnf_transformation,[],[f9]) ).

tcf(c_52,negated_conjecture,
    ! [X0: $i,X1: $i] :
      ( p(X1,X0)
      | p(X0,sK0(X1)) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_63,plain,
    ! [X0: $i,X1: $i] : p(X0,sK0(X1)),
    inference(backward_subsumption_resolution,[status(thm)],[c_52,c_51]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i] : ~ p(X0,X1),
    inference(backward_subsumption_resolution,[status(thm)],[c_49,c_51]) ).

tcf(c_69,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_63,c_65]) ).


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