↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

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

% Computer : n020.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:48:08 AM UTC 2026

% Result   : Unsatisfiable 0.18s 0.46s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  14 unt;   3 def)
%            Number of atoms       :   49 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   41 (  20   ~;  18   |;   0   &)
%                                         (   3 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-4 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    c_in(v_a,v_A,t_a),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).

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

fof(f3,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(f4,negated_conjecture,
    ~ c_lessequals(v_S,v_A,tc_set(t_a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( ~ c_in(X0,v_A,t_a)
      | ~ c_in(X1,v_A,t_a)
      | ~ c_lessequals(X2,c_Tarski_Ointerval(v_r,X1,X0,t_a),tc_set(t_a))
      | c_lessequals(X2,v_A,tc_set(t_a)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0) ).

fof(f6,plain,
    ~ c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f7,plain,
    c_lessequals(v_S,v_A,tc_set(t_a)),
    inference(consistent_polarity_flipping,[],[f4]) ).

fof(f8,plain,
    ! [X2,X0,X1] :
      ( c_lessequals(X2,c_Tarski_Ointerval(v_r,X1,X0,t_a),tc_set(t_a))
      | ~ c_in(X1,v_A,t_a)
      | ~ c_in(X0,v_A,t_a)
      | ~ c_lessequals(X2,v_A,tc_set(t_a)) ),
    inference(consistent_polarity_flipping,[],[f5]) ).

fof(f9,plain,
    ( ~ c_in(v_a,v_A,t_a)
    | ~ c_in(v_b,v_A,t_a)
    | ~ c_lessequals(v_S,v_A,tc_set(t_a)) ),
    inference(resolution,[],[f8,f6]) ).

fof(f11,definition,
    ( spl0_1
  <=> c_lessequals(v_S,v_A,tc_set(t_a)) ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f13,plain,
    ( ~ c_lessequals(v_S,v_A,tc_set(t_a))
    | spl0_1 ),
    inference(avatar_component_clause,[],[f11]) ).

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

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

fof(f19,definition,
    ( spl0_3
  <=> c_in(v_a,v_A,t_a) ),
    introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).

fof(f21,plain,
    ( ~ c_in(v_a,v_A,t_a)
    | spl0_3 ),
    inference(avatar_component_clause,[],[f19]) ).

fof(f22,plain,
    ( ~ spl0_1
    | ~ spl0_2
    | ~ spl0_3 ),
    inference(avatar_split_clause,[],[f9,f19,f15,f11]) ).

fof(f23,plain,
    ( $false
    | spl0_2 ),
    inference(resolution,[],[f17,f2]) ).

fof(f24,plain,
    spl0_2,
    inference(avatar_contradiction_clause,[],[f23]) ).

fof(f25,plain,
    ( $false
    | spl0_3 ),
    inference(resolution,[],[f21,f1]) ).

fof(f26,plain,
    spl0_3,
    inference(avatar_contradiction_clause,[],[f25]) ).

fof(f27,plain,
    ( $false
    | spl0_1 ),
    inference(resolution,[],[f13,f7]) ).

fof(f28,plain,
    spl0_1,
    inference(avatar_contradiction_clause,[],[f27]) ).

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

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

cnf(s3,plain,
    spl0_3,
    inference(sat_conversion,[],[f26]) ).

cnf(s4,plain,
    spl0_1,
    inference(sat_conversion,[],[f28]) ).

cnf(s5,plain,
    $false,
    inference(rat,[],[s1,s3,s2,s4]) ).

fof(f29,plain,
    $false,
    inference(avatar_sat_refutation,[],[s5]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LAT270-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.39  % Computer : n020.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:10:04 UTC 2026
% 0.13/0.39  % CPUTime  : 
% 0.13/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.18/0.46  % (3413825)Will run a generic schedule for satisfiability detection.
% 0.18/0.46  % (3413843)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3608432257:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.18/0.46  % (3413843) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3413825-3413843"...
% 0.18/0.46  % (3413843)...printing done.
% 0.18/0.46  % (3413843)Refutation found. Thanks to Tanya!
% 0.18/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.18/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.46  % (3413843)------------------------------
% 0.18/0.46  % (3413843)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.18/0.46  % (3413843)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/0.46  % (3413843)CaDiCaL version: 2.1.3
% 0.18/0.46  % (3413843)Termination reason: Refutation
% 0.18/0.46  % (3413843)Time elapsed: 0.001 s
% 0.18/0.46  % (3413843)Peak memory usage: 12 MB
% 0.18/0.46  % (3413843)Instructions burned: 1 (million)
% 0.18/0.46  % (3413825)Success in time 0.033 s
% 0.18/0.46  % Vampire exiting
%------------------------------------------------------------------------------