↑ 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  : SWV159+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT

% Computer : n019.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 01:20:21 PM UTC 2026

% Result   : Theorem 0.20s 0.29s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   15 (   8 unt;   0 def)
%            Number of atoms       :   76 (  27 equ)
%            Maximal formula atoms :   15 (   5 avg)
%            Number of connectives :   82 (  21   ~;  13   |;  38   &)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :   11 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   26 (  26 usr;  17 con; 0-3 aty)
%            Number of variables   :   16 (  14   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f39,axiom,
    ! [X0] : minus(X0,n1) = pred(X0),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).

fof(f53,conjecture,
    ( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
      & leq(n0,pv10)
      & leq(n0,pv47)
      & leq(pv10,n135299)
      & leq(pv47,n4)
      & ! [X0] :
          ( ( leq(n0,X0)
            & leq(X0,pred(pv47)) )
         => a_select3(q,pv10,X0) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X0)),minus(a_select2(x,pv10),a_select2(mu,X0))),tptp_minus_2),times(a_select2(sigma,X0),a_select2(sigma,X0)))),a_select2(rho,X0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
      & ! [X1] :
          ( ( leq(n0,X1)
            & leq(X1,pred(pv10)) )
         => sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ) )
   => ! [X2] :
        ( ( leq(n0,X2)
          & leq(X2,pred(pv10)) )
       => ( pv10 != X2
         => sum(n0,n4,a_select3(q,X2,tptp_sum_index)) = n1 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0009) ).

fof(f54,negated_conjecture,
    ~ ( ( pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
        & leq(n0,pv10)
        & leq(n0,pv47)
        & leq(pv10,n135299)
        & leq(pv47,n4)
        & ! [X0] :
            ( ( leq(n0,X0)
              & leq(X0,pred(pv47)) )
           => a_select3(q,pv10,X0) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X0)),minus(a_select2(x,pv10),a_select2(mu,X0))),tptp_minus_2),times(a_select2(sigma,X0),a_select2(sigma,X0)))),a_select2(rho,X0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) )
        & ! [X1] :
            ( ( leq(n0,X1)
              & leq(X1,pred(pv10)) )
           => sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1 ) )
     => ! [X2] :
          ( ( leq(n0,X2)
            & leq(X2,pred(pv10)) )
         => ( pv10 != X2
           => sum(n0,n4,a_select3(q,X2,tptp_sum_index)) = n1 ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f151,plain,
    ( ? [X2] :
        ( n1 != sum(n0,n4,a_select3(q,X2,tptp_sum_index))
        & pv10 != X2
        & leq(n0,X2)
        & leq(X2,pred(pv10)) )
    & pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
    & leq(n0,pv10)
    & leq(n0,pv47)
    & leq(pv10,n135299)
    & leq(pv47,n4)
    & ! [X0] :
        ( a_select3(q,pv10,X0) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X0)),minus(a_select2(x,pv10),a_select2(mu,X0))),tptp_minus_2),times(a_select2(sigma,X0),a_select2(sigma,X0)))),a_select2(rho,X0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
        | ~ leq(n0,X0)
        | ~ leq(X0,pred(pv47)) )
    & ! [X1] :
        ( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
        | ~ leq(n0,X1)
        | ~ leq(X1,pred(pv10)) ) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f152,plain,
    ( ? [X2] :
        ( n1 != sum(n0,n4,a_select3(q,X2,tptp_sum_index))
        & pv10 != X2
        & leq(n0,X2)
        & leq(X2,pred(pv10)) )
    & pv84 = sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))
    & leq(n0,pv10)
    & leq(n0,pv47)
    & leq(pv10,n135299)
    & leq(pv47,n4)
    & ! [X0] :
        ( a_select3(q,pv10,X0) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,X0)),minus(a_select2(x,pv10),a_select2(mu,X0))),tptp_minus_2),times(a_select2(sigma,X0),a_select2(sigma,X0)))),a_select2(rho,X0)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,X0))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index)))))
        | ~ leq(n0,X0)
        | ~ leq(X0,pred(pv47)) )
    & ! [X1] :
        ( sum(n0,n4,a_select3(q,X1,tptp_sum_index)) = n1
        | ~ leq(n0,X1)
        | ~ leq(X1,pred(pv10)) ) ),
    inference(flattening,[],[f151]) ).

fof(f303,plain,
    ! [X0] : minus(X0,n1) = pred(X0),
    inference(cnf_transformation,[],[f39]) ).

fof(f323,plain,
    leq(sK31,pred(pv10)),
    inference(cnf_transformation,[],[f152]) ).

fof(f324,plain,
    leq(n0,sK31),
    inference(cnf_transformation,[],[f152]) ).

fof(f326,plain,
    n1 != sum(n0,n4,a_select3(q,sK31,tptp_sum_index)),
    inference(cnf_transformation,[],[f152]) ).

fof(f328,plain,
    ! [X1] :
      ( ~ leq(X1,pred(pv10))
      | ~ leq(n0,X1)
      | n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ),
    inference(cnf_transformation,[],[f152]) ).

fof(f402,plain,
    ! [X1] :
      ( ~ leq(X1,minus(pv10,n1))
      | ~ leq(n0,X1)
      | n1 = sum(n0,n4,a_select3(q,X1,tptp_sum_index)) ),
    inference(definition_unfolding,[],[f328,f303]) ).

fof(f404,plain,
    leq(sK31,minus(pv10,n1)),
    inference(definition_unfolding,[],[f323,f303]) ).

fof(f418,plain,
    ( ~ leq(n0,sK31)
    | n1 = sum(n0,n4,a_select3(q,sK31,tptp_sum_index)) ),
    inference(resolution,[],[f402,f404]) ).

fof(f419,plain,
    n1 = sum(n0,n4,a_select3(q,sK31,tptp_sum_index)),
    inference(forward_subsumption_resolution,[],[f418,f324]) ).

fof(f420,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f419,f326]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV159+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.19  % Computer : n019.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Mon Sep 28 10:03:18 UTC 2026
% 0.10/0.20  % CPUTime  : 
% 0.10/0.20  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.23  Running first-order model finding
% 0.10/0.23  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.20/0.29  % (3899105)Will run a generic schedule for satisfiability detection.
% 0.20/0.29  % (3899114)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3939557033:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29  % (3899111)% WARNING: option uhcvi not known.
% 0.20/0.29  % (3899114) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3899105-3899114"...
% 0.20/0.29  % (3899110)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2683431957_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29  % (3899111)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1895328294:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29  % (3899112)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=213128332:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29  % (3899113)dis+10_1_sil=32000:sp=arity:random_seed=2373261470:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29  % (3899115)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2535677689:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29  % (3899116)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2973622524:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29  % (3899114)...printing done.
% 0.20/0.29  % (3899114)Refutation found. Thanks to Tanya!
% 0.20/0.29  % SZS status Theorem for theBenchmark
% 0.20/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29  % (3899114)------------------------------
% 0.20/0.29  % (3899114)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29  % (3899114)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29  % (3899114)CaDiCaL version: 2.1.3
% 0.20/0.29  % (3899114)Termination reason: Refutation
% 0.20/0.29  % (3899114)Time elapsed: 0.007 s
% 0.20/0.29  % (3899114)Peak memory usage: 12 MB
% 0.20/0.29  % (3899114)Instructions burned: 25 (million)
% 0.20/0.29  % (3899105)Success in time 0.05 s
% 0.20/0.29  % Vampire exiting
%------------------------------------------------------------------------------