↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE011+2 : 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 : n004.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:08 PM UTC 2026

% Result   : Theorem 3.66s 1.18s
% Output   : CNFRefutation 3.66s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   89 (  60 unt;   0 def)
%            Number of atoms       :  148 (  78 equ)
%            Maximal formula atoms :    8 (   1 avg)
%            Number of connectives :  104 (  45   ~;  32   |;  19   &)
%                                         (   4 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 avg)
%            Maximal term depth    :    7 (   2 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    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :  100 (   0 sgn  96   !;   4   ?;  39   :)

% 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(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(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(f17,conjecture,
    ! [X0,X1] :
      ( ( test(X0)
        & test(X1) )
     => ( leq(addition(addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X0,c(X0)),X1)),multiplication(c(X0),c(X1))),one)
        & leq(one,addition(addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X0,c(X0)),X1)),multiplication(c(X0),c(X1)))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

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

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

fof(f20,plain,
    ? [X0,X1] :
      ( test(X0)
      & test(X1)
      & ( ~ leq(addition(addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X0,c(X0)),X1)),multiplication(c(X0),c(X1))),one)
        | ~ leq(one,addition(addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X0,c(X0)),X1)),multiplication(c(X0),c(X1)))) ) ),
    inference(ennf_transformation,[],[f18]) ).

fof(f21,plain,
    ? [X0,X1] :
      ( test(X0)
      & test(X1)
      & ( ~ leq(addition(addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X0,c(X0)),X1)),multiplication(c(X0),c(X1))),one)
        | ~ leq(one,addition(addition(multiplication(addition(X1,c(X1)),X0),multiplication(addition(X0,c(X0)),X1)),multiplication(c(X0),c(X1)))) ) ),
    inference(flattening,[],[f20]) ).

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

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

fof(f25,plain,
    ( test(sK0)
    & test(sK1)
    & ( ~ leq(addition(addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1)),multiplication(c(sK0),c(sK1))),one)
      | ~ leq(one,addition(addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1)),multiplication(c(sK0),c(sK1)))) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1]),skolemize(X0,sK0),skolemize(X1,sK1)],[f21]) ).

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

fof(f30,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(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(flattening,[],[f30]) ).

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

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

fof(f34,plain,
    ( ~ leq(addition(addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1)),multiplication(c(sK0),c(sK1))),one)
    | ~ leq(one,addition(addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1)),multiplication(c(sK0),c(sK1)))) ),
    inference(cnf_transformation,[],[f25]) ).

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

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

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

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

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

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

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

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

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

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

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

tcf(c_49,negated_conjecture,
    ( ~ leq(one,addition(addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1)),multiplication(c(sK0),c(sK1))))
    | ~ leq(addition(addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1)),multiplication(c(sK0),c(sK1))),one) ),
    inference(cnf_transformation,[],[f34]) ).

tcf(c_50,negated_conjecture,
    test(sK1),
    inference(cnf_transformation,[],[f33]) ).

tcf(c_51,negated_conjecture,
    test(sK0),
    inference(cnf_transformation,[],[f32]) ).

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

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

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

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

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

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

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

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

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

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

tcf(c_90,negated_conjecture,
    ( ~ leq(one,addition(multiplication(c(sK0),c(sK1)),addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1))))
    | ~ leq(addition(multiplication(c(sK0),c(sK1)),addition(multiplication(addition(sK1,c(sK1)),sK0),multiplication(addition(sK0,c(sK0)),sK1))),one) ),
    inference(theory_normalisation,[status(thm)],[c_49,c_55,c_56]) ).

tcf(c_746,plain,
    ! [X0: $i,X1: $i,X2: $i] : addition(X0,addition(X1,X2)) = addition(X1,addition(X0,X2)),
    inference(superposition,[status(thm)],[c_55,c_56]) ).

tcf(c_749,plain,
    ( ~ leq(one,addition(multiplication(addition(sK1,c(sK1)),sK0),addition(multiplication(c(sK0),c(sK1)),multiplication(addition(sK0,c(sK0)),sK1))))
    | ~ leq(addition(multiplication(addition(sK1,c(sK1)),sK0),addition(multiplication(c(sK0),c(sK1)),multiplication(addition(sK0,c(sK0)),sK1))),one) ),
    inference(theory_normalisation,[status(thm)],[c_90,c_55,c_56]) ).

tcf(c_750,plain,
    ( ~ leq(one,addition(multiplication(sK1,sK0),addition(multiplication(c(sK1),sK0),addition(multiplication(sK0,sK1),addition(multiplication(c(sK0),sK1),multiplication(c(sK0),c(sK1)))))))
    | ~ leq(addition(multiplication(sK1,sK0),addition(multiplication(c(sK1),sK0),addition(multiplication(sK0,sK1),addition(multiplication(c(sK0),sK1),multiplication(c(sK0),c(sK1)))))),one) ),
    inference(demodulation,[status(thm)],[c_749,c_52,c_55,c_56,c_746]) ).

tcf(c_776,plain,
    complement(sK1,c(sK1)),
    inference(superposition,[status(thm)],[c_50,c_60]) ).

tcf(c_777,plain,
    complement(sK0,c(sK0)),
    inference(superposition,[status(thm)],[c_51,c_60]) ).

tcf(c_825,plain,
    ! [X0: $i] : leq(X0,X0),
    inference(superposition,[status(thm)],[c_54,c_57]) ).

tcf(c_902,plain,
    addition(c(sK1),sK1) = one,
    inference(superposition,[status(thm)],[c_776,c_67]) ).

tcf(c_903,plain,
    addition(c(sK0),sK0) = one,
    inference(superposition,[status(thm)],[c_777,c_67]) ).

tcf(c_910,plain,
    addition(sK0,c(sK0)) = one,
    inference(theory_normalisation,[status(thm)],[c_903,c_55,c_56]) ).

tcf(c_911,plain,
    addition(sK1,c(sK1)) = one,
    inference(theory_normalisation,[status(thm)],[c_902,c_55,c_56]) ).

tcf(c_977,plain,
    ! [X0: $i] : addition(sK0,addition(c(sK0),X0)) = addition(one,X0),
    inference(superposition,[status(thm)],[c_910,c_55]) ).

tcf(c_979,plain,
    ! [X0: $i] : addition(multiplication(sK0,X0),multiplication(c(sK0),X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_910,c_52]) ).

tcf(c_984,plain,
    ! [X0: $i] : addition(multiplication(sK0,X0),multiplication(c(sK0),X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_979,c_68]) ).

tcf(c_1003,plain,
    ! [X0: $i] : addition(sK1,addition(c(sK1),X0)) = addition(one,X0),
    inference(superposition,[status(thm)],[c_911,c_55]) ).

tcf(c_1005,plain,
    ! [X0: $i] : addition(multiplication(sK1,X0),multiplication(c(sK1),X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_911,c_52]) ).

tcf(c_1006,plain,
    ! [X0: $i] : addition(multiplication(X0,sK1),multiplication(X0,c(sK1))) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_911,c_53]) ).

tcf(c_1009,plain,
    ! [X0: $i] : addition(multiplication(X0,sK1),multiplication(X0,c(sK1))) = X0,
    inference(light_normalisation,[status(thm)],[c_1006,c_69]) ).

tcf(c_1010,plain,
    ! [X0: $i] : addition(multiplication(sK1,X0),multiplication(c(sK1),X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_1005,c_68]) ).

tcf(c_1011,plain,
    ( ~ leq(one,addition(multiplication(sK1,sK0),addition(multiplication(c(sK1),sK0),addition(multiplication(sK0,sK1),c(sK0)))))
    | ~ leq(addition(multiplication(sK1,sK0),addition(multiplication(c(sK1),sK0),addition(multiplication(sK0,sK1),c(sK0)))),one) ),
    inference(demodulation,[status(thm)],[c_750,c_1009]) ).

tcf(c_1075,plain,
    addition(one,c(sK1)) = addition(sK1,c(sK1)),
    inference(superposition,[status(thm)],[c_54,c_1003]) ).

tcf(c_1084,plain,
    addition(one,c(sK1)) = one,
    inference(light_normalisation,[status(thm)],[c_1075,c_911]) ).

tcf(c_1359,plain,
    ! [X0: $i] : addition(sK1,addition(X0,c(sK1))) = addition(X0,one),
    inference(superposition,[status(thm)],[c_911,c_746]) ).

tcf(c_1360,plain,
    ! [X0: $i] : addition(sK0,addition(X0,c(sK0))) = addition(X0,one),
    inference(superposition,[status(thm)],[c_910,c_746]) ).

tcf(c_1504,plain,
    ! [X0: $i] : addition(sK1,addition(c(sK1),X0)) = addition(X0,one),
    inference(superposition,[status(thm)],[c_56,c_1359]) ).

tcf(c_1507,plain,
    addition(one,one) = addition(sK1,one),
    inference(superposition,[status(thm)],[c_1084,c_1359]) ).

tcf(c_1518,plain,
    addition(one,one) = addition(one,sK1),
    inference(theory_normalisation,[status(thm)],[c_1507,c_55,c_56]) ).

tcf(c_1888,plain,
    ! [X0: $i,X1: $i] : addition(multiplication(sK1,X0),addition(multiplication(c(sK1),X0),X1)) = addition(X0,X1),
    inference(superposition,[status(thm)],[c_1010,c_55]) ).

tcf(c_1910,plain,
    ( ~ leq(one,addition(sK0,addition(multiplication(sK0,sK1),c(sK0))))
    | ~ leq(addition(sK0,addition(multiplication(sK0,sK1),c(sK0))),one) ),
    inference(demodulation,[status(thm)],[c_1011,c_1888]) ).

tcf(c_1923,plain,
    ( ~ leq(one,addition(one,multiplication(sK0,sK1)))
    | ~ leq(addition(one,multiplication(sK0,sK1)),one) ),
    inference(demodulation,[status(thm)],[c_1910,c_1003,c_1360,c_1504]) ).

tcf(c_2183,plain,
    addition(one,sK1) = one,
    inference(demodulation,[status(thm)],[c_1518,c_54]) ).

tcf(c_2190,plain,
    ! [X0: $i] : addition(multiplication(X0,one),multiplication(X0,sK1)) = multiplication(X0,one),
    inference(superposition,[status(thm)],[c_2183,c_53]) ).

tcf(c_2193,plain,
    ! [X0: $i] : addition(X0,multiplication(X0,sK1)) = X0,
    inference(light_normalisation,[status(thm)],[c_2190,c_69]) ).

tcf(c_2560,plain,
    addition(one,multiplication(c(sK0),sK1)) = addition(sK0,c(sK0)),
    inference(superposition,[status(thm)],[c_2193,c_977]) ).

tcf(c_2565,plain,
    addition(one,multiplication(c(sK0),sK1)) = one,
    inference(light_normalisation,[status(thm)],[c_2560,c_910]) ).

tcf(c_2695,plain,
    ! [X0: $i] : addition(one,addition(X0,multiplication(c(sK0),sK1))) = addition(X0,one),
    inference(superposition,[status(thm)],[c_2565,c_746]) ).

tcf(c_3665,plain,
    addition(multiplication(sK0,sK1),one) = addition(one,sK1),
    inference(superposition,[status(thm)],[c_984,c_2695]) ).

tcf(c_3681,plain,
    addition(one,multiplication(sK0,sK1)) = addition(one,sK1),
    inference(theory_normalisation,[status(thm)],[c_3665,c_55,c_56]) ).

tcf(c_3682,plain,
    addition(one,multiplication(sK0,sK1)) = one,
    inference(light_normalisation,[status(thm)],[c_3681,c_2183]) ).

tcf(c_3704,plain,
    ~ leq(one,one),
    inference(demodulation,[status(thm)],[c_1923,c_3682]) ).

tcf(c_3705,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_3704,c_825]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE011+2 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36  % Computer : n004.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Wed Sep 23 18:36:08 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40  Running first-order theorem proving
% 0.09/0.40  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.09/0.41  
% 0.09/0.41  % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41  
% 0.09/0.41  % Detected problem language: tptp
% 0.09/0.42  % Proving...
% 3.66/1.18  % SZS status Started for theBenchmark.p
% 3.66/1.18  % SZS status Theorem for theBenchmark.p
% 3.66/1.18  
% 3.66/1.18  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.66/1.18  
% 3.66/1.18  % ------  iProver source info
% 3.66/1.18  
% 3.66/1.18  % git: date: 2026-07-19 20:42:38 +0200
% 3.66/1.18  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.66/1.18  % git: non_committed_changes: false
% 3.66/1.18  
% 3.66/1.18  % ------ Parsing...
% 3.66/1.18  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 3.66/1.18  
% 3.66/1.18  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 3.66/1.18  
% 3.66/1.18  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 3.66/1.18  
% 3.66/1.18  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 3.66/1.18  % ------ Proving...
% 3.66/1.18  % ------ Problem Properties 
% 3.66/1.18  
% 3.66/1.18  % 
% 3.66/1.18  % clauses                               24
% 3.66/1.18  % conjectures                           3
% 3.66/1.18  % EPR                                   3
% 3.66/1.18  % Horn                                  23
% 3.66/1.18  % unary                                 13
% 3.66/1.18  % binary                                9
% 3.66/1.18  % lits                                  38
% 3.66/1.18  % lits eq                               20
% 3.66/1.18  % fd_pure                               0
% 3.66/1.18  % fd_pseudo                             0
% 3.66/1.18  % fd_cond                               0
% 3.66/1.18  % fd_pseudo_cond                        1
% 3.66/1.18  % AC symbols                            1
% 3.66/1.18  
% 3.66/1.18  % ------ Schedule dynamic 5 is on 
% 3.66/1.18  
% 3.66/1.18  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.66/1.18  
% 3.66/1.18  
% 3.66/1.18  % ------ 
% 3.66/1.18  % Current options:
% 3.66/1.18  % ------ 
% 3.66/1.18  
% 3.66/1.18  
% 3.66/1.18  % 
% 3.66/1.18  
% 3.66/1.18  % ------ Proving...
% 3.66/1.18  % 
% 3.66/1.18  
% 3.66/1.18  % SZS status Theorem for theBenchmark.p
% 3.66/1.18  
% 3.66/1.18  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.66/1.18  
% 3.66/1.18  
%------------------------------------------------------------------------------