↑ 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  : LCL201-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 : n004.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:58 AM UTC 2026

% Result   : Unsatisfiable 3.81s 1.12s
% Output   : Refutation 3.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   47 (  30 unt;   7 def)
%            Number of atoms       :   71 (  12 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   51 (  27   ~;  23   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    5 (   3 usr;   2 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :   38 (   0 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(not(or(p,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 = not(sF1),
    introduced(definition,[new_symbols(definition,[sF2])],[function_definition]) ).

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

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

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

fof(f18,definition,
    sF4 = or(sF3,q),
    introduced(definition,[new_symbols(definition,[sF4])],[function_definition]) ).

fof(f19,plain,
    or(sF3,q) = sF4,
    inference(reorient_equations,[],[f18]) ).

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

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

fof(f22,plain,
    ~ theorem(sF5),
    inference(definition_folding,[],[f9,f21,f19,f17,f15,f13,f11]) ).

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

fof(f32,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f3,f6]) ).

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

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

fof(f89,plain,
    ! [X0] : axiom(or(not(or(sF3,or(X0,q))),or(X0,sF4))),
    inference(superposition,[],[f4,f19]) ).

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

fof(f158,plain,
    ! [X2,X0,X1] :
      ( ~ axiom(or(not(X0),or(X1,X2)))
      | theorem(or(not(X0),or(X2,X1))) ),
    inference(resolution,[],[f32,f8]) ).

fof(f187,plain,
    ! [X0] :
      ( ~ theorem(or(sF3,or(X0,q)))
      | theorem(or(X0,sF4)) ),
    inference(resolution,[],[f89,f7]) ).

fof(f308,plain,
    ! [X0] :
      ( theorem(or(not(or(q,p)),X0))
      | ~ theorem(or(sF1,X0)) ),
    inference(resolution,[],[f103,f36]) ).

fof(f314,definition,
    ( spl6_9
  <=> ! [X0] :
        ( ~ theorem(or(sF1,X0))
        | theorem(or(sF3,X0)) ) ),
    introduced(definition,[new_symbols(definition,[spl6_9])],[avatar_definition]) ).

fof(f315,plain,
    ( ! [X0] :
        ( ~ theorem(or(sF1,X0))
        | theorem(or(sF3,X0)) )
    | ~ spl6_9 ),
    inference(avatar_component_clause,[],[f314]) ).

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

fof(f1007,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f158,f2]) ).

fof(f1061,plain,
    ! [X0] : theorem(or(sF2,or(sF1,X0))),
    inference(superposition,[],[f1007,f15]) ).

fof(f1305,plain,
    ! [X0] : theorem(or(sF1,or(sF2,X0))),
    inference(resolution,[],[f1061,f83]) ).

fof(f5256,plain,
    ! [X0] :
      ( ~ axiom(or(sF3,or(q,p)))
      | ~ theorem(or(sF1,X0))
      | theorem(or(sF3,X0)) ),
    inference(superposition,[],[f692,f17]) ).

fof(f5257,plain,
    ! [X0] :
      ( ~ theorem(or(sF1,X0))
      | theorem(or(sF3,X0)) ),
    inference(forward_subsumption_resolution,[],[f5256,f27]) ).

fof(f5260,plain,
    spl6_9,
    inference(avatar_split_clause,[],[f5257,f314]) ).

fof(f5283,plain,
    ( ! [X0] : theorem(or(sF3,or(sF2,X0)))
    | ~ spl6_9 ),
    inference(resolution,[],[f315,f1305]) ).

fof(f6020,plain,
    ( theorem(or(sF2,sF4))
    | ~ spl6_9 ),
    inference(resolution,[],[f5283,f187]) ).

fof(f6028,plain,
    ( theorem(sF5)
    | ~ spl6_9 ),
    inference(forward_demodulation,[],[f6020,f21]) ).

fof(f6029,plain,
    ( $false
    | ~ spl6_9 ),
    inference(forward_subsumption_resolution,[],[f6028,f22]) ).

fof(f6030,plain,
    ~ spl6_9,
    inference(avatar_contradiction_clause,[],[f6029]) ).

cnf(s99,plain,
    spl6_9,
    inference(sat_conversion,[],[f5260]) ).

cnf(s111,plain,
    ~ spl6_9,
    inference(sat_conversion,[],[f6030]) ).

cnf(s112,plain,
    $false,
    inference(rat,[],[s99,s111]) ).

fof(f6031,plain,
    $false,
    inference(avatar_sat_refutation,[],[s112]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL201-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.48  % Computer : n004.cluster.edu
% 0.22/0.48  % Model    : x86_64 x86_64
% 0.22/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.22/0.48  % Memory   : 8046.5625MB
% 0.22/0.48  % OS       : Linux 6.8.0-71-generic
% 0.22/0.48  % CPULimit : 300
% 0.22/0.49  % WCLimit  : 300
% 0.22/0.49  % DateTime : Sun Sep 27 15:26:22 UTC 2026
% 0.22/0.49  % CPUTime  : 
% 0.22/0.49  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.28/0.54  Running first-order model finding
% 0.28/0.54  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
% 3.81/1.12  % (3666890)Will run a generic schedule for satisfiability detection.
% 3.81/1.12  % (3666899)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=512225250:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.81/1.12  % (3666896)% WARNING: option uhcvi not known.
% 3.81/1.12  % (3666898)dis+10_1_sil=32000:sp=arity:random_seed=2704256617:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.81/1.12  % (3666897)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3798067008:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.81/1.12  % (3666895)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1922583313_2999 on theBenchmark for (2999ds/0Mi)
% 3.81/1.12  % (3666896)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2758024090:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.81/1.12  % (3666901)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4055054675:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.81/1.12  % (3666900)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1290005143:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.81/1.12  % TRYING [1]
% 3.81/1.12  % TRYING [2]
% 3.81/1.12  % TRYING [3]
% 3.81/1.12  % (3666899)Instruction limit reached! 
% 3.81/1.12  % (3666899)------------------------------
% 3.81/1.12  % (3666899)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666899)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666899)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666899)Termination reason: Instruction limit
% 3.81/1.12  % (3666899)Termination phase: Saturation
% 3.81/1.12  % (3666899)Time elapsed: 0.045 s
% 3.81/1.12  % (3666899)Peak memory usage: 11 MB
% 3.81/1.12  % (3666899)Instructions burned: 119 (million)
% 3.81/1.12  % TRYING [4]
% 3.81/1.12  % (3666909)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=954413342:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.81/1.12  % TRYING [1]
% 3.81/1.12  % TRYING [2]
% 3.81/1.12  % TRYING [3]
% 3.81/1.12  % TRYING [4]
% 3.81/1.12  % (3666898)Instruction limit reached! 
% 3.81/1.12  % (3666898)------------------------------
% 3.81/1.12  % (3666898)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666898)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666898)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666898)Termination reason: Instruction limit
% 3.81/1.12  % (3666898)Termination phase: Saturation
% 3.81/1.12  % (3666898)Time elapsed: 0.095 s
% 3.81/1.12  % (3666898)Peak memory usage: 11 MB
% 3.81/1.12  % (3666898)Instructions burned: 104 (million)
% 3.81/1.12  % (3666911)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1158399978:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.81/1.12  % (3666900)Instruction limit reached! 
% 3.81/1.12  % (3666900)------------------------------
% 3.81/1.12  % (3666900)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666900)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666900)Termination reason: Instruction limit
% 3.81/1.12  % (3666900)Termination phase: Saturation
% 3.81/1.12  % (3666900)Time elapsed: 0.147 s
% 3.81/1.12  % (3666900)Peak memory usage: 12 MB
% 3.81/1.12  % (3666900)Instructions burned: 131 (million)
% 3.81/1.12  % (3666901)Instruction limit reached! 
% 3.81/1.12  % (3666901)------------------------------
% 3.81/1.12  % (3666901)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666901)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666901)Termination reason: Instruction limit
% 3.81/1.12  % (3666901)Termination phase: Saturation
% 3.81/1.12  % (3666901)Time elapsed: 0.156 s
% 3.81/1.12  % (3666901)Peak memory usage: 12 MB
% 3.81/1.12  % (3666901)Instructions burned: 159 (million)
% 3.81/1.12  % (3666913)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=1245590839:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.81/1.12  % (3666914)ott-21_1_sil=16000:fs=off:random_seed=3943271433:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 3.81/1.12  % (3666911)Instruction limit reached! 
% 3.81/1.12  % (3666911)------------------------------
% 3.81/1.12  % (3666911)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666911)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666911)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666911)Termination reason: Instruction limit
% 3.81/1.12  % (3666911)Termination phase: Saturation
% 3.81/1.12  % (3666911)Time elapsed: 0.135 s
% 3.81/1.12  % (3666911)Peak memory usage: 13 MB
% 3.81/1.12  % (3666911)Instructions burned: 131 (million)
% 3.81/1.12  % (3666917)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2630765293:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.81/1.12  % (3666914)Instruction limit reached! 
% 3.81/1.12  % (3666914)------------------------------
% 3.81/1.12  % (3666914)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666914)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666914)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666914)Termination reason: Instruction limit
% 3.81/1.12  % (3666914)Termination phase: Saturation
% 3.81/1.12  % (3666914)Time elapsed: 0.155 s
% 3.81/1.12  % (3666914)Peak memory usage: 11 MB
% 3.81/1.12  % (3666914)Instructions burned: 180 (million)
% 3.81/1.12  % (3666909)Instruction limit reached! 
% 3.81/1.12  % (3666909)------------------------------
% 3.81/1.12  % (3666909)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666909)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666909)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666909)Termination reason: Instruction limit
% 3.81/1.12  % (3666909)Termination phase: Finite model building SAT solving
% 3.81/1.12  % (3666909)Time elapsed: 0.304 s
% 3.81/1.12  % (3666909)Peak memory usage: 13 MB
% 3.81/1.12  % (3666909)Instructions burned: 716 (million)
% 3.81/1.12  % (3666920)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1129862707:i=1179_2995 on theBenchmark for (2995ds/1179Mi)
% 3.81/1.12  % (3666919)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=470800672:fmbsr=1.3:i=865:ins=25_2996 on theBenchmark for (2996ds/865Mi)
% 3.81/1.12  % TRYING [1]
% 3.81/1.12  % TRYING [2]
% 3.81/1.12  % TRYING [5]
% 3.81/1.12  % TRYING [3]
% 3.81/1.12  % TRYING [4]
% 3.81/1.12  % (3666920) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3666890-3666920"...
% 3.81/1.12  % (3666920)...printing done.
% 3.81/1.12  % (3666920)Refutation found. Thanks to Tanya!
% 3.81/1.12  % SZS status Unsatisfiable for theBenchmark
% 3.81/1.12  % SZS output start Proof for theBenchmark
% See solution above
% 3.81/1.12  % (3666920)------------------------------
% 3.81/1.12  % (3666920)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.81/1.12  % (3666920)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.81/1.12  % (3666920)CaDiCaL version: 2.1.3
% 3.81/1.12  % (3666920)Termination reason: Refutation
% 3.81/1.12  % (3666920)Time elapsed: 0.129 s
% 3.81/1.12  % (3666920)Peak memory usage: 15 MB
% 3.81/1.12  % (3666920)Instructions burned: 248 (million)
% 3.81/1.12  % (3666890)Success in time 0.565 s
% 3.81/1.12  % Vampire exiting
%------------------------------------------------------------------------------