↑ 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  : LCL182-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 : n008.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:52 AM UTC 2026

% Result   : Unsatisfiable 3.79s 1.12s
% Output   : Refutation 3.79s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (  15 unt;   0 def)
%            Number of atoms       :   77 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   73 (  39   ~;  34   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   81 (  81   !;   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(f5,axiom,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

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

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

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

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

fof(f10,plain,
    ! [X0] :
      ( ~ theorem(X0)
      | ~ axiom(X0) ),
    inference(consistent_polarity_flipping,[],[f6]) ).

fof(f11,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(X1),X0))
      | ~ theorem(X0)
      | theorem(X1) ),
    inference(consistent_polarity_flipping,[],[f7]) ).

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

fof(f13,plain,
    theorem(or(not(or(not(p),q)),or(not(not(q)),not(p)))),
    inference(consistent_polarity_flipping,[],[f9]) ).

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

fof(f16,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,X1))
      | theorem(or(X1,X0)) ),
    inference(resolution,[],[f11,f3]) ).

fof(f17,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X0,X1))
      | theorem(X1) ),
    inference(resolution,[],[f11,f2]) ).

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

fof(f22,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),or(X0,X2)))
      | theorem(or(not(X1),X2)) ),
    inference(resolution,[],[f5,f11]) ).

fof(f25,plain,
    ! [X0] :
      ( theorem(or(not(X0),or(not(not(q)),not(p))))
      | ~ axiom(or(not(or(not(p),q)),X0)) ),
    inference(resolution,[],[f12,f13]) ).

fof(f28,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(or(not(p),q)),X0))
      | ~ axiom(or(not(X0),X1))
      | theorem(or(not(X1),or(not(not(q)),not(p)))) ),
    inference(resolution,[],[f25,f12]) ).

fof(f38,plain,
    ! [X0,X1] :
      ( theorem(or(X0,or(or(X0,X1),X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f21,f15]) ).

fof(f60,plain,
    ! [X0] :
      ( ~ axiom(or(not(or(q,not(p))),X0))
      | theorem(or(not(X0),or(not(not(q)),not(p)))) ),
    inference(resolution,[],[f28,f3]) ).

fof(f64,plain,
    ! [X0,X1] :
      ( theorem(or(or(X0,X1),X1))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f38,f17]) ).

fof(f65,plain,
    ! [X2,X0,X1] :
      ( ~ axiom(or(not(X0),X2))
      | ~ theorem(or(not(X0),X1))
      | theorem(or(not(X2),or(or(not(X0),X1),X1))) ),
    inference(resolution,[],[f38,f12]) ).

fof(f119,plain,
    ! [X0] : theorem(or(not(or(X0,or(q,not(p)))),or(not(not(q)),not(p)))),
    inference(resolution,[],[f60,f2]) ).

fof(f135,plain,
    ! [X0,X1] :
      ( theorem(or(X1,or(X0,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f64,f16]) ).

fof(f145,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X1,X0)),or(or(not(or(X0,X1)),X2),X2)))
      | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[],[f65,f3]) ).

fof(f148,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X2,X0)),or(or(not(X0),X1),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f65,f2]) ).

fof(f199,plain,
    ! [X0,X1] :
      ( ~ axiom(or(not(or(X0,or(q,not(p)))),X1))
      | theorem(or(not(X1),or(not(not(q)),not(p)))) ),
    inference(resolution,[],[f119,f12]) ).

fof(f325,plain,
    ! [X0,X1] :
      ( theorem(or(X0,or(X1,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f135,f21]) ).

fof(f345,plain,
    ! [X2,X0,X1] :
      ( theorem(or(or(not(X0),X1),or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f148,f21]) ).

fof(f366,plain,
    ! [X2,X0,X1] :
      ( theorem(or(or(not(or(X0,X1)),X2),or(not(or(X1,X0)),X2)))
      | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[],[f145,f21]) ).

fof(f371,plain,
    ! [X2,X0,X1] :
      ( ~ axiom(or(not(or(X1,X0)),or(or(not(or(X0,X1)),X2),X2)))
      | ~ theorem(or(not(or(X0,X1)),X2)) ),
    inference(resolution,[],[f145,f10]) ).

fof(f595,plain,
    ! [X0] : theorem(or(not(or(q,or(X0,not(p)))),or(not(not(q)),not(p)))),
    inference(resolution,[],[f199,f4]) ).

fof(f730,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X0))
      | theorem(or(not(X1),X0)) ),
    inference(resolution,[],[f325,f22]) ).

fof(f966,plain,
    ! [X2,X0,X1] :
      ( theorem(or(not(or(X2,X0)),X1))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f345,f17]) ).

fof(f1059,plain,
    ! [X2,X0,X1] :
      ( ~ theorem(or(not(or(X0,X1)),X2))
      | theorem(or(not(or(X1,X0)),X2)) ),
    inference(resolution,[],[f366,f17]) ).

fof(f1067,plain,
    ! [X0,X1] : ~ theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f371,f2]) ).

fof(f3349,plain,
    ! [X0,X1] : ~ theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f966,f1067]) ).

fof(f3851,plain,
    ! [X0] : theorem(or(not(or(or(X0,not(p)),q)),or(not(not(q)),not(p)))),
    inference(resolution,[],[f1059,f595]) ).

fof(f8756,plain,
    theorem(or(not(q),or(not(not(q)),not(p)))),
    inference(resolution,[],[f3851,f730]) ).

fof(f8774,plain,
    theorem(or(not(not(q)),or(not(q),not(p)))),
    inference(resolution,[],[f8756,f21]) ).

fof(f17551,plain,
    $false,
    inference(backward_subsumption_resolution,[],[f8774,f3349]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : LCL182-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.09  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.19/0.46  % Computer : n008.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Sun Sep 27 15:25:55 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.24/0.52  Running first-order model finding
% 0.24/0.52  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.79/1.12  % (1377597)Will run a generic schedule for satisfiability detection.
% 3.79/1.12  % (1377606)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1470980116:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 3.79/1.12  % (1377608)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2994896582:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 3.79/1.12  % (1377605)dis+10_1_sil=32000:sp=arity:random_seed=2427218409:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 3.79/1.12  % (1377607)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=516168162:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 3.79/1.12  % (1377602)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4079949345_2999 on theBenchmark for (2999ds/0Mi)
% 3.79/1.12  % (1377603)% WARNING: option uhcvi not known.
% 3.79/1.12  % TRYING [1]
% 3.79/1.12  % TRYING [2]
% 3.79/1.12  % TRYING [3]
% 3.79/1.12  % (1377603)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2540894303:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 3.79/1.12  % (1377606)Instruction limit reached! 
% 3.79/1.12  % (1377606)------------------------------
% 3.79/1.12  % (1377606)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377606)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377606)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377606)Termination reason: Instruction limit
% 3.79/1.12  % (1377606)Termination phase: Saturation
% 3.79/1.12  % (1377606)Time elapsed: 0.048 s
% 3.79/1.12  % (1377606)Peak memory usage: 11 MB
% 3.79/1.12  % (1377606)Instructions burned: 117 (million)
% 3.79/1.12  % (1377604)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4242165771:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 3.79/1.12  % TRYING [4]
% 3.79/1.12  % (1377615)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=13373547:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 3.79/1.12  % TRYING [1]
% 3.79/1.12  % TRYING [2]
% 3.79/1.12  % TRYING [3]
% 3.79/1.12  % (1377605)Instruction limit reached! 
% 3.79/1.12  % (1377605)------------------------------
% 3.79/1.12  % (1377605)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377605)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377605)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377605)Termination reason: Instruction limit
% 3.79/1.12  % (1377605)Termination phase: Saturation
% 3.79/1.12  % (1377605)Time elapsed: 0.099 s
% 3.79/1.12  % (1377605)Peak memory usage: 11 MB
% 3.79/1.12  % (1377605)Instructions burned: 103 (million)
% 3.79/1.12  % (1377607)Instruction limit reached! 
% 3.79/1.12  % (1377607)------------------------------
% 3.79/1.12  % (1377607)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377607)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377607)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377607)Termination reason: Instruction limit
% 3.79/1.12  % (1377607)Termination phase: Saturation
% 3.79/1.12  % (1377607)Time elapsed: 0.142 s
% 3.79/1.12  % (1377607)Peak memory usage: 12 MB
% 3.79/1.12  % (1377607)Instructions burned: 131 (million)
% 3.79/1.12  % TRYING [4]
% 3.79/1.12  % (1377618)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2939150935:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 3.79/1.12  % (1377608)Instruction limit reached! 
% 3.79/1.12  % (1377608)------------------------------
% 3.79/1.12  % (1377608)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377608)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377608)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377608)Termination reason: Instruction limit
% 3.79/1.12  % (1377608)Termination phase: Saturation
% 3.79/1.12  % (1377608)Time elapsed: 0.155 s
% 3.79/1.12  % (1377608)Peak memory usage: 12 MB
% 3.79/1.12  % (1377608)Instructions burned: 160 (million)
% 3.79/1.12  % (1377619)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=922822874:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 3.79/1.12  % (1377621)ott-21_1_sil=16000:fs=off:random_seed=172307095:i=180:av=off:fsr=off_2997 on theBenchmark for (2997ds/180Mi)
% 3.79/1.12  % (1377618)Instruction limit reached! 
% 3.79/1.12  % (1377618)------------------------------
% 3.79/1.12  % (1377618)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377618)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377618)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377618)Termination reason: Instruction limit
% 3.79/1.12  % (1377618)Termination phase: Saturation
% 3.79/1.12  % (1377618)Time elapsed: 0.143 s
% 3.79/1.12  % (1377618)Peak memory usage: 12 MB
% 3.79/1.12  % (1377618)Instructions burned: 131 (million)
% 3.79/1.12  % (1377624)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2438613541:i=477:bd=all_2996 on theBenchmark for (2996ds/477Mi)
% 3.79/1.12  % (1377621)Instruction limit reached! 
% 3.79/1.12  % (1377621)------------------------------
% 3.79/1.12  % (1377621)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377621)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377621)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377621)Termination reason: Instruction limit
% 3.79/1.12  % (1377621)Termination phase: Saturation
% 3.79/1.12  % (1377621)Time elapsed: 0.164 s
% 3.79/1.12  % (1377621)Peak memory usage: 12 MB
% 3.79/1.12  % (1377621)Instructions burned: 181 (million)
% 3.79/1.12  % (1377626)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=147645366:fmbsr=1.3:i=865:ins=25_2995 on theBenchmark for (2995ds/865Mi)
% 3.79/1.12  % TRYING [1]
% 3.79/1.12  % TRYING [2]
% 3.79/1.12  % TRYING [3]
% 3.79/1.12  % TRYING [4]
% 3.79/1.12  % (1377603) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1377597-1377603"...
% 3.79/1.12  % (1377603)...printing done.
% 3.79/1.12  % (1377603)Refutation found. Thanks to Tanya!
% 3.79/1.12  % SZS status Unsatisfiable for theBenchmark
% 3.79/1.12  % SZS output start Proof for theBenchmark
% See solution above
% 3.79/1.12  % (1377603)------------------------------
% 3.79/1.12  % (1377603)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 3.79/1.12  % (1377603)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.79/1.12  % (1377603)CaDiCaL version: 2.1.3
% 3.79/1.12  % (1377603)Termination reason: Refutation
% 3.79/1.12  % (1377603)Time elapsed: 0.506 s
% 3.79/1.12  % (1377603)Peak memory usage: 15 MB
% 3.79/1.12  % (1377603)Instructions burned: 495 (million)
% 3.79/1.12  % (1377597)Success in time 0.592 s
% 3.79/1.12  % Vampire exiting
%------------------------------------------------------------------------------