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

% Computer : n002.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 02:29:37 PM UTC 2026

% Result   : Unsatisfiable 0.33s 0.44s
% Output   : Refutation 0.33s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   43 (  22 unt;   2 def)
%            Number of atoms       :   64 (   9 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   47 (  26   ~;  19   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : f(X0,one) = s(one),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).

fof(f2,axiom,
    ! [X0] : f(one,s(X0)) = s(s(f(one,X0))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).

fof(f3,axiom,
    ! [X0,X1] : f(s(X0),s(X1)) = f(X0,f(s(X0),X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).

fof(f4,axiom,
    d(one),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax4) ).

fof(f5,axiom,
    ! [X0] :
      ( d(s(X0))
      | ~ d(X0) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax5) ).

fof(f6,negated_conjecture,
    ~ d(f(s(s(one)),s(s(one)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).

fof(f16,plain,
    f(one,s(one)) = s(s(s(one))),
    inference(superposition,[],[f2,f1]) ).

fof(f18,plain,
    ! [X0] :
      ( ~ d(s(f(one,X0)))
      | d(f(one,s(X0))) ),
    inference(superposition,[],[f5,f2]) ).

fof(f30,plain,
    ! [X0] : f(s(X0),s(one)) = f(X0,s(one)),
    inference(superposition,[],[f3,f1]) ).

fof(f34,plain,
    ! [X0] : f(s(X0),s(s(one))) = f(X0,f(X0,s(one))),
    inference(superposition,[],[f3,f30]) ).

fof(f49,plain,
    ! [X0] : f(s(s(X0)),s(s(one))) = f(s(X0),f(X0,s(one))),
    inference(superposition,[],[f34,f30]) ).

fof(f50,plain,
    ! [X0] : f(s(X0),s(s(s(one)))) = f(X0,f(X0,f(X0,s(one)))),
    inference(superposition,[],[f3,f34]) ).

fof(f101,plain,
    ~ d(f(s(one),f(one,s(one)))),
    inference(superposition,[],[f6,f49]) ).

fof(f104,plain,
    ~ d(f(s(one),s(s(s(one))))),
    inference(forward_demodulation,[],[f101,f16]) ).

fof(f120,plain,
    f(one,f(one,s(s(s(one))))) = f(s(one),s(s(s(one)))),
    inference(superposition,[],[f50,f16]) ).

fof(f154,plain,
    ! [X0] :
      ( d(f(one,s(X0)))
      | ~ d(f(one,X0)) ),
    inference(resolution,[],[f18,f5]) ).

fof(f201,plain,
    ! [X0] :
      ( ~ d(f(one,s(f(one,X0))))
      | d(f(one,f(one,s(X0)))) ),
    inference(superposition,[],[f154,f2]) ).

fof(f203,plain,
    ( d(s(s(s(one))))
    | ~ d(f(one,one)) ),
    inference(superposition,[],[f154,f16]) ).

fof(f206,plain,
    ( ~ d(s(one))
    | d(s(s(s(one)))) ),
    inference(forward_demodulation,[],[f203,f1]) ).

fof(f217,definition,
    ( spl0_6
  <=> d(s(s(s(one)))) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f219,plain,
    ( d(s(s(s(one))))
    | ~ spl0_6 ),
    inference(avatar_component_clause,[],[f217]) ).

fof(f221,definition,
    ( spl0_7
  <=> d(s(one)) ),
    introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).

fof(f223,plain,
    ( ~ d(s(one))
    | spl0_7 ),
    inference(avatar_component_clause,[],[f221]) ).

fof(f224,plain,
    ( spl0_6
    | ~ spl0_7 ),
    inference(avatar_split_clause,[],[f206,f221,f217]) ).

fof(f262,plain,
    ! [X0] :
      ( d(f(one,f(one,s(X0))))
      | ~ d(f(one,f(one,X0))) ),
    inference(resolution,[],[f201,f154]) ).

fof(f300,plain,
    ( d(f(one,s(s(s(one)))))
    | ~ d(f(one,f(one,one))) ),
    inference(superposition,[],[f262,f16]) ).

fof(f385,plain,
    ( d(f(s(one),s(s(s(one)))))
    | ~ d(f(one,f(one,s(s(one))))) ),
    inference(superposition,[],[f262,f120]) ).

fof(f390,plain,
    ~ d(f(one,f(one,s(s(one))))),
    inference(forward_subsumption_resolution,[],[f385,f104]) ).

fof(f395,plain,
    ~ d(f(one,f(one,s(one)))),
    inference(resolution,[],[f390,f262]) ).

fof(f396,plain,
    ~ d(f(one,s(s(s(one))))),
    inference(forward_demodulation,[],[f395,f16]) ).

fof(f400,plain,
    ( ~ d(f(one,s(one)))
    | d(f(one,s(s(s(one))))) ),
    inference(forward_demodulation,[],[f300,f1]) ).

fof(f401,plain,
    ( ~ d(s(s(s(one))))
    | d(f(one,s(s(s(one))))) ),
    inference(forward_demodulation,[],[f400,f16]) ).

fof(f402,plain,
    ( d(f(one,s(s(s(one)))))
    | ~ spl0_6 ),
    inference(forward_subsumption_resolution,[],[f401,f219]) ).

fof(f403,plain,
    ( $false
    | ~ spl0_6 ),
    inference(global_subsumption,[],[f402,f396]) ).

fof(f404,plain,
    ~ spl0_6,
    inference(avatar_contradiction_clause,[],[f403]) ).

fof(f408,plain,
    ( ~ d(one)
    | spl0_7 ),
    inference(resolution,[],[f223,f5]) ).

fof(f409,plain,
    ( $false
    | spl0_7 ),
    inference(forward_subsumption_resolution,[],[f408,f4]) ).

fof(f410,plain,
    spl0_7,
    inference(avatar_contradiction_clause,[],[f409]) ).

cnf(s143,plain,
    ( spl0_6
    | ~ spl0_7 ),
    inference(sat_conversion,[],[f224]) ).

cnf(s255,plain,
    ~ spl0_6,
    inference(sat_conversion,[],[f404]) ).

cnf(s265,plain,
    spl0_7,
    inference(sat_conversion,[],[f410]) ).

cnf(s267,plain,
    $false,
    inference(rat,[],[s143,s265,s255]) ).

fof(f411,plain,
    $false,
    inference(avatar_sat_refutation,[],[s267]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SYO038-1.003.003 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.29  % Computer : n002.cluster.edu
% 0.11/0.29  % Model    : x86_64 x86_64
% 0.11/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29  % Memory   : 8046.5625MB
% 0.11/0.29  % OS       : Linux 6.8.0-71-generic
% 0.11/0.29  % CPULimit : 300
% 0.11/0.29  % WCLimit  : 300
% 0.11/0.29  % DateTime : Mon Sep 28 17:24:38 UTC 2026
% 0.11/0.30  % CPUTime  : 
% 0.11/0.30  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.29/0.35  Running first-order model finding
% 0.29/0.35  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.33/0.44  % (534181)Will run a generic schedule for satisfiability detection.
% 0.33/0.44  % (534189)dis+10_1_sil=32000:sp=arity:random_seed=3671076968:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.33/0.44  % (534187)% WARNING: option uhcvi not known.
% 0.33/0.44  % (534188)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2869000128:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.33/0.44  % (534187)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1428939727:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.33/0.44  % (534186)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4134184583_2999 on theBenchmark for (2999ds/0Mi)
% 0.33/0.44  % (534190)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=4185160206:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.33/0.44  % (534191)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=152434064:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.33/0.44  % TRYING [1]
% 0.33/0.44  % TRYING [2]
% 0.33/0.44  % TRYING [3]
% 0.33/0.44  % TRYING [4]
% 0.33/0.44  % TRYING [5]
% 0.33/0.44  % (534188) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-534181-534188"...
% 0.33/0.44  % TRYING [6]
% 0.33/0.44  % (534188)...printing done.
% 0.33/0.44  % (534189) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-534181-534189"...
% 0.33/0.44  % (534188)Refutation found. Thanks to Tanya!
% 0.33/0.44  % SZS status Unsatisfiable for theBenchmark
% 0.33/0.44  % SZS output start Proof for theBenchmark
% See solution above
% 0.33/0.44  % (534188)------------------------------
% 0.33/0.44  % (534188)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.33/0.44  % (534188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.33/0.44  % (534188)CaDiCaL version: 2.1.3
% 0.33/0.44  % (534188)Termination reason: Refutation
% 0.33/0.44  % (534188)Time elapsed: 0.023 s
% 0.33/0.44  % (534188)Peak memory usage: 12 MB
% 0.33/0.44  % (534188)Instructions burned: 21 (million)
% 0.33/0.44  % (534181)Success in time 0.072 s
% 0.33/0.44  % Vampire exiting
%------------------------------------------------------------------------------