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

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

% Result   : Theorem 0.17s 0.47s
% Output   : Refutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (   9 unt;   0 def)
%            Number of atoms       :   43 (   0 equ)
%            Maximal formula atoms :    3 (   2 avg)
%            Number of connectives :   38 (  16   ~;  16   |;   5   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   30 (  28   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f29,axiom,
    ! [X0,X1,X2] :
      ( ( leq(X1,X0)
        & leq(X0,X2) )
     => completion_compatible(X0,X1,X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+4.ax',completion_compat) ).

fof(f37,axiom,
    ! [X0] : leq(ninf,X0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_inf_lb) ).

fof(f38,axiom,
    ! [X0] : leq(X0,nsup),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',h_sup_ub) ).

fof(f40,conjecture,
    ? [X0] :
      ( leq(ninf,X0)
      & leq(X0,nsup)
      & completion_compatible(X0,ninf,nsup) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unknown_sound_compatible) ).

fof(f41,negated_conjecture,
    ~ ? [X0] :
        ( leq(ninf,X0)
        & leq(X0,nsup)
        & completion_compatible(X0,ninf,nsup) ),
    inference(negated_conjecture,[status(cth)],[f40]) ).

fof(f69,plain,
    ! [X0,X1,X2] :
      ( completion_compatible(X0,X1,X2)
      | ~ leq(X1,X0)
      | ~ leq(X0,X2) ),
    inference(ennf_transformation,[],[f29]) ).

fof(f70,plain,
    ! [X0,X1,X2] :
      ( completion_compatible(X0,X1,X2)
      | ~ leq(X1,X0)
      | ~ leq(X0,X2) ),
    inference(flattening,[],[f69]) ).

fof(f76,plain,
    ! [X0] :
      ( ~ leq(ninf,X0)
      | ~ leq(X0,nsup)
      | ~ completion_compatible(X0,ninf,nsup) ),
    inference(ennf_transformation,[],[f41]) ).

fof(f111,plain,
    ! [X2,X0,X1] :
      ( ~ leq(X0,X2)
      | ~ leq(X1,X0)
      | completion_compatible(X0,X1,X2) ),
    inference(cnf_transformation,[],[f70]) ).

fof(f117,plain,
    ! [X0] : leq(ninf,X0),
    inference(cnf_transformation,[],[f37]) ).

fof(f118,plain,
    ! [X0] : leq(X0,nsup),
    inference(cnf_transformation,[],[f38]) ).

fof(f120,plain,
    ! [X0] :
      ( ~ completion_compatible(X0,ninf,nsup)
      | ~ leq(X0,nsup)
      | ~ leq(ninf,X0) ),
    inference(cnf_transformation,[],[f76]) ).

fof(f154,plain,
    ! [X2,X0,X1] :
      ( ~ completion_compatible(X0,X1,X2)
      | leq(X1,X0)
      | leq(X0,X2) ),
    inference(consistent_polarity_flipping,[],[f111]) ).

fof(f158,plain,
    ! [X0] : ~ leq(ninf,X0),
    inference(consistent_polarity_flipping,[],[f117]) ).

fof(f159,plain,
    ! [X0] : ~ leq(X0,nsup),
    inference(consistent_polarity_flipping,[],[f118]) ).

fof(f160,plain,
    ! [X0] :
      ( completion_compatible(X0,ninf,nsup)
      | leq(X0,nsup)
      | leq(ninf,X0) ),
    inference(consistent_polarity_flipping,[],[f120]) ).

fof(f203,plain,
    ! [X0] :
      ( completion_compatible(X0,ninf,nsup)
      | leq(X0,nsup) ),
    inference(backward_subsumption_resolution,[],[f160,f158]) ).

fof(f204,plain,
    ! [X0] : completion_compatible(X0,ninf,nsup),
    inference(backward_subsumption_resolution,[],[f203,f159]) ).

fof(f245,plain,
    ! [X0] :
      ( leq(ninf,X0)
      | leq(X0,nsup) ),
    inference(resolution,[],[f154,f204]) ).

fof(f246,plain,
    ! [X0] : leq(X0,nsup),
    inference(forward_subsumption_resolution,[],[f245,f158]) ).

fof(f247,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f246,f159]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT070+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n003.cluster.edu
% 0.11/0.39  % Model    : x86_64 x86_64
% 0.11/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39  % Memory   : 8046.5625MB
% 0.11/0.39  % OS       : Linux 6.8.0-71-generic
% 0.11/0.39  % CPULimit : 300
% 0.11/0.39  % WCLimit  : 300
% 0.11/0.39  % DateTime : Sun Sep 27 17:35:26 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/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.17/0.47  % (811618)Will run a generic schedule for satisfiability detection.
% 0.17/0.47  % (811628)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2640286826:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.47  % (811627)% WARNING: option uhcvi not known.
% 0.17/0.47  % (811626)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=129110001_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.47  % (811629)dis+10_1_sil=32000:sp=arity:random_seed=390401446:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.47  % (811627)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2792971533:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.47  % (811630)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2811333063:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.47  % Detected minimum model sizes of [3]
% 0.17/0.47  % Detected maximum model sizes of [max]
% 0.17/0.47  % TRYING [3]
% 0.17/0.47  % (811629) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-811618-811629"...
% 0.17/0.47  % (811631)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4217736512:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.47  % (811627) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-811618-811627"...
% 0.17/0.47  % (811635)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3823299740:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.47  % (811629)...printing done.
% 0.17/0.47  % (811627)...printing done.
% 0.17/0.47  % (811627)Refutation found. Thanks to Tanya!
% 0.17/0.47  % SZS status Theorem for theBenchmark
% 0.17/0.47  % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.47  % (811627)------------------------------
% 0.17/0.47  % (811627)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.47  % (811627)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.47  % (811627)CaDiCaL version: 2.1.3
% 0.17/0.47  % (811627)Termination reason: Refutation
% 0.17/0.47  % (811627)Time elapsed: 0.004 s
% 0.17/0.47  % (811627)Peak memory usage: 12 MB
% 0.17/0.47  % (811627)Instructions burned: 4 (million)
% 0.17/0.47  % (811618)Success in time 0.037 s
% 0.17/0.47  % Vampire exiting
%------------------------------------------------------------------------------