↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL097-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n014.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:51:11 AM UTC 2026

% Result   : Unsatisfiable 0.16s 1.31s
% Output   : Refutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   15 (   9 unt;   0 def)
%            Number of atoms       :   23 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  12   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 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   :   41 (  41   !;   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] : is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X0,X1),equivalent(X0,X2)),equivalent(X1,X2)),X3),X3)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).

fof(f3,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(f4,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(f6,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,[],[f3,f1]) ).

fof(f7,plain,
    ! [X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(X0,X1))),
    inference(resolution,[],[f6,f2]) ).

fof(f8,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,[],[f6,f3]) ).

fof(f10,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,[],[f7,f6]) ).

fof(f14,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,[],[f8,f1]) ).

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

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

fof(f35,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(a,b),c)),equivalent(X0,e)),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e)))),
    inference(resolution,[],[f18,f4]) ).

fof(f56,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,equivalent(equivalent(a,b),c)),X1),equivalent(equivalent(equivalent(a,falsehood),c),equivalent(equivalent(b,falsehood),e))))
      | ~ is_a_theorem(equivalent(equivalent(X0,e),X1)) ),
    inference(resolution,[],[f29,f35]) ).

fof(f78,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(equivalent(a,b),equivalent(a,falsehood)),e),equivalent(equivalent(b,falsehood),e))),
    inference(resolution,[],[f56,f10]) ).

fof(f83,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f78,f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL097-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n014.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 15:21:31 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.16/1.31  % (930639)Input is clausal, will run a generic CNF schedule.
% 0.16/1.31  % (930652)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1023895197:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 0.16/1.31  % (930651)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=2722733257:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 0.16/1.31  % (930655)lrs+10_1_sil=8000:sp=occurrence:random_seed=4202003121:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 0.16/1.31  % (930657)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=1093041823:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 0.16/1.31  % (930656)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2027125137:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 0.16/1.31  % (930658)dis-21_1_sil=8000:lcm=predicate:random_seed=2643077122:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 0.16/1.31  % (930653)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2676882895:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 0.16/1.31  % (930657)First to succeed.
% 0.16/1.31  % (930657)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-930639"
% 0.16/1.31  % (930656)Also succeeded, but the first one will report.
% 0.16/1.31  % (930655)Also succeeded, but the first one will report.
% 0.16/1.31  % (930658)Instruction limit reached! 
% 0.16/1.31  % (930658)------------------------------
% 0.16/1.31  % (930658)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.31  % (930658)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.31  % (930658)CaDiCaL version: 2.1.3
% 0.16/1.31  % (930658)Termination reason: Instruction limit
% 0.16/1.31  % (930658)Termination phase: Saturation
% 0.16/1.31  % (930658)Time elapsed: 0.074 s
% 0.16/1.31  % (930658)Peak memory usage: 88 MB
% 0.16/1.31  % (930658)Instructions burned: 119 (million)
% 0.16/1.31  % (930671)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=56277750:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 0.16/1.31  % (930671)Refutation not found, incomplete strategy
% 0.16/1.31  % (930671)------------------------------
% 0.16/1.31  % (930671)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.31  % (930671)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.31  % (930671)CaDiCaL version: 2.1.3
% 0.16/1.31  % (930671)Termination reason: Refutation not found, incomplete strategy
% 0.16/1.31  % (930671)Time elapsed: 0.001 s
% 0.16/1.31  % (930671)Peak memory usage: 87 MB
% 0.16/1.31  % (930657)Refutation found. Thanks to Tanya!
% 0.16/1.31  % SZS status Unsatisfiable for theBenchmark
% 0.16/1.31  % SZS output start Proof for theBenchmark
% See solution above
% 0.16/1.31  % (930657)------------------------------
% 0.16/1.31  % (930657)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.16/1.31  % (930657)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.16/1.31  % (930657)CaDiCaL version: 2.1.3
% 0.16/1.31  % (930657)Termination reason: Refutation
% 0.16/1.31  % (930657)Time elapsed: 0.005 s
% 0.16/1.31  % (930657)Peak memory usage: 88 MB
% 0.16/1.31  % (930657)Instructions burned: 6 (million)
% 0.16/1.31  % (930657)------------------------------
% 0.16/1.31  % (930657)------------------------------
% 0.16/1.31  % (930639)Success in time 0.482 s
% 0.16/1.31  % Vampire exiting
%------------------------------------------------------------------------------