↑ Up

iProver---3.9.4.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : iProver---3.9.4
% Problem  : KLE027+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 : n002.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:12 PM UTC 2026

% Result   : Theorem 2.30s 6.29s
% Output   : CNFRefutation 2.30s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   21
%            Number of leaves      :   20
% Syntax   : Number of formulae    :   94 (  73 unt;   8 def)
%            Number of atoms       :  216 (  99 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   77 (  31   ~;  23   |;  17   &)
%                                         (   3 <=>;   3  =>;   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  :   12 (  10 usr;   9 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   7 con; 0-2 aty)
%            Number of variables   :  119 (   0 sgn 109   !;  10   ?;  42   :)

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

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,X2,X3,X4] :
      ( ( test(X4)
        & test(X3) )
     => 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(f18,negated_conjecture,
    ~ ! [X0,X1,X2,X3,X4] :
        ( ( test(X4)
          & test(X3) )
       => 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)],[f17]) ).

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

fof(f21,plain,
    ? [X0,X1,X2,X3,X4] :
      ( test(X4)
      & test(X3)
      & 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,[],[f18]) ).

fof(f22,plain,
    ? [X0,X1,X2,X3,X4] :
      ( test(X4)
      & test(X3)
      & 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,[],[f21]) ).

fof(f26,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(f27,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,[],[f26]) ).

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

fof(f29,plain,
    ( test(sK5)
    & test(sK4)
    & 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)],[f22]) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

fof(f51,plain,
    test(sK4),
    inference(cnf_transformation,[],[f29]) ).

fof(f52,plain,
    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,[],[f29]) ).

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

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

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

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

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

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

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

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,[],[f37]) ).

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

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

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

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

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

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

tcf(c_69,negated_conjecture,
    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,[],[f52]) ).

tcf(c_70,negated_conjecture,
    test(sK4),
    inference(cnf_transformation,[],[f51]) ).

tcf(c_88,negated_conjecture,
    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_69,c_50,c_49]) ).

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

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

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

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

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

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

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

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

tcf(c_478,negated_conjecture,
    iPr_def_16 != iPr_def_17,
    inference(demodulation,[status(thm)],[c_88,c_477,c_473,c_472,c_474,c_475,c_470,c_471,c_476]) ).

tcf(c_480,negated_conjecture,
    test(sK4),
    inference(demodulation,[status(thm)],[c_70]) ).

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

tcf(c_758,plain,
    ( complement(sK4,iPr_def_10)
    | ~ test(sK4) ),
    inference(superposition,[status(thm)],[c_470,c_67]) ).

tcf(c_762,plain,
    complement(sK4,iPr_def_10),
    inference(forward_subsumption_resolution,[status(thm)],[c_758,c_480]) ).

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

tcf(c_805,plain,
    multiplication(iPr_def_10,sK4) = zero,
    inference(superposition,[status(thm)],[c_762,c_63]) ).

tcf(c_816,plain,
    multiplication(sK4,iPr_def_10) = zero,
    inference(superposition,[status(thm)],[c_762,c_64]) ).

tcf(c_827,plain,
    addition(iPr_def_10,sK4) = one,
    inference(superposition,[status(thm)],[c_762,c_65]) ).

tcf(c_1041,plain,
    ! [X0: $i] : multiplication(sK4,multiplication(iPr_def_14,X0)) = multiplication(iPr_def_15,X0),
    inference(superposition,[status(thm)],[c_475,c_53]) ).

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

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

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

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

tcf(c_1177,plain,
    ! [X0: $i] : addition(multiplication(iPr_def_12,X0),multiplication(iPr_def_13,X0)) = multiplication(iPr_def_14,X0),
    inference(superposition,[status(thm)],[c_474,c_57]) ).

tcf(c_1181,plain,
    ! [X0: $i] : addition(multiplication(iPr_def_10,X0),multiplication(sK4,X0)) = multiplication(one,X0),
    inference(superposition,[status(thm)],[c_827,c_57]) ).

tcf(c_1202,plain,
    ! [X0: $i] : addition(multiplication(iPr_def_10,X0),multiplication(sK4,X0)) = X0,
    inference(light_normalisation,[status(thm)],[c_1181,c_55]) ).

tcf(c_1272,plain,
    multiplication(sK4,iPr_def_13) = zero,
    inference(superposition,[status(thm)],[c_473,c_1046]) ).

tcf(c_1287,plain,
    multiplication(iPr_def_10,iPr_def_12) = zero,
    inference(superposition,[status(thm)],[c_472,c_1047]) ).

tcf(c_1298,plain,
    ! [X0: $i] : addition(multiplication(iPr_def_10,iPr_def_12),X0) = X0,
    inference(demodulation,[status(thm)],[c_773,c_1287]) ).

tcf(c_1302,plain,
    ! [X0: $i] : multiplication(multiplication(iPr_def_10,iPr_def_12),X0) = multiplication(iPr_def_10,iPr_def_12),
    inference(demodulation,[status(thm)],[c_59,c_1287]) ).

tcf(c_1304,plain,
    ! [X0: $i] : addition(X0,multiplication(iPr_def_10,iPr_def_12)) = X0,
    inference(demodulation,[status(thm)],[c_51,c_1287]) ).

tcf(c_1543,plain,
    multiplication(sK4,iPr_def_13) = multiplication(iPr_def_10,iPr_def_12),
    inference(light_normalisation,[status(thm)],[c_1272,c_1287]) ).

tcf(c_1544,plain,
    ! [X0: $i] : multiplication(multiplication(iPr_def_10,iPr_def_12),X0) = multiplication(sK4,multiplication(iPr_def_13,X0)),
    inference(superposition,[status(thm)],[c_1543,c_53]) ).

tcf(c_1548,plain,
    ! [X0: $i] : multiplication(sK4,multiplication(iPr_def_13,X0)) = multiplication(iPr_def_10,iPr_def_12),
    inference(light_normalisation,[status(thm)],[c_1544,c_1302]) ).

tcf(c_2376,plain,
    multiplication(sK4,iPr_def_12) = iPr_def_12,
    inference(superposition,[status(thm)],[c_1298,c_1202]) ).

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

tcf(c_5912,plain,
    ! [X0: $i] : multiplication(sK4,addition(multiplication(iPr_def_12,X0),multiplication(iPr_def_13,X0))) = multiplication(iPr_def_15,X0),
    inference(light_normalisation,[status(thm)],[c_1041,c_1177]) ).

tcf(c_5913,plain,
    ! [X0: $i] : multiplication(iPr_def_12,X0) = multiplication(iPr_def_15,X0),
    inference(demodulation,[status(thm)],[c_5912,c_56,c_1304,c_1548,c_2484]) ).

tcf(c_5917,plain,
    multiplication(iPr_def_12,one) = iPr_def_15,
    inference(superposition,[status(thm)],[c_5913,c_54]) ).

tcf(c_5976,plain,
    iPr_def_12 = iPr_def_15,
    inference(demodulation,[status(thm)],[c_5917,c_54]) ).

tcf(c_5980,plain,
    addition(iPr_def_11,iPr_def_12) = iPr_def_16,
    inference(demodulation,[status(thm)],[c_476,c_5976]) ).

tcf(c_5981,plain,
    iPr_def_16 = iPr_def_17,
    inference(demodulation,[status(thm)],[c_748,c_5980]) ).

tcf(c_5982,plain,
    $false,
    inference(forward_subsumption_resolution,[status(thm)],[c_5981,c_478]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KLE027+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.10/5.37  % Computer : n002.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 : Wed Sep 23 18:43:30 UTC 2026
% 0.10/5.37  % CPUTime  : 
% 0.10/5.37  Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.14/5.41  Running first-order theorem proving
% 0.14/5.41  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.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.44  % Proving...
% 2.30/6.29  % SZS status Started for theBenchmark.p
% 2.30/6.29  % SZS status Theorem for theBenchmark.p
% 2.30/6.29  
% 2.30/6.29  %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.30/6.29  
% 2.30/6.29  % ------  iProver source info
% 2.30/6.29  
% 2.30/6.29  % git: date: 2026-07-19 20:42:38 +0200
% 2.30/6.29  % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.30/6.29  % git: non_committed_changes: false
% 2.30/6.29  
% 2.30/6.29  % ------ Parsing...
% 2.30/6.29  % ------ Clausification by vclausify_rel  & Parsing by iProver...% 
% 2.30/6.29  
% 2.30/6.29  % ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe_e % 
% 2.30/6.29  
% 2.30/6.29  % ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e % 
% 2.30/6.29  
% 2.30/6.29  % ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.30/6.29  % ------ Proving...
% 2.30/6.29  % ------ Problem Properties 
% 2.30/6.29  
% 2.30/6.29  % 
% 2.30/6.29  % clauses                               31
% 2.30/6.29  % conjectures                           3
% 2.30/6.29  % EPR                                   4
% 2.30/6.29  % Horn                                  30
% 2.30/6.29  % unary                                 22
% 2.30/6.29  % binary                                7
% 2.30/6.29  % lits                                  43
% 2.30/6.29  % lits eq                               28
% 2.30/6.29  % fd_pure                               0
% 2.30/6.29  % fd_pseudo                             0
% 2.30/6.29  % fd_cond                               0
% 2.30/6.29  % fd_pseudo_cond                        1
% 2.30/6.29  % AC symbols                            1
% 2.30/6.29  
% 2.30/6.29  % ------ Schedule dynamic 5 is on 
% 2.30/6.29  
% 2.30/6.29  % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.30/6.29  
% 2.30/6.29  
% 2.30/6.29  % ------ 
% 2.30/6.29  % Current options:
% 2.30/6.29  % ------ 
% 2.30/6.29  
% 2.30/6.29  
% 2.30/6.29  % 
% 2.30/6.29  
% 2.30/6.29  % ------ Proving...
% 2.30/6.29  % 
% 2.30/6.29  
% 2.30/6.29  % SZS status Theorem for theBenchmark.p
% 2.30/6.29  
% 2.30/6.29  % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.30/6.29  
% 2.30/6.29  
%------------------------------------------------------------------------------