↑ 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  : SWX190-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 : n007.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:40 PM UTC 2026

% Result   : Unsatisfiable 0.20s 0.29s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   29 (  29 unt;   0 def)
%            Number of atoms       :   29 (  28 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :   11 (  11   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   4 con; 0-2 aty)
%            Number of variables   :   43 (  43   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f15,axiom,
    ! [X0] : fail(X0,n(z)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_014) ).

fof(f45,axiom,
    ! [X0] : d(n(X0)) = n(z),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_043) ).

fof(f46,plain,
    ! [X0] : n(z) = d(n(X0)),
    inference(reorient_equations,[],[f45]) ).

fof(f47,axiom,
    ! [X0,X1] : d(x(X0,X1)) = x(d(X0),d(X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_044) ).

fof(f49,axiom,
    d(x2) = n(s(z)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_046) ).

fof(f50,plain,
    n(s(z)) = d(x2),
    inference(reorient_equations,[],[f49]) ).

fof(f57,axiom,
    ! [X0] : opt(x(n(z),X0)) = X0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_052) ).

fof(f58,axiom,
    ! [X2,X0,X1] : opt(x(x(X0,X1),X2)) = fail(x(X0,X1),X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_053) ).

fof(f71,axiom,
    ! [X0] : prop4(X0) = eq2(opt(d(X0)),opt(d(opt(X0)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_063) ).

fof(f91,axiom,
    ! [X2,X0,X1] : eq2(x(X0,X1),n(X2)) = bfalse,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_074) ).

fof(f92,plain,
    ! [X2,X0,X1] : bfalse = eq2(x(X0,X1),n(X2)),
    inference(reorient_equations,[],[f91]) ).

fof(f119,axiom,
    ! [X0] : eq3(X0,X0) = btrue,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',axiom_088) ).

fof(f120,plain,
    ! [X0] : btrue = eq3(X0,X0),
    inference(reorient_equations,[],[f119]) ).

fof(f121,negated_conjecture,
    ! [X0] : eq3(prop4(X0),bfalse) != btrue,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

fof(f122,plain,
    ! [X0] : btrue != eq3(prop4(X0),bfalse),
    inference(reorient_equations,[],[f121]) ).

fof(f138,plain,
    ! [X0] : btrue != eq3(eq2(opt(d(X0)),opt(d(opt(X0)))),bfalse),
    inference(definition_unfolding,[],[f122,f71]) ).

fof(f202,plain,
    ! [X0,X1] : bfalse = eq2(x(X0,X1),d(x2)),
    inference(superposition,[],[f92,f50]) ).

fof(f241,plain,
    ! [X0,X1] : d(x(n(X0),X1)) = x(n(z),d(X1)),
    inference(superposition,[],[f47,f46]) ).

fof(f243,plain,
    ! [X0,X1] : d(x(X0,n(X1))) = x(d(X0),n(z)),
    inference(superposition,[],[f47,f46]) ).

fof(f402,plain,
    ! [X2,X0,X1] : opt(x(d(x(X0,X1)),X2)) = fail(d(x(X0,X1)),X2),
    inference(superposition,[],[f58,f47]) ).

fof(f405,plain,
    ! [X2,X0,X1] : btrue != eq3(eq2(opt(d(x(x(X0,X1),X2))),opt(d(fail(x(X0,X1),X2)))),bfalse),
    inference(superposition,[],[f138,f58]) ).

fof(f641,plain,
    ! [X0,X1] : btrue != eq3(eq2(opt(d(x(x(X0,X1),n(z)))),opt(d(x(X0,X1)))),bfalse),
    inference(superposition,[],[f405,f15]) ).

fof(f647,plain,
    ! [X0,X1] : btrue != eq3(eq2(opt(x(d(x(X0,X1)),n(z))),opt(d(x(X0,X1)))),bfalse),
    inference(forward_demodulation,[],[f641,f243]) ).

fof(f649,plain,
    ! [X0,X1] : btrue != eq3(eq2(fail(d(x(X0,X1)),n(z)),opt(d(x(X0,X1)))),bfalse),
    inference(forward_demodulation,[],[f647,f402]) ).

fof(f651,plain,
    ! [X0,X1] : btrue != eq3(eq2(d(x(X0,X1)),opt(d(x(X0,X1)))),bfalse),
    inference(forward_demodulation,[],[f649,f15]) ).

fof(f1701,plain,
    ! [X0] : btrue != eq3(eq2(x(n(z),d(X0)),opt(x(n(z),d(X0)))),bfalse),
    inference(superposition,[],[f651,f241]) ).

fof(f1725,plain,
    ! [X0] : btrue != eq3(eq2(x(n(z),d(X0)),d(X0)),bfalse),
    inference(forward_demodulation,[],[f1701,f57]) ).

fof(f1825,plain,
    btrue != eq3(bfalse,bfalse),
    inference(superposition,[],[f1725,f202]) ).

fof(f1826,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1825,f120]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWX190-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.07/0.18  % Computer : n007.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Mon Sep 28 15:05:40 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.21  Running first-order model finding
% 0.07/0.22  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.20/0.29  % (2484339)Will run a generic schedule for satisfiability detection.
% 0.20/0.29  % (2484348)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1780613984:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29  % (2484345)% WARNING: option uhcvi not known.
% 0.20/0.29  % (2484345)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4019036399:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29  % (2484344)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1905770523_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29  % (2484346)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=302747742:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29  % (2484347)dis+10_1_sil=32000:sp=arity:random_seed=3969201305:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29  % TRYING [1]
% 0.20/0.29  % (2484349)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2901555926:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29  % (2484350)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3992646032:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29  % TRYING [2]
% 0.20/0.29  % TRYING [3]
% 0.20/0.29  % (2484348) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2484339-2484348"...
% 0.20/0.29  % (2484348)...printing done.
% 0.20/0.29  % (2484348)Refutation found. Thanks to Tanya!
% 0.20/0.29  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.29  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.30  % (2484348)------------------------------
% 0.20/0.30  % (2484348)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.30  % (2484348)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.30  % (2484348)CaDiCaL version: 2.1.3
% 0.20/0.30  % (2484348)Termination reason: Refutation
% 0.20/0.30  % (2484348)Time elapsed: 0.036 s
% 0.20/0.30  % (2484348)Peak memory usage: 14 MB
% 0.20/0.30  % (2484348)Instructions burned: 109 (million)
% 0.20/0.30  % (2484339)Success in time 0.07 s
% 0.20/0.30  % Vampire exiting
%------------------------------------------------------------------------------