↑ 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  : HEN005-5 : 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:14 AM UTC 2026

% Result   : Unsatisfiable 0.09s 0.45s
% Output   : Refutation 0.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  16 unt;   0 def)
%            Number of atoms       :   31 (  30 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  11   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   16 (  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X2,X0,X1] : divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',quotient_property) ).

fof(f3,plain,
    ! [X2,X0,X1] : zero = divide(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    inference(reorient_equations,[],[f2]) ).

fof(f4,axiom,
    ! [X0] : divide(zero,X0) = zero,
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',zero_is_smallest) ).

fof(f5,plain,
    ! [X0] : zero = divide(zero,X0),
    inference(reorient_equations,[],[f4]) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( divide(X0,X1) != zero
      | divide(X1,X0) != zero
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN003-0.ax',divide_and_equal) ).

fof(f7,plain,
    ! [X0,X1] :
      ( zero != divide(X1,X0)
      | divide(X0,X1) != zero
      | X0 = X1 ),
    inference(reorient_equations,[],[f6]) ).

fof(f10,axiom,
    divide(a,b) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_divide_b_is_zero) ).

fof(f11,plain,
    zero = divide(a,b),
    inference(reorient_equations,[],[f10]) ).

fof(f12,axiom,
    divide(b,c) = zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_divide_c_is_zero) ).

fof(f13,plain,
    zero = divide(b,c),
    inference(reorient_equations,[],[f12]) ).

fof(f14,negated_conjecture,
    divide(a,c) != zero,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_transitivity_of_divide_to_zero) ).

fof(f15,plain,
    zero != divide(a,c),
    inference(reorient_equations,[],[f14]) ).

fof(f23,plain,
    ! [X0] :
      ( zero != zero
      | zero != divide(X0,zero)
      | zero = X0 ),
    inference(superposition,[],[f7,f5]) ).

fof(f28,plain,
    ! [X0] :
      ( zero != divide(X0,zero)
      | zero = X0 ),
    inference(trivial_inequality_removal,[],[f23]) ).

fof(f66,plain,
    ! [X0] : zero = divide(divide(divide(a,X0),divide(b,X0)),divide(zero,X0)),
    inference(superposition,[],[f3,f11]) ).

fof(f76,plain,
    ! [X0] : zero = divide(divide(divide(a,X0),divide(b,X0)),zero),
    inference(forward_demodulation,[],[f66,f5]) ).

fof(f110,plain,
    zero = divide(divide(divide(a,c),zero),zero),
    inference(superposition,[],[f76,f13]) ).

fof(f198,plain,
    ( zero != zero
    | zero = divide(divide(a,c),zero) ),
    inference(superposition,[],[f28,f110]) ).

fof(f207,plain,
    zero = divide(divide(a,c),zero),
    inference(trivial_inequality_removal,[],[f198]) ).

fof(f229,plain,
    ( zero != zero
    | zero = divide(a,c) ),
    inference(superposition,[],[f28,f207]) ).

fof(f239,plain,
    zero = divide(a,c),
    inference(trivial_inequality_removal,[],[f229]) ).

fof(f244,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f239,f15]) ).

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