↑ 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  : LCL108-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 : n016.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:39 AM UTC 2026

% Result   : Unsatisfiable 0.24s 0.59s
% Output   : Refutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   28 (  18 unt;   0 def)
%            Number of atoms       :   39 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   23 (  12   ~;  11   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   7 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :  135 ( 135   !;   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,X6,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,X1),X2),equivalent(equivalent(X3,X4),equivalent(equivalent(equivalent(X5,X4),equivalent(X5,X3)),X6))),equivalent(X2,equivalent(equivalent(X1,X0),X6)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_27_1690) ).

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

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

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

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

fof(f8,plain,
    ! [X2,X3,X0,X1,X8,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(equivalent(X8,X5),equivalent(X8,X6)),X7))),
    inference(resolution,[],[f6,f4]) ).

fof(f9,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(equivalent(equivalent(X3,equivalent(equivalent(X4,X5),equivalent(X4,X6))),equivalent(X3,equivalent(X5,X6))),X7)))
      | is_a_theorem(equivalent(equivalent(X1,X2),X7)) ),
    inference(resolution,[],[f6,f1]) ).

fof(f10,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)),equivalent(equivalent(X5,X6),X7))),
    inference(resolution,[],[f9,f2]) ).

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

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

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

fof(f22,plain,
    ! [X2,X3,X0,X1,X6,X7,X4,X5] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(X1,X2),equivalent(X1,X3))),equivalent(X0,equivalent(X2,X3))),equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X6)),X7)))
      | is_a_theorem(equivalent(equivalent(X5,X6),X7)) ),
    inference(resolution,[],[f10,f1]) ).

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

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

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

fof(f51,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2))),
    inference(resolution,[],[f14,f25]) ).

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

fof(f76,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X0),X1),X1)),
    inference(resolution,[],[f61,f24]) ).

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

fof(f90,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
    inference(resolution,[],[f22,f25]) ).

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

fof(f149,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,equivalent(equivalent(X1,X1),X2)),equivalent(X0,X2))),
    inference(resolution,[],[f141,f76]) ).

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

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

fof(f558,plain,
    ! [X2,X3,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),X3)),equivalent(equivalent(X2,X1),X3))),
    inference(resolution,[],[f199,f48]) ).

fof(f965,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(equivalent(X0,X1),equivalent(equivalent(X1,X0),X2)),X2)),
    inference(resolution,[],[f558,f191]) ).

fof(f974,plain,
    $false,
    inference(resolution,[],[f965,f3]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL108-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.19/0.46  % Computer : n016.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Sun Sep 27 15:26:32 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.24/0.51  Running first-order model finding
% 0.24/0.51  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.24/0.59  % (2776829)Will run a generic schedule for satisfiability detection.
% 0.24/0.59  % (2776839)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2533530493:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.24/0.59  % (2776834)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3277114261_2999 on theBenchmark for (2999ds/0Mi)
% 0.24/0.59  % (2776838)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2902891567:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.24/0.59  % (2776837)dis+10_1_sil=32000:sp=arity:random_seed=2563517660:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.24/0.59  % (2776836)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4073407887:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.24/0.59  % (2776840)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=533543213:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.24/0.59  % TRYING [1]
% 0.24/0.59  % TRYING [2]
% 0.24/0.59  % TRYING [3]
% 0.24/0.59  % (2776835)% WARNING: option uhcvi not known.
% 0.24/0.59  % (2776839) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2776829-2776839"...
% 0.24/0.59  % (2776839)...printing done.
% 0.24/0.59  % (2776839)Refutation found. Thanks to Tanya!
% 0.24/0.59  % SZS status Unsatisfiable for theBenchmark
% 0.24/0.59  % SZS output start Proof for theBenchmark
% See solution above
% 0.24/0.59  % (2776839)------------------------------
% 0.24/0.59  % (2776839)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.24/0.59  % (2776839)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.24/0.59  % (2776839)CaDiCaL version: 2.1.3
% 0.24/0.59  % (2776839)Termination reason: Refutation
% 0.24/0.59  % (2776839)Time elapsed: 0.025 s
% 0.24/0.59  % (2776839)Peak memory usage: 11 MB
% 0.24/0.59  % (2776839)Instructions burned: 49 (million)
% 0.24/0.59  % (2776829)Success in time 0.059 s
% 0.24/0.59  % Vampire exiting
%------------------------------------------------------------------------------