↑ 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  : KRS013-1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n007.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:42:05 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.48s
% Output   : Refutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   35 (   4 unt;   0 def)
%            Number of atoms       :   92 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :  101 (  44   ~;  57   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   13 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   1 con; 0-1 aty)
%            Number of variables   :   39 (  39   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
    e(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_1) ).

fof(f2,negated_conjecture,
    ~ f(exist),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_2) ).

fof(f3,axiom,
    ! [X0] :
      ( ~ c(X0)
      | t2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

fof(f5,axiom,
    ! [X0] :
      ( ~ equalish(u1r2(X0),u1r1(X0))
      | ~ t2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_5) ).

fof(f6,axiom,
    ! [X0] :
      ( t(X0,u1r1(X0))
      | ~ t2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_6) ).

fof(f7,axiom,
    ! [X0] :
      ( t(X0,u1r2(X0))
      | ~ t2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_7) ).

fof(f9,axiom,
    ! [X0] :
      ( ~ d(X0)
      | t1most(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_9) ).

fof(f11,axiom,
    ! [X2,X0,X1] :
      ( ~ t(X2,X1)
      | ~ t1most(X2)
      | ~ t(X2,X0)
      | equalish(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_11) ).

fof(f15,axiom,
    ! [X0,X1] :
      ( ~ r(X1,X0)
      | ~ e(X1)
      | d(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_15) ).

fof(f16,axiom,
    ! [X0,X1] :
      ( ~ r(X1,X0)
      | ~ e(X1)
      | c(X0)
      | ~ s2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).

fof(f26,axiom,
    ! [X2,X0,X1] :
      ( ~ s(X0,X2)
      | equalish(X1,X2)
      | ~ s(X0,X1)
      | s2least(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_26) ).

fof(f28,axiom,
    ! [X0] :
      ( ~ s1most(u6r1(X0))
      | f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_28) ).

fof(f29,axiom,
    ! [X0] :
      ( r(X0,u6r1(X0))
      | f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_29) ).

fof(f31,axiom,
    ! [X0] :
      ( ~ equalish(u7r2(X0),u7r1(X0))
      | s1most(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_31) ).

fof(f32,axiom,
    ! [X0] :
      ( s(X0,u7r1(X0))
      | s1most(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_32) ).

fof(f33,axiom,
    ! [X0] :
      ( s(X0,u7r2(X0))
      | s1most(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_33) ).

fof(f34,plain,
    ! [X0] :
      ( d(u6r1(X0))
      | ~ e(X0)
      | f(X0) ),
    inference(resolution,[],[f15,f29]) ).

fof(f36,plain,
    ! [X0] :
      ( t1most(u6r1(X0))
      | f(X0)
      | ~ e(X0) ),
    inference(resolution,[],[f34,f9]) ).

fof(f38,plain,
    ! [X0] :
      ( ~ s2least(u6r1(X0))
      | c(u6r1(X0))
      | ~ e(X0)
      | f(X0) ),
    inference(resolution,[],[f16,f29]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( equalish(X1,u1r1(X0))
      | ~ t(X0,X1)
      | ~ t1most(X0)
      | ~ t2least(X0) ),
    inference(resolution,[],[f11,f6]) ).

fof(f62,plain,
    ! [X0,X1] :
      ( equalish(X0,u7r1(X1))
      | ~ s(X1,X0)
      | s2least(X1)
      | s1most(X1) ),
    inference(resolution,[],[f26,f32]) ).

fof(f75,plain,
    ! [X0] :
      ( ~ t(X0,u1r2(X0))
      | ~ t1most(X0)
      | ~ t2least(X0)
      | ~ t2least(X0) ),
    inference(resolution,[],[f56,f5]) ).

fof(f76,plain,
    ! [X0] :
      ( ~ t(X0,u1r2(X0))
      | ~ t1most(X0)
      | ~ t2least(X0) ),
    inference(duplicate_literal_removal,[],[f75]) ).

fof(f77,plain,
    ! [X0] :
      ( ~ t1most(X0)
      | ~ t2least(X0) ),
    inference(forward_subsumption_resolution,[],[f76,f7]) ).

fof(f78,plain,
    ! [X0] :
      ( ~ t2least(u6r1(X0))
      | f(X0)
      | ~ e(X0) ),
    inference(resolution,[],[f77,f36]) ).

fof(f84,plain,
    ! [X0] :
      ( ~ s(X0,u7r2(X0))
      | s2least(X0)
      | s1most(X0)
      | s1most(X0) ),
    inference(resolution,[],[f62,f31]) ).

fof(f85,plain,
    ! [X0] :
      ( ~ s(X0,u7r2(X0))
      | s2least(X0)
      | s1most(X0) ),
    inference(duplicate_literal_removal,[],[f84]) ).

fof(f86,plain,
    ! [X0] :
      ( s1most(X0)
      | s2least(X0) ),
    inference(forward_subsumption_resolution,[],[f85,f33]) ).

fof(f87,plain,
    ! [X0] :
      ( s2least(u6r1(X0))
      | f(X0) ),
    inference(resolution,[],[f86,f28]) ).

fof(f88,plain,
    ! [X0] :
      ( f(X0)
      | c(u6r1(X0))
      | ~ e(X0)
      | f(X0) ),
    inference(resolution,[],[f87,f38]) ).

fof(f89,plain,
    ! [X0] :
      ( c(u6r1(X0))
      | f(X0)
      | ~ e(X0) ),
    inference(duplicate_literal_removal,[],[f88]) ).

fof(f96,plain,
    ! [X0] :
      ( f(X0)
      | ~ e(X0)
      | t2least(u6r1(X0)) ),
    inference(resolution,[],[f89,f3]) ).

fof(f97,plain,
    ! [X0] :
      ( ~ e(X0)
      | f(X0) ),
    inference(forward_subsumption_resolution,[],[f96,f78]) ).

fof(f98,plain,
    f(exist),
    inference(resolution,[],[f97,f1]) ).

fof(f99,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f98,f2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS013-1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n007.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 13:14:10 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.37  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.42  Running first-order model finding
% 0.13/0.42  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.13/0.48  % (1410008)Will run a generic schedule for satisfiability detection.
% 0.13/0.48  % (1410017)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2536332345:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.13/0.48  % (1410014)% WARNING: option uhcvi not known.
% 0.13/0.48  % (1410013)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2208323974_2999 on theBenchmark for (2999ds/0Mi)
% 0.13/0.48  % (1410014)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4276478859:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.13/0.48  % (1410019)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2898678471:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.13/0.48  % (1410015)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3953943797:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.13/0.48  % (1410016)dis+10_1_sil=32000:sp=arity:random_seed=2368697525:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.13/0.48  % TRYING [1]
% 0.13/0.48  % TRYING [2]
% 0.13/0.48  % (1410018)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=224824206:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.13/0.48  % TRYING [3]
% 0.13/0.48  % (1410019) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1410008-1410019"...
% 0.13/0.48  % (1410016) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1410008-1410016"...
% 0.13/0.48  % (1410014) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1410008-1410014"...
% 0.13/0.48  % TRYING [4]
% 0.13/0.48  % (1410016)...printing done.
% 0.13/0.48  % (1410019)...printing done.
% 0.13/0.48  % (1410014)...printing done.
% 0.13/0.48  % (1410018) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1410008-1410018"...
% 0.13/0.48  % (1410016)Refutation found. Thanks to Tanya!
% 0.13/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.13/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.13/0.48  % (1410016)------------------------------
% 0.13/0.48  % (1410016)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.13/0.48  % (1410016)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.13/0.48  % (1410016)CaDiCaL version: 2.1.3
% 0.13/0.48  % (1410016)Termination reason: Refutation
% 0.13/0.48  % (1410016)Time elapsed: 0.004 s
% 0.13/0.48  % (1410016)Peak memory usage: 11 MB
% 0.13/0.48  % (1410016)Instructions burned: 3 (million)
% 0.13/0.48  % (1410008)Success in time 0.044 s
% 0.13/0.48  % Vampire exiting
%------------------------------------------------------------------------------