TSTP Solution File: KLE007+1 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : KLE007+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n019.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 07:16:46 EDT 2024

% Result   : Theorem 0.21s 0.38s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  14 unt;   0 def)
%            Number of atoms       :   87 (  46 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   83 (  30   ~;  18   |;  24   &)
%                                         (   5 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   41 (  35   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f111,plain,
    $false,
    inference(trivial_inequality_removal,[],[f110]) ).

fof(f110,plain,
    one != one,
    inference(superposition,[],[f109,f103]) ).

fof(f103,plain,
    one = addition(sK1,c(sK1)),
    inference(resolution,[],[f76,f38]) ).

fof(f38,plain,
    test(sK1),
    inference(cnf_transformation,[],[f30]) ).

fof(f30,plain,
    ( one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))
    & test(sK0)
    & test(sK1) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f26,f29]) ).

fof(f29,plain,
    ( ? [X0,X1] :
        ( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
        & test(X0)
        & test(X1) )
   => ( one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1)))
      & test(sK0)
      & test(sK1) ) ),
    introduced(choice_axiom,[]) ).

fof(f26,plain,
    ? [X0,X1] :
      ( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
      & test(X0)
      & test(X1) ),
    inference(flattening,[],[f25]) ).

fof(f25,plain,
    ? [X0,X1] :
      ( one != addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1)))
      & test(X0)
      & test(X1) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f19,plain,
    ~ ! [X0,X1] :
        ( ( test(X0)
          & test(X1) )
       => one = addition(multiplication(addition(X0,c(X0)),X1),multiplication(addition(X0,c(X0)),c(X1))) ),
    inference(rectify,[],[f18]) ).

fof(f18,negated_conjecture,
    ~ ! [X3,X4] :
        ( ( test(X3)
          & test(X4) )
       => one = addition(multiplication(addition(X3,c(X3)),X4),multiplication(addition(X3,c(X3)),c(X4))) ),
    inference(negated_conjecture,[],[f17]) ).

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

fof(f76,plain,
    ! [X0] :
      ( ~ test(X0)
      | one = addition(X0,c(X0)) ),
    inference(forward_demodulation,[],[f75,f50]) ).

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

fof(f1,axiom,
    ! [X0,X1] : addition(X0,X1) = addition(X1,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',additive_commutativity) ).

fof(f75,plain,
    ! [X0] :
      ( one = addition(c(X0),X0)
      | ~ test(X0) ),
    inference(resolution,[],[f55,f61]) ).

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

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

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

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

fof(f22,plain,
    ! [X0,X1] :
      ( test(X0)
     => ( c(X0) = X1
      <=> complement(X0,X1) ) ),
    inference(rectify,[],[f15]) ).

fof(f15,axiom,
    ! [X3,X4] :
      ( test(X3)
     => ( c(X3) = X4
      <=> complement(X3,X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_3) ).

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

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

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

fof(f23,plain,
    ! [X0,X1] :
      ( complement(X1,X0)
    <=> ( addition(X0,X1) = one
        & zero = multiplication(X1,X0)
        & zero = multiplication(X0,X1) ) ),
    inference(rectify,[],[f14]) ).

fof(f14,axiom,
    ! [X3,X4] :
      ( complement(X4,X3)
    <=> ( one = addition(X3,X4)
        & zero = multiplication(X4,X3)
        & zero = multiplication(X3,X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',test_2) ).

fof(f109,plain,
    one != addition(sK1,c(sK1)),
    inference(forward_demodulation,[],[f108,f45]) ).

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

fof(f7,axiom,
    ! [X0] : multiplication(one,X0) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiplicative_left_identity) ).

fof(f108,plain,
    one != addition(multiplication(one,sK1),c(sK1)),
    inference(forward_demodulation,[],[f107,f45]) ).

fof(f107,plain,
    one != addition(multiplication(one,sK1),multiplication(one,c(sK1))),
    inference(backward_demodulation,[],[f40,f104]) ).

fof(f104,plain,
    one = addition(sK0,c(sK0)),
    inference(resolution,[],[f76,f39]) ).

fof(f39,plain,
    test(sK0),
    inference(cnf_transformation,[],[f30]) ).

fof(f40,plain,
    one != addition(multiplication(addition(sK0,c(sK0)),sK1),multiplication(addition(sK0,c(sK0)),c(sK1))),
    inference(cnf_transformation,[],[f30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : KLE007+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.35  % Computer : n019.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit   : 300
% 0.15/0.35  % WCLimit    : 300
% 0.15/0.35  % DateTime   : Fri May  3 21:20:23 EDT 2024
% 0.15/0.35  % CPUTime    : 
% 0.15/0.36  % (28013)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.37  % (28018)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.15/0.37  % (28016)WARNING: value z3 for option sas not known
% 0.15/0.37  % (28014)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.37  % (28015)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.37  % (28017)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.37  % (28016)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.37  % (28019)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.15/0.37  % (28020)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.15/0.38  TRYING [1]
% 0.15/0.38  TRYING [2]
% 0.15/0.38  TRYING [3]
% 0.15/0.38  % (28019)First to succeed.
% 0.15/0.38  % (28019)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-28013"
% 0.15/0.38  TRYING [1]
% 0.21/0.38  % (28019)Refutation found. Thanks to Tanya!
% 0.21/0.38  % SZS status Theorem for theBenchmark
% 0.21/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38  % (28019)------------------------------
% 0.21/0.38  % (28019)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.21/0.38  % (28019)Termination reason: Refutation
% 0.21/0.38  
% 0.21/0.38  % (28019)Memory used [KB]: 880
% 0.21/0.38  % (28019)Time elapsed: 0.007 s
% 0.21/0.38  % (28019)Instructions burned: 8 (million)
% 0.21/0.38  % (28013)Success in time 0.024 s
%------------------------------------------------------------------------------