↑ 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  : SWV385+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/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 01:21:08 PM UTC 2026

% Result   : Theorem 0.10s 0.25s
% Output   : Refutation 0.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (  10 unt;   2 def)
%            Number of atoms       :   68 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   73 (  37   ~;  24   |;   6   &)
%                                         (   2 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   0 sgn  27   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f42,axiom,
    ! [X0,X1,X2] :
      ( ~ ok(triple(X0,X1,X2))
     => ~ ok(im_succ_cpq(triple(X0,X1,X2))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li1316) ).

fof(f43,axiom,
    ! [X0,X1,X2] :
      ( ~ check_cpq(triple(X0,X1,X2))
     => ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
        | ~ ok(im_succ_cpq(triple(X0,X1,X2))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_li2225) ).

fof(f44,conjecture,
    ! [X0,X1,X2] :
      ( ( ~ check_cpq(triple(X0,X1,X2))
        | ~ ok(triple(X0,X1,X2)) )
     => ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
        | ~ ok(im_succ_cpq(triple(X0,X1,X2))) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',l21_co) ).

fof(f45,negated_conjecture,
    ~ ! [X0,X1,X2] :
        ( ( ~ check_cpq(triple(X0,X1,X2))
          | ~ ok(triple(X0,X1,X2)) )
       => ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
          | ~ ok(im_succ_cpq(triple(X0,X1,X2))) ) ),
    inference(negated_conjecture,[status(cth)],[f44]) ).

fof(f84,plain,
    ! [X0,X1,X2] :
      ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | ok(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f42]) ).

fof(f85,plain,
    ! [X0,X1,X2] :
      ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      | ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | check_cpq(triple(X0,X1,X2)) ),
    inference(ennf_transformation,[],[f43]) ).

fof(f86,plain,
    ! [X0,X1,X2] :
      ( ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      | ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | check_cpq(triple(X0,X1,X2)) ),
    inference(flattening,[],[f85]) ).

fof(f87,plain,
    ? [X0,X1,X2] :
      ( check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      & ok(im_succ_cpq(triple(X0,X1,X2)))
      & ( ~ check_cpq(triple(X0,X1,X2))
        | ~ ok(triple(X0,X1,X2)) ) ),
    inference(ennf_transformation,[],[f45]) ).

fof(f88,plain,
    ? [X0,X1,X2] :
      ( check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      & ok(im_succ_cpq(triple(X0,X1,X2)))
      & ( ~ check_cpq(triple(X0,X1,X2))
        | ~ ok(triple(X0,X1,X2)) ) ),
    inference(flattening,[],[f87]) ).

fof(f95,plain,
    ( check_cpq(im_succ_cpq(triple(sK0,sK1,sK2)))
    & ok(im_succ_cpq(triple(sK0,sK1,sK2)))
    & ( ~ check_cpq(triple(sK0,sK1,sK2))
      | ~ ok(triple(sK0,sK1,sK2)) ) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2)],[f88]) ).

fof(f144,plain,
    ! [X2,X0,X1] :
      ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | ok(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f84]) ).

fof(f145,plain,
    ! [X2,X0,X1] :
      ( ~ ok(im_succ_cpq(triple(X0,X1,X2)))
      | ~ check_cpq(im_succ_cpq(triple(X0,X1,X2)))
      | check_cpq(triple(X0,X1,X2)) ),
    inference(cnf_transformation,[],[f86]) ).

fof(f146,plain,
    ( ~ check_cpq(triple(sK0,sK1,sK2))
    | ~ ok(triple(sK0,sK1,sK2)) ),
    inference(cnf_transformation,[],[f95]) ).

fof(f147,plain,
    ok(im_succ_cpq(triple(sK0,sK1,sK2))),
    inference(cnf_transformation,[],[f95]) ).

fof(f148,plain,
    check_cpq(im_succ_cpq(triple(sK0,sK1,sK2))),
    inference(cnf_transformation,[],[f95]) ).

fof(f157,definition,
    ( spl3_1
  <=> ok(triple(sK0,sK1,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl3_1])],[avatar_definition]) ).

fof(f159,plain,
    ( ~ ok(triple(sK0,sK1,sK2))
    | spl3_1 ),
    inference(avatar_component_clause,[],[f157]) ).

fof(f161,definition,
    ( spl3_2
  <=> check_cpq(triple(sK0,sK1,sK2)) ),
    introduced(definition,[new_symbols(definition,[spl3_2])],[avatar_definition]) ).

fof(f163,plain,
    ( ~ check_cpq(triple(sK0,sK1,sK2))
    | spl3_2 ),
    inference(avatar_component_clause,[],[f161]) ).

fof(f164,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(avatar_split_clause,[],[f146,f161,f157]) ).

fof(f190,plain,
    ok(triple(sK0,sK1,sK2)),
    inference(resolution,[],[f144,f147]) ).

fof(f191,plain,
    ( $false
    | spl3_1 ),
    inference(forward_subsumption_resolution,[],[f190,f159]) ).

fof(f192,plain,
    spl3_1,
    inference(avatar_contradiction_clause,[],[f191]) ).

fof(f203,plain,
    ( ~ check_cpq(im_succ_cpq(triple(sK0,sK1,sK2)))
    | check_cpq(triple(sK0,sK1,sK2)) ),
    inference(resolution,[],[f145,f147]) ).

fof(f204,plain,
    check_cpq(triple(sK0,sK1,sK2)),
    inference(forward_subsumption_resolution,[],[f203,f148]) ).

fof(f205,plain,
    ( $false
    | spl3_2 ),
    inference(forward_subsumption_resolution,[],[f204,f163]) ).

fof(f206,plain,
    spl3_2,
    inference(avatar_contradiction_clause,[],[f205]) ).

cnf(s53,plain,
    ( ~ spl3_1
    | ~ spl3_2 ),
    inference(sat_conversion,[],[f164]) ).

cnf(s85,plain,
    spl3_1,
    inference(sat_conversion,[],[f192]) ).

cnf(s98,plain,
    spl3_2,
    inference(sat_conversion,[],[f206]) ).

cnf(s99,plain,
    $false,
    inference(rat,[],[s53,s98,s85]) ).

fof(f207,plain,
    $false,
    inference(avatar_sat_refutation,[],[s99]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV385+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.17  % Computer : n003.cluster.edu
% 0.10/0.17  % Model    : x86_64 x86_64
% 0.10/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.17  % Memory   : 8046.5625MB
% 0.10/0.17  % OS       : Linux 6.8.0-71-generic
% 0.10/0.17  % CPULimit : 300
% 0.10/0.17  % WCLimit  : 300
% 0.10/0.17  % DateTime : Mon Sep 28 10:49:42 UTC 2026
% 0.10/0.17  % CPUTime  : 
% 0.10/0.17  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.20  Running first-order model finding
% 0.10/0.20  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.10/0.25  % (1507918)Will run a generic schedule for satisfiability detection.
% 0.10/0.25  % (1507923)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1691365785_2999 on theBenchmark for (2999ds/0Mi)
% 0.10/0.25  % TRYING [1]
% 0.10/0.25  % TRYING [2]
% 0.10/0.25  % TRYING [3]
% 0.10/0.25  % (1507928)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3939256298:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.10/0.25  % (1507925)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3138767496:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.10/0.25  % (1507926)dis+10_1_sil=32000:sp=arity:random_seed=2017477394:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.10/0.25  % (1507927)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=667140277:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.10/0.25  % (1507929)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4066959687:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.10/0.25  % (1507924)% WARNING: option uhcvi not known.
% 0.10/0.25  % (1507925) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1507918-1507925"...
% 0.10/0.25  % (1507926) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1507918-1507926"...
% 0.10/0.25  % (1507925)...printing done.
% 0.10/0.25  % (1507925)Refutation found. Thanks to Tanya!
% 0.10/0.25  % SZS status Theorem for theBenchmark
% 0.10/0.25  % SZS output start Proof for theBenchmark
% See solution above
% 0.10/0.25  % (1507925)------------------------------
% 0.10/0.25  % (1507925)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.10/0.25  % (1507925)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.10/0.25  % (1507925)CaDiCaL version: 2.1.3
% 0.10/0.25  % (1507925)Termination reason: Refutation
% 0.10/0.25  % (1507925)Time elapsed: 0.005 s
% 0.10/0.25  % (1507925)Peak memory usage: 12 MB
% 0.10/0.25  % (1507925)Instructions burned: 5 (million)
% 0.10/0.25  % (1507918)Success in time 0.042 s
% 0.10/0.25  % Vampire exiting
%------------------------------------------------------------------------------