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

% Computer : n016.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:17 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   48 (   4 unt;   0 def)
%            Number of atoms       :  105 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :  107 (  50   ~;  42   |;   2   &)
%                                         (   3 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   61 (  55   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => cdxcomp(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f4,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => cc(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_3) ).

fof(f5,axiom,
    ! [X0] :
      ( cc(X0)
     => ! [X1] :
          ( rr(X0,X1)
         => cc(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_4) ).

fof(f6,axiom,
    ! [X0] :
      ( cd(X0)
    <=> ~ ? [X1] : ra_Px1(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_5) ).

fof(f7,axiom,
    ! [X0] :
      ( cdxcomp(X0)
    <=> ? [X1] : ra_Px1(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_6) ).

fof(f8,axiom,
    ! [X0] :
      ( ca_Ax2(X0)
    <=> ! [X1] :
          ( rr(X0,X1)
         => cc(X1) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_7) ).

fof(f9,axiom,
    ! [X0] :
      ( ca_Ax2(X0)
     => cd(X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(f10,axiom,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

fof(f11,plain,
    ! [X0] :
      ( ! [X1] :
          ( rr(X0,X1)
         => cc(X1) )
     => ca_Ax2(X0) ),
    inference(unused_predicate_definition_removal,[],[f8]) ).

fof(f12,plain,
    ! [X0] :
      ( cd(X0)
     => ~ ? [X1] : ra_Px1(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f6]) ).

fof(f13,plain,
    ! [X0] :
      ( cdxcomp(X0)
     => ? [X1] : ra_Px1(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f7]) ).

fof(f16,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f3]) ).

fof(f17,plain,
    ! [X0] :
      ( cc(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f4]) ).

fof(f18,plain,
    ! [X0] :
      ( ! [X1] :
          ( cc(X1)
          | ~ rr(X0,X1) )
      | ~ cc(X0) ),
    inference(ennf_transformation,[],[f5]) ).

fof(f19,plain,
    ! [X0] :
      ( ! [X1] : ~ ra_Px1(X0,X1)
      | ~ cd(X0) ),
    inference(ennf_transformation,[],[f12]) ).

fof(f20,plain,
    ! [X0] :
      ( ? [X1] : ra_Px1(X0,X1)
      | ~ cdxcomp(X0) ),
    inference(ennf_transformation,[],[f13]) ).

fof(f21,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | ? [X1] :
          ( ~ cc(X1)
          & rr(X0,X1) ) ),
    inference(ennf_transformation,[],[f11]) ).

fof(f22,plain,
    ! [X0] :
      ( cd(X0)
      | ~ ca_Ax2(X0) ),
    inference(ennf_transformation,[],[f9]) ).

fof(f23,plain,
    ! [X0] :
      ( ra_Px1(X0,sK0(X0))
      | ~ cdxcomp(X0) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X1,sK0(X0))],[f20]) ).

fof(f24,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | ( ~ cc(sK1(X0))
        & rr(X0,sK1(X0)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X1,sK1(X0))],[f21]) ).

fof(f25,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f16]) ).

fof(f26,plain,
    ! [X0] :
      ( cc(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(cnf_transformation,[],[f17]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( cc(X1)
      | ~ rr(X0,X1)
      | ~ cc(X0) ),
    inference(cnf_transformation,[],[f18]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ ra_Px1(X0,X1)
      | ~ cd(X0) ),
    inference(cnf_transformation,[],[f19]) ).

fof(f29,plain,
    ! [X0] :
      ( ra_Px1(X0,sK0(X0))
      | ~ cdxcomp(X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f30,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | rr(X0,sK1(X0)) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f31,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | ~ cc(sK1(X0)) ),
    inference(cnf_transformation,[],[f24]) ).

fof(f32,plain,
    ! [X0] :
      ( cd(X0)
      | ~ ca_Ax2(X0) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f33,plain,
    cUnsatisfiable(i2003_11_14_17_20_53634),
    inference(cnf_transformation,[],[f10]) ).

fof(f34,plain,
    ! [X0] :
      ( ~ cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f25]) ).

fof(f35,plain,
    ! [X0,X1] :
      ( ra_Px1(X0,X1)
      | ~ cd(X0) ),
    inference(consistent_polarity_flipping,[],[f28]) ).

fof(f36,plain,
    ! [X0] :
      ( ~ ra_Px1(X0,sK0(X0))
      | cdxcomp(X0) ),
    inference(consistent_polarity_flipping,[],[f29]) ).

fof(f37,plain,
    ! [X0] :
      ( ~ ca_Ax2(X0)
      | ~ cc(sK1(X0)) ),
    inference(consistent_polarity_flipping,[],[f31]) ).

fof(f38,plain,
    ! [X0] :
      ( rr(X0,sK1(X0))
      | ~ ca_Ax2(X0) ),
    inference(consistent_polarity_flipping,[],[f30]) ).

fof(f39,plain,
    ! [X0] :
      ( ca_Ax2(X0)
      | cd(X0) ),
    inference(consistent_polarity_flipping,[],[f32]) ).

fof(f40,plain,
    ! [X0] :
      ( cd(X0)
      | ~ cc(sK1(X0)) ),
    inference(resolution,[],[f37,f39]) ).

fof(f41,plain,
    ! [X0] :
      ( ~ cd(X0)
      | cdxcomp(X0) ),
    inference(resolution,[],[f36,f35]) ).

fof(f42,plain,
    ! [X0] :
      ( ~ cc(sK1(X0))
      | cdxcomp(X0) ),
    inference(resolution,[],[f41,f40]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( cdxcomp(X1)
      | ~ cc(X0)
      | ~ rr(X0,sK1(X1)) ),
    inference(resolution,[],[f27,f42]) ).

fof(f46,plain,
    ! [X0,X1] :
      ( ~ rr(X0,sK1(X1))
      | ~ cc(X0)
      | ~ cUnsatisfiable(X1) ),
    inference(resolution,[],[f45,f34]) ).

fof(f47,plain,
    ! [X0] :
      ( ~ ca_Ax2(X0)
      | ~ cUnsatisfiable(X0)
      | ~ cc(X0) ),
    inference(resolution,[],[f46,f38]) ).

fof(f48,plain,
    ! [X0] :
      ( cd(X0)
      | ~ cc(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f47,f39]) ).

fof(f49,plain,
    ! [X0] :
      ( ~ cc(X0)
      | ~ cUnsatisfiable(X0)
      | cdxcomp(X0) ),
    inference(resolution,[],[f48,f41]) ).

fof(f51,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f49,f26]) ).

fof(f52,plain,
    ! [X0] :
      ( cdxcomp(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f51]) ).

fof(f53,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ cUnsatisfiable(X0) ),
    inference(resolution,[],[f52,f34]) ).

fof(f54,plain,
    ! [X0] : ~ cUnsatisfiable(X0),
    inference(duplicate_literal_removal,[],[f53]) ).

fof(f55,plain,
    $false,
    inference(resolution,[],[f54,f33]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : KRS105+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.38  % Computer : n016.cluster.edu
% 0.10/0.38  % Model    : x86_64 x86_64
% 0.10/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38  % Memory   : 8046.5625MB
% 0.10/0.38  % OS       : Linux 6.8.0-71-generic
% 0.10/0.38  % CPULimit : 300
% 0.10/0.38  % WCLimit  : 300
% 0.10/0.38  % DateTime : Sun Sep 27 13:29:02 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41  Running first-order model finding
% 0.11/0.41  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.11/0.45  % (2651358)Will run a generic schedule for satisfiability detection.
% 0.11/0.45  % (2651369)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3863514024:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.11/0.45  % (2651369) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2651358-2651369"...
% 0.11/0.45  % (2651369)...printing done.
% 0.11/0.45  % (2651369)Refutation found. Thanks to Tanya!
% 0.11/0.45  % SZS status Unsatisfiable for theBenchmark
% 0.11/0.45  % SZS output start Proof for theBenchmark
% See solution above
% 0.11/0.45  % (2651369)------------------------------
% 0.11/0.45  % (2651369)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.11/0.45  % (2651369)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.11/0.45  % (2651369)CaDiCaL version: 2.1.3
% 0.11/0.45  % (2651369)Termination reason: Refutation
% 0.11/0.45  % (2651369)Time elapsed: 0.001 s
% 0.11/0.45  % (2651369)Peak memory usage: 11 MB
% 0.11/0.45  % (2651369)Instructions burned: 1 (million)
% 0.11/0.45  % (2651358)Success in time 0.029 s
% 0.11/0.45  % Vampire exiting
%------------------------------------------------------------------------------