↑ 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  : LCL042-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 : n019.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:29 AM UTC 2026

% Result   : Unsatisfiable 2.70s 0.80s
% Output   : Refutation 2.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   50 (  37 unt;   6 def)
%            Number of atoms       :   65 (  12 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   35 (  20   ~;  15   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   39 (  39   !;   0   ?)

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

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

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

fof(f4,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,implies(X1,X2)),implies(X1,implies(X0,X2)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_21) ).

fof(f5,axiom,
    ! [X2,X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(X2,X0),implies(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_22) ).

fof(f6,axiom,
    ! [X0,X1] : is_a_theorem(implies(implies(X0,X1),implies(implies(not(X0),X1),X1))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_54) ).

fof(f7,negated_conjecture,
    ~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_35) ).

fof(f8,definition,
    sF0 = implies(b,c),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f9,plain,
    implies(b,c) = sF0,
    inference(reorient_equations,[],[f8]) ).

fof(f10,definition,
    sF1 = implies(a,sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f11,plain,
    implies(a,sF0) = sF1,
    inference(reorient_equations,[],[f10]) ).

fof(f12,definition,
    sF2 = implies(a,b),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f13,plain,
    implies(a,b) = sF2,
    inference(reorient_equations,[],[f12]) ).

fof(f14,definition,
    sF3 = implies(a,c),
    introduced(definition,[new_symbols(definition,[sF3])],[function_definition]) ).

fof(f15,plain,
    implies(a,c) = sF3,
    inference(reorient_equations,[],[f14]) ).

fof(f16,definition,
    sF4 = implies(sF2,sF3),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f17,plain,
    implies(sF2,sF3) = sF4,
    inference(reorient_equations,[],[f16]) ).

fof(f18,definition,
    sF5 = implies(sF1,sF4),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f19,plain,
    implies(sF1,sF4) = sF5,
    inference(reorient_equations,[],[f18]) ).

fof(f20,plain,
    ~ is_a_theorem(sF5),
    inference(definition_folding,[],[f7,f19,f17,f15,f13,f11,f9]) ).

fof(f27,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(X1,X0))
      | ~ is_a_theorem(X0) ),
    inference(resolution,[],[f1,f3]) ).

fof(f83,plain,
    ! [X2,X0,X1] :
      ( ~ is_a_theorem(implies(X0,implies(X1,X2)))
      | is_a_theorem(implies(X1,implies(X0,X2))) ),
    inference(resolution,[],[f4,f1]) ).

fof(f88,plain,
    ! [X0] : is_a_theorem(implies(implies(X0,sF5),implies(sF1,implies(X0,sF4)))),
    inference(superposition,[],[f4,f19]) ).

fof(f94,plain,
    ! [X0] : is_a_theorem(implies(implies(sF1,implies(X0,sF4)),implies(X0,sF5))),
    inference(superposition,[],[f4,f19]) ).

fof(f95,plain,
    ! [X0] : is_a_theorem(implies(implies(sF2,implies(X0,sF3)),implies(X0,sF4))),
    inference(superposition,[],[f4,f17]) ).

fof(f100,plain,
    ! [X0] : is_a_theorem(implies(sF0,implies(implies(X0,b),implies(X0,c)))),
    inference(superposition,[],[f5,f9]) ).

fof(f103,plain,
    ! [X0] : is_a_theorem(implies(implies(sF0,X0),implies(sF1,implies(a,X0)))),
    inference(superposition,[],[f5,f11]) ).

fof(f113,plain,
    ! [X0] : is_a_theorem(implies(implies(X0,sF4),implies(implies(sF1,X0),sF5))),
    inference(superposition,[],[f5,f19]) ).

fof(f187,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,sF5))
      | is_a_theorem(implies(sF1,implies(X0,sF4))) ),
    inference(resolution,[],[f88,f1]) ).

fof(f213,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF1,implies(X0,sF4)))
      | is_a_theorem(implies(X0,sF5)) ),
    inference(resolution,[],[f94,f1]) ).

fof(f216,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF2,implies(X0,sF3)))
      | is_a_theorem(implies(X0,sF4)) ),
    inference(resolution,[],[f95,f1]) ).

fof(f234,plain,
    is_a_theorem(implies(sF0,implies(implies(a,b),sF3))),
    inference(superposition,[],[f100,f15]) ).

fof(f236,plain,
    is_a_theorem(implies(sF0,implies(sF2,sF3))),
    inference(forward_demodulation,[],[f234,f13]) ).

fof(f238,plain,
    is_a_theorem(implies(sF0,sF4)),
    inference(forward_demodulation,[],[f236,f17]) ).

fof(f247,plain,
    ! [X0] :
      ( is_a_theorem(implies(sF1,implies(a,X0)))
      | ~ is_a_theorem(implies(sF0,X0)) ),
    inference(resolution,[],[f103,f1]) ).

fof(f341,plain,
    ! [X0] :
      ( is_a_theorem(implies(implies(sF1,X0),sF5))
      | ~ is_a_theorem(implies(X0,sF4)) ),
    inference(resolution,[],[f113,f1]) ).

fof(f353,plain,
    ! [X0,X1] : is_a_theorem(implies(not(X0),implies(X0,X1))),
    inference(resolution,[],[f83,f2]) ).

fof(f355,plain,
    ! [X0,X1] : is_a_theorem(implies(implies(not(X0),X1),implies(implies(X0,X1),X1))),
    inference(resolution,[],[f83,f6]) ).

fof(f451,plain,
    is_a_theorem(implies(not(a),sF3)),
    inference(superposition,[],[f353,f15]) ).

fof(f688,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,sF3))
      | is_a_theorem(implies(X0,sF4)) ),
    inference(resolution,[],[f216,f27]) ).

fof(f690,plain,
    ( ~ is_a_theorem(implies(sF0,sF4))
    | is_a_theorem(implies(a,sF5)) ),
    inference(resolution,[],[f247,f213]) ).

fof(f696,plain,
    is_a_theorem(implies(a,sF5)),
    inference(forward_subsumption_resolution,[],[f690,f238]) ).

fof(f720,plain,
    is_a_theorem(implies(sF1,implies(a,sF4))),
    inference(resolution,[],[f696,f187]) ).

fof(f772,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(X0,sF4))
      | ~ is_a_theorem(implies(sF1,X0))
      | is_a_theorem(sF5) ),
    inference(resolution,[],[f341,f1]) ).

fof(f774,plain,
    ! [X0] :
      ( ~ is_a_theorem(implies(sF1,X0))
      | ~ is_a_theorem(implies(X0,sF4)) ),
    inference(forward_subsumption_resolution,[],[f772,f20]) ).

fof(f778,plain,
    ~ is_a_theorem(implies(implies(a,sF4),sF4)),
    inference(resolution,[],[f774,f720]) ).

fof(f1122,plain,
    ! [X0,X1] :
      ( is_a_theorem(implies(implies(X0,X1),X1))
      | ~ is_a_theorem(implies(not(X0),X1)) ),
    inference(resolution,[],[f355,f1]) ).

fof(f1544,plain,
    is_a_theorem(implies(not(a),sF4)),
    inference(resolution,[],[f688,f451]) ).

fof(f3849,plain,
    ~ is_a_theorem(implies(not(a),sF4)),
    inference(resolution,[],[f1122,f778]) ).

fof(f3879,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f3849,f1544]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL042-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n019.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Sun Sep 27 15:18:49 UTC 2026
% 0.12/0.39  % CPUTime  : 
% 0.12/0.39  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.42  Running first-order model finding
% 0.12/0.42  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
% 1.69/0.80  % (3191066)Will run a generic schedule for satisfiability detection.
% 1.69/0.80  % (3191075)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2000201205:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.69/0.80  % (3191072)% WARNING: option uhcvi not known.
% 1.69/0.80  % (3191071)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3366526814_2999 on theBenchmark for (2999ds/0Mi)
% 1.69/0.80  % (3191072)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3788948774:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.69/0.80  % (3191073)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3149969408:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.69/0.80  % (3191076)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3462592231:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.80  % (3191074)dis+10_1_sil=32000:sp=arity:random_seed=1490443762:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.69/0.80  % (3191077)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=7914801:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.69/0.80  % TRYING [1]
% 1.69/0.80  % TRYING [2]
% 1.69/0.80  % TRYING [3]
% 1.69/0.80  % TRYING [4]
% 1.69/0.80  % (3191075)Instruction limit reached! 
% 1.69/0.80  % (3191075)------------------------------
% 1.69/0.80  % (3191075)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (3191075)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (3191075)CaDiCaL version: 2.1.3
% 1.69/0.80  % (3191075)Termination reason: Instruction limit
% 1.69/0.80  % (3191075)Termination phase: Saturation
% 1.69/0.80  % (3191075)Time elapsed: 0.038 s
% 1.69/0.80  % (3191075)Peak memory usage: 11 MB
% 1.69/0.80  % (3191075)Instructions burned: 116 (million)
% 1.69/0.80  % (3191085)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=759178871:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.69/0.80  % TRYING [1]
% 1.69/0.80  % TRYING [2]
% 1.69/0.80  % TRYING [3]
% 1.69/0.80  % TRYING [4]
% 1.69/0.80  % (3191074)Instruction limit reached! 
% 1.69/0.80  % (3191074)------------------------------
% 1.69/0.80  % (3191074)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (3191074)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (3191074)CaDiCaL version: 2.1.3
% 1.69/0.80  % (3191074)Termination reason: Instruction limit
% 1.69/0.80  % (3191074)Termination phase: Saturation
% 1.69/0.80  % (3191074)Time elapsed: 0.066 s
% 1.69/0.80  % (3191074)Peak memory usage: 12 MB
% 1.69/0.80  % (3191074)Instructions burned: 104 (million)
% 1.69/0.80  % (3191076)Instruction limit reached! 
% 1.69/0.80  % (3191076)------------------------------
% 1.69/0.80  % (3191076)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (3191076)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (3191076)CaDiCaL version: 2.1.3
% 1.69/0.80  % (3191076)Termination reason: Instruction limit
% 1.69/0.80  % (3191076)Termination phase: Saturation
% 1.69/0.80  % (3191076)Time elapsed: 0.084 s
% 1.69/0.80  % (3191076)Peak memory usage: 13 MB
% 1.69/0.80  % (3191076)Instructions burned: 131 (million)
% 1.69/0.80  % (3191087)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=919446144:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.80  % (3191077)Instruction limit reached! 
% 1.69/0.80  % (3191077)------------------------------
% 1.69/0.80  % (3191077)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (3191077)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (3191077)CaDiCaL version: 2.1.3
% 1.69/0.80  % (3191077)Termination reason: Instruction limit
% 1.69/0.80  % (3191077)Termination phase: Saturation
% 1.69/0.80  % (3191077)Time elapsed: 0.098 s
% 1.69/0.80  % (3191077)Peak memory usage: 13 MB
% 1.69/0.80  % (3191077)Instructions burned: 159 (million)
% 1.69/0.80  % (3191088)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=2896973641:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.69/0.80  % TRYING [5]
% 1.69/0.80  % (3191090)ott-21_1_sil=16000:fs=off:random_seed=628445188:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.69/0.80  % TRYING [5]
% 1.69/0.80  % (3191087)Instruction limit reached! 
% 1.69/0.80  % (3191087)------------------------------
% 1.69/0.80  % (3191087)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (3191087)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (3191087)CaDiCaL version: 2.1.3
% 1.69/0.80  % (3191087)Termination reason: Instruction limit
% 1.69/0.80  % (3191087)Termination phase: Saturation
% 1.69/0.80  % (3191087)Time elapsed: 0.081 s
% 1.69/0.80  % (3191087)Peak memory usage: 12 MB
% 1.69/0.80  % (3191087)Instructions burned: 132 (million)
% 1.69/0.80  % (3191093)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=893185814:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.69/0.80  % (3191090)Instruction limit reached! 
% 1.69/0.80  % (3191090)------------------------------
% 1.69/0.80  % (3191090)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (3191090)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (3191090)CaDiCaL version: 2.1.3
% 1.69/0.80  % (3191090)Termination reason: Instruction limit
% 1.69/0.80  % (3191090)Termination phase: Saturation
% 1.69/0.80  % (3191090)Time elapsed: 0.098 s
% 1.69/0.80  % (3191090)Peak memory usage: 13 MB
% 1.69/0.80  % (3191090)Instructions burned: 180 (million)
% 1.69/0.80  % (3191095)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1791575187:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 2.70/0.80  % TRYING [1]
% 2.70/0.80  % TRYING [2]
% 2.70/0.80  % TRYING [3]
% 2.70/0.80  % TRYING [4]
% 2.70/0.80  % (3191085)Instruction limit reached! 
% 2.70/0.80  % (3191085)------------------------------
% 2.70/0.80  % (3191085)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.80  % (3191085)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.80  % (3191085)CaDiCaL version: 2.1.3
% 2.70/0.80  % (3191085)Termination reason: Instruction limit
% 2.70/0.80  % (3191085)Termination phase: Finite model building SAT solving
% 2.70/0.80  % (3191085)Time elapsed: 0.232 s
% 2.70/0.80  % (3191085)Peak memory usage: 16 MB
% 2.70/0.80  % (3191085)Instructions burned: 716 (million)
% 2.70/0.80  % (3191097)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=811352236:i=1179_2996 on theBenchmark for (2996ds/1179Mi)
% 2.70/0.80  % TRYING [5]
% 2.70/0.80  % (3191097) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3191066-3191097"...
% 2.70/0.80  % (3191097)...printing done.
% 2.70/0.80  % (3191097)Refutation found. Thanks to Tanya!
% 2.70/0.80  % SZS status Unsatisfiable for theBenchmark
% 2.70/0.80  % SZS output start Proof for theBenchmark
% See solution above
% 2.70/0.80  % (3191097)------------------------------
% 2.70/0.80  % (3191097)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 2.70/0.80  % (3191097)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.70/0.80  % (3191097)CaDiCaL version: 2.1.3
% 2.70/0.80  % (3191097)Termination reason: Refutation
% 2.70/0.80  % (3191097)Time elapsed: 0.046 s
% 2.70/0.80  % (3191097)Peak memory usage: 13 MB
% 2.70/0.80  % (3191097)Instructions burned: 135 (million)
% 2.70/0.80  % (3191066)Success in time 0.37 s
% 2.70/0.80  % Vampire exiting
%------------------------------------------------------------------------------