↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n007.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:56:34 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(f39,axiom,
    ! [X0] :
      ( one_sorted_str(X0)
     => cast_as_carrier_subset(X0) = the_carrier(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_pre_topc) ).

fof(f40,conjecture,
    ! [X0] :
      ( one_sorted_str(X0)
     => cast_as_carrier_subset(X0) = the_carrier(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_pre_topc) ).

fof(f41,negated_conjecture,
    ~ ! [X0] :
        ( one_sorted_str(X0)
       => cast_as_carrier_subset(X0) = the_carrier(X0) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

fof(f82,plain,
    ! [X0] :
      ( ~ one_sorted_str(X0)
      | cast_as_carrier_subset(X0) = the_carrier(X0) ),
    inference(ennf_transformation,[],[f39]) ).

fof(f83,plain,
    ? [X0] :
      ( one_sorted_str(X0)
      & cast_as_carrier_subset(X0) != the_carrier(X0) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f89,plain,
    ( one_sorted_str(sK5)
    & cast_as_carrier_subset(sK5) != the_carrier(sK5) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK5]),skolemize(X0,sK5)],[f83]) ).

fof(f144,plain,
    ! [X0] :
      ( ~ one_sorted_str(X0)
      | cast_as_carrier_subset(X0) = the_carrier(X0) ),
    inference(cnf_transformation,[],[f82]) ).

fof(f145,plain,
    one_sorted_str(sK5),
    inference(cnf_transformation,[],[f89]) ).

fof(f146,plain,
    cast_as_carrier_subset(sK5) != the_carrier(sK5),
    inference(cnf_transformation,[],[f89]) ).

tcf(c_103,plain,
    ! [X0: $i] :
      ( ( cast_as_carrier_subset(X0) = the_carrier(X0) )
      | ~ one_sorted_str(X0) ),
    inference(cnf_transformation,[],[f144]) ).

tcf(c_104,negated_conjecture,
    cast_as_carrier_subset(sK5) != the_carrier(sK5),
    inference(cnf_transformation,[],[f146]) ).

tcf(c_105,negated_conjecture,
    one_sorted_str(sK5),
    inference(cnf_transformation,[],[f145]) ).

tcf(c_559,plain,
    ! [X0: $i] :
      ( ( cast_as_carrier_subset(X0) = the_carrier(X0) )
      | ( X0 != sK5 ) ),
    inference(resolution_lifted,[status(thm)],[c_103,c_105]) ).

tcf(c_560,plain,
    cast_as_carrier_subset(sK5) = the_carrier(sK5),
    inference(unflattening,[status(thm)],[c_559]) ).

tcf(c_561,plain,
    $false,
    inference(prop_impl_just,[status(thm)],[c_560,c_104]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SEU306+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07  % Command  : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.44  % Computer : n007.cluster.edu
% 0.17/0.44  % Model    : x86_64 x86_64
% 0.17/0.44  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44  % Memory   : 8046.5625MB
% 0.17/0.44  % OS       : Linux 6.8.0-71-generic
% 0.17/0.44  % CPULimit : 300
% 0.17/0.44  % WCLimit  : 300
% 0.17/0.44  % DateTime : Thu Sep 24 13:35:38 UTC 2026
% 0.17/0.45  % CPUTime  : 
% 0.17/0.45  Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.50  Running first-order theorem proving
% 0.17/0.50  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.26/0.52  
% 0.26/0.52  % ======== iProver multi-core TPTP/SMT =========
% 0.26/0.52  
% 0.26/0.52  % Detected problem language: tptp
% 0.26/0.54  % Proving...
% 1.91/1.51  % SZS status Started for theBenchmark.p
% 1.91/1.51  % SZS status Theorem for theBenchmark.p
% 1.91/1.51  
% 1.91/1.51  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.91/1.51  
% 1.91/1.51  % ------  iProver source info
% 1.91/1.51  
% 1.91/1.51  % git: date: 2026-07-19 20:42:38 +0200
% 1.91/1.51  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.91/1.51  % git: non_committed_changes: false
% 1.91/1.51  
% 1.91/1.51  % ------ Parsing...
% 1.91/1.51  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 1.91/1.51  
% 1.91/1.51  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 40 0s  sf_e  pe_s  pe:1:0s% 
% 1.91/1.51  
% 1.91/1.51  % SZS status Theorem for theBenchmark.p
% 1.91/1.51  
% 1.91/1.51  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.91/1.51  
% 1.91/1.51  
%------------------------------------------------------------------------------