↑ Up

Vampire---5.0.1.UNS-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire---5.0.1
% Problem  : LCL103-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 : n002.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:12 AM UTC 2026

% Result   : Unsatisfiable 3.01s 1.43s
% Output   : Refutation 3.01s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   25 (  11 unt;   0 def)
%            Number of atoms       :   42 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   44 (  27   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   5 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   64 (  64   !;   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(X0,X1),X2),equivalent(equivalent(X3,X1),equivalent(equivalent(X0,X3),X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p_1) ).

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

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

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

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

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

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

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

fof(f11,plain,
    ! [X2,X0,X1] : is_a_theorem(equivalent(equivalent(X0,X1),equivalent(equivalent(X2,X0),equivalent(X2,X1)))),
    inference(resolution,[],[f8,f5]) ).

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

fof(f17,plain,
    ~ is_a_theorem(equivalent(e,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(a,b),equivalent(a,c))),e))),
    inference(resolution,[],[f10,f4]) ).

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

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

fof(f28,plain,
    ! [X2,X3,X0,X1] :
      ( is_a_theorem(equivalent(equivalent(X2,X0),equivalent(equivalent(X3,X2),equivalent(X3,X1))))
      | ~ is_a_theorem(equivalent(X0,X1)) ),
    inference(resolution,[],[f16,f6]) ).

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

fof(f56,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(equivalent(X2,equivalent(equivalent(X1,X0),equivalent(e,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(a,b),equivalent(a,c))),e)))))
      | ~ is_a_theorem(equivalent(equivalent(X0,X1),X2)) ),
    inference(resolution,[],[f20,f17]) ).

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

fof(f205,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X0),e),equivalent(equivalent(equivalent(b,c),equivalent(equivalent(a,b),equivalent(a,c))),e))),
    inference(resolution,[],[f176,f2]) ).

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

fof(f396,plain,
    ! [X0] : ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X0),e),equivalent(equivalent(equivalent(a,b),equivalent(a,c)),equivalent(equivalent(c,b),e)))),
    inference(resolution,[],[f218,f7]) ).

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

fof(f1336,plain,
    ! [X0,X1] :
      ( ~ is_a_theorem(equivalent(equivalent(equivalent(X0,X0),e),equivalent(equivalent(a,c),X1)))
      | ~ is_a_theorem(equivalent(X1,equivalent(equivalent(b,a),equivalent(equivalent(c,b),e)))) ),
    inference(resolution,[],[f418,f19]) ).

fof(f1678,plain,
    ~ is_a_theorem(equivalent(equivalent(equivalent(c,a),e),equivalent(equivalent(b,a),equivalent(equivalent(c,b),e)))),
    inference(resolution,[],[f1336,f2]) ).

fof(f1684,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f1678,f2]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL103-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.11/0.38  % Computer : n002.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Sun Sep 27 15:24:07 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/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
% 3.01/1.43  % (3664149)Input is clausal, will run a generic CNF schedule.
% 3.01/1.43  % (3664169)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=4229311881:i=132376:av=off_3000 on theBenchmark for (3000ds/132376Mi)
% 3.01/1.43  % (3664170)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=3186512218:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_3000 on theBenchmark for (3000ds/137899Mi)
% 3.01/1.43  % (3664172)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=4065236591:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_3000 on theBenchmark for (3000ds/114Mi)
% 3.01/1.43  % (3664174)dis-21_1_sil=8000:lcm=predicate:random_seed=788274365:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_3000 on theBenchmark for (3000ds/117Mi)
% 3.01/1.43  % (3664171)lrs+10_1_sil=8000:sp=occurrence:random_seed=1360731910:i=107:sd=3:ss=axioms:sgt=8_3000 on theBenchmark for (3000ds/107Mi)
% 3.01/1.43  % (3664168)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=2826047521:i=140167_3000 on theBenchmark for (3000ds/140167Mi)
% 3.01/1.43  % (3664173)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3734906605:s2a=on:i=180:gtg=position_3000 on theBenchmark for (3000ds/180Mi)
% 3.01/1.43  % (3664173)First to succeed.
% 3.01/1.43  % (3664173)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3664149"
% 3.01/1.43  % (3664174)Instruction limit reached! 
% 3.01/1.43  % (3664174)------------------------------
% 3.01/1.43  % (3664174)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.43  % (3664174)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.43  % (3664174)CaDiCaL version: 2.1.3
% 3.01/1.43  % (3664174)Termination reason: Instruction limit
% 3.01/1.43  % (3664174)Termination phase: Saturation
% 3.01/1.43  % (3664174)Time elapsed: 0.064 s
% 3.01/1.43  % (3664174)Peak memory usage: 88 MB
% 3.01/1.43  % (3664174)Instructions burned: 118 (million)
% 3.01/1.43  % (3664172)Instruction limit reached! 
% 3.01/1.43  % (3664172)------------------------------
% 3.01/1.43  % (3664172)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.43  % (3664172)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.43  % (3664172)CaDiCaL version: 2.1.3
% 3.01/1.43  % (3664172)Termination reason: Instruction limit
% 3.01/1.43  % (3664172)Termination phase: Saturation
% 3.01/1.43  % (3664172)Time elapsed: 0.065 s
% 3.01/1.43  % (3664172)Peak memory usage: 88 MB
% 3.01/1.43  % (3664172)Instructions burned: 114 (million)
% 3.01/1.43  % (3664171)Instruction limit reached! 
% 3.01/1.43  % (3664171)------------------------------
% 3.01/1.43  % (3664171)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.43  % (3664171)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.43  % (3664171)CaDiCaL version: 2.1.3
% 3.01/1.43  % (3664171)Termination reason: Instruction limit
% 3.01/1.43  % (3664171)Termination phase: Saturation
% 3.01/1.43  % (3664171)Time elapsed: 0.070 s
% 3.01/1.43  % (3664171)Peak memory usage: 88 MB
% 3.01/1.43  % (3664171)Instructions burned: 108 (million)
% 3.01/1.43  % (3664173)Refutation found. Thanks to Tanya!
% 3.01/1.43  % SZS status Unsatisfiable for theBenchmark
% 3.01/1.43  % SZS output start Proof for theBenchmark
% See solution above
% 3.01/1.43  % (3664173)------------------------------
% 3.01/1.43  % (3664173)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.01/1.43  % (3664173)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.01/1.43  % (3664173)CaDiCaL version: 2.1.3
% 3.01/1.43  % (3664173)Termination reason: Refutation
% 3.01/1.43  % (3664173)Time elapsed: 0.034 s
% 3.01/1.43  % (3664173)Peak memory usage: 89 MB
% 3.01/1.43  % (3664173)Instructions burned: 97 (million)
% 3.01/1.43  % (3664173)------------------------------
% 3.01/1.43  % (3664173)------------------------------
% 3.01/1.43  % (3664149)Success in time 0.325 s
% 3.01/1.43  % Vampire exiting
%------------------------------------------------------------------------------