↑ Up

Vampire---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : CSR152_8 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n018.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 09:43:58 AM UTC 2026

% Result   : Theorem 3.70s 1.28s
% Output   : Refutation 3.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   61 (  22 unt;   0 typ;   7 def)
%            Number of atoms       :  268 (  33 equ)
%            Maximal formula atoms :    6 (   4 avg)
%            Number of connectives :  113 (  48   ~;  47   |;   8   &)
%                                         (   8 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of FOOLs       :  146 ( 142 fml;   4 var)
%            Number of types       :    3 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :   17 (  14 usr;  14 prp; 0-2 aty)
%            Number of functors    :    0 (   0 usr;   0 con; --- aty)
%            Number of variables   :   13 (   0 sgn  11   !;   2   ?;  13   :)

% Comments : 
%------------------------------------------------------------------------------
tff(type_def_5,type,
    num: $tType ).

tff(func_def_4,type,
    bG0: $o ).

tff(func_def_7,type,
    bG1: $o ).

tff(func_def_8,type,
    bG2: $o ).

tff(pred_def_1,type,
    knows_THFTYPE_IiooI: ( $i * $o ) > $o ).

tff(f1,axiom,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,lChris_THFTYPE_i = lChris_THFTYPE_i),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax) ).

tff(f2,axiom,
    likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_001) ).

tff(f3,axiom,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,
      ! [X0: $i] :
        ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
       => likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0) )),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax_002) ).

tff(f4,conjecture,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).

tff(f5,negated_conjecture,
    ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)),
    inference(negated_conjecture,[status(cth)],[f4]) ).

tff(f6,definition,
    ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
  <=> ( bG0 = $true ) ),
    introduced(definition,[new_symbols(definition,[bG0])],[fool_formula_definition]) ).

tff(f7,plain,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG0),
    inference(fool_elimination,[],[f1,f6]) ).

tff(f8,definition,
    ( ! [X0: $i] :
        ( likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
       => likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0) )
  <=> ( $true = bG1 ) ),
    introduced(definition,[new_symbols(definition,[bG1])],[fool_formula_definition]) ).

tff(f9,plain,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG1),
    inference(fool_elimination,[],[f3,f8]) ).

tff(f10,definition,
    ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
  <=> ( $true = bG2 ) ),
    introduced(definition,[new_symbols(definition,[bG2])],[fool_formula_definition]) ).

tff(f11,plain,
    ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG2),
    inference(fool_elimination,[],[f5,f10]) ).

tff(f12,plain,
    ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG2),
    inference(flattening,[],[f11]) ).

tff(f13,plain,
    ( ! [X0: $i] :
        ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
        | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )
  <=> ( $true = bG1 ) ),
    inference(ennf_transformation,[],[f8]) ).

tff(f14,plain,
    ( ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
      | ( $true != bG2 ) )
    & ( ( $true = bG2 )
      | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ) ),
    inference(nnf_transformation,[],[f10]) ).

tff(f15,plain,
    ( ( ! [X0: $i] :
          ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
          | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )
      | ( $true != bG1 ) )
    & ( ( $true = bG1 )
      | ? [X0: $i] :
          ( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
          & likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) ) ) ),
    inference(nnf_transformation,[],[f13]) ).

tff(f16,plain,
    ( ( ! [X0: $i] :
          ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
          | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )
      | ( $true != bG1 ) )
    & ( ( $true = bG1 )
      | ? [X1: $i] :
          ( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,X1)
          & likes_THFTYPE_IiioI(lMary_THFTYPE_i,X1) ) ) ),
    inference(rectify,[],[f15]) ).

tff(f17,plain,
    ( ( ! [X0: $i] :
          ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
          | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )
      | ( $true != bG1 ) )
    & ( ( $true = bG1 )
      | ( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,sK3)
        & likes_THFTYPE_IiioI(lMary_THFTYPE_i,sK3) ) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK3]),skolemize(X1,sK3)],[f16]) ).

tff(f18,plain,
    ( ( ( lChris_THFTYPE_i = lChris_THFTYPE_i )
      | ( bG0 != $true ) )
    & ( ( bG0 = $true )
      | ( lChris_THFTYPE_i != lChris_THFTYPE_i ) ) ),
    inference(nnf_transformation,[],[f6]) ).

tff(f19,plain,
    ( ( $true = bG2 )
    | ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ),
    inference(cnf_transformation,[],[f14]) ).

tff(f23,plain,
    ! [X0: $i] :
      ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
      | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0)
      | ( $true != bG1 ) ),
    inference(cnf_transformation,[],[f17]) ).

tff(f24,plain,
    ( ( bG0 = $true )
    | ( lChris_THFTYPE_i != lChris_THFTYPE_i ) ),
    inference(cnf_transformation,[],[f18]) ).

tff(f26,plain,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG0),
    inference(cnf_transformation,[],[f7]) ).

tff(f27,plain,
    likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i),
    inference(cnf_transformation,[],[f2]) ).

tff(f28,plain,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG1),
    inference(cnf_transformation,[],[f9]) ).

tff(f29,plain,
    ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,bG2),
    inference(cnf_transformation,[],[f12]) ).

tff(f31,plain,
    ! [X0: $o] :
      ( ( $false = (X0) )
      | ( $true = (X0) ) ),
    introduced(definition,[],[fool_exhaustiveness_axiom]) ).

tff(f32,plain,
    bG0 = $true,
    inference(trivial_inequality_removal,[],[f24]) ).

tff(f38,definition,
    ( spl4_2
  <=> ( $true = bG1 ) ),
    introduced(definition,[new_symbols(definition,[spl4_2])],[avatar_definition]) ).

tff(f39,plain,
    ( ( $true != bG1 )
    | spl4_2 ),
    inference(avatar_component_clause,[],[f38]) ).

tff(f48,definition,
    ( spl4_4
  <=> ! [X0: $i] :
        ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
        | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) ) ),
    introduced(definition,[new_symbols(definition,[spl4_4])],[avatar_definition]) ).

tff(f49,plain,
    ( ! [X0: $i] :
        ( likes_THFTYPE_IiioI(lSue_THFTYPE_i,X0)
        | ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,X0) )
    | ~ spl4_4 ),
    inference(avatar_component_clause,[],[f48]) ).

tff(f50,plain,
    ( ~ spl4_2
    | spl4_4 ),
    inference(avatar_split_clause,[],[f23,f48,f38]) ).

tff(f52,definition,
    ( spl4_5
  <=> likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i) ),
    introduced(definition,[new_symbols(definition,[spl4_5])],[avatar_definition]) ).

tff(f54,plain,
    ( ~ likes_THFTYPE_IiioI(lSue_THFTYPE_i,lBill_THFTYPE_i)
    | spl4_5 ),
    inference(avatar_component_clause,[],[f52]) ).

tff(f56,definition,
    ( spl4_6
  <=> ( $true = bG2 ) ),
    introduced(definition,[new_symbols(definition,[spl4_6])],[avatar_definition]) ).

tff(f57,plain,
    ( ( $true != bG2 )
    | spl4_6 ),
    inference(avatar_component_clause,[],[f56]) ).

tff(f58,plain,
    ( ( $true = bG2 )
    | ~ spl4_6 ),
    inference(avatar_component_clause,[],[f56]) ).

tff(f59,plain,
    ( ~ spl4_5
    | spl4_6 ),
    inference(avatar_split_clause,[],[f19,f56,f52]) ).

tff(f61,plain,
    knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true),
    inference(superposition,[],[f26,f32]) ).

tff(f63,plain,
    ( ~ likes_THFTYPE_IiioI(lMary_THFTYPE_i,lBill_THFTYPE_i)
    | ~ spl4_4
    | spl4_5 ),
    inference(resolution,[],[f49,f54]) ).

tff(f64,plain,
    ( $false
    | ~ spl4_4
    | spl4_5 ),
    inference(forward_subsumption_resolution,[],[f63,f27]) ).

tff(f65,plain,
    ( ~ spl4_4
    | spl4_5 ),
    inference(avatar_contradiction_clause,[],[f64]) ).

tff(f66,plain,
    ( ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,$true)
    | ~ spl4_6 ),
    inference(superposition,[],[f29,f58]) ).

tff(f67,plain,
    ( $false
    | ~ spl4_6 ),
    inference(forward_subsumption_resolution,[],[f66,f61]) ).

tff(f68,plain,
    ~ spl4_6,
    inference(avatar_contradiction_clause,[],[f67]) ).

tff(f75,plain,
    ( ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)
    | ( $true = bG2 ) ),
    inference(superposition,[],[f29,f31]) ).

tff(f78,plain,
    ( ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,$false)
    | spl4_6 ),
    inference(forward_subsumption_resolution,[],[f75,f57]) ).

tff(f80,plain,
    ( ! [X0: $o] :
        ( ~ knows_THFTYPE_IiooI(lChris_THFTYPE_i,(X0))
        | ( $true = (X0) ) )
    | spl4_6 ),
    inference(superposition,[],[f78,f31]) ).

tff(f82,plain,
    ( ( $true = bG1 )
    | spl4_6 ),
    inference(resolution,[],[f80,f28]) ).

tff(f84,plain,
    ( $false
    | spl4_2
    | spl4_6 ),
    inference(forward_subsumption_resolution,[],[f82,f39]) ).

tff(f85,plain,
    ( spl4_2
    | spl4_6 ),
    inference(avatar_contradiction_clause,[],[f84]) ).

cnf(s3,plain,
    ( ~ spl4_2
    | spl4_4 ),
    inference(sat_conversion,[],[f50]) ).

cnf(s4,plain,
    ( ~ spl4_5
    | spl4_6 ),
    inference(sat_conversion,[],[f59]) ).

cnf(s6,plain,
    ( ~ spl4_4
    | spl4_5 ),
    inference(sat_conversion,[],[f65]) ).

cnf(s7,plain,
    ~ spl4_6,
    inference(sat_conversion,[],[f68]) ).

cnf(s8,plain,
    ( spl4_2
    | spl4_6 ),
    inference(sat_conversion,[],[f85]) ).

cnf(s9,plain,
    spl4_2,
    inference(rat,[],[s8,s7]) ).

cnf(s10,plain,
    ~ spl4_5,
    inference(rat,[],[s4,s7]) ).

cnf(s11,plain,
    ~ spl4_4,
    inference(rat,[],[s6,s10]) ).

cnf(s12,plain,
    $false,
    inference(rat,[],[s3,s11,s9]) ).

tff(f86,plain,
    $false,
    inference(avatar_sat_refutation,[],[s12]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR152_8 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.18  % Computer : n018.cluster.edu
% 0.12/0.18  % Model    : x86_64 x86_64
% 0.12/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.18  % Memory   : 8046.5625MB
% 0.12/0.18  % OS       : Linux 6.8.0-71-generic
% 0.12/0.18  % CPULimit : 300
% 0.12/0.18  % WCLimit  : 300
% 0.12/0.18  % DateTime : Mon Sep 28 23:40:40 UTC 2026
% 0.12/0.18  % CPUTime  : 
% 0.12/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.21  Running first-order theorem proving
% 0.12/0.22  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.70/1.28  % (3899823)Detected formulas, will run a generic FOF schedule.
% 3.70/1.28  % (3899955)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=3064640406:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.70/1.28  % (3899957)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=956705891:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.70/1.28  % (3899956)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=2835343301:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.70/1.28  % (3899956)Refutation not found, incomplete strategy
% 3.70/1.28  % (3899956)------------------------------
% 3.70/1.28  % (3899956)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.28  % (3899956)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.28  % (3899956)CaDiCaL version: 2.1.3
% 3.70/1.28  % (3899956)Termination reason: Refutation not found, incomplete strategy
% 3.70/1.28  % (3899956)Time elapsed: 0.001 s
% 3.70/1.28  % (3899956)Peak memory usage: 88 MB
% 3.70/1.28  % (3899953)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=356820081:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.70/1.28  % (3899954)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=1464954982:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.70/1.28  % (3899958)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=542456328:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.70/1.28  % (3899959)dis-21_1_sil=8000:lcm=predicate:random_seed=3573135476:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 3.70/1.28  % (3899959)Refutation not found, incomplete strategy
% 3.70/1.28  % (3899959)------------------------------
% 3.70/1.28  % (3899959)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.28  % (3899959)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.28  % (3899959)CaDiCaL version: 2.1.3
% 3.70/1.28  % (3899959)Termination reason: Refutation not found, incomplete strategy
% 3.70/1.28  % (3899959)Time elapsed: 0.002 s
% 3.70/1.28  % (3899959)Peak memory usage: 88 MB
% 3.70/1.28  % (3899959)Instructions burned: 1 (million)
% 3.70/1.28  % (3899958)First to succeed.
% 3.70/1.28  % (3899958)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3899823"
% 3.70/1.28  % (3899957)Instruction limit reached! 
% 3.70/1.28  % (3899957)------------------------------
% 3.70/1.28  % (3899957)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.28  % (3899957)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.28  % (3899957)CaDiCaL version: 2.1.3
% 3.70/1.28  % (3899957)Termination reason: Instruction limit
% 3.70/1.28  % (3899957)Termination phase: Saturation
% 3.70/1.28  % (3899957)Time elapsed: 0.050 s
% 3.70/1.28  % (3899957)Peak memory usage: 87 MB
% 3.70/1.28  % (3899957)Instructions burned: 120 (million)
% 3.70/1.28  % (3899967)lrs+10_1_sil=8000:sp=occurrence:random_seed=2454746199:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.70/1.28  % (3899967)Also succeeded, but the first one will report.
% 3.70/1.28  % (3899956)------------------------------
% 3.70/1.28  % (3899956)------------------------------
% 3.70/1.28  % (3899959)------------------------------
% 3.70/1.28  % (3899959)------------------------------
% 3.70/1.28  % (3899958)Refutation found. Thanks to Tanya!
% 3.70/1.28  % SZS status Theorem for theBenchmark
% 3.70/1.28  % SZS output start Proof for theBenchmark
% See solution above
% 3.70/1.28  % (3899958)------------------------------
% 3.70/1.28  % (3899958)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.70/1.28  % (3899958)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.70/1.28  % (3899958)CaDiCaL version: 2.1.3
% 3.70/1.28  % (3899958)Termination reason: Refutation
% 3.70/1.28  % (3899958)Time elapsed: 0.004 s
% 3.70/1.28  % (3899958)Peak memory usage: 89 MB
% 3.70/1.28  % (3899958)Instructions burned: 3 (million)
% 3.70/1.28  % (3899958)------------------------------
% 3.70/1.28  % (3899958)------------------------------
% 3.70/1.28  % (3899823)Success in time 0.437 s
% 3.70/1.28  % Vampire exiting
%------------------------------------------------------------------------------