↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : NUM291+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 : n015.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:18:15 PM UTC 2026

% Result   : Theorem 0.21s 0.54s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   21 (  13 unt;   0 def)
%            Number of atoms       :   39 (   1 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   41 (  23   ~;  13   |;   3   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   22 (  22   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f3,axiom,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn2) ).

fof(f4,axiom,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn3) ).

fof(f268,axiom,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).

fof(f281,axiom,
    ! [X0,X1,X2,X3] :
      ( ( rdn_translate(X0,rdn_pos(X2))
        & rdn_translate(X1,rdn_pos(X3))
        & rdn_positive_less(X2,X3) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).

fof(f284,axiom,
    ! [X0,X1] :
      ( less(X0,X1)
    <=> ( ~ less(X1,X0)
        & X1 != X0 ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).

fof(f402,conjecture,
    ~ less(n3,n2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',n3_not_less_n2) ).

fof(f403,negated_conjecture,
    ~ ~ less(n3,n2),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f404,plain,
    less(n3,n2),
    inference(flattening,[],[f403]) ).

fof(f414,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_pos(X2))
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_positive_less(X2,X3) ),
    inference(ennf_transformation,[],[f281]) ).

fof(f415,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_pos(X2))
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_positive_less(X2,X3) ),
    inference(flattening,[],[f414]) ).

fof(f453,plain,
    rdn_translate(n2,rdn_pos(rdnn(n2))),
    inference(cnf_transformation,[],[f3]) ).

fof(f454,plain,
    rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(cnf_transformation,[],[f4]) ).

fof(f718,plain,
    rdn_positive_less(rdnn(n2),rdnn(n3)),
    inference(cnf_transformation,[],[f268]) ).

fof(f731,plain,
    ! [X2,X3,X0,X1] :
      ( less(X0,X1)
      | ~ rdn_translate(X1,rdn_pos(X3))
      | ~ rdn_translate(X0,rdn_pos(X2))
      | ~ rdn_positive_less(X2,X3) ),
    inference(cnf_transformation,[],[f415]) ).

fof(f735,plain,
    ! [X0,X1] :
      ( ~ less(X1,X0)
      | ~ less(X0,X1) ),
    inference(cnf_transformation,[],[f284]) ).

fof(f855,plain,
    less(n3,n2),
    inference(cnf_transformation,[],[f404]) ).

fof(f858,plain,
    ~ less(n2,n3),
    inference(resolution,[],[f735,f855]) ).

fof(f1143,plain,
    ! [X0,X1] :
      ( ~ rdn_positive_less(X1,X0)
      | ~ rdn_translate(n2,rdn_pos(X1))
      | ~ rdn_translate(n3,rdn_pos(X0)) ),
    inference(resolution,[],[f731,f858]) ).

fof(f1146,plain,
    ( ~ rdn_translate(n2,rdn_pos(rdnn(n2)))
    | ~ rdn_translate(n3,rdn_pos(rdnn(n3))) ),
    inference(resolution,[],[f1143,f718]) ).

fof(f1208,plain,
    ~ rdn_translate(n3,rdn_pos(rdnn(n3))),
    inference(forward_subsumption_resolution,[],[f1146,f453]) ).

fof(f1227,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1208,f454]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM291+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.41  % Computer : n015.cluster.edu
% 0.15/0.41  % Model    : x86_64 x86_64
% 0.15/0.41  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.41  % Memory   : 8046.5625MB
% 0.15/0.41  % OS       : Linux 6.8.0-71-generic
% 0.15/0.41  % CPULimit : 300
% 0.15/0.41  % WCLimit  : 300
% 0.15/0.41  % DateTime : Sun Sep 27 19:32:01 UTC 2026
% 0.15/0.42  % CPUTime  : 
% 0.15/0.42  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.15/0.46  Running first-order model finding
% 0.15/0.46  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.21/0.54  % (1962999)Will run a generic schedule for satisfiability detection.
% 0.21/0.54  % (1963008)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2061026249:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.54  % (1963004)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3276381336_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.54  % (1963005)% WARNING: option uhcvi not known.
% 0.21/0.54  % (1963007)dis+10_1_sil=32000:sp=arity:random_seed=4179228279:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.54  % (1963006)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3325012452:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.54  % (1963005)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3142812645:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.54  % (1963009)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2922299222:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.54  % (1963010)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2145690989:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.54  % (1963008) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1962999-1963008"...
% 0.21/0.54  % (1963008)...printing done.
% 0.21/0.54  % (1963008)Refutation found. Thanks to Tanya!
% 0.21/0.54  % SZS status Theorem for theBenchmark
% 0.21/0.54  % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.54  % (1963008)------------------------------
% 0.21/0.54  % (1963008)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.54  % (1963008)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.54  % (1963008)CaDiCaL version: 2.1.3
% 0.21/0.54  % (1963008)Termination reason: Refutation
% 0.21/0.54  % (1963008)Time elapsed: 0.022 s
% 0.21/0.54  % (1963008)Peak memory usage: 13 MB
% 0.21/0.54  % (1963008)Instructions burned: 47 (million)
% 0.21/0.54  % (1962999)Success in time 0.065 s
% 0.21/0.54  % Vampire exiting
%------------------------------------------------------------------------------