↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE027+4 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover 300 /export/starexec/sandbox/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 01:52:13 PM UTC 2026

% Result   : Theorem 65.73s 12.39s
% Output   : CNFRefutation 65.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :   21
% Syntax   : Number of formulae    :   96 (  67 unt;   8 def)
%            Number of atoms       :  209 (  88 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :  100 (  41   ~;  32   |;  19   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   13 (  11 usr;   9 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  116 (   0 sgn 106   !;  10   ?;  37   :)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_commutativity) ).

fof(f2,axiom,
    ! [X0,X1,X2] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_associativity) ).

fof(f3,axiom,
    ! [X0] : addition(X0,zero) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_identity) ).

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',additive_idempotence) ).

fof(f5,axiom,
    ! [X0,X1,X2] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).

fof(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

fof(f8,axiom,
    ! [X0,X1,X2] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_distributivity) ).

fof(f10,axiom,
    ! [X0] : multiplication(X0,zero) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',right_annihilation) ).

fof(f11,axiom,
    ! [X0] : multiplication(zero,X0) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_annihilation) ).

fof(f12,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',order) ).

fof(f14,axiom,
    ! [X0,X1] :
      ( complement(X1,X0)
    <=> ( addition(X0,X1) = one
        & multiplication(X1,X0) = zero
        & multiplication(X0,X1) = zero ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_2) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( test(X0)
     => ( c(X0) = X1
      <=> complement(X0,X1) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_3) ).

fof(f19,conjecture,
    ! [X0,X1,X2,X3,X4] :
      ( ( test(X4)
        & test(X3) )
     => ( leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
        & leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

fof(f20,negated_conjecture,
    ~ ! [X0,X1,X2,X3,X4] :
        ( ( test(X4)
          & test(X3) )
       => ( leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
          & leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) ) ),
    inference(negated_conjecture,[status(cth)],[f19]) ).

fof(f21,plain,
    ! [X0,X1] :
      ( addition(X0,X1) = X1
     => leq(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f12]) ).

fof(f22,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != X1
      | leq(X0,X1) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f23,plain,
    ! [X0,X1] :
      ( ~ test(X0)
      | ( c(X0) = X1
      <=> complement(X0,X1) ) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f29,plain,
    ? [X0,X1,X2,X3,X4] :
      ( test(X4)
      & test(X3)
      & ( ~ leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
        | ~ leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) ) ),
    inference(ennf_transformation,[],[f20]) ).

fof(f30,plain,
    ? [X0,X1,X2,X3,X4] :
      ( test(X4)
      & test(X3)
      & ( ~ leq(addition(multiplication(X3,X0),multiplication(c(X3),X2)),addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)))
        | ~ leq(addition(multiplication(X3,addition(multiplication(X3,X0),multiplication(c(X3),X1))),multiplication(c(X3),X2)),addition(multiplication(X3,X0),multiplication(c(X3),X2))) ) ),
    inference(flattening,[],[f29]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ( ~ complement(X1,X0)
        | ( addition(X0,X1) = one
          & multiplication(X1,X0) = zero
          & multiplication(X0,X1) = zero ) )
      & ( addition(X0,X1) != one
        | zero != multiplication(X1,X0)
        | zero != multiplication(X0,X1)
        | complement(X1,X0) ) ),
    inference(nnf_transformation,[],[f14]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ( ~ complement(X1,X0)
        | ( addition(X0,X1) = one
          & multiplication(X1,X0) = zero
          & multiplication(X0,X1) = zero ) )
      & ( addition(X0,X1) != one
        | zero != multiplication(X1,X0)
        | zero != multiplication(X0,X1)
        | complement(X1,X0) ) ),
    inference(flattening,[],[f34]) ).

fof(f36,plain,
    ! [X0,X1] :
      ( ~ test(X0)
      | ( ( c(X0) != X1
          | complement(X0,X1) )
        & ( ~ complement(X0,X1)
          | c(X0) = X1 ) ) ),
    inference(nnf_transformation,[],[f23]) ).

fof(f37,plain,
    ( test(sK5)
    & test(sK4)
    & ( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)))
      | ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK1),skolemize(X1,sK2),skolemize(X2,sK3),skolemize(X3,sK4),skolemize(X4,sK5)],[f30]) ).

fof(f38,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f1]) ).

fof(f39,plain,
    ! [X2,X0,X1] : addition(X2,addition(X1,X0)) = addition(addition(X2,X1),X0),
    inference(cnf_transformation,[],[f2]) ).

fof(f40,plain,
    ! [X0] : addition(X0,zero) = X0,
    inference(cnf_transformation,[],[f3]) ).

fof(f41,plain,
    ! [X0] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f4]) ).

fof(f42,plain,
    ! [X2,X0,X1] : multiplication(X0,multiplication(X1,X2)) = multiplication(multiplication(X0,X1),X2),
    inference(cnf_transformation,[],[f5]) ).

fof(f43,plain,
    ! [X0] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f6]) ).

fof(f45,plain,
    ! [X2,X0,X1] : multiplication(X0,addition(X1,X2)) = addition(multiplication(X0,X1),multiplication(X0,X2)),
    inference(cnf_transformation,[],[f8]) ).

fof(f47,plain,
    ! [X0] : zero = multiplication(X0,zero),
    inference(cnf_transformation,[],[f10]) ).

fof(f48,plain,
    ! [X0] : zero = multiplication(zero,X0),
    inference(cnf_transformation,[],[f11]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != X1
      | leq(X0,X1) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f52,plain,
    ! [X0,X1] :
      ( ~ complement(X1,X0)
      | addition(X0,X1) = one ),
    inference(cnf_transformation,[],[f35]) ).

fof(f53,plain,
    ! [X0,X1] :
      ( ~ complement(X1,X0)
      | zero = multiplication(X1,X0) ),
    inference(cnf_transformation,[],[f35]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( ~ test(X0)
      | c(X0) != X1
      | complement(X0,X1) ),
    inference(cnf_transformation,[],[f36]) ).

fof(f62,plain,
    test(sK4),
    inference(cnf_transformation,[],[f37]) ).

fof(f63,plain,
    ( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)))
    | ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) ),
    inference(cnf_transformation,[],[f37]) ).

fof(f64,plain,
    ! [X0] :
      ( ~ test(X0)
      | complement(X0,c(X0)) ),
    inference(equality_resolution,[],[f56]) ).

tcf(c_49,plain,
    ! [X0: $i,X1: $i] : addition(X0,X1) = addition(X1,X0),
    inference(cnf_transformation,[],[f38]) ).

tcf(c_50,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(addition(X0,X1),X2) = addition(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f39]) ).

tcf(c_51,plain,
    ! [X0: $i] : addition(X0,zero) = X0,
    inference(cnf_transformation,[],[f40]) ).

tcf(c_52,plain,
    ! [X0: $i] : addition(X0,X0) = X0,
    inference(cnf_transformation,[],[f41]) ).

tcf(c_53,plain,
    ! [X0: $i,X1: $i,X2: $i] : multiplication(multiplication(X0,X1),X2) = multiplication(X0,multiplication(X1,X2)),
    inference(cnf_transformation,[],[f42]) ).

tcf(c_54,plain,
    ! [X0: $i] : multiplication(X0,one) = X0,
    inference(cnf_transformation,[],[f43]) ).

tcf(c_56,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(multiplication(X0,X1),multiplication(X0,X2)) = multiplication(X0,addition(X1,X2)),
    inference(cnf_transformation,[],[f45]) ).

tcf(c_58,plain,
    ! [X0: $i] : multiplication(X0,zero) = zero,
    inference(cnf_transformation,[],[f47]) ).

tcf(c_59,plain,
    ! [X0: $i] : multiplication(zero,X0) = zero,
    inference(cnf_transformation,[],[f48]) ).

tcf(c_60,plain,
    ! [X0: $i,X1: $i] :
      ( leq(X0,X1)
      | ( addition(X0,X1) != X1 ) ),
    inference(cnf_transformation,[],[f49]) ).

tcf(c_65,plain,
    ! [X0: $i,X1: $i] :
      ( ( multiplication(X0,X1) = zero )
      | ~ complement(X0,X1) ),
    inference(cnf_transformation,[],[f53]) ).

tcf(c_66,plain,
    ! [X0: $i,X1: $i] :
      ( ( addition(X1,X0) = one )
      | ~ complement(X0,X1) ),
    inference(cnf_transformation,[],[f52]) ).

tcf(c_68,plain,
    ! [X0: $i] :
      ( complement(X0,c(X0))
      | ~ test(X0) ),
    inference(cnf_transformation,[],[f64]) ).

tcf(c_72,negated_conjecture,
    ( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)))
    | ~ leq(addition(multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2))),multiplication(c(sK4),sK3)),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) ),
    inference(cnf_transformation,[],[f63]) ).

tcf(c_73,negated_conjecture,
    test(sK4),
    inference(cnf_transformation,[],[f62]) ).

tcf(c_95,negated_conjecture,
    ( ~ leq(addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3)),addition(multiplication(c(sK4),sK3),multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2)))))
    | ~ leq(addition(multiplication(c(sK4),sK3),multiplication(sK4,addition(multiplication(sK4,sK1),multiplication(c(sK4),sK2)))),addition(multiplication(sK4,sK1),multiplication(c(sK4),sK3))) ),
    inference(theory_normalisation,[status(thm)],[c_72,c_50,c_49]) ).

tcf(c_396,definition,
    iPr_def_10 = c(sK4),
    introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).

tcf(c_397,definition,
    iPr_def_11 = multiplication(iPr_def_10,sK3),
    introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).

tcf(c_398,definition,
    iPr_def_12 = multiplication(sK4,sK1),
    introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).

tcf(c_399,definition,
    iPr_def_13 = multiplication(iPr_def_10,sK2),
    introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).

tcf(c_400,definition,
    iPr_def_14 = addition(iPr_def_12,iPr_def_13),
    introduced(definition,[new_symbols(definition,[iPr_def_14])],[]) ).

tcf(c_401,definition,
    iPr_def_15 = multiplication(sK4,iPr_def_14),
    introduced(definition,[new_symbols(definition,[iPr_def_15])],[]) ).

tcf(c_402,definition,
    iPr_def_16 = addition(iPr_def_11,iPr_def_15),
    introduced(definition,[new_symbols(definition,[iPr_def_16])],[]) ).

tcf(c_403,definition,
    iPr_def_17 = addition(iPr_def_12,iPr_def_11),
    introduced(definition,[new_symbols(definition,[iPr_def_17])],[]) ).

tcf(c_404,negated_conjecture,
    ( ~ leq(iPr_def_17,iPr_def_16)
    | ~ leq(iPr_def_16,iPr_def_17) ),
    inference(demodulation,[status(thm)],[c_95,c_403,c_399,c_398,c_400,c_401,c_396,c_397,c_402]) ).

tcf(c_406,negated_conjecture,
    test(sK4),
    inference(demodulation,[status(thm)],[c_73]) ).

tcf(c_790,plain,
    ! [X0: $i] : leq(X0,X0),
    inference(superposition,[status(thm)],[c_52,c_60]) ).

tcf(c_142340,plain,
    ( complement(sK4,iPr_def_10)
    | ~ test(sK4) ),
    inference(superposition,[status(thm)],[c_396,c_68]) ).

tcf(c_142344,plain,
    complement(sK4,iPr_def_10),
    inference(forward_subsumption_resolution,[status(thm)],[c_142340,c_406]) ).

tcf(c_142593,plain,
    multiplication(sK4,iPr_def_10) = zero,
    inference(superposition,[status(thm)],[c_142344,c_65]) ).

tcf(c_143025,plain,
    ! [X0: $i] : multiplication(sK4,multiplication(iPr_def_10,X0)) = multiplication(zero,X0),
    inference(superposition,[status(thm)],[c_142593,c_53]) ).

tcf(c_143030,plain,
    ! [X0: $i] : multiplication(sK4,multiplication(iPr_def_10,X0)) = zero,
    inference(light_normalisation,[status(thm)],[c_143025,c_59]) ).

tcf(c_146002,plain,
    multiplication(sK4,iPr_def_13) = zero,
    inference(superposition,[status(thm)],[c_399,c_143030]) ).

tcf(c_146451,plain,
    ! [X0: $i] : addition(multiplication(sK4,X0),zero) = multiplication(sK4,addition(X0,iPr_def_13)),
    inference(superposition,[status(thm)],[c_146002,c_56]) ).

tcf(c_146455,plain,
    ! [X0: $i] : addition(zero,multiplication(sK4,X0)) = multiplication(sK4,addition(X0,iPr_def_13)),
    inference(theory_normalisation,[status(thm)],[c_146451,c_50,c_49]) ).

tcf(c_152233,plain,
    ! [X0: $i] : addition(zero,X0) = X0,
    inference(superposition,[status(thm)],[c_51,c_49]) ).

tcf(c_152237,plain,
    ! [X0: $i] : multiplication(sK4,addition(X0,iPr_def_13)) = multiplication(sK4,X0),
    inference(demodulation,[status(thm)],[c_146455,c_152233]) ).

tcf(c_152294,plain,
    multiplication(sK4,iPr_def_12) = multiplication(sK4,iPr_def_14),
    inference(superposition,[status(thm)],[c_400,c_152237]) ).

tcf(c_152296,plain,
    multiplication(sK4,iPr_def_12) = iPr_def_15,
    inference(light_normalisation,[status(thm)],[c_152294,c_401]) ).

tcf(c_152400,plain,
    addition(iPr_def_11,iPr_def_12) = iPr_def_17,
    inference(theory_normalisation,[status(thm)],[c_403,c_50,c_49]) ).

tcf(c_152412,plain,
    ( complement(sK4,iPr_def_10)
    | ~ test(sK4) ),
    inference(superposition,[status(thm)],[c_396,c_68]) ).

tcf(c_152416,plain,
    complement(sK4,iPr_def_10),
    inference(forward_subsumption_resolution,[status(thm)],[c_152412,c_406]) ).

tcf(c_152660,plain,
    multiplication(sK4,iPr_def_10) = zero,
    inference(superposition,[status(thm)],[c_152416,c_65]) ).

tcf(c_152671,plain,
    addition(iPr_def_10,sK4) = one,
    inference(superposition,[status(thm)],[c_152416,c_66]) ).

tcf(c_152812,plain,
    ! [X0: $i] : addition(zero,multiplication(sK4,X0)) = multiplication(sK4,addition(iPr_def_10,X0)),
    inference(superposition,[status(thm)],[c_152660,c_56]) ).

tcf(c_152829,plain,
    ! [X0: $i,X1: $i] : addition(multiplication(X0,X1),zero) = multiplication(X0,addition(X1,zero)),
    inference(superposition,[status(thm)],[c_58,c_56]) ).

tcf(c_152869,plain,
    ! [X0: $i,X1: $i] : addition(zero,multiplication(X0,X1)) = multiplication(X0,addition(X1,zero)),
    inference(theory_normalisation,[status(thm)],[c_152829,c_50,c_49]) ).

tcf(c_153055,plain,
    ! [X0: $i] : multiplication(sK4,addition(iPr_def_10,X0)) = multiplication(sK4,X0),
    inference(demodulation,[status(thm)],[c_152812,c_51,c_152869]) ).

tcf(c_153065,plain,
    multiplication(sK4,one) = multiplication(sK4,sK4),
    inference(superposition,[status(thm)],[c_152671,c_153055]) ).

tcf(c_153090,plain,
    multiplication(sK4,sK4) = sK4,
    inference(demodulation,[status(thm)],[c_153065,c_54]) ).

tcf(c_153093,plain,
    ! [X0: $i] : multiplication(sK4,multiplication(sK4,X0)) = multiplication(sK4,X0),
    inference(superposition,[status(thm)],[c_153090,c_53]) ).

tcf(c_157635,plain,
    multiplication(sK4,iPr_def_12) = iPr_def_12,
    inference(superposition,[status(thm)],[c_398,c_153093]) ).

tcf(c_157663,plain,
    iPr_def_12 = iPr_def_15,
    inference(demodulation,[status(thm)],[c_152296,c_157635]) ).

tcf(c_157669,plain,
    addition(iPr_def_11,iPr_def_12) = iPr_def_16,
    inference(demodulation,[status(thm)],[c_402,c_157663]) ).

tcf(c_157670,plain,
    iPr_def_16 = iPr_def_17,
    inference(demodulation,[status(thm)],[c_152400,c_157669]) ).

tcf(c_157676,plain,
    ~ leq(iPr_def_16,iPr_def_16),
    inference(demodulation,[status(thm)],[c_404,c_157670]) ).

tcf(c_157677,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_157676,c_790]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KLE027+4 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.38  % Computer : n006.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Wed Sep 23 18:41:27 UTC 2026
% 0.10/0.38  % CPUTime  : 
% 0.10/0.38  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.42  Running first-order theorem proving
% 0.10/0.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.10/0.43  
% 0.10/0.43  % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43  
% 0.10/0.43  % Detected problem language: tptp
% 0.10/0.44  % Proving...
% 65.73/12.39  % SZS status Started for theBenchmark.p
% 65.73/12.39  % SZS status Theorem for theBenchmark.p
% 65.73/12.39  
% 65.73/12.39  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 65.73/12.39  
% 65.73/12.39  % ------  iProver source info
% 65.73/12.39  
% 65.73/12.39  % git: date: 2026-07-19 20:42:38 +0200
% 65.73/12.39  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 65.73/12.39  % git: non_committed_changes: false
% 65.73/12.39  
% 65.73/12.39  % ------ Parsing...
% 65.73/12.39  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 65.73/12.39  
% 65.73/12.39  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 65.73/12.39  
% 65.73/12.39  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 65.73/12.39  
% 65.73/12.39  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 65.73/12.39  % ------ Proving...
% 65.73/12.39  % ------ Problem Properties 
% 65.73/12.39  
% 65.73/12.39  % 
% 65.73/12.39  % clauses                               34
% 65.73/12.39  % conjectures                           3
% 65.73/12.39  % EPR                                   4
% 65.73/12.39  % Horn                                  33
% 65.73/12.39  % unary                                 21
% 65.73/12.39  % binary                                9
% 65.73/12.39  % lits                                  52
% 65.73/12.39  % lits eq                               30
% 65.73/12.39  % fd_pure                               0
% 65.73/12.39  % fd_pseudo                             0
% 65.73/12.39  % fd_cond                               0
% 65.73/12.39  % fd_pseudo_cond                        1
% 65.73/12.39  % AC symbols                            1
% 65.73/12.39  
% 65.73/12.39  % ------ Schedule dynamic 5 is on 
% 65.73/12.39  
% 65.73/12.39  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 65.73/12.39  
% 65.73/12.39  
% 65.73/12.39  % ------ 
% 65.73/12.39  % Current options:
% 65.73/12.39  % ------ 
% 65.73/12.39  
% 65.73/12.39  
% 65.73/12.39  % 
% 65.73/12.39  
% 65.73/12.39  % ------ Proving...
% 65.73/12.39  % Proof_search_loop: time out after: 4656 full_loop iterations
% 65.73/12.39  
% 65.73/12.39  % ------ Input Options"1. --res_lit_sel adaptive --res_lit_sel_side num_symb" Time Limit: 15.
% 65.73/12.39  
% 65.73/12.39  
% 65.73/12.39  % ------ 
% 65.73/12.39  % Current options:
% 65.73/12.39  % ------ 
% 65.73/12.39  
% 65.73/12.39  
% 65.73/12.39  % 
% 65.73/12.39  
% 65.73/12.39  % ------ Proving...
% 65.73/12.39  % 
% 65.73/12.39  
% 65.73/12.39  % SZS status Theorem for theBenchmark.p
% 65.73/12.39  
% 65.73/12.39  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 65.73/12.39  
% 65.73/12.39  
%------------------------------------------------------------------------------