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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : KLE146+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 : n021.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:17:24 EDT 2024

% Result   : Theorem 0.23s 0.41s
% Output   : Refutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   24 (  20 unt;   0 def)
%            Number of atoms       :   30 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   16 (  10   ~;   3   |;   1   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   34 (  32   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f256,plain,
    $false,
    inference(resolution,[],[f245,f30]) ).

fof(f30,plain,
    ~ leq(one,strong_iteration(sK0)),
    inference(cnf_transformation,[],[f28]) ).

fof(f28,plain,
    ~ leq(one,strong_iteration(sK0)),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f27]) ).

fof(f27,plain,
    ( ? [X0] : ~ leq(one,strong_iteration(X0))
   => ~ leq(one,strong_iteration(sK0)) ),
    introduced(choice_axiom,[]) ).

fof(f23,plain,
    ? [X0] : ~ leq(one,strong_iteration(X0)),
    inference(ennf_transformation,[],[f21]) ).

fof(f21,plain,
    ~ ! [X0] : leq(one,strong_iteration(X0)),
    inference(rectify,[],[f20]) ).

fof(f20,negated_conjecture,
    ~ ! [X3] : leq(one,strong_iteration(X3)),
    inference(negated_conjecture,[],[f19]) ).

fof(f19,conjecture,
    ! [X3] : leq(one,strong_iteration(X3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).

fof(f245,plain,
    ! [X0] : leq(one,strong_iteration(X0)),
    inference(superposition,[],[f207,f102]) ).

fof(f102,plain,
    ! [X0] : strong_iteration(X0) = addition(one,multiplication(X0,strong_iteration(X0))),
    inference(superposition,[],[f36,f40]) ).

fof(f40,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/sandbox2/benchmark/theBenchmark.p',additive_commutativity) ).

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

fof(f15,axiom,
    ! [X0] : strong_iteration(X0) = addition(multiplication(X0,strong_iteration(X0)),one),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_unfold1) ).

fof(f207,plain,
    ! [X0,X1] : leq(X0,addition(X0,X1)),
    inference(unit_resulting_resolution,[],[f182,f42]) ).

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

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

fof(f18,axiom,
    ! [X0,X1] :
      ( leq(X0,X1)
    <=> addition(X0,X1) = X1 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',order) ).

fof(f182,plain,
    ! [X0,X1] : addition(X0,X1) = addition(X0,addition(X0,X1)),
    inference(superposition,[],[f43,f35]) ).

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

fof(f4,axiom,
    ! [X0] : addition(X0,X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence) ).

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

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

fof(f2,axiom,
    ! [X2,X1,X0] : addition(X0,addition(X1,X2)) = addition(addition(X0,X1),X2),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_associativity) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem    : KLE146+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.15/0.36  % Computer : n021.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 300
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Fri May  3 21:23:53 EDT 2024
% 0.15/0.36  % CPUTime    : 
% 0.15/0.37  % (13162)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.38  % (13163)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.15/0.39  TRYING [1]
% 0.15/0.39  % (13165)WARNING: value z3 for option sas not known
% 0.15/0.39  TRYING [2]
% 0.15/0.40  % (13164)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.15/0.40  % (13166)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.15/0.40  % (13165)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.40  % (13167)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.40  % (13169)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.40  % (13168)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.40  TRYING [1]
% 0.15/0.40  TRYING [2]
% 0.23/0.41  TRYING [3]
% 0.23/0.41  % (13168)Also succeeded, but the first one will report.
% 0.23/0.41  % (13169)First to succeed.
% 0.23/0.41  % (13169)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-13162"
% 0.23/0.41  % (13169)Refutation found. Thanks to Tanya!
% 0.23/0.41  % SZS status Theorem for theBenchmark
% 0.23/0.41  % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.41  % (13169)------------------------------
% 0.23/0.41  % (13169)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.23/0.41  % (13169)Termination reason: Refutation
% 0.23/0.41  
% 0.23/0.41  % (13169)Memory used [KB]: 863
% 0.23/0.41  % (13169)Time elapsed: 0.014 s
% 0.23/0.41  % (13169)Instructions burned: 12 (million)
% 0.23/0.41  % (13162)Success in time 0.042 s
%------------------------------------------------------------------------------