↑ 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  : HEN007-2 : 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 : n013.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:19:16 AM UTC 2026

% Result   : Unsatisfiable 0.10s 0.46s
% Output   : Refutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   23 (  13 unt;   0 def)
%            Number of atoms       :   39 (   3 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  17   ~;  16   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   32 (  32   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0,X1] :
      ( ~ quotient(X0,X1,zero)
      | less_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',less_equal_quotient) ).

fof(f8,axiom,
    ! [X0,X1] : quotient(X0,X1,divide(X0,X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',closure) ).

fof(f9,axiom,
    ! [X2,X3,X0,X1] :
      ( ~ quotient(X0,X1,X3)
      | ~ quotient(X0,X1,X2)
      | X2 = X3 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN001-0.ax',well_defined) ).

fof(f12,axiom,
    ! [X0] : quotient(X0,X0,zero),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',x_divide_x_is_zero) ).

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

fof(f15,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ quotient(X0,X3,X4)
      | ~ less_equal(X2,X3)
      | ~ quotient(X0,X1,X2)
      | less_equal(X4,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xQyLEz_implies_xQzLEy) ).

fof(f16,axiom,
    less_equal(x,y),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',xLEy) ).

fof(f17,axiom,
    quotient(z,y,zQy),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zQy) ).

fof(f18,axiom,
    quotient(z,x,zQx),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',zQx) ).

fof(f19,negated_conjecture,
    ~ less_equal(zQy,zQx),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_zQyLEzQx) ).

fof(f21,plain,
    ! [X0] : less_equal(X0,X0),
    inference(resolution,[],[f2,f12]) ).

fof(f67,plain,
    ! [X0] :
      ( ~ less_equal(X0,x)
      | less_equal(X0,y) ),
    inference(resolution,[],[f14,f16]) ).

fof(f71,plain,
    ! [X0] :
      ( ~ quotient(z,x,X0)
      | zQx = X0 ),
    inference(resolution,[],[f9,f18]) ).

fof(f80,plain,
    ! [X0,X1] :
      ( ~ quotient(z,X1,X0)
      | ~ less_equal(X0,y)
      | less_equal(zQy,X1) ),
    inference(resolution,[],[f15,f17]) ).

fof(f86,plain,
    ! [X2,X3,X0,X1] :
      ( ~ quotient(X2,X3,X0)
      | ~ less_equal(X0,X1)
      | less_equal(divide(X2,X1),X3) ),
    inference(resolution,[],[f15,f8]) ).

fof(f127,plain,
    zQx = divide(z,x),
    inference(resolution,[],[f71,f8]) ).

fof(f184,plain,
    ! [X0] :
      ( ~ less_equal(divide(z,X0),y)
      | less_equal(zQy,X0) ),
    inference(resolution,[],[f80,f8]) ).

fof(f233,plain,
    ! [X2,X0,X1] :
      ( ~ less_equal(divide(X0,X1),X2)
      | less_equal(divide(X0,X2),X1) ),
    inference(resolution,[],[f86,f8]) ).

fof(f528,plain,
    ! [X0,X1] : less_equal(divide(X0,divide(X0,X1)),X1),
    inference(resolution,[],[f233,f21]) ).

fof(f698,plain,
    less_equal(divide(z,zQx),x),
    inference(superposition,[],[f528,f127]) ).

fof(f731,plain,
    less_equal(divide(z,zQx),y),
    inference(resolution,[],[f698,f67]) ).

fof(f747,plain,
    less_equal(zQy,zQx),
    inference(resolution,[],[f731,f184]) ).

fof(f762,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f747,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HEN007-2 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.36  % Computer : n013.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 27 10:50:13 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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.10/0.46  % (43957)Will run a generic schedule for satisfiability detection.
% 0.10/0.46  % (43966)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=326074858:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.46  % (43963)% WARNING: option uhcvi not known.
% 0.10/0.46  % (43962)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1522945045_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.46  % (43964)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1020884335:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.46  % (43965)dis+10_1_sil=32000:sp=arity:random_seed=3408815112:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.46  % (43968)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3146542837:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.46  % (43967)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3623029996:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.46  % TRYING [1]
% 0.10/0.46  % (43963)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3930655736:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.46  % TRYING [2]
% 0.10/0.46  % TRYING [3]
% 0.10/0.46  % TRYING [4]
% 0.10/0.46  % TRYING [5]
% 0.10/0.46  % (43965) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-43957-43965"...
% 0.10/0.46  % (43965)...printing done.
% 0.10/0.46  % (43965)Refutation found. Thanks to Tanya!
% 0.10/0.46  % SZS status Unsatisfiable for theBenchmark
% 0.10/0.46  % SZS output start Proof for theBenchmark
% See solution above
% 0.35/0.46  % (43965)------------------------------
% 0.35/0.46  % (43965)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.35/0.46  % (43965)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.35/0.46  % (43965)CaDiCaL version: 2.1.3
% 0.35/0.46  % (43965)Termination reason: Refutation
% 0.35/0.46  % (43965)Time elapsed: 0.016 s
% 0.35/0.46  % (43965)Peak memory usage: 11 MB
% 0.35/0.46  % (43965)Instructions burned: 21 (million)
% 0.35/0.46  % (43957)Success in time 0.057 s
% 0.35/0.46  % Vampire exiting
%------------------------------------------------------------------------------