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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : KLE137+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 : n032.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 : Tue Apr 30 13:12:00 EDT 2024

% Result   : Theorem 0.10s 0.36s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (  20 unt;   0 def)
%            Number of atoms       :   40 (  15 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   25 (  14   ~;   7   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    3 (   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   :   46 (  44   !;   2   ?)

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

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

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

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

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

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

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

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

fof(f563,plain,
    ! [X0] : leq(X0,strong_iteration(one)),
    inference(superposition,[],[f559,f33]) ).

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

fof(f6,axiom,
    ! [X0] : multiplication(X0,one) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_right_identity) ).

fof(f559,plain,
    ! [X0,X1] : leq(X0,multiplication(strong_iteration(one),X1)),
    inference(subsumption_resolution,[],[f544,f315]) ).

fof(f315,plain,
    ! [X0,X1] : leq(X0,addition(X0,X1)),
    inference(trivial_inequality_removal,[],[f309]) ).

fof(f309,plain,
    ! [X0,X1] :
      ( addition(X0,X1) != addition(X0,X1)
      | leq(X0,addition(X0,X1)) ),
    inference(superposition,[],[f42,f171]) ).

fof(f171,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) ).

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(f544,plain,
    ! [X0,X1] :
      ( ~ leq(X0,addition(X0,X1))
      | leq(X0,multiplication(strong_iteration(one),X1)) ),
    inference(superposition,[],[f47,f34]) ).

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

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

fof(f47,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X2,addition(multiplication(X0,X2),X1))
      | leq(X2,multiplication(strong_iteration(X0),X1)) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f24,plain,
    ! [X0,X1,X2] :
      ( leq(X2,multiplication(strong_iteration(X0),X1))
      | ~ leq(X2,addition(multiplication(X0,X2),X1)) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f16,axiom,
    ! [X0,X1,X2] :
      ( leq(X2,addition(multiplication(X0,X2),X1))
     => leq(X2,multiplication(strong_iteration(X0),X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',infty_coinduction) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : KLE137+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.32  % Computer : n032.cluster.edu
% 0.10/0.32  % Model    : x86_64 x86_64
% 0.10/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32  % Memory   : 8042.1875MB
% 0.10/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32  % CPULimit   : 300
% 0.10/0.32  % WCLimit    : 300
% 0.10/0.32  % DateTime   : Tue Apr 30 05:07:36 EDT 2024
% 0.10/0.32  % CPUTime    : 
% 0.10/0.32  % (15327)Running in auto input_syntax mode. Trying TPTP
% 0.10/0.34  % (15330)WARNING: value z3 for option sas not known
% 0.10/0.34  % (15331)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.10/0.34  % (15328)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.10/0.34  % (15329)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.10/0.34  % (15333)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.10/0.34  % (15332)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.10/0.34  % (15335)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.10/0.34  % (15330)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.10/0.34  TRYING [1]
% 0.10/0.34  TRYING [2]
% 0.10/0.35  TRYING [3]
% 0.10/0.35  TRYING [1]
% 0.10/0.35  TRYING [2]
% 0.10/0.35  TRYING [4]
% 0.10/0.36  % (15330)First to succeed.
% 0.10/0.36  % (15330)Refutation found. Thanks to Tanya!
% 0.10/0.36  % SZS status Theorem for theBenchmark
% 0.10/0.36  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.36  % (15330)------------------------------
% 0.10/0.36  % (15330)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.10/0.36  % (15330)Termination reason: Refutation
% 0.10/0.36  
% 0.10/0.36  % (15330)Memory used [KB]: 1017
% 0.10/0.36  % (15330)Time elapsed: 0.016 s
% 0.10/0.36  % (15330)Instructions burned: 28 (million)
% 0.10/0.36  % (15330)------------------------------
% 0.10/0.36  % (15330)------------------------------
% 0.10/0.36  % (15327)Success in time 0.031 s
%------------------------------------------------------------------------------