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

% Computer : n015.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:46:45 PM UTC 2026

% Result   : Theorem 0.19s 0.30s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   36 (  17 unt;   0 def)
%            Number of atoms       :   73 (  19 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   72 (  35   ~;  25   |;   7   &)
%                                         (   4 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   5 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;   5 con; 0-3 aty)
%            Number of variables   :  106 ( 104   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f25,axiom,
    ! [X0,X1] : index(cons(X0,X1),zero) = just(X0),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_025) ).

fof(f26,axiom,
    ! [X0,X1,X2] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_026) ).

fof(f27,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( tc(X0,app(X2,X3,X4),X1)
    <=> ( tc(X0,X2,arr(X4,X1))
        & tc(X0,X3,X4) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_027) ).

fof(f29,axiom,
    ! [X0,X1,X2,X3] :
      ( tc(X0,lam(X1),arr(X2,X3))
    <=> tc(cons(X2,X0),X1,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_029) ).

fof(f31,axiom,
    ! [X0,X1,X2,X3] :
      ( index(X0,X2) = just(X3)
     => ( tc(X0,var(X2),X1)
      <=> X3 = X1 ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_031) ).

fof(f32,conjecture,
    ? [X0] : tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal_032) ).

fof(f33,negated_conjecture,
    ~ ? [X0] : tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
    inference(negated_conjecture,[status(cth)],[f32]) ).

fof(f36,plain,
    ! [X0,X1,X2,X3] :
      ( ( tc(X0,var(X2),X1)
      <=> X3 = X1 )
      | index(X0,X2) != just(X3) ),
    inference(ennf_transformation,[],[f31]) ).

fof(f37,plain,
    ! [X0] : ~ tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
    inference(ennf_transformation,[],[f33]) ).

fof(f38,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ( tc(X0,app(X2,X3,X4),X1)
        | ~ tc(X0,X2,arr(X4,X1))
        | ~ tc(X0,X3,X4) )
      & ( ( tc(X0,X2,arr(X4,X1))
          & tc(X0,X3,X4) )
        | ~ tc(X0,app(X2,X3,X4),X1) ) ),
    inference(nnf_transformation,[],[f27]) ).

fof(f39,plain,
    ! [X0,X1,X2,X3,X4] :
      ( ( tc(X0,app(X2,X3,X4),X1)
        | ~ tc(X0,X2,arr(X4,X1))
        | ~ tc(X0,X3,X4) )
      & ( ( tc(X0,X2,arr(X4,X1))
          & tc(X0,X3,X4) )
        | ~ tc(X0,app(X2,X3,X4),X1) ) ),
    inference(flattening,[],[f38]) ).

fof(f40,plain,
    ! [X0,X1,X2,X3] :
      ( ( tc(X0,lam(X1),arr(X2,X3))
        | ~ tc(cons(X2,X0),X1,X3) )
      & ( tc(cons(X2,X0),X1,X3)
        | ~ tc(X0,lam(X1),arr(X2,X3)) ) ),
    inference(nnf_transformation,[],[f29]) ).

fof(f41,plain,
    ! [X0,X1,X2,X3] :
      ( ( ( tc(X0,var(X2),X1)
          | X1 != X3 )
        & ( X3 = X1
          | ~ tc(X0,var(X2),X1) ) )
      | index(X0,X2) != just(X3) ),
    inference(nnf_transformation,[],[f36]) ).

fof(f66,plain,
    ! [X0,X1] : just(X0) = index(cons(X0,X1),zero),
    inference(cnf_transformation,[],[f25]) ).

fof(f67,plain,
    ! [X2,X0,X1] : index(cons(X0,X1),suc(X2)) = index(X1,X2),
    inference(cnf_transformation,[],[f26]) ).

fof(f70,plain,
    ! [X2,X3,X0,X1,X4] :
      ( tc(X0,app(X2,X3,X4),X1)
      | ~ tc(X0,X2,arr(X4,X1))
      | ~ tc(X0,X3,X4) ),
    inference(cnf_transformation,[],[f39]) ).

fof(f73,plain,
    ! [X2,X3,X0,X1] :
      ( tc(X0,lam(X1),arr(X2,X3))
      | ~ tc(cons(X2,X0),X1,X3) ),
    inference(cnf_transformation,[],[f40]) ).

fof(f76,plain,
    ! [X2,X3,X0,X1] :
      ( tc(X0,var(X2),X1)
      | X1 != X3
      | index(X0,X2) != just(X3) ),
    inference(cnf_transformation,[],[f41]) ).

fof(f77,plain,
    ! [X0] : ~ tc(nil,X0,arr(arr(b,c),arr(arr(a,b),arr(a,c)))),
    inference(cnf_transformation,[],[f37]) ).

fof(f78,plain,
    ! [X2,X3,X0] :
      ( index(X0,X2) != just(X3)
      | tc(X0,var(X2),X3) ),
    inference(equality_resolution,[],[f76]) ).

fof(f84,plain,
    ! [X2,X0,X1] :
      ( just(X0) != just(X2)
      | tc(cons(X0,X1),var(zero),X2) ),
    inference(superposition,[],[f78,f66]) ).

fof(f85,plain,
    ! [X2,X3,X0,X1] :
      ( just(X3) != index(X0,X1)
      | tc(cons(X2,X0),var(suc(X1)),X3) ),
    inference(superposition,[],[f78,f67]) ).

fof(f86,plain,
    ! [X0,X1] : tc(cons(X0,X1),var(zero),X0),
    inference(equality_resolution,[],[f84]) ).

fof(f87,plain,
    ! [X0] : ~ tc(cons(arr(b,c),nil),X0,arr(arr(a,b),arr(a,c))),
    inference(resolution,[],[f73,f77]) ).

fof(f94,plain,
    ! [X0] : ~ tc(cons(arr(a,b),cons(arr(b,c),nil)),X0,arr(a,c)),
    inference(resolution,[],[f87,f73]) ).

fof(f99,plain,
    ! [X0] : ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,c),
    inference(resolution,[],[f94,f73]) ).

fof(f103,plain,
    ! [X2,X0,X1] :
      ( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,arr(X1,c))
      | ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X2,X1) ),
    inference(resolution,[],[f99,f70]) ).

fof(f112,plain,
    ! [X2,X3,X0,X1] :
      ( just(X0) != just(X1)
      | tc(cons(X3,cons(X0,X2)),var(suc(zero)),X1) ),
    inference(superposition,[],[f85,f66]) ).

fof(f113,plain,
    ! [X2,X3,X0,X1,X4] :
      ( index(X0,X1) != just(X2)
      | tc(cons(X4,cons(X3,X0)),var(suc(suc(X1))),X2) ),
    inference(superposition,[],[f85,f67]) ).

fof(f137,plain,
    ! [X2,X0,X1] : tc(cons(X0,cons(X1,X2)),var(suc(zero)),X1),
    inference(equality_resolution,[],[f112]) ).

fof(f148,plain,
    ! [X2,X3,X0,X1,X4] :
      ( just(X0) != just(X2)
      | tc(cons(X3,cons(X4,cons(X0,X1))),var(suc(suc(zero))),X2) ),
    inference(superposition,[],[f113,f66]) ).

fof(f193,plain,
    ! [X2,X3,X0,X1] : tc(cons(X0,cons(X1,cons(X2,X3))),var(suc(suc(zero))),X2),
    inference(equality_resolution,[],[f148]) ).

fof(f264,plain,
    ! [X0] : ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,b),
    inference(resolution,[],[f193,f103]) ).

fof(f270,plain,
    ! [X2,X0,X1] :
      ( ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,arr(X1,b))
      | ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X2,X1) ),
    inference(resolution,[],[f264,f70]) ).

fof(f515,plain,
    ! [X0] : ~ tc(cons(a,cons(arr(a,b),cons(arr(b,c),nil))),X0,a),
    inference(resolution,[],[f270,f137]) ).

fof(f518,plain,
    $false,
    inference(resolution,[],[f515,f86]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX219+1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.18  % Computer : n015.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Mon Sep 28 15:14:32 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21  Running first-order model finding
% 0.08/0.21  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.19/0.30  % (2707121)Will run a generic schedule for satisfiability detection.
% 0.19/0.30  % (2707130)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3184068794:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.19/0.30  % (2707127)% WARNING: option uhcvi not known.
% 0.19/0.30  % (2707126)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1064668639_2999 on theBenchmark for (2999ds/0Mi)
% 0.19/0.30  % (2707127)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3040364050:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.19/0.30  % (2707128)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3985862210:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.19/0.30  % (2707129)dis+10_1_sil=32000:sp=arity:random_seed=1009728795:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.19/0.30  % (2707131)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=562817779:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.19/0.30  % (2707132)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1243899189:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.19/0.30  % Detected minimum model sizes of [3]
% 0.19/0.30  % Detected maximum model sizes of [max]
% 0.19/0.30  % TRYING [3]
% 0.19/0.30  % TRYING [4]
% 0.19/0.30  % TRYING [5]
% 0.19/0.30  % (2707130)Instruction limit reached! 
% 0.19/0.30  % (2707130)------------------------------
% 0.19/0.30  % (2707130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30  % (2707130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30  % (2707130)CaDiCaL version: 2.1.3
% 0.19/0.30  % (2707130)Termination reason: Instruction limit
% 0.19/0.30  % (2707130)Termination phase: Saturation
% 0.19/0.30  % (2707130)Time elapsed: 0.037 s
% 0.19/0.30  % (2707130)Peak memory usage: 12 MB
% 0.19/0.30  % (2707130)Instructions burned: 118 (million)
% 0.19/0.30  % (2707129) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2707121-2707129"...
% 0.19/0.30  % (2707129)...printing done.
% 0.19/0.30  % (2707129)Refutation found. Thanks to Tanya!
% 0.19/0.30  % SZS status Theorem for theBenchmark
% 0.19/0.30  % SZS output start Proof for theBenchmark
% See solution above
% 0.19/0.30  % (2707129)------------------------------
% 0.19/0.30  % (2707129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.19/0.30  % (2707129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.19/0.30  % (2707129)CaDiCaL version: 2.1.3
% 0.19/0.30  % (2707129)Termination reason: Refutation
% 0.19/0.30  % (2707129)Time elapsed: 0.032 s
% 0.19/0.30  % (2707129)Peak memory usage: 12 MB
% 0.19/0.30  % (2707129)Instructions burned: 51 (million)
% 0.19/0.30  % (2707121)Success in time 0.077 s
% 0.19/0.30  % Vampire exiting
%------------------------------------------------------------------------------