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

% Computer : n009.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 11:58:26 AM UTC 2026

% Result   : Unsatisfiable 0.20s 0.57s
% Output   : Refutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   32 (  17 unt;   0 def)
%            Number of atoms       :   51 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   47 (  28   ~;  19   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   5 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   77 (  77   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(X0)
      | is_a_theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).

fof(f2,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_1) ).

fof(f3,axiom,
    ! [X0] : is_a_theorem(implies(implies(not(X0),X0),X0)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_2) ).

fof(f4,axiom,
    ! [X0,X1] : is_a_theorem(implies(X0,implies(not(X0),X1))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cn_3) ).

fof(f5,negated_conjecture,
    ~ is_a_theorem(implies(implies(not(x),y),implies(z,implies(implies(y,x),x)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_cn_13) ).

fof(f6,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | is_a_theorem(X0)
      | ~ is_a_theorem(X1) ),
    inference(consistent_polarity_flipping,[],[f1]) ).

fof(f7,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(X1,X2),implies(X0,X2)))),
    inference(consistent_polarity_flipping,[],[f2]) ).

fof(f8,plain,
    ! [X0] : ~ is_a_theorem(implies(implies(not(X0),X0),X0)),
    inference(consistent_polarity_flipping,[],[f3]) ).

fof(f9,plain,
    ! [X0,X1] : ~ is_a_theorem(implies(X0,implies(not(X0),X1))),
    inference(consistent_polarity_flipping,[],[f4]) ).

fof(f10,plain,
    is_a_theorem(implies(implies(not(x),y),implies(z,implies(implies(y,x),x)))),
    inference(consistent_polarity_flipping,[],[f5]) ).

fof(f12,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(not(X0),X1))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f6,f9]) ).

fof(f22,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(implies(X1,X2),implies(X0,X2))) ),
    inference(resolution,[],[f7,f6]) ).

fof(f23,plain,
    ! [X0,X1] : ~ is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X0),X1))),
    inference(resolution,[],[f22,f8]) ).

fof(f24,plain,
    ! [X2,X3,X0,X1] : ~ is_a_theorem(implies(implies(implies(implies(X0,X1),implies(X2,X1)),X3),implies(implies(X2,X0),X3))),
    inference(resolution,[],[f22,f7]) ).

fof(f25,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X0,X2))),
    inference(resolution,[],[f22,f9]) ).

fof(f26,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),implies(not(X2),X1)))
      | is_a_theorem(X2) ),
    inference(resolution,[],[f22,f12]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | ~ is_a_theorem(implies(implies(not(X0),X0),X1)) ),
    inference(resolution,[],[f23,f6]) ).

fof(f30,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X1),X2))
      | ~ is_a_theorem(implies(X0,X2)) ),
    inference(resolution,[],[f25,f6]) ).

fof(f33,plain,
    ! [X0] : ~ is_a_theorem(implies(implies(not(implies(not(X0),X0)),implies(not(X0),X0)),X0)),
    inference(resolution,[],[f28,f8]) ).

fof(f48,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(not(X1),X2)))
      | is_a_theorem(X1) ),
    inference(resolution,[],[f30,f26]) ).

fof(f56,plain,
    ! [X2,X3,X0,X1] :
      ( ~ is_a_theorem(implies(implies(implies(not(X0),X1),X2),implies(X3,X2)))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f48,f22]) ).

fof(f62,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(implies(X0,X1),implies(X2,X1)),X3))
      | ~ is_a_theorem(implies(implies(X2,X0),X3)) ),
    inference(resolution,[],[f24,f6]) ).

fof(f153,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X1),X2))
      | is_a_theorem(X0)
      | ~ is_a_theorem(implies(X3,X2)) ),
    inference(resolution,[],[f56,f6]) ).

fof(f168,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(implies(X1,X0))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f153,f8]) ).

fof(f190,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(implies(X0,X1),implies(X2,X1)))
      | is_a_theorem(X0) ),
    inference(resolution,[],[f168,f22]) ).

fof(f203,plain,
    ! [X2,X0,X1] :
      ( is_a_theorem(implies(X0,X1))
      | is_a_theorem(X0)
      | ~ is_a_theorem(implies(X2,X1)) ),
    inference(resolution,[],[f190,f6]) ).

fof(f211,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(implies(implies(not(X0),X1),X2))
      | ~ is_a_theorem(implies(X3,implies(X0,X2))) ),
    inference(resolution,[],[f203,f25]) ).

fof(f732,plain,
    ! [X0,X1] : ~ is_a_theorem(implies(X0,implies(implies(not(X1),X1),X1))),
    inference(resolution,[],[f211,f33]) ).

fof(f826,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(implies(implies(not(X0),X0),X0),X1),implies(X2,X1))),
    inference(resolution,[],[f732,f22]) ).

fof(f1988,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(X0,implies(not(X1),X1)),implies(X2,implies(X0,X1)))),
    inference(resolution,[],[f826,f62]) ).

fof(f2357,plain,
    ! [X2,X0,X1] : ~ is_a_theorem(implies(implies(not(X0),X1),implies(X2,implies(implies(X1,X0),X0)))),
    inference(resolution,[],[f1988,f62]) ).

fof(f2824,plain,
    $false,
    inference(resolution,[],[f2357,f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL364-1 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.40  % Computer : n009.cluster.edu
% 0.13/0.40  % Model    : x86_64 x86_64
% 0.13/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.40  % Memory   : 8046.5625MB
% 0.13/0.40  % OS       : Linux 6.8.0-71-generic
% 0.13/0.40  % CPULimit : 300
% 0.13/0.40  % WCLimit  : 300
% 0.13/0.40  % DateTime : Sun Sep 27 15:36:15 UTC 2026
% 0.13/0.40  % CPUTime  : 
% 0.13/0.40  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.13/0.43  Running first-order model finding
% 0.13/0.43  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.20/0.57  % (2186091)Will run a generic schedule for satisfiability detection.
% 0.20/0.57  % (2186098)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2352243156:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.57  % (2186097)% WARNING: option uhcvi not known.
% 0.20/0.57  % (2186099)dis+10_1_sil=32000:sp=arity:random_seed=122330745:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.57  % (2186096)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3285071267_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.57  % (2186097)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3473891851:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.57  % (2186101)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3733496082:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.57  % (2186100)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3811625981:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.57  % TRYING [1]
% 0.20/0.57  % TRYING [2]
% 0.20/0.57  % TRYING [3]
% 0.20/0.57  % TRYING [4]
% 0.20/0.57  % (2186102)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3429128377:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.57  % (2186099)Instruction limit reached! 
% 0.20/0.57  % (2186099)------------------------------
% 0.20/0.57  % (2186099)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.57  % (2186099)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.57  % (2186099)CaDiCaL version: 2.1.3
% 0.20/0.57  % (2186099)Termination reason: Instruction limit
% 0.20/0.57  % (2186099)Termination phase: Saturation
% 0.20/0.57  % (2186099)Time elapsed: 0.066 s
% 0.20/0.57  % (2186099)Peak memory usage: 11 MB
% 0.20/0.57  % (2186099)Instructions burned: 104 (million)
% 0.20/0.57  % (2186100)Instruction limit reached! 
% 0.20/0.57  % (2186100)------------------------------
% 0.20/0.57  % (2186100)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.57  % (2186100)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.57  % (2186100)CaDiCaL version: 2.1.3
% 0.20/0.57  % (2186100)Termination reason: Instruction limit
% 0.20/0.57  % (2186100)Termination phase: Saturation
% 0.20/0.57  % (2186100)Time elapsed: 0.072 s
% 0.20/0.57  % (2186100)Peak memory usage: 11 MB
% 0.20/0.57  % (2186100)Instructions burned: 117 (million)
% 0.20/0.57  % (2186101)Instruction limit reached! 
% 0.20/0.57  % (2186101)------------------------------
% 0.20/0.57  % (2186101)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.57  % (2186101)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.57  % (2186101)CaDiCaL version: 2.1.3
% 0.20/0.57  % (2186101)Termination reason: Instruction limit
% 0.20/0.57  % (2186101)Termination phase: Saturation
% 0.20/0.57  % (2186101)Time elapsed: 0.091 s
% 0.20/0.57  % (2186101)Peak memory usage: 13 MB
% 0.20/0.57  % (2186101)Instructions burned: 131 (million)
% 0.20/0.57  % (2186102) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2186091-2186102"...
% 0.20/0.57  % (2186102)...printing done.
% 0.20/0.57  % (2186102)Refutation found. Thanks to Tanya!
% 0.20/0.57  % SZS status Unsatisfiable for theBenchmark
% 0.20/0.57  % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.57  % (2186102)------------------------------
% 0.20/0.57  % (2186102)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.57  % (2186102)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.57  % (2186102)CaDiCaL version: 2.1.3
% 0.20/0.57  % (2186102)Termination reason: Refutation
% 0.20/0.57  % (2186102)Time elapsed: 0.082 s
% 0.20/0.57  % (2186102)Peak memory usage: 12 MB
% 0.20/0.57  % (2186102)Instructions burned: 89 (million)
% 0.20/0.57  % (2186091)Success in time 0.13 s
% 0.20/0.57  % Vampire exiting
%------------------------------------------------------------------------------