↑ 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-3 : 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 : 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 10:19:16 AM UTC 2026

% Result   : Unsatisfiable 0.19s 0.57s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   50 (  38 unt;   0 def)
%            Number of atoms       :   63 (  25 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   27 (  14   ~;  13   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   79 (  79   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ less_equal(X0,X1)
      | divide(X0,X1) = zero ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal1) ).

fof(f2,axiom,
    ! [X0,X1] :
      ( divide(X0,X1) != zero
      | less_equal(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_less_equal2) ).

fof(f3,axiom,
    ! [X0,X1] : less_equal(divide(X0,X1),X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_smaller_than_numerator) ).

fof(f4,axiom,
    ! [X2,X0,X1] : less_equal(divide(divide(X0,X1),divide(X2,X1)),divide(divide(X0,X2),X1)),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',quotient_property) ).

fof(f5,axiom,
    ! [X0] : less_equal(zero,X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',zero_is_smallest) ).

fof(f6,axiom,
    ! [X0,X1] :
      ( ~ less_equal(X1,X0)
      | ~ less_equal(X0,X1)
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HEN002-0.ax',less_equal_and_equal) ).

fof(f8,axiom,
    less_equal(a,b),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_LE_b) ).

fof(f9,negated_conjecture,
    ~ less_equal(divide(c,b),divide(c,a)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c_divide_b_LE_c_divide_a) ).

fof(f17,plain,
    ! [X0,X1] : zero = divide(divide(X0,X1),X0),
    inference(resolution,[],[f1,f3]) ).

fof(f18,plain,
    ! [X0] : zero = divide(zero,X0),
    inference(resolution,[],[f1,f5]) ).

fof(f19,plain,
    zero = divide(a,b),
    inference(resolution,[],[f1,f8]) ).

fof(f77,plain,
    ! [X0,X1] :
      ( ~ less_equal(X0,divide(X0,X1))
      | divide(X0,X1) = X0 ),
    inference(resolution,[],[f6,f3]) ).

fof(f78,plain,
    ! [X0] :
      ( ~ less_equal(X0,zero)
      | zero = X0 ),
    inference(resolution,[],[f6,f5]) ).

fof(f307,plain,
    ! [X0,X1] : less_equal(divide(divide(X0,X1),zero),divide(divide(X0,zero),X1)),
    inference(superposition,[],[f4,f18]) ).

fof(f308,plain,
    ! [X0] : less_equal(divide(divide(X0,b),zero),divide(divide(X0,a),b)),
    inference(superposition,[],[f4,f19]) ).

fof(f312,plain,
    ! [X2,X0,X1] : less_equal(divide(divide(divide(X0,X1),X2),divide(X0,X2)),divide(zero,X2)),
    inference(superposition,[],[f4,f17]) ).

fof(f316,plain,
    ! [X0,X1] : less_equal(divide(divide(X0,X0),divide(X1,X0)),zero),
    inference(superposition,[],[f4,f17]) ).

fof(f321,plain,
    ! [X2,X0,X1] : less_equal(divide(divide(divide(X0,X1),X2),divide(X0,X2)),zero),
    inference(forward_demodulation,[],[f312,f18]) ).

fof(f349,plain,
    ! [X0] : less_equal(divide(divide(X0,X0),zero),zero),
    inference(superposition,[],[f316,f17]) ).

fof(f376,plain,
    ! [X0] : zero = divide(divide(X0,X0),zero),
    inference(resolution,[],[f349,f78]) ).

fof(f396,plain,
    ! [X0] :
      ( zero != zero
      | less_equal(divide(X0,X0),zero) ),
    inference(superposition,[],[f2,f376]) ).

fof(f404,plain,
    ! [X0] : less_equal(divide(X0,X0),zero),
    inference(trivial_inequality_removal,[],[f396]) ).

fof(f407,plain,
    ! [X0] : zero = divide(X0,X0),
    inference(resolution,[],[f404,f78]) ).

fof(f418,plain,
    ! [X0,X1] : less_equal(divide(divide(X0,X1),zero),divide(divide(X0,X1),X1)),
    inference(superposition,[],[f4,f407]) ).

fof(f814,plain,
    ! [X0] : less_equal(divide(divide(X0,divide(X0,zero)),zero),zero),
    inference(superposition,[],[f307,f407]) ).

fof(f1292,plain,
    ! [X0] : zero = divide(divide(X0,divide(X0,zero)),zero),
    inference(resolution,[],[f814,f78]) ).

fof(f1333,plain,
    ! [X0] :
      ( zero != zero
      | less_equal(divide(X0,divide(X0,zero)),zero) ),
    inference(superposition,[],[f2,f1292]) ).

fof(f1345,plain,
    ! [X0] : less_equal(divide(X0,divide(X0,zero)),zero),
    inference(trivial_inequality_removal,[],[f1333]) ).

fof(f1356,plain,
    ! [X0] : zero = divide(X0,divide(X0,zero)),
    inference(resolution,[],[f1345,f78]) ).

fof(f1387,plain,
    ! [X0] :
      ( zero != zero
      | less_equal(X0,divide(X0,zero)) ),
    inference(superposition,[],[f2,f1356]) ).

fof(f1422,plain,
    ! [X0] : less_equal(X0,divide(X0,zero)),
    inference(trivial_inequality_removal,[],[f1387]) ).

fof(f1433,plain,
    ! [X0] : divide(X0,zero) = X0,
    inference(resolution,[],[f1422,f77]) ).

fof(f1644,plain,
    ! [X2,X0,X1] : zero = divide(divide(divide(X0,X1),X2),divide(X0,X2)),
    inference(resolution,[],[f321,f78]) ).

fof(f1686,plain,
    ! [X2,X0,X1] : less_equal(divide(divide(divide(divide(X0,X1),X2),X0),zero),zero),
    inference(superposition,[],[f321,f17]) ).

fof(f1715,plain,
    ! [X2,X0,X1] : less_equal(divide(divide(divide(X0,X1),X2),X0),zero),
    inference(forward_demodulation,[],[f1686,f1433]) ).

fof(f1760,plain,
    ! [X2,X0,X1] : zero = divide(divide(divide(X0,X1),X2),X0),
    inference(resolution,[],[f1715,f78]) ).

fof(f1884,plain,
    ! [X2,X0,X1] :
      ( zero != zero
      | less_equal(divide(divide(X0,X1),X2),X0) ),
    inference(superposition,[],[f2,f1760]) ).

fof(f1913,plain,
    ! [X2,X0,X1] : less_equal(divide(divide(X0,X1),X2),X0),
    inference(trivial_inequality_removal,[],[f1884]) ).

fof(f2383,plain,
    ! [X2,X0,X1] :
      ( zero != zero
      | less_equal(divide(divide(X0,X1),X2),divide(X0,X2)) ),
    inference(superposition,[],[f2,f1644]) ).

fof(f2400,plain,
    ! [X2,X0,X1] : less_equal(divide(divide(X0,X1),X2),divide(X0,X2)),
    inference(trivial_inequality_removal,[],[f2383]) ).

fof(f4922,plain,
    ! [X0,X1] : less_equal(divide(X0,X1),divide(divide(X0,X1),X1)),
    inference(forward_demodulation,[],[f418,f1433]) ).

fof(f4923,plain,
    ! [X0,X1] : divide(X0,X1) = divide(divide(X0,X1),X1),
    inference(resolution,[],[f4922,f77]) ).

fof(f5209,plain,
    ! [X0] : less_equal(divide(divide(X0,b),zero),divide(divide(divide(X0,b),a),b)),
    inference(superposition,[],[f308,f4923]) ).

fof(f5210,plain,
    ! [X0] : less_equal(divide(X0,b),divide(divide(divide(X0,b),a),b)),
    inference(forward_demodulation,[],[f5209,f1433]) ).

fof(f5291,plain,
    ! [X0] :
      ( ~ less_equal(divide(divide(divide(X0,b),a),b),divide(X0,b))
      | divide(X0,b) = divide(divide(divide(X0,b),a),b) ),
    inference(resolution,[],[f5210,f6]) ).

fof(f5315,plain,
    ! [X0] : divide(X0,b) = divide(divide(divide(X0,b),a),b),
    inference(forward_subsumption_resolution,[],[f5291,f1913]) ).

fof(f5424,plain,
    ! [X0] :
      ( ~ less_equal(divide(divide(X0,b),a),divide(X0,b))
      | divide(X0,b) = divide(divide(X0,b),a) ),
    inference(superposition,[],[f77,f5315]) ).

fof(f5452,plain,
    ! [X0] : divide(X0,b) = divide(divide(X0,b),a),
    inference(forward_subsumption_resolution,[],[f5424,f3]) ).

fof(f5687,plain,
    ! [X0] : less_equal(divide(X0,b),divide(X0,a)),
    inference(superposition,[],[f2400,f5452]) ).

fof(f5772,plain,
    $false,
    inference(resolution,[],[f5687,f9]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : HEN007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40  % Computer : n016.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 10:55:37 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.44  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.19/0.57  % (2445916)Will run a generic schedule for satisfiability detection.
% 0.19/0.57  % (2445931)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1766390464_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.57  % TRYING [1]
% 0.19/0.57  % TRYING [2]
% 0.19/0.57  % TRYING [3]
% 0.19/0.57  % TRYING [4]
% 0.19/0.57  % (2445933)% WARNING: option uhcvi not known.
% 0.19/0.57  % TRYING [5]
% 0.19/0.57  % (2445934)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=7766240:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.57  % (2445935)dis+10_1_sil=32000:sp=arity:random_seed=3380251461:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.57  % (2445933)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3872339643:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.57  % (2445938)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4139062606:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.57  % (2445936)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=715763237:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.57  % (2445937)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3632774541:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.57  % TRYING [6]
% 0.19/0.57  % TRYING [7]
% 0.19/0.57  % (2445935)Instruction limit reached! 
% 0.19/0.57  % (2445935)------------------------------
% 0.19/0.57  % (2445935)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.57  % (2445935)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.57  % (2445935)CaDiCaL version: 2.1.3
% 0.19/0.57  % (2445935)Termination reason: Instruction limit
% 0.19/0.57  % (2445935)Termination phase: Saturation
% 0.19/0.57  % (2445935)Time elapsed: 0.057 s
% 0.19/0.57  % (2445935)Peak memory usage: 12 MB
% 0.19/0.57  % (2445935)Instructions burned: 103 (million)
% 0.19/0.57  % (2445936)Instruction limit reached! 
% 0.19/0.57  % (2445936)------------------------------
% 0.19/0.57  % (2445936)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.57  % (2445936)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.57  % (2445936)CaDiCaL version: 2.1.3
% 0.19/0.57  % (2445936)Termination reason: Instruction limit
% 0.19/0.57  % (2445936)Termination phase: Saturation
% 0.19/0.57  % (2445936)Time elapsed: 0.064 s
% 0.19/0.57  % (2445936)Peak memory usage: 12 MB
% 0.19/0.57  % (2445936)Instructions burned: 116 (million)
% 0.19/0.57  % (2445937)Instruction limit reached! 
% 0.19/0.57  % (2445937)------------------------------
% 0.19/0.57  % (2445937)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.57  % (2445937)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.57  % (2445937)CaDiCaL version: 2.1.3
% 0.19/0.57  % (2445937)Termination reason: Instruction limit
% 0.19/0.57  % (2445937)Termination phase: Saturation
% 0.19/0.57  % (2445937)Time elapsed: 0.075 s
% 0.19/0.57  % (2445937)Peak memory usage: 12 MB
% 0.19/0.57  % (2445937)Instructions burned: 132 (million)
% 0.19/0.57  % (2445976)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1777814091:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.19/0.57  % TRYING [1]
% 0.19/0.57  % (2445934) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2445916-2445934"...
% 0.19/0.57  % TRYING [2]
% 0.19/0.57  % TRYING [3]
% 0.19/0.57  % (2445934)...printing done.
% 0.19/0.57  % (2445934)Refutation found. Thanks to Tanya!
% 0.19/0.57  % SZS status Unsatisfiable for theBenchmark
% 0.19/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.57  % (2445934)------------------------------
% 0.19/0.57  % (2445934)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.57  % (2445934)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.57  % (2445934)CaDiCaL version: 2.1.3
% 0.19/0.57  % (2445934)Termination reason: Refutation
% 0.19/0.57  % (2445934)Time elapsed: 0.082 s
% 0.19/0.57  % (2445934)Peak memory usage: 13 MB
% 0.19/0.57  % (2445934)Instructions burned: 141 (million)
% 0.19/0.57  % (2445916)Success in time 0.125 s
% 0.19/0.57  % Vampire exiting
%------------------------------------------------------------------------------