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

View Problem - Process Solution

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

% Computer : n023.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:42:30 EDT 2024

% Result   : Theorem 0.14s 0.38s
% Output   : Refutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   37 (  14 unt;   0 def)
%            Number of atoms       :   71 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   65 (  31   ~;  20   |;   2   &)
%                                         (   5 <=>;   7  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   33 (  31   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f207,plain,
    $false,
    inference(resolution,[],[f205,f118]) ).

fof(f118,plain,
    and_3,
    inference(cnf_transformation,[],[f42]) ).

fof(f42,axiom,
    and_3,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_and_3) ).

fof(f205,plain,
    ~ and_3,
    inference(resolution,[],[f204,f138]) ).

fof(f138,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
      | ~ and_3 ),
    inference(cnf_transformation,[],[f94]) ).

fof(f94,plain,
    ( ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1))))
    | ~ and_3 ),
    inference(ennf_transformation,[],[f74]) ).

fof(f74,plain,
    ( and_3
   => ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
    inference(unused_predicate_definition_removal,[],[f9]) ).

fof(f9,axiom,
    ( and_3
  <=> ! [X0,X1] : is_a_theorem(implies(X0,implies(X1,and(X0,X1)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',and_3) ).

fof(f204,plain,
    ~ is_a_theorem(implies(sK0,implies(sK0,and(sK0,sK0)))),
    inference(resolution,[],[f196,f122]) ).

fof(f122,plain,
    implies_2,
    inference(cnf_transformation,[],[f38]) ).

fof(f38,axiom,
    implies_2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_implies_2) ).

fof(f196,plain,
    ( ~ implies_2
    | ~ is_a_theorem(implies(sK0,implies(sK0,and(sK0,sK0)))) ),
    inference(resolution,[],[f142,f152]) ).

fof(f152,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,implies(sK0,and(sK0,sK0))))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f150,f108]) ).

fof(f108,plain,
    modus_ponens,
    inference(cnf_transformation,[],[f35]) ).

fof(f35,axiom,
    modus_ponens,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',hilbert_modus_ponens) ).

fof(f150,plain,
    ! [X0] :
      ( ~ modus_ponens
      | ~ is_a_theorem(X0)
      | ~ is_a_theorem(implies(X0,implies(sK0,and(sK0,sK0)))) ),
    inference(resolution,[],[f145,f148]) ).

fof(f148,plain,
    ~ is_a_theorem(implies(sK0,and(sK0,sK0))),
    inference(resolution,[],[f132,f107]) ).

fof(f107,plain,
    ~ kn1,
    inference(cnf_transformation,[],[f55]) ).

fof(f55,plain,
    ~ kn1,
    inference(flattening,[],[f54]) ).

fof(f54,negated_conjecture,
    ~ kn1,
    inference(negated_conjecture,[],[f53]) ).

fof(f53,conjecture,
    kn1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',rosser_kn1) ).

fof(f132,plain,
    ( kn1
    | ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
    inference(cnf_transformation,[],[f106]) ).

fof(f106,plain,
    ( kn1
    | ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f88,f105]) ).

fof(f105,plain,
    ( ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0)))
   => ~ is_a_theorem(implies(sK0,and(sK0,sK0))) ),
    introduced(choice_axiom,[]) ).

fof(f88,plain,
    ( kn1
    | ? [X0] : ~ is_a_theorem(implies(X0,and(X0,X0))) ),
    inference(ennf_transformation,[],[f67]) ).

fof(f67,plain,
    ( ! [X0] : is_a_theorem(implies(X0,and(X0,X0)))
   => kn1 ),
    inference(unused_predicate_definition_removal,[],[f66]) ).

fof(f66,plain,
    ( kn1
  <=> ! [X0] : is_a_theorem(implies(X0,and(X0,X0))) ),
    inference(rectify,[],[f16]) ).

fof(f16,axiom,
    ( kn1
  <=> ! [X3] : is_a_theorem(implies(X3,and(X3,X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',kn1) ).

fof(f145,plain,
    ! [X0,X1] :
      ( is_a_theorem(X1)
      | ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | ~ modus_ponens ),
    inference(cnf_transformation,[],[f102]) ).

fof(f102,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(X1)
        | ~ is_a_theorem(implies(X0,X1))
        | ~ is_a_theorem(X0) )
    | ~ modus_ponens ),
    inference(flattening,[],[f101]) ).

fof(f101,plain,
    ( ! [X0,X1] :
        ( is_a_theorem(X1)
        | ~ is_a_theorem(implies(X0,X1))
        | ~ is_a_theorem(X0) )
    | ~ modus_ponens ),
    inference(ennf_transformation,[],[f82]) ).

fof(f82,plain,
    ( modus_ponens
   => ! [X0,X1] :
        ( ( is_a_theorem(implies(X0,X1))
          & is_a_theorem(X0) )
       => is_a_theorem(X1) ) ),
    inference(unused_predicate_definition_removal,[],[f1]) ).

fof(f1,axiom,
    ( modus_ponens
  <=> ! [X0,X1] :
        ( ( is_a_theorem(implies(X0,X1))
          & is_a_theorem(X0) )
       => is_a_theorem(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',modus_ponens) ).

fof(f142,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
      | ~ implies_2 ),
    inference(cnf_transformation,[],[f98]) ).

fof(f98,plain,
    ( ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1)))
    | ~ implies_2 ),
    inference(ennf_transformation,[],[f78]) ).

fof(f78,plain,
    ( implies_2
   => ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
    inference(unused_predicate_definition_removal,[],[f5]) ).

fof(f5,axiom,
    ( implies_2
  <=> ! [X0,X1] : is_a_theorem(implies(implies(X0,implies(X0,X1)),implies(X0,X1))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',implies_2) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem    : LCL459+1 : TPTP v8.1.2. Released v3.3.0.
% 0.11/0.14  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35  % Computer : n023.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Mon Apr 29 22:49:25 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.14/0.36  % (17335)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37  % (17338)WARNING: value z3 for option sas not known
% 0.14/0.37  % (17336)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.37  % (17337)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.37  % (17339)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.37  % (17338)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.14/0.37  % (17340)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.14/0.37  % (17341)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.14/0.37  % (17342)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.14/0.38  TRYING [1]
% 0.14/0.38  TRYING [2]
% 0.14/0.38  % (17341)First to succeed.
% 0.14/0.38  % (17341)Refutation found. Thanks to Tanya!
% 0.14/0.38  % SZS status Theorem for theBenchmark
% 0.14/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.14/0.38  % (17341)------------------------------
% 0.14/0.38  % (17341)Version: Vampire 4.8 (commit 8e9376e55 on 2024-01-18 13:49:33 +0100)
% 0.14/0.38  % (17341)Termination reason: Refutation
% 0.14/0.38  
% 0.14/0.38  % (17341)Memory used [KB]: 965
% 0.14/0.38  % (17341)Time elapsed: 0.007 s
% 0.14/0.38  % (17341)Instructions burned: 8 (million)
% 0.14/0.38  % (17341)------------------------------
% 0.14/0.38  % (17341)------------------------------
% 0.14/0.38  % (17335)Success in time 0.025 s
%------------------------------------------------------------------------------