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

% Computer : n011.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:04 PM UTC 2026

% Result   : Theorem 0.51s 0.38s
% Output   : Refutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   28 (  21 unt;   0 def)
%            Number of atoms       :   74 (  46 equ)
%            Maximal formula atoms :   11 (   2 avg)
%            Number of connectives :   70 (  24   ~;  14   |;  26   &)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   3 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   2 prp; 0-2 aty)
%            Number of functors    :   25 (  25 usr;  15 con; 0-3 aty)
%            Number of variables   :    9 (   9   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f26,axiom,
    ! [X0] : sum(n0,tptp_minus_1,X0) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).

fof(f28,axiom,
    succ(tptp_minus_1) = n0,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).

fof(f29,axiom,
    ! [X0] : plus(X0,n1) = succ(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_plus_1_r) ).

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

fof(f40,axiom,
    ! [X0] : pred(succ(X0)) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).

fof(f51,axiom,
    true,
    file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',ttrue) ).

fof(f53,conjecture,
    ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
      & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
      & leq(n0,pv35)
      & leq(pv35,minus(n5,n1)) )
   => ( ( n0 != pv44
       => ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
          & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          & leq(n0,pv35)
          & leq(pv35,minus(n5,n1)) ) )
      & ( n0 = pv44
       => true ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_norm_0010) ).

fof(f54,negated_conjecture,
    ~ ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
        & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
        & leq(n0,pv35)
        & leq(pv35,minus(n5,n1)) )
     => ( ( n0 != pv44
         => ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
            & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
            & leq(n0,pv35)
            & leq(pv35,minus(n5,n1)) ) )
        & ( n0 = pv44
         => true ) ) ),
    inference(negated_conjecture,[status(cth)],[f53]) ).

fof(f142,plain,
    ( ( ( ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | ~ leq(n0,pv35)
          | ~ leq(pv35,minus(n5,n1)) )
        & n0 != pv44 )
      | ( ~ true
        & n0 = pv44 ) )
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    & leq(n0,pv35)
    & leq(pv35,minus(n5,n1)) ),
    inference(ennf_transformation,[],[f54]) ).

fof(f143,plain,
    ( ( ( ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
          | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
          | ~ leq(n0,pv35)
          | ~ leq(pv35,minus(n5,n1)) )
        & n0 != pv44 )
      | ( ~ true
        & n0 = pv44 ) )
    & pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    & pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81)))
    & leq(n0,pv35)
    & leq(pv35,minus(n5,n1)) ),
    inference(flattening,[],[f142]) ).

fof(f273,plain,
    ! [X0] : n0 = sum(n0,tptp_minus_1,X0),
    inference(cnf_transformation,[],[f26]) ).

fof(f275,plain,
    n0 = succ(tptp_minus_1),
    inference(cnf_transformation,[],[f28]) ).

fof(f276,plain,
    ! [X0] : succ(X0) = plus(X0,n1),
    inference(cnf_transformation,[],[f29]) ).

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

fof(f287,plain,
    ! [X0] : pred(succ(X0)) = X0,
    inference(cnf_transformation,[],[f40]) ).

fof(f305,plain,
    true,
    inference(cnf_transformation,[],[f51]) ).

fof(f307,plain,
    leq(pv35,minus(n5,n1)),
    inference(cnf_transformation,[],[f143]) ).

fof(f308,plain,
    leq(n0,pv35),
    inference(cnf_transformation,[],[f143]) ).

fof(f310,plain,
    pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)),
    inference(cnf_transformation,[],[f143]) ).

fof(f312,plain,
    ( n0 != pv44
    | ~ true ),
    inference(cnf_transformation,[],[f143]) ).

fof(f313,plain,
    ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
    | pv78 != sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35))
    | ~ leq(n0,pv35)
    | ~ leq(pv35,minus(n5,n1))
    | n0 = pv44 ),
    inference(cnf_transformation,[],[f143]) ).

fof(f360,plain,
    n0 = plus(tptp_minus_1,n1),
    inference(definition_unfolding,[],[f275,f276]) ).

fof(f370,plain,
    ! [X0] : minus(plus(X0,n1),n1) = X0,
    inference(definition_unfolding,[],[f287,f286,f276]) ).

fof(f383,plain,
    ( n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35))))
    | n0 = pv44 ),
    inference(global_subsumption,[],[f313,f310,f308,f307]) ).

fof(f385,plain,
    n0 != sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))),
    inference(global_subsumption,[],[f383,f305,f312]) ).

fof(f514,plain,
    tptp_minus_1 = minus(n0,n1),
    inference(superposition,[],[f370,f360]) ).

fof(f517,plain,
    n0 != sum(n0,tptp_minus_1,times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))),
    inference(superposition,[],[f385,f514]) ).

fof(f518,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f517,f273]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : SWV046+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.27  % Computer : n011.cluster.edu
% 0.24/0.27  % Model    : x86_64 x86_64
% 0.24/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.27  % Memory   : 8046.5625MB
% 0.24/0.27  % OS       : Linux 6.8.0-71-generic
% 0.24/0.27  % CPULimit : 300
% 0.24/0.27  % WCLimit  : 300
% 0.24/0.27  % DateTime : Mon Sep 28 09:47:45 UTC 2026
% 0.24/0.28  % CPUTime  : 
% 0.24/0.28  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.31  Running first-order model finding
% 0.24/0.31  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.51/0.38  % (3286008)Will run a generic schedule for satisfiability detection.
% 0.51/0.38  % (3286013)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3890967074_2999 on theBenchmark for (2999ds/0Mi)
% 0.51/0.38  % (3286014)% WARNING: option uhcvi not known.
% 0.51/0.38  % (3286019)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2773425816:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.51/0.38  % (3286016)dis+10_1_sil=32000:sp=arity:random_seed=3179801878:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.51/0.38  % (3286015)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1685506580:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.51/0.38  % (3286014)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3406049242:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.51/0.38  % (3286017)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=518970662:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.51/0.38  % (3286018)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2292706506:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.51/0.38  % (3286015) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3286008-3286015"...
% 0.51/0.38  % (3286019) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3286008-3286019"...
% 0.51/0.38  % (3286014) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3286008-3286014"...
% 0.51/0.38  % (3286016) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3286008-3286016"...
% 0.51/0.38  % (3286019)...printing done.
% 0.51/0.38  % (3286015)...printing done.
% 0.51/0.38  % (3286014)...printing done.
% 0.51/0.38  % (3286016)...printing done.
% 0.51/0.38  % (3286015)Refutation found. Thanks to Tanya!
% 0.51/0.38  % SZS status Theorem for theBenchmark
% 0.51/0.38  % SZS output start Proof for theBenchmark
% See solution above
% 0.51/0.38  % (3286015)------------------------------
% 0.51/0.38  % (3286015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.51/0.38  % (3286015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.51/0.38  % (3286015)CaDiCaL version: 2.1.3
% 0.51/0.38  % (3286015)Termination reason: Refutation
% 0.51/0.38  % (3286015)Time elapsed: 0.018 s
% 0.51/0.38  % (3286015)Peak memory usage: 12 MB
% 0.51/0.38  % (3286015)Instructions burned: 17 (million)
% 0.51/0.38  % (3286008)Success in time 0.059 s
% 0.51/0.38  % Vampire exiting
%------------------------------------------------------------------------------