↑ 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  : KRS128+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 : n017.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:20 AM UTC 2026

% Result   : Unsatisfiable 0.15s 5.46s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   36 (   5 unt;   0 def)
%            Number of atoms       :   97 (   0 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   86 (  25   ~;  34   |;  13   &)
%                                         (   6 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   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   :   55 (  47   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & cexcomp(X1) )
        & ! [X1] :
            ( rr(X0,X1)
           => cd(X1) )
        & ! [X1] :
            ( rr(X0,X1)
           => ca_Cx4(X1) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_2) ).

fof(f9,axiom,
    ! [X0] :
      ( ca_Cx4(X0)
    <=> ? [X1] : ra_Px4(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_8) ).

fof(f10,axiom,
    ! [X0] :
      ( ca_Cx4xcomp(X0)
    <=> ~ ? [X1] : ra_Px4(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_9) ).

fof(f11,axiom,
    ! [X0] :
      ( ca_Cx4xcomp(X0)
    <=> ( cd(X0)
        & cexcomp(X0) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_10) ).

fof(f12,axiom,
    cUnsatisfiable(i2003_11_14_17_22_31584),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_11) ).

fof(f13,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
    <=> ( ? [X1] :
            ( rr(X0,X1)
            & cexcomp(X1) )
        & ! [X2] :
            ( rr(X0,X2)
           => cd(X2) )
        & ! [X3] :
            ( rr(X0,X3)
           => ca_Cx4(X3) ) ) ),
    inference(rectify,[],[f3]) ).

fof(f15,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
     => ( ? [X1] :
            ( rr(X0,X1)
            & cexcomp(X1) )
        & ! [X2] :
            ( rr(X0,X2)
           => cd(X2) )
        & ! [X3] :
            ( rr(X0,X3)
           => ca_Cx4(X3) ) ) ),
    inference(unused_predicate_definition_removal,[],[f13]) ).

fof(f16,plain,
    ! [X0] :
      ( ca_Cx4(X0)
     => ? [X1] : ra_Px4(X0,X1) ),
    inference(unused_predicate_definition_removal,[],[f9]) ).

fof(f21,plain,
    ! [X0] :
      ( ( ? [X1] :
            ( rr(X0,X1)
            & cexcomp(X1) )
        & ! [X2] :
            ( cd(X2)
            | ~ rr(X0,X2) )
        & ! [X3] :
            ( ca_Cx4(X3)
            | ~ rr(X0,X3) ) )
      | ~ cUnsatisfiable(X0) ),
    inference(ennf_transformation,[],[f15]) ).

fof(f22,plain,
    ! [X0] :
      ( ? [X1] : ra_Px4(X0,X1)
      | ~ ca_Cx4(X0) ),
    inference(ennf_transformation,[],[f16]) ).

fof(f23,plain,
    ! [X0] :
      ( ca_Cx4xcomp(X0)
    <=> ! [X1] : ~ ra_Px4(X0,X1) ),
    inference(ennf_transformation,[],[f10]) ).

fof(f24,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | cexcomp(sK0(X0)) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f25,plain,
    ! [X0] :
      ( ~ cUnsatisfiable(X0)
      | rr(X0,sK0(X0)) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f26,plain,
    ! [X2,X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,X2)
      | cd(X2) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f27,plain,
    ! [X3,X0] :
      ( ~ cUnsatisfiable(X0)
      | ~ rr(X0,X3)
      | ca_Cx4(X3) ),
    inference(cnf_transformation,[],[f21]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ ca_Cx4(X0)
      | ra_Px4(X0,sK3(X0)) ),
    inference(cnf_transformation,[],[f22]) ).

fof(f34,plain,
    ! [X0,X1] :
      ( ~ ra_Px4(X0,X1)
      | ~ ca_Cx4xcomp(X0) ),
    inference(cnf_transformation,[],[f23]) ).

fof(f37,plain,
    ! [X0] :
      ( ~ cexcomp(X0)
      | ~ cd(X0)
      | ca_Cx4xcomp(X0) ),
    inference(cnf_transformation,[],[f11]) ).

fof(f38,plain,
    cUnsatisfiable(i2003_11_14_17_22_31584),
    inference(cnf_transformation,[],[f12]) ).

fof(f39,plain,
    ! [X3,X0] :
      ( rr(X0,X3)
      | cUnsatisfiable(X0)
      | ca_Cx4(X3) ),
    inference(consistent_polarity_flipping,[],[f27]) ).

fof(f40,plain,
    ! [X2,X0] :
      ( rr(X0,X2)
      | cUnsatisfiable(X0)
      | cd(X2) ),
    inference(consistent_polarity_flipping,[],[f26]) ).

fof(f41,plain,
    ! [X0] :
      ( ~ rr(X0,sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f25]) ).

fof(f42,plain,
    ! [X0] :
      ( ~ cexcomp(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(consistent_polarity_flipping,[],[f24]) ).

fof(f45,plain,
    ! [X0,X1] :
      ( ~ ra_Px4(X0,X1)
      | ca_Cx4xcomp(X0) ),
    inference(consistent_polarity_flipping,[],[f34]) ).

fof(f47,plain,
    ! [X0] :
      ( ~ cd(X0)
      | cexcomp(X0)
      | ~ ca_Cx4xcomp(X0) ),
    inference(consistent_polarity_flipping,[],[f37]) ).

fof(f50,plain,
    ~ cUnsatisfiable(i2003_11_14_17_22_31584),
    inference(consistent_polarity_flipping,[],[f38]) ).

fof(f54,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | ca_Cx4(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f39,f41]) ).

fof(f55,plain,
    ! [X0] :
      ( ca_Cx4(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f54]) ).

fof(f56,plain,
    ! [X0] :
      ( ra_Px4(sK0(X0),sK3(sK0(X0)))
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f55,f32]) ).

fof(f57,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | cd(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(resolution,[],[f40,f41]) ).

fof(f58,plain,
    ! [X0] :
      ( cd(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(duplicate_literal_removal,[],[f57]) ).

fof(f59,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | cexcomp(sK0(X0))
      | ~ ca_Cx4xcomp(sK0(X0)) ),
    inference(resolution,[],[f58,f47]) ).

fof(f61,plain,
    ! [X0] :
      ( ~ ca_Cx4xcomp(sK0(X0))
      | cUnsatisfiable(X0) ),
    inference(forward_subsumption_resolution,[],[f59,f42]) ).

fof(f63,plain,
    ! [X0] :
      ( cUnsatisfiable(X0)
      | ca_Cx4xcomp(sK0(X0)) ),
    inference(resolution,[],[f56,f45]) ).

fof(f64,plain,
    ! [X0] : cUnsatisfiable(X0),
    inference(forward_subsumption_resolution,[],[f63,f61]) ).

fof(f66,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f50,f64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS128+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/5.39  % Computer : n017.cluster.edu
% 0.10/5.39  % Model    : x86_64 x86_64
% 0.10/5.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.39  % Memory   : 8046.5625MB
% 0.10/5.39  % OS       : Linux 6.8.0-71-generic
% 0.10/5.39  % CPULimit : 300
% 0.10/5.39  % WCLimit  : 300
% 0.10/5.39  % DateTime : Sun Sep 27 13:23:25 UTC 2026
% 0.10/5.39  % CPUTime  : 
% 0.10/5.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/5.42  Running first-order model finding
% 0.15/5.42  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.15/5.46  % (2552434)Will run a generic schedule for satisfiability detection.
% 0.15/5.46  % (2552440)% WARNING: option uhcvi not known.
% 0.15/5.46  % (2552440)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1289267279:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/5.46  % (2552440) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2552434-2552440"...
% 0.15/5.46  % (2552440)...printing done.
% 0.15/5.46  % (2552440)Refutation found. Thanks to Tanya!
% 0.15/5.46  % SZS status Unsatisfiable for theBenchmark
% 0.15/5.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/5.46  % (2552440)------------------------------
% 0.15/5.46  % (2552440)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/5.46  % (2552440)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/5.46  % (2552440)CaDiCaL version: 2.1.3
% 0.15/5.46  % (2552440)Termination reason: Refutation
% 0.15/5.46  % (2552440)Time elapsed: 0.001 s
% 0.15/5.46  % (2552440)Peak memory usage: 11 MB
% 0.15/5.46  % (2552440)Instructions burned: 2 (million)
% 0.15/5.46  % (2552434)Success in time 0.028 s
% 0.15/5.46  % Vampire exiting
%------------------------------------------------------------------------------