↑ Up

iProver---3.9.4.THM-CRf.s

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

% Computer : n006.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:48:54 PM UTC 2026

% Result   : Theorem 2.27s 6.28s
% Output   : CNFRefutation 2.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   23
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   83 (  23 unt;   6 def)
%            Number of atoms       :  263 (  88 equ)
%            Maximal formula atoms :   10 (   3 avg)
%            Number of connectives :  214 (  90   ~;  95   |;  23   &)
%                                         (   5 <=>;   0  =>;   0  <=;   1 <~>)
%            Maximal formula depth :    9 (   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  :    9 (   7 usr;   7 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :  130 (   0 sgn 116   !;  14   ?;  41   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).

fof(f3,axiom,
    ! [X0,X1] :
      ( X1 = singleton(X0)
    <=> ! [X2] :
          ( in(X2,X1)
        <=> X2 = X0 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tarski) ).

fof(f4,axiom,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).

fof(f6,axiom,
    ! [X0,X1,X2,X3] :
      ( in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
    <=> ( in(X1,X3)
        & in(X0,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l55_zfmisc_1) ).

fof(f9,conjecture,
    ! [X0,X1,X2,X3] :
      ( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
    <=> ( X1 = X3
        & X0 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t34_zfmisc_1) ).

fof(f10,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
      <=> ( X1 = X3
          & X0 = X2 ) ),
    inference(negated_conjecture,[status(cth)],[f9]) ).

fof(f12,plain,
    ? [X0,X1,X2,X3] :
      ( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
    <~> ( X1 = X3
        & X0 = X2 ) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f13,plain,
    ! [X0,X1] :
      ( ( singleton(X0) != X1
        | ! [X2] :
            ( ( ~ in(X2,X1)
              | X2 = X0 )
            & ( X0 != X2
              | in(X2,X1) ) ) )
      & ( ? [X2] :
            ( ( in(X2,X1)
              | X2 = X0 )
            & ( ~ in(X2,X1)
              | X0 != X2 ) )
        | X1 = singleton(X0) ) ),
    inference(nnf_transformation,[],[f3]) ).

fof(f14,plain,
    ! [X0,X1] :
      ( ( singleton(X0) != X1
        | ! [X3] :
            ( ( ~ in(X3,X1)
              | X0 = X3 )
            & ( X0 != X3
              | in(X3,X1) ) ) )
      & ( ? [X2] :
            ( ( in(X2,X1)
              | X2 = X0 )
            & ( ~ in(X2,X1)
              | X0 != X2 ) )
        | X1 = singleton(X0) ) ),
    inference(rectify,[],[f13]) ).

fof(f15,plain,
    ! [X0,X1] :
      ( ( singleton(X0) != X1
        | ! [X3] :
            ( ( ~ in(X3,X1)
              | X0 = X3 )
            & ( X0 != X3
              | in(X3,X1) ) ) )
      & ( ( ( in(sK0(X0,X1),X1)
            | sK0(X0,X1) = X0 )
          & ( ~ in(sK0(X0,X1),X1)
            | sK0(X0,X1) != X0 ) )
        | X1 = singleton(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f14]) ).

fof(f16,plain,
    ! [X0,X1,X2,X3] :
      ( ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
        | ( in(X1,X3)
          & in(X0,X2) ) )
      & ( ~ in(X1,X3)
        | ~ in(X0,X2)
        | in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
    inference(nnf_transformation,[],[f6]) ).

fof(f17,plain,
    ! [X0,X1,X2,X3] :
      ( ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
        | ( in(X1,X3)
          & in(X0,X2) ) )
      & ( ~ in(X1,X3)
        | ~ in(X0,X2)
        | in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ) ),
    inference(flattening,[],[f16]) ).

fof(f20,plain,
    ? [X0,X1,X2,X3] :
      ( ( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
        | ( X1 = X3
          & X0 = X2 ) )
      & ( ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
        | X1 != X3
        | X0 != X2 ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f21,plain,
    ? [X0,X1,X2,X3] :
      ( ( in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
        | ( X1 = X3
          & X0 = X2 ) )
      & ( ~ in(ordered_pair(X0,X1),cartesian_product2(singleton(X2),singleton(X3)))
        | X1 != X3
        | X0 != X2 ) ),
    inference(flattening,[],[f20]) ).

fof(f22,plain,
    ( ( in(ordered_pair(sK3,sK4),cartesian_product2(singleton(sK5),singleton(sK6)))
      | ( sK4 = sK6
        & sK3 = sK5 ) )
    & ( ~ in(ordered_pair(sK3,sK4),cartesian_product2(singleton(sK5),singleton(sK6)))
      | sK4 != sK6
      | sK3 != sK5 ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3,sK4,sK5,sK6]),skolemize(X0,sK3),skolemize(X1,sK4),skolemize(X2,sK5),skolemize(X3,sK6)],[f21]) ).

fof(f24,plain,
    ! [X0,X1] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f25,plain,
    ! [X3,X0,X1] :
      ( singleton(X0) != X1
      | ~ in(X3,X1)
      | X0 = X3 ),
    inference(cnf_transformation,[],[f15]) ).

fof(f26,plain,
    ! [X3,X0,X1] :
      ( singleton(X0) != X1
      | X0 != X3
      | in(X3,X1) ),
    inference(cnf_transformation,[],[f15]) ).

fof(f29,plain,
    ! [X0,X1] : ordered_pair(X0,X1) = unordered_pair(unordered_pair(X0,X1),singleton(X0)),
    inference(cnf_transformation,[],[f4]) ).

fof(f31,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
      | in(X1,X3) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f32,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(ordered_pair(X0,X1),cartesian_product2(X2,X3))
      | in(X0,X2) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f33,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(X1,X3)
      | ~ in(X0,X2)
      | in(ordered_pair(X0,X1),cartesian_product2(X2,X3)) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f36,plain,
    ( in(ordered_pair(sK3,sK4),cartesian_product2(singleton(sK5),singleton(sK6)))
    | sK4 = sK6 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f37,plain,
    ( in(ordered_pair(sK3,sK4),cartesian_product2(singleton(sK5),singleton(sK6)))
    | sK3 = sK5 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f38,plain,
    ( ~ in(ordered_pair(sK3,sK4),cartesian_product2(singleton(sK5),singleton(sK6)))
    | sK4 != sK6
    | sK3 != sK5 ),
    inference(cnf_transformation,[],[f22]) ).

fof(f40,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(X1,X3)
      | ~ in(X0,X2)
      | in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3)) ),
    inference(definition_unfolding,[],[f33,f29]) ).

fof(f41,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3))
      | in(X0,X2) ),
    inference(definition_unfolding,[],[f32,f29]) ).

fof(f42,plain,
    ! [X2,X3,X0,X1] :
      ( ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3))
      | in(X1,X3) ),
    inference(definition_unfolding,[],[f31,f29]) ).

fof(f43,plain,
    ( ~ in(unordered_pair(unordered_pair(sK3,sK4),singleton(sK3)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | sK4 != sK6
    | sK3 != sK5 ),
    inference(definition_unfolding,[],[f38,f29]) ).

fof(f44,plain,
    ( in(unordered_pair(unordered_pair(sK3,sK4),singleton(sK3)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | sK3 = sK5 ),
    inference(definition_unfolding,[],[f37,f29]) ).

fof(f45,plain,
    ( in(unordered_pair(unordered_pair(sK3,sK4),singleton(sK3)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | sK4 = sK6 ),
    inference(definition_unfolding,[],[f36,f29]) ).

fof(f46,plain,
    ! [X3,X1] :
      ( singleton(X3) != X1
      | in(X3,X1) ),
    inference(equality_resolution,[],[f26]) ).

fof(f47,plain,
    ! [X3] : in(X3,singleton(X3)),
    inference(equality_resolution,[],[f46]) ).

fof(f48,plain,
    ! [X3,X0] :
      ( ~ in(X3,singleton(X0))
      | X0 = X3 ),
    inference(equality_resolution,[],[f25]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i] : unordered_pair(X0,X1) = unordered_pair(X1,X0),
    inference(cnf_transformation,[],[f24]) ).

tcf(c_53,plain,
    ! [X0: $i] : in(X0,singleton(X0)),
    inference(cnf_transformation,[],[f47]) ).

tcf(c_54,plain,
    ! [X0: $i,X1: $i] :
      ( ( X0 = X1 )
      | ~ in(X0,singleton(X1)) ),
    inference(cnf_transformation,[],[f48]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( in(unordered_pair(unordered_pair(X2,X0),singleton(X2)),cartesian_product2(X3,X1))
      | ~ in(X2,X3)
      | ~ in(X0,X1) ),
    inference(cnf_transformation,[],[f40]) ).

tcf(c_57,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( in(X0,X2)
      | ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3)) ),
    inference(cnf_transformation,[],[f41]) ).

tcf(c_58,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( in(X1,X3)
      | ~ in(unordered_pair(unordered_pair(X0,X1),singleton(X0)),cartesian_product2(X2,X3)) ),
    inference(cnf_transformation,[],[f42]) ).

tcf(c_61,negated_conjecture,
    ( ~ in(unordered_pair(unordered_pair(sK3,sK4),singleton(sK3)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | ( sK4 != sK6 )
    | ( sK3 != sK5 ) ),
    inference(cnf_transformation,[],[f43]) ).

tcf(c_62,negated_conjecture,
    ( in(unordered_pair(unordered_pair(sK3,sK4),singleton(sK3)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | ( sK3 = sK5 ) ),
    inference(cnf_transformation,[],[f44]) ).

tcf(c_63,negated_conjecture,
    ( in(unordered_pair(unordered_pair(sK3,sK4),singleton(sK3)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | ( sK4 = sK6 ) ),
    inference(cnf_transformation,[],[f45]) ).

tcf(c_137,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( in(X1,X3)
      | ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(X2,X3)) ),
    inference(demodulation,[status(thm)],[c_58,c_50]) ).

tcf(c_144,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( in(X0,X2)
      | ~ in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),cartesian_product2(X2,X3)) ),
    inference(demodulation,[status(thm)],[c_57,c_50]) ).

tcf(c_151,plain,
    ( in(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | ( sK4 = sK6 ) ),
    inference(demodulation,[status(thm)],[c_63,c_50]) ).

tcf(c_158,plain,
    ( in(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | ( sK3 = sK5 ) ),
    inference(demodulation,[status(thm)],[c_62,c_50]) ).

tcf(c_171,plain,
    ! [X0: $i,X1: $i,X2: $i,X3: $i] :
      ( in(unordered_pair(singleton(X2),unordered_pair(X2,X0)),cartesian_product2(X3,X1))
      | ~ in(X2,X3)
      | ~ in(X0,X1) ),
    inference(demodulation,[status(thm)],[c_56,c_50]) ).

tcf(c_187,plain,
    ( ~ in(unordered_pair(singleton(sK3),unordered_pair(sK3,sK4)),cartesian_product2(singleton(sK5),singleton(sK6)))
    | ( sK4 != sK6 )
    | ( sK3 != sK5 ) ),
    inference(demodulation,[status(thm)],[c_61,c_50]) ).

tcf(c_218,definition,
    iPr_def_10 = singleton(sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_219,definition,
    iPr_def_11 = unordered_pair(sK3,sK4),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_220,definition,
    iPr_def_12 = unordered_pair(iPr_def_10,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_221,definition,
    iPr_def_13 = singleton(sK5),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_222,definition,
    iPr_def_14 = singleton(sK6),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_223,definition,
    iPr_def_15 = cartesian_product2(iPr_def_13,iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_224,plain,
    ( ~ in(iPr_def_12,iPr_def_15)
    | ( sK4 != sK6 )
    | ( sK3 != sK5 ) ),
    inference(demodulation,[status(thm)],[c_187,c_222,c_221,c_223,c_219,c_218,c_220]) ).

tcf(c_225,plain,
    ( in(iPr_def_12,iPr_def_15)
    | ( sK3 = sK5 ) ),
    inference(demodulation,[status(thm)],[c_158]) ).

tcf(c_226,plain,
    ( in(iPr_def_12,iPr_def_15)
    | ( sK4 = sK6 ) ),
    inference(demodulation,[status(thm)],[c_151]) ).

tcf(c_469,plain,
    in(sK3,iPr_def_10),
    inference(superposition,[status(thm)],[c_218,c_53]) ).

tcf(c_471,plain,
    in(sK6,iPr_def_14),
    inference(superposition,[status(thm)],[c_222,c_53]) ).

tcf(c_518,plain,
    ! [X0: $i,X1: $i] :
      ( in(sK4,X1)
      | ~ in(unordered_pair(singleton(sK3),iPr_def_11),cartesian_product2(X0,X1)) ),
    inference(superposition,[status(thm)],[c_219,c_137]) ).

tcf(c_525,plain,
    ! [X0: $i,X1: $i] :
      ( in(sK4,X1)
      | ~ in(iPr_def_12,cartesian_product2(X0,X1)) ),
    inference(light_normalisation,[status(thm)],[c_518,c_218,c_220]) ).

tcf(c_548,plain,
    ! [X0: $i] :
      ( ( X0 = sK5 )
      | ~ in(X0,iPr_def_13) ),
    inference(superposition,[status(thm)],[c_221,c_54]) ).

tcf(c_549,plain,
    ! [X0: $i] :
      ( ( X0 = sK6 )
      | ~ in(X0,iPr_def_14) ),
    inference(superposition,[status(thm)],[c_222,c_54]) ).

tcf(c_557,plain,
    ( ( sK3 = sK5 )
    | ~ in(sK3,iPr_def_13) ),
    inference(instantiation,[status(thm)],[c_548]) ).

tcf(c_567,plain,
    ! [X0: $i,X1: $i] :
      ( in(sK3,X0)
      | ~ in(unordered_pair(singleton(sK3),iPr_def_11),cartesian_product2(X0,X1)) ),
    inference(superposition,[status(thm)],[c_219,c_144]) ).

tcf(c_574,plain,
    ! [X0: $i,X1: $i] :
      ( in(sK3,X0)
      | ~ in(iPr_def_12,cartesian_product2(X0,X1)) ),
    inference(light_normalisation,[status(thm)],[c_567,c_218,c_220]) ).

tcf(c_790,plain,
    ( in(sK4,iPr_def_14)
    | ~ in(iPr_def_12,iPr_def_15) ),
    inference(superposition,[status(thm)],[c_223,c_525]) ).

tcf(c_799,plain,
    ( in(sK4,iPr_def_14)
    | ( sK4 = sK6 ) ),
    inference(superposition,[status(thm)],[c_226,c_790]) ).

tcf(c_809,plain,
    sK4 = sK6,
    inference(forward_subsumption_resolution,[status(thm)],[c_799,c_549]) ).

tcf(c_815,plain,
    in(sK4,iPr_def_14),
    inference(demodulation,[status(thm)],[c_471,c_809]) ).

tcf(c_817,plain,
    ( ~ in(iPr_def_12,iPr_def_15)
    | ( sK4 != sK4 )
    | ( sK3 != sK5 ) ),
    inference(demodulation,[status(thm)],[c_224,c_809]) ).

tcf(c_820,plain,
    ( ~ in(iPr_def_12,iPr_def_15)
    | ( sK3 != sK5 ) ),
    inference(equality_resolution_simp,[status(thm)],[c_817]) ).

tcf(c_930,plain,
    ( in(sK3,iPr_def_13)
    | ~ in(iPr_def_12,iPr_def_15) ),
    inference(superposition,[status(thm)],[c_223,c_574]) ).

tcf(c_933,plain,
    ~ in(iPr_def_12,iPr_def_15),
    inference(global_subsumption_just,[status(thm)],[c_930,c_557,c_820,c_930]) ).

tcf(c_935,plain,
    sK3 = sK5,
    inference(backward_subsumption_resolution,[status(thm)],[c_225,c_933]) ).

tcf(c_941,plain,
    singleton(sK3) = iPr_def_13,
    inference(demodulation,[status(thm)],[c_221,c_935]) ).

tcf(c_942,plain,
    iPr_def_10 = iPr_def_13,
    inference(light_normalisation,[status(thm)],[c_941,c_218]) ).

tcf(c_943,plain,
    cartesian_product2(iPr_def_10,iPr_def_14) = iPr_def_15,
    inference(demodulation,[status(thm)],[c_223,c_942]) ).

tcf(c_949,plain,
    ! [X0: $i,X1: $i] :
      ( in(unordered_pair(singleton(X0),unordered_pair(X0,X1)),iPr_def_15)
      | ~ in(X1,iPr_def_14)
      | ~ in(X0,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_943,c_171]) ).

tcf(c_1219,plain,
    ( in(unordered_pair(singleton(sK3),iPr_def_11),iPr_def_15)
    | ~ in(sK4,iPr_def_14)
    | ~ in(sK3,iPr_def_10) ),
    inference(superposition,[status(thm)],[c_219,c_949]) ).

tcf(c_1227,plain,
    ( in(iPr_def_12,iPr_def_15)
    | ~ in(sK4,iPr_def_14)
    | ~ in(sK3,iPr_def_10) ),
    inference(light_normalisation,[status(thm)],[c_1219,c_218,c_220]) ).

tcf(c_1228,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_1227,c_933,c_815,c_469]) ).


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