↑ 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  : KRS003-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 : 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:42:04 AM UTC 2026

% Result   : Unsatisfiable 0.16s 0.47s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   29 (   5 unt;   0 def)
%            Number of atoms       :   61 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   62 (  30   ~;  32   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-1 aty)
%            Number of variables   :   32 (  32   !;   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] :
      ( s2least(X0)
      | ~ c(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_3) ).

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

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

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

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

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

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

fof(f12,axiom,
    ! [X0] :
      ( s1most(X0)
      | ~ equalish(u3r2(X0),u3r1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_12) ).

fof(f13,axiom,
    ! [X0] :
      ( s1most(X0)
      | s(X0,u3r1(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_13) ).

fof(f14,axiom,
    ! [X0] :
      ( s1most(X0)
      | s(X0,u3r2(X0)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_14) ).

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

fof(f16,axiom,
    ! [X0] :
      ( d(X0)
      | ~ f(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',clause_16) ).

fof(f17,plain,
    ~ e(exist),
    inference(consistent_polarity_flipping,[],[f1]) ).

fof(f18,plain,
    ~ f(exist),
    inference(consistent_polarity_flipping,[],[f2]) ).

fof(f19,plain,
    ! [X0] :
      ( ~ s2least(X0)
      | c(X0) ),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f20,plain,
    ! [X0] :
      ( s2least(X0)
      | equalish(u1r2(X0),u1r1(X0)) ),
    inference(consistent_polarity_flipping,[],[f5]) ).

fof(f21,plain,
    ! [X0] :
      ( s(X0,u1r1(X0))
      | s2least(X0) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f22,plain,
    ! [X0] :
      ( s(X0,u1r2(X0))
      | s2least(X0) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

fof(f23,plain,
    ! [X2,X0,X1] :
      ( ~ s2least(X0)
      | ~ equalish(X1,X2)
      | ~ s(X0,X1)
      | ~ s(X0,X2) ),
    inference(consistent_polarity_flipping,[],[f8]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ s1most(X0)
      | ~ d(X0) ),
    inference(consistent_polarity_flipping,[],[f9]) ).

fof(f25,plain,
    ! [X2,X0,X1] :
      ( ~ equalish(X0,X1)
      | s1most(X2)
      | ~ s(X2,X0)
      | ~ s(X2,X1) ),
    inference(consistent_polarity_flipping,[],[f11]) ).

fof(f26,plain,
    ! [X0] :
      ( ~ s1most(X0)
      | equalish(u3r2(X0),u3r1(X0)) ),
    inference(consistent_polarity_flipping,[],[f12]) ).

fof(f27,plain,
    ! [X0] :
      ( ~ s1most(X0)
      | s(X0,u3r1(X0)) ),
    inference(consistent_polarity_flipping,[],[f13]) ).

fof(f28,plain,
    ! [X0] :
      ( ~ s1most(X0)
      | s(X0,u3r2(X0)) ),
    inference(consistent_polarity_flipping,[],[f14]) ).

fof(f29,plain,
    ! [X0] :
      ( ~ c(X0)
      | e(X0) ),
    inference(consistent_polarity_flipping,[],[f15]) ).

fof(f30,plain,
    ! [X0] :
      ( d(X0)
      | f(X0) ),
    inference(consistent_polarity_flipping,[],[f16]) ).

fof(f39,plain,
    $false,
    inference(finite_model_not_found_(exhaustively_excluded_all_possible_domain_size_assignments),[],[f17,f18,f19,f20,f21,f22,f23,f24,f25,f26,f27,f28,f29,f30]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS003-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.10/0.40  % Computer : n020.cluster.edu
% 0.10/0.40  % Model    : x86_64 x86_64
% 0.10/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40  % Memory   : 8046.5625MB
% 0.10/0.40  % OS       : Linux 6.8.0-71-generic
% 0.10/0.40  % CPULimit : 300
% 0.10/0.40  % WCLimit  : 300
% 0.10/0.40  % DateTime : Sun Sep 27 13:16:04 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.43  Running first-order model finding
% 0.10/0.43  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.16/0.47  % (3375665)Will run a generic schedule for satisfiability detection.
% 0.16/0.47  % (3375670)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1487314997_2999 on theBenchmark for (2999ds/0Mi)
% 0.16/0.47  % TRYING [1]
% 0.16/0.47  % TRYING [2]
% 0.16/0.47  % TRYING [3]
% 0.16/0.47  % TRYING [4]
% 0.16/0.47  % (3375670) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3375665-3375670"...
% 0.16/0.47  % (3375670)...printing done.
% 0.16/0.47  % (3375670)Refutation found. Thanks to Tanya!
% 0.16/0.47  % SZS status Unsatisfiable for theBenchmark
% 0.16/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.47  % (3375670)------------------------------
% 0.16/0.47  % (3375670)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.16/0.47  % (3375670)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/0.47  % (3375670)CaDiCaL version: 2.1.3
% 0.16/0.47  % (3375670)Termination reason: Refutation
% 0.16/0.47  % (3375670)Time elapsed: 0.001 s
% 0.16/0.47  % (3375670)Peak memory usage: 11 MB
% 0.16/0.47  % (3375670)Instructions burned: 2 (million)
% 0.16/0.47  % (3375665)Success in time 0.027 s
% 0.16/0.47  % Vampire exiting
%------------------------------------------------------------------------------