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

% 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 10:08:40 AM UTC 2026

% Result   : Unsatisfiable 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   18
% Syntax   : Number of formulae    :   40 (  31 unt;   0 def)
%            Number of atoms       :   73 (  48 equ)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :   75 (  42   ~;  33   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   24 (  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ r(X0,X1)
      | r(X1,X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rsym) ).

fof(f2,axiom,
    ! [X0,X1,X2] :
      ( X0 = X1
      | X0 = X2
      | X1 = X2
      | ~ r(X0,X1)
      | ~ r(X0,X2)
      | ~ r(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rno3cl) ).

fof(f3,axiom,
    ! [X0,X1,X2] :
      ( X0 = X1
      | X0 = X2
      | X1 = X2
      | r(X0,X1)
      | r(X0,X2)
      | r(X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rno3acl) ).

fof(f4,axiom,
    v0 != v1,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v0nv1) ).

fof(f5,axiom,
    v0 != v2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v0nv2) ).

fof(f6,axiom,
    v1 != v2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1nv2) ).

fof(f7,axiom,
    v0 != v3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v0nv3) ).

fof(f8,axiom,
    v1 != v3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1nv3) ).

fof(f9,axiom,
    v2 != v3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v2nv3) ).

fof(f10,axiom,
    v0 != v4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v0nv4) ).

fof(f11,axiom,
    v1 != v4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1nv4) ).

fof(f12,axiom,
    v2 != v4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v2nv4) ).

fof(f13,axiom,
    v3 != v4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v3nv4) ).

fof(f14,axiom,
    v0 != v5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v0nv5) ).

fof(f15,axiom,
    v1 != v5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v1nv5) ).

fof(f16,axiom,
    v2 != v5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v2nv5) ).

fof(f17,axiom,
    v3 != v5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v3nv5) ).

fof(f18,axiom,
    v4 != v5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v4nv5) ).

fof(f19,plain,
    ! [X0,X1] :
      ( ~ r(X0,X1)
      | r(X1,X0) ),
    inference(cnf_transformation,[],[f1]) ).

fof(f20,plain,
    ! [X2,X0,X1] :
      ( X0 = X1
      | X0 = X2
      | X1 = X2
      | ~ r(X0,X1)
      | ~ r(X0,X2)
      | ~ r(X1,X2) ),
    inference(cnf_transformation,[],[f2]) ).

fof(f21,plain,
    ! [X2,X0,X1] :
      ( X0 = X1
      | X0 = X2
      | X1 = X2
      | r(X0,X1)
      | r(X0,X2)
      | r(X1,X2) ),
    inference(cnf_transformation,[],[f3]) ).

fof(f22,plain,
    v0 != v1,
    inference(cnf_transformation,[],[f4]) ).

fof(f23,plain,
    v0 != v2,
    inference(cnf_transformation,[],[f5]) ).

fof(f24,plain,
    v1 != v2,
    inference(cnf_transformation,[],[f6]) ).

fof(f25,plain,
    v0 != v3,
    inference(cnf_transformation,[],[f7]) ).

fof(f26,plain,
    v1 != v3,
    inference(cnf_transformation,[],[f8]) ).

fof(f27,plain,
    v2 != v3,
    inference(cnf_transformation,[],[f9]) ).

fof(f28,plain,
    v0 != v4,
    inference(cnf_transformation,[],[f10]) ).

fof(f29,plain,
    v1 != v4,
    inference(cnf_transformation,[],[f11]) ).

fof(f30,plain,
    v2 != v4,
    inference(cnf_transformation,[],[f12]) ).

fof(f31,plain,
    v3 != v4,
    inference(cnf_transformation,[],[f13]) ).

fof(f32,plain,
    v0 != v5,
    inference(cnf_transformation,[],[f14]) ).

fof(f33,plain,
    v1 != v5,
    inference(cnf_transformation,[],[f15]) ).

fof(f34,plain,
    v2 != v5,
    inference(cnf_transformation,[],[f16]) ).

fof(f35,plain,
    v3 != v5,
    inference(cnf_transformation,[],[f17]) ).

fof(f36,plain,
    v4 != v5,
    inference(cnf_transformation,[],[f18]) ).

fof(f37,plain,
    ! [X0,X1] :
      ( r(X0,X1)
      | ~ r(X1,X0) ),
    inference(consistent_polarity_flipping,[],[f19]) ).

fof(f38,plain,
    ! [X2,X0,X1] :
      ( X0 = X1
      | X0 = X2
      | X1 = X2
      | r(X0,X1)
      | r(X0,X2)
      | r(X1,X2) ),
    inference(consistent_polarity_flipping,[],[f20]) ).

fof(f39,plain,
    ! [X2,X0,X1] :
      ( X0 = X1
      | X0 = X2
      | X1 = X2
      | ~ r(X0,X1)
      | ~ r(X0,X2)
      | ~ r(X1,X2) ),
    inference(consistent_polarity_flipping,[],[f21]) ).

fof(f55,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f37,f38,f39,f22,f23,f24,f25,f26,f27,f28,f29,f30,f31,f32,f33,f34,f35,f36]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRA117+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.07  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.41  % Computer : n018.cluster.edu
% 0.14/0.41  % Model    : x86_64 x86_64
% 0.14/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.41  % Memory   : 8046.5625MB
% 0.14/0.41  % OS       : Linux 6.8.0-71-generic
% 0.14/0.41  % CPULimit : 300
% 0.14/0.41  % WCLimit  : 300
% 0.14/0.41  % DateTime : Sun Sep 27 09:01:23 UTC 2026
% 0.14/0.42  % CPUTime  : 
% 0.14/0.42  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.14/0.45  Running first-order model finding
% 0.14/0.45  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.21/0.51  % (2051435)Will run a generic schedule for satisfiability detection.
% 0.21/0.51  % (2051445)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1471978142:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.51  % (2051446)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=97912608:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.51  % (2051441)% WARNING: option uhcvi not known.
% 0.21/0.51  % (2051440)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=829932923_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.51  % (2051441)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2566515745:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.51  % (2051443)dis+10_1_sil=32000:sp=arity:random_seed=3706354094:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.51  % (2051444)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3017413740:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.51  % (2051442)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3005379539:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.51  % Detected minimum model sizes of [6]
% 0.21/0.51  % Detected maximum model sizes of [6]
% 0.21/0.51  % TRYING [6]
% 0.21/0.51  % (2051440) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2051435-2051440"...
% 0.21/0.51  % (2051440)...printing done.
% 0.21/0.51  % (2051440)Refutation found. Thanks to Tanya!
% 0.21/0.51  % SZS status Unsatisfiable for theBenchmark
% 0.21/0.51  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.51  % (2051440)------------------------------
% 0.21/0.51  % (2051440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.51  % (2051440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.51  % (2051440)CaDiCaL version: 2.1.3
% 0.21/0.51  % (2051440)Termination reason: Refutation
% 0.21/0.51  % (2051440)Time elapsed: 0.004 s
% 0.21/0.51  % (2051440)Peak memory usage: 11 MB
% 0.21/0.51  % (2051440)Instructions burned: 3 (million)
% 0.21/0.51  % (2051435)Success in time 0.04 s
% 0.21/0.51  % Vampire exiting
%------------------------------------------------------------------------------