↑ 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  : NUM299+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/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:16 PM UTC 2026

% Result   : Theorem 0.10s 0.48s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   29 (  14 unt;   0 def)
%            Number of atoms       :   61 (   1 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   68 (  36   ~;  25   |;   4   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-1 aty)
%            Number of variables   :   41 (  41   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f130,axiom,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn2) ).

fof(f132,axiom,
    rdn_translate(nn4,rdn_neg(rdnn(n4))),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+0.ax',rdnn4) ).

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

fof(f269,axiom,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_positive_less34) ).

fof(f275,axiom,
    ! [X0,X1,X2] :
      ( ( rdn_positive_less(rdnn(X0),rdnn(X1))
        & rdn_positive_less(rdnn(X1),rdnn(X2)) )
     => rdn_positive_less(rdnn(X0),rdnn(X2)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_transitivity) ).

fof(f283,axiom,
    ! [X0,X1,X2,X3] :
      ( ( rdn_translate(X0,rdn_neg(X2))
        & rdn_translate(X1,rdn_neg(X3))
        & rdn_positive_less(X3,X2) )
     => less(X0,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_neg) ).

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

fof(f402,conjecture,
    ~ less(nn2,nn4),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nn2_not_less_nn4) ).

fof(f403,negated_conjecture,
    ~ ~ less(nn2,nn4),
    inference(negated_conjecture,[status(cth)],[f402]) ).

fof(f404,plain,
    less(nn2,nn4),
    inference(flattening,[],[f403]) ).

fof(f406,plain,
    ! [X0,X1,X2] :
      ( rdn_positive_less(rdnn(X0),rdnn(X2))
      | ~ rdn_positive_less(rdnn(X0),rdnn(X1))
      | ~ rdn_positive_less(rdnn(X1),rdnn(X2)) ),
    inference(ennf_transformation,[],[f275]) ).

fof(f407,plain,
    ! [X0,X1,X2] :
      ( rdn_positive_less(rdnn(X0),rdnn(X2))
      | ~ rdn_positive_less(rdnn(X0),rdnn(X1))
      | ~ rdn_positive_less(rdnn(X1),rdnn(X2)) ),
    inference(flattening,[],[f406]) ).

fof(f418,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_neg(X2))
      | ~ rdn_translate(X1,rdn_neg(X3))
      | ~ rdn_positive_less(X3,X2) ),
    inference(ennf_transformation,[],[f283]) ).

fof(f419,plain,
    ! [X0,X1,X2,X3] :
      ( less(X0,X1)
      | ~ rdn_translate(X0,rdn_neg(X2))
      | ~ rdn_translate(X1,rdn_neg(X3))
      | ~ rdn_positive_less(X3,X2) ),
    inference(flattening,[],[f418]) ).

fof(f580,plain,
    rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(cnf_transformation,[],[f130]) ).

fof(f582,plain,
    rdn_translate(nn4,rdn_neg(rdnn(n4))),
    inference(cnf_transformation,[],[f132]) ).

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

fof(f719,plain,
    rdn_positive_less(rdnn(n3),rdnn(n4)),
    inference(cnf_transformation,[],[f269]) ).

fof(f725,plain,
    ! [X2,X0,X1] :
      ( ~ rdn_positive_less(rdnn(X1),rdnn(X2))
      | ~ rdn_positive_less(rdnn(X0),rdnn(X1))
      | rdn_positive_less(rdnn(X0),rdnn(X2)) ),
    inference(cnf_transformation,[],[f407]) ).

fof(f733,plain,
    ! [X2,X3,X0,X1] :
      ( less(X0,X1)
      | ~ rdn_translate(X1,rdn_neg(X3))
      | ~ rdn_translate(X0,rdn_neg(X2))
      | ~ rdn_positive_less(X3,X2) ),
    inference(cnf_transformation,[],[f419]) ).

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

fof(f855,plain,
    less(nn2,nn4),
    inference(cnf_transformation,[],[f404]) ).

fof(f1135,plain,
    ! [X2,X3,X0,X1] :
      ( ~ less(X0,X2)
      | ~ rdn_translate(X2,rdn_neg(X3))
      | ~ rdn_positive_less(X1,X3)
      | ~ rdn_translate(X0,rdn_neg(X1)) ),
    inference(resolution,[],[f733,f735]) ).

fof(f1140,plain,
    ! [X0] :
      ( rdn_positive_less(rdnn(X0),rdnn(n4))
      | ~ rdn_positive_less(rdnn(X0),rdnn(n3)) ),
    inference(resolution,[],[f725,f719]) ).

fof(f1296,plain,
    ! [X0,X1] :
      ( ~ rdn_positive_less(X1,X0)
      | ~ rdn_translate(nn4,rdn_neg(X0))
      | ~ rdn_translate(nn2,rdn_neg(X1)) ),
    inference(resolution,[],[f1135,f855]) ).

fof(f1307,plain,
    ! [X0] :
      ( ~ rdn_translate(nn4,rdn_neg(rdnn(n4)))
      | ~ rdn_translate(nn2,rdn_neg(rdnn(X0)))
      | ~ rdn_positive_less(rdnn(X0),rdnn(n3)) ),
    inference(resolution,[],[f1296,f1140]) ).

fof(f1413,plain,
    ! [X0] :
      ( ~ rdn_positive_less(rdnn(X0),rdnn(n3))
      | ~ rdn_translate(nn2,rdn_neg(rdnn(X0))) ),
    inference(forward_subsumption_resolution,[],[f1307,f582]) ).

fof(f1529,plain,
    ~ rdn_translate(nn2,rdn_neg(rdnn(n2))),
    inference(resolution,[],[f1413,f718]) ).

fof(f1530,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1529,f580]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM299+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39  % Computer : n015.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 27 19:32:31 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.42  Running first-order model finding
% 0.10/0.42  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.48  % (1964277)Will run a generic schedule for satisfiability detection.
% 0.10/0.48  % (1964286)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=93974672:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.48  % (1964283)% WARNING: option uhcvi not known.
% 0.10/0.48  % (1964283)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3652912103:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.10/0.48  % (1964282)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3299510979_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.48  % (1964285)dis+10_1_sil=32000:sp=arity:random_seed=2537228155:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.48  % (1964284)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2417020345:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.48  % (1964287)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=398615560:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.48  % (1964288)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=41862594:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.48  % (1964286) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1964277-1964286"...
% 0.10/0.48  % (1964286)...printing done.
% 0.10/0.48  % (1964286)Refutation found. Thanks to Tanya!
% 0.10/0.48  % SZS status Theorem for theBenchmark
% 0.10/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.48  % (1964286)------------------------------
% 0.10/0.48  % (1964286)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.48  % (1964286)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.48  % (1964286)CaDiCaL version: 2.1.3
% 0.10/0.48  % (1964286)Termination reason: Refutation
% 0.10/0.48  % (1964286)Time elapsed: 0.018 s
% 0.10/0.48  % (1964286)Peak memory usage: 13 MB
% 0.10/0.48  % (1964286)Instructions burned: 67 (million)
% 0.10/0.48  % (1964277)Success in time 0.045 s
% 0.10/0.48  % Vampire exiting
%------------------------------------------------------------------------------