↑ Up

Vampire-SAT---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : HWV023-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n005.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 10:58:59 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.48s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   38 (  23 unt;   0 def)
%            Number of atoms       :   63 (  25 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   49 (  24   ~;  25   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-2 aty)
%            Number of variables   :   21 (  21   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f2,axiom,
    ! [X0] : gt(plus(X0,n1),n0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_2) ).

fof(f5,axiom,
    ! [X2,X0,X1] :
      ( minus(X0,X1) = X2
      | plus(X2,X1) != X0
      | def_10(X1,X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_5) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ def_10(X0,X1)
      | X1 != X0 ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_7) ).

fof(f8,plain,
    ! [X0,X1] :
      ( ~ def_10(X0,X1)
      | X0 != X1 ),
    inference(reorient_equations,[],[f7]) ).

fof(f24,axiom,
    ! [X0] : plus(n0,X0) = X0,
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_19) ).

fof(f26,axiom,
    ! [X0] : level(X0) = int_level(X0),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_21) ).

fof(f29,axiom,
    ! [X0] :
      ( int_level(X0) != n0
      | p_Empty(X0) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_24) ).

fof(f30,plain,
    ! [X0] :
      ( n0 != int_level(X0)
      | p_Empty(X0) ),
    inference(reorient_equations,[],[f29]) ).

fof(f90,axiom,
    ! [X0] :
      ( p_Reset(X0)
      | p_Wr(X0)
      | ~ p_Rd(X0)
      | ~ gt(int_level(X0),n0)
      | int_level(plus(X0,n1)) = minus(int_level(X0),n1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/HWV003-0.ax',axiom_71) ).

fof(f113,negated_conjecture,
    level(t_139) = n1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_1) ).

fof(f114,plain,
    n1 = level(t_139),
    inference(reorient_equations,[],[f113]) ).

fof(f115,negated_conjecture,
    ~ p_Wr(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_2) ).

fof(f116,negated_conjecture,
    p_Rd(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_3) ).

fof(f117,negated_conjecture,
    ~ p_Reset(t_139),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_4) ).

fof(f118,negated_conjecture,
    ~ p_Empty(plus(t_139,n1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',quest_5) ).

fof(f119,plain,
    n1 = int_level(t_139),
    inference(definition_unfolding,[],[f114,f26]) ).

fof(f121,plain,
    ! [X2,X1] :
      ( def_10(X1,plus(X2,X1))
      | minus(plus(X2,X1),X1) = X2 ),
    inference(equality_resolution,[],[f5]) ).

fof(f122,plain,
    ! [X1] : ~ def_10(X1,X1),
    inference(equality_resolution,[],[f8]) ).

fof(f123,plain,
    ! [X0] : ~ gt(plus(X0,n1),n0),
    inference(consistent_polarity_flipping,[],[f2]) ).

fof(f137,plain,
    ! [X0] :
      ( n0 != int_level(X0)
      | ~ p_Empty(X0) ),
    inference(consistent_polarity_flipping,[],[f30]) ).

fof(f184,plain,
    ! [X0] :
      ( ~ p_Wr(X0)
      | ~ p_Reset(X0)
      | p_Rd(X0)
      | gt(int_level(X0),n0)
      | int_level(plus(X0,n1)) = minus(int_level(X0),n1) ),
    inference(consistent_polarity_flipping,[],[f90]) ).

fof(f204,plain,
    p_Wr(t_139),
    inference(consistent_polarity_flipping,[],[f115]) ).

fof(f205,plain,
    ~ p_Rd(t_139),
    inference(consistent_polarity_flipping,[],[f116]) ).

fof(f206,plain,
    p_Reset(t_139),
    inference(consistent_polarity_flipping,[],[f117]) ).

fof(f207,plain,
    p_Empty(plus(t_139,n1)),
    inference(consistent_polarity_flipping,[],[f118]) ).

fof(f209,plain,
    ~ gt(n1,n0),
    inference(superposition,[],[f123,f24]) ).

fof(f343,plain,
    ! [X0] :
      ( def_10(X0,X0)
      | n0 = minus(X0,X0) ),
    inference(superposition,[],[f121,f24]) ).

fof(f345,plain,
    ! [X0] : n0 = minus(X0,X0),
    inference(forward_subsumption_resolution,[],[f343,f122]) ).

fof(f737,plain,
    ( ~ p_Reset(t_139)
    | p_Rd(t_139)
    | gt(int_level(t_139),n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(resolution,[],[f184,f204]) ).

fof(f745,plain,
    ( p_Rd(t_139)
    | gt(int_level(t_139),n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(forward_subsumption_resolution,[],[f737,f206]) ).

fof(f746,plain,
    ( gt(int_level(t_139),n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(forward_subsumption_resolution,[],[f745,f205]) ).

fof(f747,plain,
    ( gt(n1,n0)
    | int_level(plus(t_139,n1)) = minus(int_level(t_139),n1) ),
    inference(forward_demodulation,[],[f746,f119]) ).

fof(f748,plain,
    int_level(plus(t_139,n1)) = minus(int_level(t_139),n1),
    inference(forward_subsumption_resolution,[],[f747,f209]) ).

fof(f749,plain,
    minus(n1,n1) = int_level(plus(t_139,n1)),
    inference(forward_demodulation,[],[f748,f119]) ).

fof(f750,plain,
    n0 = int_level(plus(t_139,n1)),
    inference(forward_demodulation,[],[f749,f345]) ).

fof(f755,plain,
    ( n0 != n0
    | ~ p_Empty(plus(t_139,n1)) ),
    inference(superposition,[],[f137,f750]) ).

fof(f761,plain,
    ~ p_Empty(plus(t_139,n1)),
    inference(trivial_inequality_removal,[],[f755]) ).

fof(f762,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f761,f207]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : HWV023-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.39  % Computer : n005.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 10:57:32 UTC 2026
% 0.11/0.39  % CPUTime  : 
% 0.11/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.42  Running first-order model finding
% 0.11/0.42  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.15/0.48  % (3819509)Will run a generic schedule for satisfiability detection.
% 0.15/0.48  % (3819519)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2765265628:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.48  % (3819515)% WARNING: option uhcvi not known.
% 0.15/0.48  % (3819514)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1014953249_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.48  % (3819515)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=98076119:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.48  % (3819518)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=501559224:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.48  % (3819516)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1342509852:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.48  % (3819517)dis+10_1_sil=32000:sp=arity:random_seed=1883716106:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.48  % (3819520)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1759194586:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.48  % TRYING [1]
% 0.15/0.48  % TRYING [2]
% 0.15/0.48  % TRYING [3]
% 0.15/0.48  % (3819515) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3819509-3819515"...
% 0.15/0.48  % (3819515)...printing done.
% 0.15/0.48  % (3819515)Refutation found. Thanks to Tanya!
% 0.15/0.48  % SZS status Unsatisfiable for theBenchmark
% 0.15/0.48  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.48  % (3819515)------------------------------
% 0.15/0.48  % (3819515)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.48  % (3819515)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.48  % (3819515)CaDiCaL version: 2.1.3
% 0.15/0.48  % (3819515)Termination reason: Refutation
% 0.15/0.48  % (3819515)Time elapsed: 0.017 s
% 0.15/0.48  % (3819515)Peak memory usage: 12 MB
% 0.15/0.48  % (3819515)Instructions burned: 21 (million)
% 0.15/0.48  % (3819509)Success in time 0.05 s
% 0.15/0.48  % Vampire exiting
%------------------------------------------------------------------------------