↑ Up

Vampire---5.0.1.UNS-Ref.s

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

% Computer : n016.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 11:46:28 AM UTC 2026

% Result   : Unsatisfiable 2.53s 1.33s
% Output   : Refutation 2.53s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   31 (  11 unt;   3 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   59 (  29   ~;  27   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   4 prp; 0-4 aty)
%            Number of functors    :   13 (  13 usr;   8 con; 0-4 aty)
%            Number of variables   :   15 (   0 sgn  15   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ c_lessequals(X1,c_Tarski_Ointerval(X3,X4,X5,X2),tc_set(X2))
      | ~ c_in(X0,X1,X2)
      | c_in(c_Pair(X0,X5,X2,X2),X3,tc_prod(X2,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) ).

fof(f2,axiom,
    ! [X2,X0,X1] :
      ( ~ c_Tarski_OisLub(X0,v_cl,X1,t_a)
      | ~ c_in(X2,v_A,t_a)
      | c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | c_in(v_sko__4mi(X0,v_r,X2),X0,t_a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ c_Tarski_OisLub(X0,v_cl,X1,t_a)
      | ~ c_in(X2,v_A,t_a)
      | ~ c_in(c_Pair(v_sko__4mi(X0,v_r,X2),X2,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | c_in(c_Pair(X1,X2,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) ).

fof(f4,negated_conjecture,
    c_in(v_b,v_A,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).

fof(f5,negated_conjecture,
    c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f6,negated_conjecture,
    c_Tarski_OisLub(v_S,v_cl,v_L,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f7,negated_conjecture,
    ~ c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

fof(f8,plain,
    ! [X0] :
      ( c_in(c_Pair(X0,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X0,v_S,t_a) ),
    inference(resolution,[],[f1,f5]) ).

fof(f9,plain,
    ! [X0] :
      ( c_in(c_Pair(v_L,X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X0,v_A,t_a)
      | c_in(v_sko__4mi(v_S,v_r,X0),v_S,t_a) ),
    inference(resolution,[],[f2,f6]) ).

fof(f11,plain,
    ! [X0] :
      ( ~ c_in(c_Pair(v_sko__4mi(v_S,v_r,X0),X0,t_a,t_a),v_r,tc_prod(t_a,t_a))
      | ~ c_in(X0,v_A,t_a)
      | c_in(c_Pair(v_L,X0,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    inference(resolution,[],[f3,f6]) ).

fof(f12,plain,
    ( ~ c_in(v_b,v_A,t_a)
    | c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a) ),
    inference(resolution,[],[f9,f7]) ).

fof(f14,definition,
    ( spl0_1
  <=> c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f17,definition,
    ( spl0_2
  <=> c_in(v_b,v_A,t_a) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f18,plain,
    ( ~ c_in(v_b,v_A,t_a)
    | spl0_2 ),
    inference(avatar_component_clause,[],[f17]) ).

fof(f19,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f12,f17,f14]) ).

fof(f20,plain,
    ( $false
    | spl0_2 ),
    inference(resolution,[],[f18,f4]) ).

fof(f21,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f20]) ).

fof(f22,plain,
    ( ~ c_in(v_b,v_A,t_a)
    | c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
    | ~ c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a) ),
    inference(resolution,[],[f11,f8]) ).

fof(f25,definition,
    ( spl0_3
  <=> c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f26,plain,
    ( c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a))
    | ~ spl0_3 ),
    inference(avatar_component_clause,[],[f25]) ).

fof(f27,plain,
    ( ~ spl0_1
    | spl0_3
    | ~ spl0_2 ),
    inference(avatar_split_clause,[],[f22,f17,f25,f14]) ).

fof(f28,plain,
    ( $false
    | ~ spl0_3 ),
    inference(resolution,[],[f26,f7]) ).

fof(f29,plain,
    ~ spl0_3,
    inference(avatar_contradiction_clause,[],[f28]) ).

cnf(s1,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f19]) ).

cnf(s2,plain,
    spl0_2,
    inference(sat_conversion,[],[f21]) ).

cnf(s3,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | spl0_3 ),
    inference(sat_conversion,[],[f27]) ).

cnf(s4,plain,
    ~ spl0_3,
    inference(sat_conversion,[],[f29]) ).

cnf(s5,plain,
    ( ~ spl0_1
    | ~ spl0_2 ),
    inference(rat,[],[s3,s4]) ).

cnf(s6,plain,
    ~ spl0_1,
    inference(rat,[],[s5,s2]) ).

cnf(s7,plain,
    $false,
    inference(rat,[],[s1,s2,s6]) ).

fof(f30,plain,
    $false,
    inference(avatar_sat_refutation,[],[s7]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT273-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  % Computer : n016.cluster.edu
% 0.13/0.39  % Model    : x86_64 x86_64
% 0.13/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39  % Memory   : 8046.5625MB
% 0.13/0.39  % OS       : Linux 6.8.0-71-generic
% 0.13/0.39  % CPULimit : 300
% 0.13/0.39  % WCLimit  : 300
% 0.13/0.39  % DateTime : Sun Sep 27 14:14:17 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.42  Running first-order theorem proving
% 0.13/0.42  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
% 2.53/1.33  % (2682507)Input is clausal, will run a generic CNF schedule.
% 2.53/1.33  % (2682518)dis-21_1_sil=8000:lcm=predicate:random_seed=2460384872:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.53/1.33  % (2682518)First to succeed.
% 2.53/1.33  % (2682518)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-2682507"
% 2.53/1.33  % (2682515)lrs+10_1_sil=8000:sp=occurrence:random_seed=2801278418:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.53/1.33  % (2682514)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=4205177922:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.53/1.33  % (2682512)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=2732922159:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.53/1.33  % (2682513)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=3200386941:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.53/1.33  % (2682516)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4269983070:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.53/1.33  % (2682517)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1270465904:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.53/1.33  % (2682515)Also succeeded, but the first one will report.
% 2.53/1.33  % (2682516)Also succeeded, but the first one will report.
% 2.53/1.33  % (2682517)Also succeeded, but the first one will report.
% 2.53/1.33  % (2682518)Refutation found. Thanks to Tanya!
% 2.53/1.33  % SZS status Unsatisfiable for theBenchmark
% 2.53/1.33  % SZS output start Proof for theBenchmark
% See solution above
% 2.53/1.33  % (2682518)------------------------------
% 2.53/1.33  % (2682518)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.53/1.33  % (2682518)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.53/1.33  % (2682518)CaDiCaL version: 2.1.3
% 2.53/1.33  % (2682518)Termination reason: Refutation
% 2.53/1.33  % (2682518)Time elapsed: 0.001 s
% 2.53/1.33  % (2682518)Peak memory usage: 89 MB
% 2.53/1.33  % (2682518)Instructions burned: 1 (million)
% 2.53/1.33  % (2682518)------------------------------
% 2.53/1.33  % (2682518)------------------------------
% 2.53/1.33  % (2682507)Success in time 0.273 s
% 2.53/1.33  % Vampire exiting
%------------------------------------------------------------------------------