↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE017+1 : 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 : n011.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:09 PM UTC 2026

% Result   : Theorem 46.57s 20.98s
% Output   : CNFRefutation 46.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   14
% Syntax   : Number of formulae    :  139 (  70 unt;   0 def)
%            Number of atoms       :  287 ( 131 equ)
%            Maximal formula atoms :    9 (   2 avg)
%            Number of connectives :  228 (  80   ~;  93   |;  42   &)
%                                         (   7 <=>;   4  =>;   0  <=;   2 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of types       :    1 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :  152 (   0 sgn 137   !;  15   ?;  57   :)

% 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(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_left_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(f9,axiom,
    ! [X0,X1,X2] : multiplication(addition(X0,X1),X2) = addition(multiplication(X0,X2),multiplication(X1,X2)),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',left_distributivity) ).

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

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

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(f16,axiom,
    ! [X0] :
      ( ~ test(X0)
     => c(X0) = zero ),
    file('/export/starexec/sandbox/benchmark/Axioms/KLE001+1.ax',test_4) ).

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

fof(f18,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( test(X2)
          & test(X1)
          & test(X0) )
       => ( leq(X2,multiplication(X0,X1))
        <=> ( leq(X2,X1)
            & leq(X2,X0) ) ) ),
    inference(negated_conjecture,[status(cth)],[f17]) ).

fof(f19,plain,
    ? [X0,X1,X2] :
      ( test(X2)
      & test(X1)
      & test(X0)
      & ( leq(X2,multiplication(X0,X1))
      <~> ( leq(X2,X1)
          & leq(X2,X0) ) ) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f20,plain,
    ? [X0,X1,X2] :
      ( test(X2)
      & test(X1)
      & test(X0)
      & ( leq(X2,multiplication(X0,X1))
      <~> ( leq(X2,X1)
          & leq(X2,X0) ) ) ),
    inference(flattening,[],[f19]) ).

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

fof(f22,plain,
    ! [X0] :
      ( test(X0)
      | c(X0) = zero ),
    inference(ennf_transformation,[],[f16]) ).

fof(f23,plain,
    ? [X0,X1,X2] :
      ( test(X2)
      & test(X1)
      & test(X0)
      & ( leq(X2,multiplication(X0,X1))
        | ( leq(X2,X1)
          & leq(X2,X0) ) )
      & ( ~ leq(X2,multiplication(X0,X1))
        | ~ leq(X2,X1)
        | ~ leq(X2,X0) ) ),
    inference(nnf_transformation,[],[f20]) ).

fof(f24,plain,
    ? [X0,X1,X2] :
      ( test(X2)
      & test(X1)
      & test(X0)
      & ( leq(X2,multiplication(X0,X1))
        | ( leq(X2,X1)
          & leq(X2,X0) ) )
      & ( ~ leq(X2,multiplication(X0,X1))
        | ~ leq(X2,X1)
        | ~ leq(X2,X0) ) ),
    inference(flattening,[],[f23]) ).

fof(f25,plain,
    ( test(sK2)
    & test(sK1)
    & test(sK0)
    & ( leq(sK2,multiplication(sK0,sK1))
      | ( leq(sK2,sK1)
        & leq(sK2,sK0) ) )
    & ( ~ leq(sK2,multiplication(sK0,sK1))
      | ~ leq(sK2,sK1)
      | ~ leq(sK2,sK0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f24]) ).

fof(f26,plain,
    ! [X0,X1] :
      ( ( ~ leq(X0,X1)
        | addition(X0,X1) = X1 )
      & ( addition(X0,X1) != X1
        | leq(X0,X1) ) ),
    inference(nnf_transformation,[],[f12]) ).

fof(f27,plain,
    ! [X0] :
      ( ( ~ test(X0)
        | ? [X1] : complement(X1,X0) )
      & ( ! [X1] : ~ complement(X1,X0)
        | test(X0) ) ),
    inference(nnf_transformation,[],[f13]) ).

fof(f28,plain,
    ! [X0] :
      ( ( ~ test(X0)
        | ? [X2] : complement(X2,X0) )
      & ( ! [X1] : ~ complement(X1,X0)
        | test(X0) ) ),
    inference(rectify,[],[f27]) ).

fof(f29,plain,
    ! [X0] :
      ( ( ~ test(X0)
        | complement(sK3(X0),X0) )
      & ( ! [X1] : ~ complement(X1,X0)
        | test(X0) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X2,sK3(X0))],[f28]) ).

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

fof(f31,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(f32,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,[],[f31]) ).

fof(f33,plain,
    test(sK2),
    inference(cnf_transformation,[],[f25]) ).

fof(f34,plain,
    test(sK1),
    inference(cnf_transformation,[],[f25]) ).

fof(f35,plain,
    test(sK0),
    inference(cnf_transformation,[],[f25]) ).

fof(f36,plain,
    ( leq(sK2,multiplication(sK0,sK1))
    | leq(sK2,sK1) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f37,plain,
    ( leq(sK2,multiplication(sK0,sK1))
    | leq(sK2,sK0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f38,plain,
    ( ~ leq(sK2,multiplication(sK0,sK1))
    | ~ leq(sK2,sK1)
    | ~ leq(sK2,sK0) ),
    inference(cnf_transformation,[],[f25]) ).

fof(f39,plain,
    ! [X0,X1] :
      ( ~ leq(X0,X1)
      | addition(X0,X1) = X1 ),
    inference(cnf_transformation,[],[f26]) ).

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

fof(f41,plain,
    ! [X0] :
      ( ~ test(X0)
      | complement(sK3(X0),X0) ),
    inference(cnf_transformation,[],[f29]) ).

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

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

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

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

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

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

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

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

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

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

fof(f54,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != one
      | zero != multiplication(X1,X0)
      | zero != multiplication(X0,X1)
      | complement(X1,X0) ),
    inference(cnf_transformation,[],[f32]) ).

fof(f55,plain,
    ! [X0] :
      ( test(X0)
      | zero = c(X0) ),
    inference(cnf_transformation,[],[f22]) ).

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

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

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

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

tcf(c_49,negated_conjecture,
    ( ~ leq(sK2,sK1)
    | ~ leq(sK2,sK0)
    | ~ leq(sK2,multiplication(sK0,sK1)) ),
    inference(cnf_transformation,[],[f38]) ).

tcf(c_50,negated_conjecture,
    ( leq(sK2,sK0)
    | leq(sK2,multiplication(sK0,sK1)) ),
    inference(cnf_transformation,[],[f37]) ).

tcf(c_51,negated_conjecture,
    ( leq(sK2,sK1)
    | leq(sK2,multiplication(sK0,sK1)) ),
    inference(cnf_transformation,[],[f36]) ).

tcf(c_52,negated_conjecture,
    test(sK0),
    inference(cnf_transformation,[],[f35]) ).

tcf(c_53,negated_conjecture,
    test(sK1),
    inference(cnf_transformation,[],[f34]) ).

tcf(c_54,negated_conjecture,
    test(sK2),
    inference(cnf_transformation,[],[f33]) ).

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

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

tcf(c_58,plain,
    ! [X0: $i] :
      ( complement(sK3(X0),X0)
      | ~ test(X0) ),
    inference(cnf_transformation,[],[f41]) ).

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

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

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

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

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

tcf(c_65,plain,
    ! [X0: $i,X1: $i] :
      ( ( c(X0) = X1 )
      | ~ test(X0)
      | ~ complement(X0,X1) ),
    inference(cnf_transformation,[],[f50]) ).

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

tcf(c_67,plain,
    ! [X0: $i,X1: $i] :
      ( complement(X1,X0)
      | ( addition(X0,X1) != one )
      | ( multiplication(X1,X0) != zero )
      | ( multiplication(X0,X1) != zero ) ),
    inference(cnf_transformation,[],[f54]) ).

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

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

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

tcf(c_71,plain,
    ! [X0: $i] :
      ( test(X0)
      | ( c(X0) = zero ) ),
    inference(cnf_transformation,[],[f55]) ).

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

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

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

tcf(c_106,plain,
    ! [X0: $i] :
      ( complement(sK3(X0),X0)
      | ~ test(X0) ),
    inference(prop_impl_just,[status(thm)],[c_58]) ).

tcf(c_419,plain,
    ! [X0: $i] :
      ( complement(sK3(X0),X0)
      | ( X0 != sK2 ) ),
    inference(resolution_lifted,[status(thm)],[c_54,c_106]) ).

tcf(c_420,plain,
    complement(sK3(sK2),sK2),
    inference(unflattening,[status(thm)],[c_419]) ).

tcf(c_1963,plain,
    ! [X0: $i] :
      ( leq(sK2,X0)
      | ( addition(sK2,X0) != X0 ) ),
    inference(instantiation,[status(thm)],[c_55]) ).

tcf(c_7617,plain,
    ( leq(sK2,sK0)
    | ( addition(sK2,sK0) != sK0 ) ),
    inference(instantiation,[status(thm)],[c_1963]) ).

tcf(c_7621,plain,
    ( leq(sK2,sK1)
    | ( addition(sK2,sK1) != sK1 ) ),
    inference(instantiation,[status(thm)],[c_1963]) ).

tcf(c_12373,plain,
    ! [X0: $i,X1: $i] : addition(X0,addition(X0,X1)) = addition(X0,X1),
    inference(superposition,[status(thm)],[c_62,c_63]) ).

tcf(c_12449,plain,
    ( leq(sK2,sK1)
    | ( addition(sK2,multiplication(sK0,sK1)) = multiplication(sK0,sK1) ) ),
    inference(superposition,[status(thm)],[c_51,c_56]) ).

tcf(c_12450,plain,
    ( leq(sK2,sK0)
    | ( addition(sK2,multiplication(sK0,sK1)) = multiplication(sK0,sK1) ) ),
    inference(superposition,[status(thm)],[c_50,c_56]) ).

tcf(c_12481,plain,
    ! [X0: $i] :
      ( ( addition(X0,sK3(X0)) = one )
      | ~ test(X0) ),
    inference(superposition,[status(thm)],[c_58,c_70]) ).

tcf(c_12532,plain,
    ( ( addition(sK2,sK1) = sK1 )
    | ( addition(sK2,multiplication(sK0,sK1)) = multiplication(sK0,sK1) ) ),
    inference(superposition,[status(thm)],[c_12449,c_56]) ).

tcf(c_12539,plain,
    ( ( addition(sK2,sK0) = sK0 )
    | ( addition(sK2,multiplication(sK0,sK1)) = multiplication(sK0,sK1) ) ),
    inference(superposition,[status(thm)],[c_12450,c_56]) ).

tcf(c_12547,plain,
    ! [X0: $i] :
      ( ( addition(sK2,sK1) = sK1 )
      | ( addition(sK2,addition(multiplication(sK0,sK1),X0)) = addition(multiplication(sK0,sK1),X0) ) ),
    inference(superposition,[status(thm)],[c_12532,c_63]) ).

tcf(c_12562,plain,
    ! [X0: $i] :
      ( ( addition(sK2,sK0) = sK0 )
      | ( addition(sK2,addition(multiplication(sK0,sK1),X0)) = addition(multiplication(sK0,sK1),X0) ) ),
    inference(superposition,[status(thm)],[c_12539,c_63]) ).

tcf(c_12600,plain,
    ! [X0: $i] :
      ( ( addition(sK2,sK1) = sK1 )
      | ( addition(sK2,addition(X0,multiplication(sK0,sK1))) = addition(X0,multiplication(sK0,sK1)) ) ),
    inference(superposition,[status(thm)],[c_64,c_12547]) ).

tcf(c_12627,plain,
    ! [X0: $i] :
      ( ( addition(sK2,sK0) = sK0 )
      | ( addition(sK2,addition(X0,multiplication(sK0,sK1))) = addition(X0,multiplication(sK0,sK1)) ) ),
    inference(superposition,[status(thm)],[c_64,c_12562]) ).

tcf(c_33252,plain,
    addition(sK0,sK3(sK0)) = one,
    inference(superposition,[status(thm)],[c_52,c_12481]) ).

tcf(c_33253,plain,
    addition(sK1,sK3(sK1)) = one,
    inference(superposition,[status(thm)],[c_53,c_12481]) ).

tcf(c_33466,plain,
    addition(sK0,one) = one,
    inference(superposition,[status(thm)],[c_33252,c_12373]) ).

tcf(c_33488,plain,
    addition(one,sK0) = one,
    inference(theory_normalisation,[status(thm)],[c_33466,c_63,c_64]) ).

tcf(c_34238,plain,
    addition(sK1,one) = one,
    inference(superposition,[status(thm)],[c_33253,c_12373]) ).

tcf(c_34260,plain,
    addition(one,sK1) = one,
    inference(theory_normalisation,[status(thm)],[c_34238,c_63,c_64]) ).

tcf(c_34926,plain,
    ! [X0: $i] : addition(multiplication(one,X0),multiplication(sK0,X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_33488,c_59]) ).

tcf(c_34954,plain,
    ! [X0: $i] : addition(X0,multiplication(sK0,X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_34926,c_75]) ).

tcf(c_34976,plain,
    ! [X0: $i] : addition(multiplication(X0,one),multiplication(X0,sK1)) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_34260,c_60]) ).

tcf(c_35001,plain,
    ! [X0: $i] : addition(X0,multiplication(X0,sK1)) = X0,
    inference(light_normalisation,[status(thm)],[c_34976,c_76]) ).

tcf(c_51578,plain,
    addition(sK2,sK1) = sK1,
    inference(superposition,[status(thm)],[c_34954,c_12600]) ).

tcf(c_51735,plain,
    addition(sK2,sK0) = sK0,
    inference(superposition,[status(thm)],[c_35001,c_12627]) ).

tcf(c_199154,negated_conjecture,
    leq(sK2,sK0),
    inference(global_subsumption_just,[status(thm)],[c_50,c_7617,c_51735]) ).

tcf(c_199156,negated_conjecture,
    leq(sK2,sK1),
    inference(global_subsumption_just,[status(thm)],[c_51,c_7621,c_51578]) ).

tcf(c_199158,negated_conjecture,
    ~ leq(sK2,multiplication(sK0,sK1)),
    inference(global_subsumption_just,[status(thm)],[c_49,c_49,c_7617,c_7621,c_51578,c_51735]) ).

tcf(c_199168,plain,
    ! [X0: $i] : addition(zero,X0) = X0,
    inference(superposition,[status(thm)],[c_74,c_64]) ).

tcf(c_199222,plain,
    addition(sK2,sK0) = sK0,
    inference(superposition,[status(thm)],[c_199154,c_56]) ).

tcf(c_199223,plain,
    addition(sK2,sK1) = sK1,
    inference(superposition,[status(thm)],[c_199156,c_56]) ).

tcf(c_199343,plain,
    ! [X0: $i] :
      ( ( c(sK3(X0)) = X0 )
      | ~ test(X0)
      | ~ test(sK3(X0)) ),
    inference(superposition,[status(thm)],[c_58,c_65]) ).

tcf(c_199357,plain,
    ! [X0: $i] : addition(multiplication(sK2,X0),multiplication(sK0,X0)) = multiplication(sK0,X0),
    inference(superposition,[status(thm)],[c_199222,c_59]) ).

tcf(c_199385,plain,
    ! [X0: $i] : addition(multiplication(X0,sK2),multiplication(X0,sK1)) = multiplication(X0,sK1),
    inference(superposition,[status(thm)],[c_199223,c_60]) ).

tcf(c_199419,plain,
    ! [X0: $i,X1: $i] :
      ( complement(X1,X0)
      | ( addition(X1,X0) != one )
      | ( multiplication(X1,X0) != zero )
      | ( multiplication(X0,X1) != zero ) ),
    inference(superposition,[status(thm)],[c_64,c_67]) ).

tcf(c_199517,plain,
    ! [X0: $i,X1: $i] : addition(multiplication(sK2,X0),addition(multiplication(sK0,X0),X1)) = addition(multiplication(sK0,X0),X1),
    inference(superposition,[status(thm)],[c_199357,c_63]) ).

tcf(c_199919,plain,
    addition(multiplication(sK2,sK2),multiplication(sK0,sK1)) = multiplication(sK0,sK1),
    inference(superposition,[status(thm)],[c_199385,c_199517]) ).

tcf(c_199949,plain,
    leq(multiplication(sK2,sK2),multiplication(sK0,sK1)),
    inference(superposition,[status(thm)],[c_199919,c_55]) ).

tcf(c_200068,plain,
    ! [X0: $i] :
      ( ( c(sK3(X0)) = zero )
      | ( c(sK3(X0)) = X0 )
      | ~ test(X0) ),
    inference(superposition,[status(thm)],[c_71,c_199343]) ).

tcf(c_200127,plain,
    ( ( c(sK3(sK2)) = zero )
    | ( c(sK3(sK2)) = sK2 ) ),
    inference(superposition,[status(thm)],[c_54,c_200068]) ).

tcf(c_200167,plain,
    ( complement(sK3(sK2),sK2)
    | ( c(sK3(sK2)) = zero )
    | ~ test(sK3(sK2)) ),
    inference(superposition,[status(thm)],[c_200127,c_66]) ).

tcf(c_200189,plain,
    complement(sK3(sK2),sK2),
    inference(global_subsumption_just,[status(thm)],[c_200167,c_420]) ).

tcf(c_200192,plain,
    addition(sK2,sK3(sK2)) = one,
    inference(superposition,[status(thm)],[c_200189,c_70]) ).

tcf(c_200193,plain,
    multiplication(sK3(sK2),sK2) = zero,
    inference(superposition,[status(thm)],[c_200189,c_69]) ).

tcf(c_200194,plain,
    multiplication(sK2,sK3(sK2)) = zero,
    inference(superposition,[status(thm)],[c_200189,c_68]) ).

tcf(c_200382,plain,
    ( complement(sK2,sK3(sK2))
    | ( addition(sK2,sK3(sK2)) != one )
    | ( multiplication(sK2,sK3(sK2)) != zero ) ),
    inference(superposition,[status(thm)],[c_200193,c_199419]) ).

tcf(c_200392,plain,
    complement(sK2,sK3(sK2)),
    inference(ground_joinability,[status(thm)],[c_200382,c_200194,c_200192]) ).

tcf(c_206444,plain,
    ( ( sK3(sK2) = c(sK2) )
    | ~ test(sK2) ),
    inference(superposition,[status(thm)],[c_200392,c_65]) ).

tcf(c_206450,plain,
    sK3(sK2) = c(sK2),
    inference(forward_subsumption_resolution,[status(thm)],[c_206444,c_54]) ).

tcf(c_206456,plain,
    multiplication(sK2,c(sK2)) = zero,
    inference(demodulation,[status(thm)],[c_200194,c_206450]) ).

tcf(c_206458,plain,
    addition(sK2,c(sK2)) = one,
    inference(demodulation,[status(thm)],[c_200192,c_206450]) ).

tcf(c_207095,plain,
    ! [X0: $i] : addition(multiplication(X0,sK2),multiplication(X0,c(sK2))) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_206458,c_60]) ).

tcf(c_207096,plain,
    ! [X0: $i] : addition(multiplication(X0,sK2),multiplication(X0,c(sK2))) = X0,
    inference(light_normalisation,[status(thm)],[c_207095,c_76]) ).

tcf(c_207301,plain,
    addition(multiplication(sK2,sK2),zero) = sK2,
    inference(superposition,[status(thm)],[c_206456,c_207096]) ).

tcf(c_207317,plain,
    addition(zero,multiplication(sK2,sK2)) = sK2,
    inference(theory_normalisation,[status(thm)],[c_207301,c_63,c_64]) ).

tcf(c_207441,plain,
    multiplication(sK2,sK2) = sK2,
    inference(demodulation,[status(thm)],[c_207317,c_199168]) ).

tcf(c_207460,plain,
    leq(sK2,multiplication(sK0,sK1)),
    inference(demodulation,[status(thm)],[c_199949,c_207441]) ).

tcf(c_207467,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_207460,c_199158]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE017+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/10.40  % Computer : n011.cluster.edu
% 0.12/10.40  % Model    : x86_64 x86_64
% 0.12/10.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.40  % Memory   : 8046.5625MB
% 0.12/10.40  % OS       : Linux 6.8.0-71-generic
% 0.12/10.40  % CPULimit : 300
% 0.12/10.40  % WCLimit  : 300
% 0.12/10.40  % DateTime : Wed Sep 23 18:37:55 UTC 2026
% 0.12/10.41  % CPUTime  : 
% 0.12/10.41  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/10.44  Running first-order theorem proving
% 0.12/10.44  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.12/10.45  
% 0.12/10.45  % ======== iProver multi-core TPTP/SMT =========
% 0.12/10.45  
% 0.12/10.45  % Detected problem language: tptp
% 0.12/10.46  % Proving...
% 46.57/20.98  % SZS status Started for theBenchmark.p
% 46.57/20.98  ERROR - "ProverProcess:heur/330959:296.0" ran with exit code 2 and error: iprover.ml: Unexpected exception: Failure("Clause.get_demod_eqs: not a demod/lightnorm conclusion ( leq(X0,addition(X1,addition(X2,addition(X0,addition(X1,addition(X3,X2)))))) )")
% 46.57/20.98  Fatal error: exception Failure("Clause.get_demod_eqs: not a demod/lightnorm conclusion ( leq(X0,addition(X1,addition(X2,addition(X0,addition(X1,addition(X3,X2)))))) )")
% 46.57/20.98  ERROR - cmd was:  ulimit -v 4023281; ./res/iproveropt --abstr_ref "[]" --abstr_ref_af_restrict_to_split_sk false --abstr_ref_prep false --abstr_ref_sig_restrict funpre --abstr_ref_under "[]" --abstr_ref_until_sat false --add_important_lit false --bc_imp_inh "[conj_cone]" --brand_transform false --clause_weak_htbl true --comb_inst_mult 3 --comb_mode clause_based --comb_res_mult 1 --comb_sup_deep_mult 2 --comb_sup_mult 0 --conj_cone_tolerance 3. --demod_completeness_check fast --demod_use_ground true --eq_ax_congr_red true --extra_neg_conj none --gc_record_bc_elim false --inst_activity_threshold 500 --inst_dismatching true --inst_eager_unprocessed_to_passive true --inst_eq_res_simp false --inst_learning_factor 2 --inst_learning_loop_flag true --inst_learning_start 3000 --inst_lit_activity_flag true --inst_lit_sel "[+prop;+sign;+ground;-num_var;-num_symb]" --inst_lit_sel_side num_symb --inst_orphan_elimination true --inst_passive_queue_type priority_queues --inst_passive_queues "[[-conj_dist;+conj_symb;-num_var];[+age;-num_symb]]" --inst_passive_queues_freq "[25;2]" --inst_prop_sim_given true --inst_prop_sim_new false --inst_restr_to_given false --inst_sel_renew solver --inst_solver_calls_frac 1. --inst_solver_per_active 1400 --inst_sos_flag false --inst_sos_phase true --inst_sos_sth_lit_sel "[+prop;+non_prol_conj_symb;-eq;+ground;-num_var]" --inst_start_prop_sim_after_learn 3 --inst_subs_given false --inst_subs_new false --instantiation_flag true --large_theory_mode true --lt_threshold 2000 --min_unsat_core false --non_eq_to_eq false --pred_elim true --prep_def_merge true --prep_def_merge_mbd true --prep_def_merge_prop_impl false --prep_def_merge_tr_cl false --prep_def_merge_tr_red false --prep_gs_sim true --prep_res_sim true --prep_sem_filter exhaustive --prep_sem_filter_out false --prep_sup_sim_all true --prep_sup_sim_sup false --prep_unflatten true --prep_upred true --preprocessed_out false --preprocessed_stats false --preprocessing_flag true --prolific_symb_bound 256 --prop_impl_unit "[]" --prop_impl_unit_size 0 --prop_solver_per_cl 1024 --pure_diseq_elim true --res_backward_subs full --res_backward_subs_resolution true --res_forward_subs full --res_forward_subs_resolution true --res_lit_sel adaptive --res_lit_sel_side none --res_ordering kbo --res_orphan_elimination true --res_passive_queue_type priority_queues --res_passive_queues "[[-conj_dist;+conj_symb;-num_symb];[+age;-num_symb]]" --res_passive_queues_freq "[15;5]" --res_prop_simpl_given true --res_prop_simpl_new false --res_sim_input true --res_time_limit 300. --res_to_prop_solver active --reset_solvers false --resolution_flag true --schedule none --share_sel_clauses true --smt_ac_axioms fast --smt_preprocessing true --soft_assumptions false --soft_lemma_size 3 --splitting_cvd false --splitting_cvd_svl false --splitting_grd true --splitting_mode input --splitting_nvd 32 --stats_out none --sub_typing true --subs_bck_mult 8 --sup_full_bw "[BwDemod;BwUnitSubsAndRes]" --sup_full_fw "[FwDemodLightNormLoopTriv;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes]" --sup_full_triv "[PropSubs]" --sup_fun_splitting false --sup_immed_bw_immed "[BwUnitSubsAndRes]" --sup_immed_bw_main "[BwUnitSubsAndRes]" --sup_immed_fw_immed "[ACNormalisation;FwDemodLightNormLoopTriv;FwUnitSubsAndRes]" --sup_immed_fw_main "[FwUnitSubsAndRes]" --sup_immed_triv "[]" --sup_indices_passive "[LightNormIndex;UnitSubsumptionIndex]" --sup_input_bw "[BwDemod;BwUnitSubsAndRes;BwSubsumption;BwSubsumptionRes]" --sup_input_fw "[ACNormalisation;FwDemodLightNormLoopTriv;FwUnitSubsAndRes;FwSubsumption;FwSubsumptionRes]" --sup_input_triv "[Unflattening]" --sup_iter_deepening 2 --sup_passive_queue_type priority_queues --sup_passive_queues "[[-conj_dist;-num_symb];[+age;-num_symb];[+score;-num_symb]]" --sup_passive_queues_freq "[8;4;4]" --sup_prop_simpl_given true --sup_prop_simpl_new true --sup_restarts_mult 2 --sup_score sim_d_gen --sup_share_max_num_cl 500 --sup_share_score_frac 0.2 --sup_smt_interval 10000 --sup_symb_ordering invfreq --sup_to_prop_solver passive --superposition_flag true --time_out_prep_mult 0.1 --suppress_sat_res true --tptp_safe_out true --out_options none --proof_out true --sat_out_model pos --clausifier res/vclausify_rel --clausifier_options "--mode clausify   -t 98.67" --time_out_real 296.00 /export/starexec/sandbox/benchmark/theBenchmark.p 1>> /export/starexec/sandbox/tmp/iprover_out_mhoz5sqy/kmfmpoat 2>> /export/starexec/sandbox/tmp/iprover_out_mhoz5sqy/kmfmpoat_error
% 46.57/20.98  % SZS status Theorem for theBenchmark.p
% 46.57/20.98  
% 46.57/20.98  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 46.57/20.98  
% 46.57/20.98  % ------  iProver source info
% 46.57/20.98  
% 46.57/20.98  % git: date: 2026-07-19 20:42:38 +0200
% 46.57/20.98  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 46.57/20.98  % git: non_committed_changes: false
% 46.57/20.98  
% 46.57/20.98  % ------ Parsing...
% 46.57/20.98  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 46.57/20.98  
% 46.57/20.98  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 46.57/20.98  
% 46.57/20.98  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 46.57/20.98  
% 46.57/20.98  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 46.57/20.98  % ------ Proving...
% 46.57/20.98  % ------ Problem Properties 
% 46.57/20.98  
% 46.57/20.98  % 
% 46.57/20.98  % clauses                               28
% 46.57/20.98  % conjectures                           6
% 46.57/20.98  % EPR                                   4
% 46.57/20.98  % Horn                                  25
% 46.57/20.98  % unary                                 14
% 46.57/20.98  % binary                                11
% 46.57/20.98  % lits                                  46
% 46.57/20.98  % lits eq                               21
% 46.57/20.98  % fd_pure                               0
% 46.57/20.98  % fd_pseudo                             0
% 46.57/20.98  % fd_cond                               0
% 46.57/20.98  % fd_pseudo_cond                        1
% 46.57/20.98  % AC symbols                            1
% 46.57/20.98  
% 46.57/20.98  % ------ Schedule dynamic 5 is on 
% 46.57/20.98  
% 46.57/20.98  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 46.57/20.98  
% 46.57/20.98  
% 46.57/20.98  % ------ 
% 46.57/20.98  % Current options:
% 46.57/20.98  % ------ 
% 46.57/20.98  
% 46.57/20.98  
% 46.57/20.98  % 
% 46.57/20.98  
% 46.57/20.98  % ------ Proving...
% 46.57/20.98  % 
% 46.57/20.98  
% 46.57/20.98  % SZS status Theorem for theBenchmark.p
% 46.57/20.98  
% 46.57/20.98  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 46.57/20.99  
% 46.57/20.99  
%------------------------------------------------------------------------------