↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SWV412+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n015.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 01:21:11 PM UTC 2026

% Result   : Theorem 0.08s 0.26s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   5 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   37 (  13   ~;   7   |;  14   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   33 (  25   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f19,axiom,
    ! [X0,X1,X2,X3] :
      ( ( pair_in_list(X0,X1,X2)
        & strictly_less_than(X2,X3) )
     => pair_in_list(update_slb(X0,X3),X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l48_li3839) ).

fof(f20,conjecture,
    ! [X0,X1,X2,X3] :
      ( ( pair_in_list(X0,X1,X2)
        & strictly_less_than(X1,X3)
        & strictly_less_than(X2,X3) )
     => pair_in_list(update_slb(X0,X3),X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l48_co) ).

fof(f21,negated_conjecture,
    ~ ! [X0,X1,X2,X3] :
        ( ( pair_in_list(X0,X1,X2)
          & strictly_less_than(X1,X3)
          & strictly_less_than(X2,X3) )
       => pair_in_list(update_slb(X0,X3),X1,X3) ),
    inference(negated_conjecture,[status(cth)],[f20]) ).

fof(f30,plain,
    ! [X0,X1,X2,X3] :
      ( pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ pair_in_list(X0,X1,X2)
      | ~ strictly_less_than(X2,X3) ),
    inference(ennf_transformation,[],[f19]) ).

fof(f31,plain,
    ! [X0,X1,X2,X3] :
      ( pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ pair_in_list(X0,X1,X2)
      | ~ strictly_less_than(X2,X3) ),
    inference(flattening,[],[f30]) ).

fof(f32,plain,
    ? [X0,X1,X2,X3] :
      ( ~ pair_in_list(update_slb(X0,X3),X1,X3)
      & pair_in_list(X0,X1,X2)
      & strictly_less_than(X1,X3)
      & strictly_less_than(X2,X3) ),
    inference(ennf_transformation,[],[f21]) ).

fof(f33,plain,
    ? [X0,X1,X2,X3] :
      ( ~ pair_in_list(update_slb(X0,X3),X1,X3)
      & pair_in_list(X0,X1,X2)
      & strictly_less_than(X1,X3)
      & strictly_less_than(X2,X3) ),
    inference(flattening,[],[f32]) ).

fof(f40,plain,
    ( ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3)
    & pair_in_list(sK0,sK1,sK2)
    & strictly_less_than(sK1,sK3)
    & strictly_less_than(sK2,sK3) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3)],[f33]) ).

fof(f66,plain,
    ! [X2,X3,X0,X1] :
      ( ~ pair_in_list(X0,X1,X2)
      | pair_in_list(update_slb(X0,X3),X1,X3)
      | ~ strictly_less_than(X2,X3) ),
    inference(cnf_transformation,[],[f31]) ).

fof(f67,plain,
    strictly_less_than(sK2,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f69,plain,
    pair_in_list(sK0,sK1,sK2),
    inference(cnf_transformation,[],[f40]) ).

fof(f70,plain,
    ~ pair_in_list(update_slb(sK0,sK3),sK1,sK3),
    inference(cnf_transformation,[],[f40]) ).

fof(f92,plain,
    ! [X0] :
      ( pair_in_list(update_slb(sK0,X0),sK1,X0)
      | ~ strictly_less_than(sK2,X0) ),
    inference(resolution,[],[f66,f69]) ).

fof(f101,plain,
    ~ strictly_less_than(sK2,sK3),
    inference(resolution,[],[f92,f70]) ).

fof(f103,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f101,f67]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV412+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n015.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 10:54:31 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.26  % (2542925)Will run a generic schedule for satisfiability detection.
% 0.08/0.26  % (2542930)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=561305_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.26  % TRYING [1]
% 0.08/0.26  % (2542931)% WARNING: option uhcvi not known.
% 0.08/0.26  % TRYING [2]
% 0.08/0.26  % TRYING [3]
% 0.08/0.26  % (2542931)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1197711118:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.26  % (2542933)dis+10_1_sil=32000:sp=arity:random_seed=3003939191:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.26  % (2542932)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4197116601:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.26  % (2542934)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3599453077:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.26  % (2542935)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3817143957:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.26  % (2542936)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1373721878:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.26  % TRYING [4]
% 0.08/0.26  % (2542932) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2542925-2542932"...
% 0.08/0.26  % (2542933) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2542925-2542933"...
% 0.08/0.26  % (2542932)...printing done.
% 0.08/0.26  % (2542931) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2542925-2542931"...
% 0.08/0.26  % (2542933)...printing done.
% 0.08/0.26  % (2542932)Refutation found. Thanks to Tanya!
% 0.08/0.26  % SZS status Theorem for theBenchmark
% 0.08/0.26  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.26  % (2542932)------------------------------
% 0.08/0.26  % (2542932)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.26  % (2542932)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.26  % (2542932)CaDiCaL version: 2.1.3
% 0.08/0.26  % (2542932)Termination reason: Refutation
% 0.08/0.26  % (2542932)Time elapsed: 0.003 s
% 0.08/0.26  % (2542932)Peak memory usage: 12 MB
% 0.08/0.26  % (2542932)Instructions burned: 2 (million)
% 0.08/0.26  % (2542925)Success in time 0.043 s
% 0.08/0.26  % Vampire exiting
%------------------------------------------------------------------------------