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

% Computer : n017.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:58:03 AM UTC 2026

% Result   : Unsatisfiable 4.58s 1.18s
% Output   : Refutation 4.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   53 (  36 unt;   8 def)
%            Number of atoms       :   78 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   55 (  30   ~;  24   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   35 (   0 sgn  35   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_2) ).

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_3) ).

fof(f3,axiom,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_4) ).

fof(f4,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_5) ).

fof(f6,axiom,
    ! [X0] :
      ( ~ axiom(X0)
      | theorem(X0) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_1) ).

fof(f7,axiom,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_2) ).

fof(f8,axiom,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(X2),X1))
      | ~ axiom(or(not(X0),X2))
      | theorem(or(not(X0),X1)) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',rule_3) ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(not(or(p,q)),q)),or(not(p),q))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).

fof(f10,definition,
    sF0 = or(p,q),
    introduced(definition,[new_symbols(definition,[sF0])],[function_definition]) ).

fof(f11,plain,
    or(p,q) = sF0,
    inference(reorient_equations,[],[f10]) ).

fof(f12,definition,
    sF1 = not(sF0),
    introduced(definition,[new_symbols(definition,[sF1])],[function_definition]) ).

fof(f13,plain,
    not(sF0) = sF1,
    inference(reorient_equations,[],[f12]) ).

fof(f14,definition,
    sF2 = or(sF1,q),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

fof(f15,plain,
    or(sF1,q) = sF2,
    inference(reorient_equations,[],[f14]) ).

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

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

fof(f18,definition,
    sF4 = not(p),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f19,plain,
    not(p) = sF4,
    inference(reorient_equations,[],[f18]) ).

fof(f20,definition,
    sF5 = or(sF4,q),
    introduced(definition,[new_symbols(definition,[sF5])],[function_definition]) ).

fof(f21,plain,
    or(sF4,q) = sF5,
    inference(reorient_equations,[],[f20]) ).

fof(f22,definition,
    sF6 = or(sF3,sF5),
    introduced(definition,[new_symbols(definition,[sF6])],[function_definition]) ).

fof(f23,plain,
    or(sF3,sF5) = sF6,
    inference(reorient_equations,[],[f22]) ).

fof(f24,plain,
    ~ theorem(sF6),
    inference(definition_folding,[],[f9,f23,f21,f19,f17,f15,f13,f11]) ).

fof(f28,plain,
    ! [X0] : axiom(or(sF3,or(X0,sF2))),
    inference(superposition,[],[f2,f17]) ).

fof(f29,plain,
    ! [X0] : axiom(or(sF4,or(X0,p))),
    inference(superposition,[],[f2,f19]) ).

fof(f39,plain,
    axiom(or(not(or(q,p)),sF0)),
    inference(superposition,[],[f3,f11]) ).

fof(f46,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f7,f1]) ).

fof(f82,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(X1,or(X0,X2)))
      | theorem(or(X0,or(X1,X2))) ),
    inference(resolution,[],[f4,f7]) ).

fof(f85,plain,
    ! [X0] : axiom(or(not(or(X0,sF2)),or(sF1,or(X0,q)))),
    inference(superposition,[],[f4,f15]) ).

fof(f90,plain,
    ! [X0] : axiom(or(not(or(sF4,or(X0,q))),or(X0,sF5))),
    inference(superposition,[],[f4,f21]) ).

fof(f107,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),sF0))
      | ~ theorem(or(sF1,X0))
      | theorem(or(not(X1),X0)) ),
    inference(superposition,[],[f8,f13]) ).

fof(f119,plain,
    ! [X0] : theorem(or(sF3,or(X0,sF2))),
    inference(resolution,[],[f28,f6]) ).

fof(f194,plain,
    ! [X0] :
      ( theorem(or(sF1,or(X0,q)))
      | ~ theorem(or(X0,sF2)) ),
    inference(resolution,[],[f85,f7]) ).

fof(f238,plain,
    axiom(or(not(or(sF4,or(sF3,q))),sF6)),
    inference(superposition,[],[f90,f23]) ).

fof(f251,plain,
    ! [X0] : theorem(or(X0,or(sF3,sF2))),
    inference(resolution,[],[f82,f119]) ).

fof(f312,plain,
    theorem(or(sF3,sF2)),
    inference(resolution,[],[f251,f46]) ).

fof(f383,plain,
    ! [X0] :
      ( theorem(or(not(or(q,p)),X0))
      | ~ theorem(or(sF1,X0)) ),
    inference(resolution,[],[f107,f39]) ).

fof(f389,definition,
    ( spl7_8
  <=> ! [X0] :
        ( ~ theorem(or(sF1,X0))
        | theorem(or(sF4,X0)) ) ),
    introduced(definition,[new_symbols(definition,[spl7_8])],[avatar_definition]) ).

fof(f390,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF1,X0))
        | theorem(or(sF4,X0)) )
    | ~ spl7_8 ),
    inference(avatar_component_clause,[],[f389]) ).

fof(f587,plain,
    ( theorem(sF6)
    | ~ theorem(or(sF4,or(sF3,q))) ),
    inference(resolution,[],[f238,f7]) ).

fof(f589,plain,
    ~ theorem(or(sF4,or(sF3,q))),
    inference(forward_subsumption_resolution,[],[f587,f24]) ).

fof(f917,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),or(q,p)))
      | ~ theorem(or(sF1,X0))
      | theorem(or(not(X1),X0)) ),
    inference(resolution,[],[f383,f8]) ).

fof(f7350,plain,
    ! [X0] :
      ( ~ axiom(or(sF4,or(q,p)))
      | ~ theorem(or(sF1,X0))
      | theorem(or(sF4,X0)) ),
    inference(superposition,[],[f917,f19]) ).

fof(f7351,plain,
    ! [X0] :
      ( ~ theorem(or(sF1,X0))
      | theorem(or(sF4,X0)) ),
    inference(forward_subsumption_resolution,[],[f7350,f29]) ).

fof(f7354,plain,
    spl7_8,
    inference(avatar_split_clause,[],[f7351,f389]) ).

fof(f7359,plain,
    ( ! [X0] :
        ( theorem(or(sF4,or(X0,q)))
        | ~ theorem(or(X0,sF2)) )
    | ~ spl7_8 ),
    inference(resolution,[],[f390,f194]) ).

fof(f7571,plain,
    ( ~ theorem(or(sF3,sF2))
    | ~ spl7_8 ),
    inference(resolution,[],[f7359,f589]) ).

fof(f7582,plain,
    ( $false
    | ~ spl7_8 ),
    inference(forward_subsumption_resolution,[],[f7571,f312]) ).

fof(f7583,plain,
    ~ spl7_8,
    inference(avatar_contradiction_clause,[],[f7582]) ).

cnf(s113,plain,
    spl7_8,
    inference(sat_conversion,[],[f7354]) ).

cnf(s129,plain,
    ~ spl7_8,
    inference(sat_conversion,[],[f7583]) ).

cnf(s130,plain,
    $false,
    inference(rat,[],[s113,s129]) ).

fof(f7584,plain,
    $false,
    inference(avatar_sat_refutation,[],[s130]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL218-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.10  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.22/0.47  % Computer : n017.cluster.edu
% 0.22/0.47  % Model    : x86_64 x86_64
% 0.22/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.47  % Memory   : 8046.5625MB
% 0.22/0.47  % OS       : Linux 6.8.0-71-generic
% 0.22/0.47  % CPULimit : 300
% 0.22/0.47  % WCLimit  : 300
% 0.22/0.47  % DateTime : Sun Sep 27 15:22:50 UTC 2026
% 0.22/0.47  % CPUTime  : 
% 0.22/0.47  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.27/0.53  Running first-order model finding
% 0.27/0.53  Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.58/1.18  % (2729903)Will run a generic schedule for satisfiability detection.
% 4.58/1.18  % (2729911)dis+10_1_sil=32000:sp=arity:random_seed=2987151533:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 4.58/1.18  % (2729909)% WARNING: option uhcvi not known.
% 4.58/1.18  % (2729909)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=651247704:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 4.58/1.18  % (2729912)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=364134967:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 4.58/1.18  % (2729908)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2728921838_2999 on theBenchmark for (2999ds/0Mi)
% 4.58/1.18  % (2729910)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2313606884:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 4.58/1.18  % (2729914)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2203050377:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 4.58/1.18  % (2729913)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1873305048:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 4.58/1.18  % TRYING [1]
% 4.58/1.18  % TRYING [2]
% 4.58/1.18  % TRYING [3]
% 4.58/1.18  % (2729911)Instruction limit reached! 
% 4.58/1.18  % (2729911)------------------------------
% 4.58/1.18  % (2729911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729911)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729911)Termination reason: Instruction limit
% 4.58/1.18  % (2729911)Termination phase: Saturation
% 4.58/1.18  % (2729911)Time elapsed: 0.051 s
% 4.58/1.18  % (2729911)Peak memory usage: 11 MB
% 4.58/1.18  % (2729911)Instructions burned: 104 (million)
% 4.58/1.18  % TRYING [4]
% 4.58/1.18  % (2729922)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=76563436:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 4.58/1.18  % TRYING [1]
% 4.58/1.18  % TRYING [2]
% 4.58/1.18  % TRYING [3]
% 4.58/1.18  % (2729912)Instruction limit reached! 
% 4.58/1.18  % (2729912)------------------------------
% 4.58/1.18  % (2729912)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729912)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729912)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729912)Termination reason: Instruction limit
% 4.58/1.18  % (2729912)Termination phase: Saturation
% 4.58/1.18  % (2729912)Time elapsed: 0.094 s
% 4.58/1.18  % (2729912)Peak memory usage: 11 MB
% 4.58/1.18  % (2729912)Instructions burned: 117 (million)
% 4.58/1.18  % TRYING [4]
% 4.58/1.18  % (2729924)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2795007931:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 4.58/1.18  % (2729913)Instruction limit reached! 
% 4.58/1.18  % (2729913)------------------------------
% 4.58/1.18  % (2729913)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729913)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729913)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729913)Termination reason: Instruction limit
% 4.58/1.18  % (2729913)Termination phase: Saturation
% 4.58/1.18  % (2729913)Time elapsed: 0.145 s
% 4.58/1.18  % (2729913)Peak memory usage: 12 MB
% 4.58/1.18  % (2729913)Instructions burned: 131 (million)
% 4.58/1.18  % (2729914)Instruction limit reached! 
% 4.58/1.18  % (2729914)------------------------------
% 4.58/1.18  % (2729914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729914)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729914)Termination reason: Instruction limit
% 4.58/1.18  % (2729914)Termination phase: Saturation
% 4.58/1.18  % (2729914)Time elapsed: 0.156 s
% 4.58/1.18  % (2729914)Peak memory usage: 12 MB
% 4.58/1.18  % (2729914)Instructions burned: 159 (million)
% 4.58/1.18  % (2729926)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=2292234087:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 4.58/1.18  % (2729927)ott-21_1_sil=16000:fs=off:random_seed=2757573862:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 4.58/1.18  % (2729924)Instruction limit reached! 
% 4.58/1.18  % (2729924)------------------------------
% 4.58/1.18  % (2729924)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729924)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729924)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729924)Termination reason: Instruction limit
% 4.58/1.18  % (2729924)Termination phase: Saturation
% 4.58/1.18  % (2729924)Time elapsed: 0.149 s
% 4.58/1.18  % (2729924)Peak memory usage: 12 MB
% 4.58/1.18  % (2729924)Instructions burned: 131 (million)
% 4.58/1.18  % (2729930)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1691888128:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 4.58/1.18  % (2729927)Instruction limit reached! 
% 4.58/1.18  % (2729927)------------------------------
% 4.58/1.18  % (2729927)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729927)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729927)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729927)Termination reason: Instruction limit
% 4.58/1.18  % (2729927)Termination phase: Saturation
% 4.58/1.18  % (2729927)Time elapsed: 0.159 s
% 4.58/1.18  % (2729927)Peak memory usage: 12 MB
% 4.58/1.18  % (2729927)Instructions burned: 180 (million)
% 4.58/1.18  % TRYING [5]
% 4.58/1.18  % (2729922)Instruction limit reached! 
% 4.58/1.18  % (2729922)------------------------------
% 4.58/1.18  % (2729922)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729922)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729922)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729922)Termination reason: Instruction limit
% 4.58/1.18  % (2729922)Termination phase: Finite model building constraint generation
% 4.58/1.18  % (2729922)Time elapsed: 0.319 s
% 4.58/1.18  % (2729922)Peak memory usage: 13 MB
% 4.58/1.18  % (2729922)Instructions burned: 716 (million)
% 4.58/1.18  % (2729932)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=1835102164:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 4.58/1.18  % TRYING [1]
% 4.58/1.18  % TRYING [2]
% 4.58/1.18  % TRYING [3]
% 4.58/1.18  % (2729933)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=2690549853:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 4.58/1.18  % TRYING [4]
% 4.58/1.18  % (2729933) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2729903-2729933"...
% 4.58/1.18  % (2729933)...printing done.
% 4.58/1.18  % (2729933)Refutation found. Thanks to Tanya!
% 4.58/1.18  % SZS status Unsatisfiable for theBenchmark
% 4.58/1.18  % SZS output start Proof for theBenchmark
% See solution above
% 4.58/1.18  % (2729933)------------------------------
% 4.58/1.18  % (2729933)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 4.58/1.18  % (2729933)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 4.58/1.18  % (2729933)CaDiCaL version: 2.1.3
% 4.58/1.18  % (2729933)Termination reason: Refutation
% 4.58/1.18  % (2729933)Time elapsed: 0.165 s
% 4.58/1.18  % (2729933)Peak memory usage: 16 MB
% 4.58/1.18  % (2729933)Instructions burned: 285 (million)
% 4.58/1.18  % (2729903)Success in time 0.637 s
% 4.58/1.18  % Vampire exiting
%------------------------------------------------------------------------------