↑ Up

iProver---3.9.4.THM-CRf.s

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

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

% Result   : Theorem 0.45s 11.29s
% Output   : CNFRefutation 0.45s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   18 (   5 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   39 (  20   ~;  13   |;   3   &)
%                                         (   2 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    8 (   5 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  :    3 (   2 usr;   2 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   69 (   0 sgn  51   !;  18   ?;  15   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,conjecture,
    ( ! [X0,X1,X2] : f(X0,X1,X2)
  <=> ~ ? [X3,X4,X5] : ~ f(X3,X4,X5) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish250) ).

fof(f2,negated_conjecture,
    ~ ( ! [X0,X1,X2] : f(X0,X1,X2)
    <=> ~ ? [X3,X4,X5] : ~ f(X3,X4,X5) ),
    inference(negated_conjecture,[status(cth)],[f1]) ).

fof(f3,plain,
    ( ! [X0,X1,X2] : f(X0,X1,X2)
  <~> ! [X3,X4,X5] : f(X3,X4,X5) ),
    inference(ennf_transformation,[],[f2]) ).

fof(f4,plain,
    ( ( ! [X0,X1,X2] : f(X0,X1,X2)
      | ! [X3,X4,X5] : f(X3,X4,X5) )
    & ( ? [X0,X1,X2] : ~ f(X0,X1,X2)
      | ? [X3,X4,X5] : ~ f(X3,X4,X5) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f5,plain,
    ( ( ! [X9,X10,X11] : f(X9,X10,X11)
      | ! [X6,X7,X8] : f(X6,X7,X8) )
    & ( ? [X3,X4,X5] : ~ f(X3,X4,X5)
      | ? [X0,X1,X2] : ~ f(X0,X1,X2) ) ),
    inference(rectify,[],[f4]) ).

fof(f6,plain,
    ( ( ! [X9,X10,X11] : f(X9,X10,X11)
      | ! [X6,X7,X8] : f(X6,X7,X8) )
    & ( ~ f(sK3,sK4,sK5)
      | ~ f(sK0,sK1,sK2) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5)],[f5]) ).

fof(f7,plain,
    ! [X10,X11,X8,X6,X9,X7] :
      ( f(X9,X10,X11)
      | f(X6,X7,X8) ),
    inference(cnf_transformation,[],[f6]) ).

fof(f8,plain,
    ( ~ f(sK3,sK4,sK5)
    | ~ f(sK0,sK1,sK2) ),
    inference(cnf_transformation,[],[f6]) ).

tcf(c_49,negated_conjecture,
    ( ~ f(sK3,sK4,sK5)
    | ~ f(sK0,sK1,sK2) ),
    inference(cnf_transformation,[],[f8]) ).

tcf(c_50,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i,X5: $i] :
      ( f(X3,X4,X5)
      | f(X0,X1,X2) ),
    inference(cnf_transformation,[],[f7]) ).

tcf(c_60,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( ~ iPr_def_10
      | f(X0,X1,X2) ),
    inference(splitting,[splitting(split),new_symbols(definition,[iPr_def_10])],[c_50]) ).

tcf(c_61,negated_conjecture,
    iPr_def_10,
    inference(splitting,[splitting(split),new_symbols(definition,[])],[c_50]) ).

tcf(c_62,negated_conjecture,
    iPr_def_10,
    inference(demodulation,[status(thm)],[c_61]) ).

tcf(c_64,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] :
      ( f(X0,X1,X2)
      | ~ iPr_def_10 ),
    inference(demodulation,[status(thm)],[c_60]) ).

tcf(c_65,negated_conjecture,
    ( ~ f(sK3,sK4,sK5)
    | ~ f(sK0,sK1,sK2) ),
    inference(demodulation,[status(thm)],[c_49]) ).

tcf(c_68,negated_conjecture,
    ! [X0: $i,X1: $i,X2: $i] : f(X0,X1,X2),
    inference(global_subsumption_just,[status(thm)],[c_64,c_62,c_64]) ).

tcf(c_70,plain,
    ~ f(sK3,sK4,sK5),
    inference(resolution,[status(thm)],[c_65,c_68]) ).

tcf(c_71,plain,
    $false,
    inference(resolution,[status(thm)],[c_70,c_68]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN411+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.11/10.38  % Computer : n014.cluster.edu
% 0.11/10.38  % Model    : x86_64 x86_64
% 0.11/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.38  % Memory   : 8046.5625MB
% 0.11/10.38  % OS       : Linux 6.8.0-71-generic
% 0.11/10.38  % CPULimit : 300
% 0.11/10.38  % WCLimit  : 300
% 0.11/10.38  % DateTime : Fri Sep 25 01:05:58 UTC 2026
% 0.11/10.38  % CPUTime  : 
% 0.11/10.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/10.42  Running first-order theorem proving
% 0.15/10.42  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.15/10.43  
% 0.15/10.43  % ======== iProver multi-core TPTP/SMT =========
% 0.15/10.43  
% 0.15/10.44  % Detected problem language: tptp
% 0.15/10.45  % Proving...
% 0.45/11.29  % SZS status Started for theBenchmark.p
% 0.45/11.29  % SZS status Theorem for theBenchmark.p
% 0.45/11.29  
% 0.45/11.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.45/11.29  
% 0.45/11.29  % ------  iProver source info
% 0.45/11.29  
% 0.45/11.29  % git: date: 2026-07-19 20:42:38 +0200
% 0.45/11.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.45/11.29  % git: non_committed_changes: false
% 0.45/11.29  
% 0.45/11.29  % ------ Parsing...
% 0.45/11.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.45/11.29  % 
% 0.45/11.29  
% 0.45/11.29  % ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e % 
% 0.45/11.29  
% 0.45/11.29  % ------ Preprocessing...% ------  preprocesses with Option_epr_non_horn_non_eq
% 0.45/11.29   gs_s  sp: 2 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 0.45/11.29  % ------ Proving...
% 0.45/11.29  % ------ Problem Properties 
% 0.45/11.29  
% 0.45/11.29  % 
% 0.45/11.29  % clauses                               3
% 0.45/11.29  % conjectures                           3
% 0.45/11.29  % EPR                                   3
% 0.45/11.29  % Horn                                  3
% 0.45/11.29  % unary                                 1
% 0.45/11.29  % binary                                2
% 0.45/11.29  % lits                                  5
% 0.45/11.29  % lits eq                               0
% 0.45/11.29  % fd_pure                               0
% 0.45/11.29  % fd_pseudo                             0
% 0.45/11.29  % fd_cond                               0
% 0.45/11.29  % fd_pseudo_cond                        0
% 0.45/11.29  % AC symbols                            0
% 0.45/11.29  
% 0.45/11.29  % ------ Schedule EPR Horn non eq is on
% 0.45/11.29  
% 0.45/11.29  % ------ no equalities: superposition off 
% 0.45/11.29  
% 0.45/11.29  % ------ Option_epr_horn Time Limit: Unbounded
% 0.45/11.29  
% 0.45/11.29  
% 0.45/11.29  % ------ 
% 0.45/11.29  % Current options:
% 0.45/11.29  % ------ 
% 0.45/11.29  
% 0.45/11.29  
% 0.45/11.29  % 
% 0.45/11.29  
% 0.45/11.29  % ------ Proving...
% 0.45/11.29  % 
% 0.45/11.29  
% 0.45/11.29  % SZS status Theorem for theBenchmark.p
% 0.45/11.29  
% 0.45/11.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.45/11.29  
% 0.45/11.29  
%------------------------------------------------------------------------------