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

% Computer : n005.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:57:38 AM UTC 2026

% Result   : Unsatisfiable 0.27s 0.61s
% Output   : Refutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   12 (   6 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   17 (   9   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   48 (  48   !;   0   ?)

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

fof(f2,axiom,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4),X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_3) ).

fof(f3,negated_conjecture,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),c),e),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_4) ).

fof(f4,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),X3),equivalent(equivalent(X1,X2),X3)),X4))
      | is_a_theorem(X4) ),
    inference(resolution,[],[f2,f1]) ).

fof(f5,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
    inference(resolution,[],[f4,f2]) ).

fof(f6,plain,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),X0),equivalent(equivalent(X3,X4),X1)))),
    inference(resolution,[],[f5,f4]) ).

fof(f7,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(resolution,[],[f5,f1]) ).

fof(f8,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(equivalent(X5,X1),equivalent(X5,X2)),X3)),X4))
      | ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),X3)),X4)) ),
    inference(resolution,[],[f7,f4]) ).

fof(f21,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(equivalent(X0,equivalent(equivalent(equivalent(X5,X1),equivalent(X5,X2)),X3)))
      | ~ is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),X3)),X4))
      | is_a_theorem(X4) ),
    inference(resolution,[],[f8,f1]) ).

fof(f153,plain,
    ! [X2,X3,X0,X1,X4,X5] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3))),X5))
      | is_a_theorem(X5) ),
    inference(resolution,[],[f21,f6]) ).

fof(f1285,plain,
    ! [X2,X3,X0,X1,X4] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),X3),equivalent(equivalent(equivalent(X0,X4),X2),equivalent(equivalent(X1,X4),X3)))),
    inference(resolution,[],[f153,f2]) ).

fof(f1324,plain,
    $false,
    inference(resolution,[],[f1285,f3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : LCL098-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.20/0.47  % Computer : n005.cluster.edu
% 0.20/0.47  % Model    : x86_64 x86_64
% 0.20/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.47  % Memory   : 8046.5625MB
% 0.20/0.47  % OS       : Linux 6.8.0-71-generic
% 0.20/0.47  % CPULimit : 300
% 0.20/0.47  % WCLimit  : 300
% 0.20/0.47  % DateTime : Sun Sep 27 15:21:32 UTC 2026
% 0.20/0.47  % CPUTime  : 
% 0.20/0.47  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.52  Running first-order model finding
% 0.24/0.52  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.27/0.61  % (4126730)Will run a generic schedule for satisfiability detection.
% 0.27/0.61  % (4126738)dis+10_1_sil=32000:sp=arity:random_seed=2251981184:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.27/0.61  % (4126736)% WARNING: option uhcvi not known.
% 0.27/0.61  % (4126741)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1407457535:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.27/0.61  % (4126735)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2129761887_2999 on theBenchmark for (2999ds/0Mi)
% 0.27/0.61  % (4126736)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4021565667:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.27/0.61  % (4126739)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=64659227:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.27/0.61  % (4126737)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1733456099:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.27/0.61  % (4126740)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2720501648:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.27/0.61  % TRYING [1]
% 0.27/0.61  % TRYING [2]
% 0.27/0.61  % TRYING [3]
% 0.27/0.61  % (4126738) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-4126730-4126738"...
% 0.27/0.61  % (4126738)...printing done.
% 0.27/0.61  % (4126738)Refutation found. Thanks to Tanya!
% 0.27/0.61  % SZS status Unsatisfiable for theBenchmark
% 0.27/0.61  % SZS output start Proof for theBenchmark
% See solution above
% 0.27/0.61  % (4126738)------------------------------
% 0.27/0.61  % (4126738)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.27/0.61  % (4126738)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.27/0.61  % (4126738)CaDiCaL version: 2.1.3
% 0.27/0.61  % (4126738)Termination reason: Refutation
% 0.27/0.61  % (4126738)Time elapsed: 0.035 s
% 0.27/0.61  % (4126738)Peak memory usage: 11 MB
% 0.27/0.61  % (4126738)Instructions burned: 67 (million)
% 0.27/0.61  % (4126730)Success in time 0.075 s
% 0.27/0.61  % Vampire exiting
%------------------------------------------------------------------------------