TSTP Solution File: CAT011-3 by Vampire---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire---4.8
% Problem  : CAT011-3 : TPTP v8.2.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s

% Computer : n013.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 : Mon May 20 19:00:33 EDT 2024

% Result   : Unsatisfiable 0.58s 0.73s
% Output   : Refutation 0.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (   8 unt;   0 def)
%            Number of atoms       :   95 (  12 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :  123 (  65   ~;  53   |;   0   &)
%                                         (   5 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   6 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-2 aty)
%            Number of variables   :   30 (  30   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f114,plain,
    $false,
    inference(avatar_sat_refutation,[],[f64,f75,f92,f94,f101,f108]) ).

fof(f108,plain,
    ( ~ spl0_6
    | ~ spl0_2
    | spl0_7 ),
    inference(avatar_split_clause,[],[f107,f98,f58,f89]) ).

fof(f89,plain,
    ( spl0_6
  <=> there_exists(a) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_6])]) ).

fof(f58,plain,
    ( spl0_2
  <=> there_exists(domain(a)) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).

fof(f98,plain,
    ( spl0_7
  <=> there_exists(compose(codomain(domain(a)),domain(domain(a)))) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_7])]) ).

fof(f107,plain,
    ( ~ there_exists(domain(a))
    | ~ there_exists(a)
    | spl0_7 ),
    inference(forward_demodulation,[],[f105,f10]) ).

fof(f10,axiom,
    ! [X0] : compose(X0,domain(X0)) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_domain) ).

fof(f105,plain,
    ( ~ there_exists(a)
    | ~ there_exists(compose(domain(a),domain(domain(a))))
    | spl0_7 ),
    inference(superposition,[],[f102,f10]) ).

fof(f102,plain,
    ( ! [X0] :
        ( ~ there_exists(compose(X0,domain(a)))
        | ~ there_exists(compose(domain(X0),domain(domain(a)))) )
    | spl0_7 ),
    inference(superposition,[],[f100,f7]) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( domain(X0) = codomain(X1)
      | ~ there_exists(compose(X0,X1)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_codomain_composition1) ).

fof(f100,plain,
    ( ~ there_exists(compose(codomain(domain(a)),domain(domain(a))))
    | spl0_7 ),
    inference(avatar_component_clause,[],[f98]) ).

fof(f101,plain,
    ( ~ spl0_7
    | ~ spl0_2
    | ~ spl0_4 ),
    inference(avatar_split_clause,[],[f96,f82,f58,f98]) ).

fof(f82,plain,
    ( spl0_4
  <=> ! [X2] :
        ( ~ there_exists(compose(X2,domain(domain(a))))
        | ~ there_exists(compose(X2,domain(a))) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_4])]) ).

fof(f96,plain,
    ( ~ there_exists(domain(a))
    | ~ there_exists(compose(codomain(domain(a)),domain(domain(a))))
    | ~ spl0_4 ),
    inference(superposition,[],[f83,f11]) ).

fof(f11,axiom,
    ! [X0] : compose(codomain(X0),X0) = X0,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',compose_codomain) ).

fof(f83,plain,
    ( ! [X2] :
        ( ~ there_exists(compose(X2,domain(a)))
        | ~ there_exists(compose(X2,domain(domain(a)))) )
    | ~ spl0_4 ),
    inference(avatar_component_clause,[],[f82]) ).

fof(f94,plain,
    spl0_6,
    inference(avatar_contradiction_clause,[],[f93]) ).

fof(f93,plain,
    ( $false
    | spl0_6 ),
    inference(resolution,[],[f91,f24]) ).

fof(f24,plain,
    there_exists(a),
    inference(resolution,[],[f4,f18]) ).

fof(f18,axiom,
    there_exists(domain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',assume_domain_exists) ).

fof(f4,axiom,
    ! [X0] :
      ( ~ there_exists(domain(X0))
      | there_exists(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',domain_has_elements) ).

fof(f91,plain,
    ( ~ there_exists(a)
    | spl0_6 ),
    inference(avatar_component_clause,[],[f89]) ).

fof(f92,plain,
    ( spl0_4
    | ~ spl0_6
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f79,f73,f89,f82]) ).

fof(f73,plain,
    ( spl0_3
  <=> ! [X2,X0,X1] :
        ( domain(X0) != domain(a)
        | ~ there_exists(compose(X0,X2))
        | ~ there_exists(compose(X1,domain(domain(a))))
        | ~ there_exists(compose(X1,X2)) ) ),
    introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).

fof(f79,plain,
    ( ! [X0] :
        ( ~ there_exists(a)
        | ~ there_exists(compose(X0,domain(domain(a))))
        | ~ there_exists(compose(X0,domain(a))) )
    | ~ spl0_3 ),
    inference(equality_resolution,[],[f76]) ).

fof(f76,plain,
    ( ! [X0,X1] :
        ( domain(X0) != domain(a)
        | ~ there_exists(X0)
        | ~ there_exists(compose(X1,domain(domain(a))))
        | ~ there_exists(compose(X1,domain(X0))) )
    | ~ spl0_3 ),
    inference(superposition,[],[f74,f10]) ).

fof(f74,plain,
    ( ! [X2,X0,X1] :
        ( ~ there_exists(compose(X0,X2))
        | domain(X0) != domain(a)
        | ~ there_exists(compose(X1,domain(domain(a))))
        | ~ there_exists(compose(X1,X2)) )
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f73]) ).

fof(f75,plain,
    ( spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f71,f58,f73]) ).

fof(f71,plain,
    ! [X2,X0,X1] :
      ( ~ there_exists(domain(a))
      | domain(X0) != domain(a)
      | ~ there_exists(compose(X1,domain(domain(a))))
      | ~ there_exists(compose(X1,X2))
      | ~ there_exists(compose(X0,X2)) ),
    inference(superposition,[],[f69,f10]) ).

fof(f69,plain,
    ! [X2,X3,X0,X1] :
      ( ~ there_exists(compose(domain(a),X2))
      | domain(a) != domain(X1)
      | ~ there_exists(compose(X3,X2))
      | ~ there_exists(compose(X3,X0))
      | ~ there_exists(compose(X1,X0)) ),
    inference(superposition,[],[f50,f7]) ).

fof(f50,plain,
    ! [X2,X0,X1] :
      ( codomain(X1) != domain(a)
      | ~ there_exists(compose(domain(a),X2))
      | ~ there_exists(compose(X0,X2))
      | ~ there_exists(compose(X0,X1)) ),
    inference(superposition,[],[f49,f7]) ).

fof(f49,plain,
    ! [X0,X1] :
      ( domain(a) != domain(X1)
      | ~ there_exists(compose(domain(a),X0))
      | ~ there_exists(compose(X1,X0)) ),
    inference(superposition,[],[f41,f7]) ).

fof(f41,plain,
    ! [X0] :
      ( codomain(X0) != domain(a)
      | ~ there_exists(compose(domain(a),X0)) ),
    inference(superposition,[],[f19,f7]) ).

fof(f19,axiom,
    domain(a) != domain(domain(a)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_domain_is_idempotent) ).

fof(f64,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f62]) ).

fof(f62,plain,
    ( $false
    | spl0_2 ),
    inference(resolution,[],[f60,f18]) ).

fof(f60,plain,
    ( ~ there_exists(domain(a))
    | spl0_2 ),
    inference(avatar_component_clause,[],[f58]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.15  % Problem    : CAT011-3 : TPTP v8.2.0. Released v1.0.0.
% 0.14/0.16  % Command    : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.16/0.39  % Computer : n013.cluster.edu
% 0.16/0.39  % Model    : x86_64 x86_64
% 0.16/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.39  % Memory   : 8042.1875MB
% 0.16/0.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.39  % CPULimit   : 300
% 0.16/0.39  % WCLimit    : 300
% 0.16/0.39  % DateTime   : Sat May 18 11:29:38 EDT 2024
% 0.16/0.39  % CPUTime    : 
% 0.16/0.39  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.16/0.39  Running vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.51/0.73  % (15283)lrs+1011_461:32768_sil=16000:irw=on:sp=frequency:lsd=20:fd=preordered:nwc=10.0:s2agt=32:alpa=false:cond=fast:s2a=on:i=51:s2at=3.0:awrs=decay:awrsf=691:bd=off:nm=20:fsr=off:amm=sco:uhcvi=on:rawr=on_0 on theBenchmark for (2996ds/51Mi)
% 0.51/0.73  % (15286)lrs+2_1:1_sil=16000:fde=none:sos=all:nwc=5.0:i=34:ep=RS:s2pl=on:lma=on:afp=100000_0 on theBenchmark for (2996ds/34Mi)
% 0.51/0.73  % (15282)dis-1011_2:1_sil=2000:lsd=20:nwc=5.0:flr=on:mep=off:st=3.0:i=34:sd=1:ep=RS:ss=axioms_0 on theBenchmark for (2996ds/34Mi)
% 0.51/0.73  % (15287)lrs+1002_1:16_to=lpo:sil=32000:sp=unary_frequency:sos=on:i=45:bd=off:ss=axioms_0 on theBenchmark for (2996ds/45Mi)
% 0.51/0.73  % (15288)lrs+21_1:5_sil=2000:sos=on:urr=on:newcnf=on:slsq=on:i=83:slsql=off:bd=off:nm=2:ss=axioms:st=1.5:sp=const_min:gsp=on:rawr=on_0 on theBenchmark for (2996ds/83Mi)
% 0.51/0.73  % (15286)Refutation not found, incomplete strategy% (15286)------------------------------
% 0.51/0.73  % (15286)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (15286)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (15286)Memory used [KB]: 984
% 0.51/0.73  % (15286)Time elapsed: 0.001 s
% 0.51/0.73  % (15286)Instructions burned: 2 (million)
% 0.51/0.73  % (15289)lrs-21_1:1_to=lpo:sil=2000:sp=frequency:sos=on:lma=on:i=56:sd=2:ss=axioms:ep=R_0 on theBenchmark for (2996ds/56Mi)
% 0.51/0.73  % (15286)------------------------------
% 0.51/0.73  % (15286)------------------------------
% 0.51/0.73  % (15287)Refutation not found, incomplete strategy% (15287)------------------------------
% 0.51/0.73  % (15287)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (15287)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (15287)Memory used [KB]: 980
% 0.51/0.73  % (15287)Time elapsed: 0.002 s
% 0.51/0.73  % (15287)Instructions burned: 2 (million)
% 0.51/0.73  % (15289)Refutation not found, incomplete strategy% (15289)------------------------------
% 0.51/0.73  % (15289)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (15289)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (15289)Memory used [KB]: 981
% 0.51/0.73  % (15289)Time elapsed: 0.002 s
% 0.51/0.73  % (15289)Instructions burned: 2 (million)
% 0.51/0.73  % (15287)------------------------------
% 0.51/0.73  % (15287)------------------------------
% 0.51/0.73  % (15288)Refutation not found, incomplete strategy% (15288)------------------------------
% 0.51/0.73  % (15288)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (15288)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (15288)Memory used [KB]: 982
% 0.51/0.73  % (15288)Time elapsed: 0.002 s
% 0.51/0.73  % (15288)Instructions burned: 2 (million)
% 0.51/0.73  % (15289)------------------------------
% 0.51/0.73  % (15289)------------------------------
% 0.51/0.73  % (15282)Refutation not found, incomplete strategy% (15282)------------------------------
% 0.51/0.73  % (15282)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.51/0.73  % (15288)------------------------------
% 0.51/0.73  % (15288)------------------------------
% 0.51/0.73  % (15282)Termination reason: Refutation not found, incomplete strategy
% 0.51/0.73  
% 0.51/0.73  % (15282)Memory used [KB]: 986
% 0.51/0.73  % (15282)Time elapsed: 0.003 s
% 0.51/0.73  % (15282)Instructions burned: 3 (million)
% 0.51/0.73  % (15282)------------------------------
% 0.51/0.73  % (15282)------------------------------
% 0.51/0.73  % (15283)First to succeed.
% 0.58/0.73  % (15283)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-15281"
% 0.58/0.73  % (15285)ott+1011_1:1_sil=2000:urr=on:i=33:sd=1:kws=inv_frequency:ss=axioms:sup=off_0 on theBenchmark for (2996ds/33Mi)
% 0.58/0.73  % (15283)Refutation found. Thanks to Tanya!
% 0.58/0.73  % SZS status Unsatisfiable for theBenchmark
% 0.58/0.73  % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.73  % (15283)------------------------------
% 0.58/0.73  % (15283)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.58/0.73  % (15283)Termination reason: Refutation
% 0.58/0.73  
% 0.58/0.73  % (15283)Memory used [KB]: 1028
% 0.58/0.73  % (15283)Time elapsed: 0.004 s
% 0.58/0.73  % (15283)Instructions burned: 7 (million)
% 0.58/0.73  % (15281)Success in time 0.339 s
% 0.58/0.73  % Vampire---4.8 exiting
%------------------------------------------------------------------------------