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

% Computer : n011.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 12:17:49 PM UTC 2026

% Result   : Unsatisfiable 0.28s 0.46s
% Output   : Refutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   22 (   5 unt;   0 def)
%            Number of atoms       :   46 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   51 (  27   ~;  24   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : divides(X0,X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divide_self) ).

fof(f2,axiom,
    ! [X2,X0,X1] :
      ( ~ divides(X0,X1)
      | ~ divides(X1,X2)
      | divides(X0,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitive_divide) ).

fof(f3,axiom,
    ! [X0] :
      ( prime(X0)
      | divides(divisor(X0),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prime) ).

fof(f4,axiom,
    ! [X0] :
      ( prime(X0)
      | less(n1,divisor(X0)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor1) ).

fof(f5,axiom,
    ! [X0] :
      ( prime(X0)
      | less(divisor(X0),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',divisor2) ).

fof(f6,axiom,
    ! [X0] :
      ( prime(factor_of(X0))
      | ~ less(X0,a)
      | ~ less(n1,X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor1) ).

fof(f7,axiom,
    ! [X0] :
      ( ~ less(n1,X0)
      | ~ less(X0,a)
      | divides(factor_of(X0),X0) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',factor2) ).

fof(f9,negated_conjecture,
    ! [X0] :
      ( ~ prime(X0)
      | ~ divides(X0,a) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_a_has_prime_divisor) ).

fof(f10,plain,
    ! [X0] :
      ( divides(divisor(X0),X0)
      | ~ divides(X0,a) ),
    inference(resolution,[],[f3,f9]) ).

fof(f11,plain,
    ! [X0] :
      ( less(n1,divisor(X0))
      | ~ divides(X0,a) ),
    inference(resolution,[],[f4,f9]) ).

fof(f12,plain,
    ! [X0] :
      ( less(divisor(X0),X0)
      | ~ divides(X0,a) ),
    inference(resolution,[],[f5,f9]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ divides(X1,divisor(X0))
      | divides(X1,X0)
      | ~ divides(X0,a) ),
    inference(resolution,[],[f2,f10]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ less(X0,a)
      | ~ less(n1,X0)
      | ~ divides(factor_of(X0),a) ),
    inference(resolution,[],[f6,f9]) ).

fof(f25,plain,
    ( ~ less(n1,divisor(a))
    | ~ divides(factor_of(divisor(a)),a)
    | ~ divides(a,a) ),
    inference(resolution,[],[f23,f12]) ).

fof(f26,plain,
    ( ~ divides(factor_of(divisor(a)),a)
    | ~ divides(a,a) ),
    inference(forward_subsumption_resolution,[],[f25,f11]) ).

fof(f36,plain,
    ~ divides(factor_of(divisor(a)),a),
    inference(forward_subsumption_resolution,[],[f26,f1]) ).

fof(f38,plain,
    ( ~ less(n1,divisor(a))
    | divides(factor_of(divisor(a)),divisor(a))
    | ~ divides(a,a) ),
    inference(resolution,[],[f7,f12]) ).

fof(f39,plain,
    ( divides(factor_of(divisor(a)),divisor(a))
    | ~ divides(a,a) ),
    inference(forward_subsumption_resolution,[],[f38,f11]) ).

fof(f45,plain,
    divides(factor_of(divisor(a)),divisor(a)),
    inference(forward_subsumption_resolution,[],[f39,f1]) ).

fof(f75,plain,
    ( divides(factor_of(divisor(a)),a)
    | ~ divides(a,a) ),
    inference(resolution,[],[f17,f45]) ).

fof(f81,plain,
    ~ divides(a,a),
    inference(forward_subsumption_resolution,[],[f75,f36]) ).

fof(f82,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f81,f1]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM015-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n011.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 18:39:46 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.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.28/0.46  % (2685497)Will run a generic schedule for satisfiability detection.
% 0.28/0.46  % (2685506)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4168101886:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.28/0.46  % (2685506) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2685497-2685506"...
% 0.28/0.46  % (2685506)...printing done.
% 0.28/0.46  % (2685503)% WARNING: option uhcvi not known.
% 0.28/0.46  % (2685506)Refutation found. Thanks to Tanya!
% 0.28/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.28/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.28/0.46  % (2685506)------------------------------
% 0.28/0.46  % (2685506)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.28/0.46  % (2685506)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.28/0.46  % (2685506)CaDiCaL version: 2.1.3
% 0.28/0.46  % (2685506)Termination reason: Refutation
% 0.28/0.46  % (2685506)Time elapsed: 0.002 s
% 0.28/0.46  % (2685506)Peak memory usage: 11 MB
% 0.28/0.46  % (2685506)Instructions burned: 3 (million)
% 0.28/0.46  % (2685497)Success in time 0.033 s
% 0.28/0.46  % Vampire exiting
%------------------------------------------------------------------------------