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

% Computer : n012.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 09:40:04 AM UTC 2026

% Result   : Unsatisfiable 0.08s 0.16s
% Output   : Refutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   21 (  14 unt;   0 def)
%            Number of atoms       :   30 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   19 (  10   ~;   9   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   12 (  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ follows(X0,X1)
      | succeeds(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',direct_success) ).

fof(f2,axiom,
    ! [X2,X0,X1] :
      ( ~ succeeds(X0,X2)
      | succeeds(X0,X1)
      | ~ succeeds(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transitivity_of_success) ).

fof(f3,axiom,
    ! [X2,X0,X1] :
      ( ~ labels(X2,X0)
      | ~ has(X1,goto(X2))
      | succeeds(X0,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goto_success) ).

fof(f8,axiom,
    labels(loop,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',label_state_3) ).

fof(f13,axiom,
    follows(p6,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_3_to_6) ).

fof(f15,axiom,
    follows(p7,p6),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_6_to_7) ).

fof(f17,axiom,
    follows(p8,p7),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',transition_7_to_8) ).

fof(f18,axiom,
    has(p8,goto(loop)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',state_8) ).

fof(f19,negated_conjecture,
    ~ succeeds(p3,p3),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_there_is_a_loop_through_p3) ).

fof(f23,plain,
    succeeds(p6,p3),
    inference(resolution,[],[f1,f13]) ).

fof(f24,plain,
    succeeds(p7,p6),
    inference(resolution,[],[f1,f15]) ).

fof(f25,plain,
    succeeds(p8,p7),
    inference(resolution,[],[f1,f17]) ).

fof(f31,plain,
    ! [X0] :
      ( ~ succeeds(p6,X0)
      | succeeds(p7,X0) ),
    inference(resolution,[],[f24,f2]) ).

fof(f32,plain,
    ! [X0] :
      ( ~ has(X0,goto(loop))
      | succeeds(p3,X0) ),
    inference(resolution,[],[f3,f8]) ).

fof(f33,plain,
    ! [X0] :
      ( ~ succeeds(p7,X0)
      | succeeds(p8,X0) ),
    inference(resolution,[],[f25,f2]) ).

fof(f35,plain,
    succeeds(p3,p8),
    inference(resolution,[],[f32,f18]) ).

fof(f36,plain,
    ! [X0] :
      ( ~ succeeds(p8,X0)
      | succeeds(p3,X0) ),
    inference(resolution,[],[f35,f2]) ).

fof(f45,plain,
    succeeds(p7,p3),
    inference(resolution,[],[f31,f23]) ).

fof(f50,plain,
    succeeds(p8,p3),
    inference(resolution,[],[f45,f33]) ).

fof(f68,plain,
    succeeds(p3,p3),
    inference(resolution,[],[f50,f36]) ).

fof(f70,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f68,f19]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : COM002-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.00/0.11  % Computer : n012.cluster.edu
% 0.00/0.11  % Model    : x86_64 x86_64
% 0.00/0.11  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.00/0.11  % Memory   : 8046.5625MB
% 0.00/0.11  % OS       : Linux 6.8.0-71-generic
% 0.00/0.11  % CPULimit : 300
% 0.00/0.11  % WCLimit  : 300
% 0.00/0.11  % DateTime : Mon Sep 28 21:42:04 UTC 2026
% 0.00/0.11  % CPUTime  : 
% 0.00/0.11  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.12  Running first-order model finding
% 0.08/0.12  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.08/0.16  % (3813095)Will run a generic schedule for satisfiability detection.
% 0.08/0.16  % (3813117)% WARNING: option uhcvi not known.
% 0.08/0.16  % (3813121)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3490509095:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.08/0.16  % (3813120)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4153688338:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.08/0.16  % (3813115)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1699700692_2999 on theBenchmark for (2999ds/0Mi)
% 0.08/0.16  % (3813117)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3168287988:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.08/0.16  % (3813118)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4084760790:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.08/0.16  % (3813119)dis+10_1_sil=32000:sp=arity:random_seed=3468141481:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.08/0.16  % (3813122)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3622290828:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.08/0.16  % (3813121) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3813095-3813121"...
% 0.08/0.16  % TRYING [1]
% 0.08/0.16  % (3813119) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3813095-3813119"...
% 0.08/0.16  % TRYING [2]
% 0.08/0.16  % (3813117) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3813095-3813117"...
% 0.08/0.16  % (3813122) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3813095-3813122"...
% 0.08/0.16  % TRYING [3]
% 0.08/0.16  % (3813121)...printing done.
% 0.08/0.16  % (3813119)...printing done.
% 0.08/0.16  % (3813118) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3813095-3813118"...
% 0.08/0.16  % (3813117)...printing done.
% 0.08/0.16  % TRYING [4]
% 0.08/0.16  % (3813122)...printing done.
% 0.08/0.16  % (3813121)Refutation found. Thanks to Tanya!
% 0.08/0.16  % SZS status Unsatisfiable for theBenchmark
% 0.08/0.16  % SZS output start Proof for theBenchmark
% See solution above
% 0.08/0.16  % (3813121)------------------------------
% 0.08/0.16  % (3813121)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.08/0.16  % (3813121)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.08/0.16  % (3813121)CaDiCaL version: 2.1.3
% 0.08/0.16  % (3813121)Termination reason: Refutation
% 0.08/0.16  % (3813121)Time elapsed: 0.001 s
% 0.08/0.16  % (3813121)Peak memory usage: 11 MB
% 0.08/0.16  % (3813121)Instructions burned: 1 (million)
% 0.08/0.16  % (3813095)Success in time 0.034 s
% 0.08/0.16  % Vampire exiting
%------------------------------------------------------------------------------