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

% Computer : n012.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:04 AM UTC 2026

% Result   : Unsatisfiable 1.69s 0.80s
% Output   : Refutation 1.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   42 (  16 unt;   0 def)
%            Number of atoms       :   73 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   67 (  36   ~;  31   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-1 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   75 (  75   !;   0   ?)

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

fof(f2,axiom,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',axiom_1_6) ).

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

fof(f7,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ axiom(or(not(X1),X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL003-0.ax',rule_3) ).

fof(f9,negated_conjecture,
    ~ theorem(or(not(or(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))),
    file('/export/starexec/sandbox/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(p,q)),or(not(or(p,or(not(q),r))),or(p,r)))),
    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(f18,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(f37,plain,
    theorem(or(not(or(p,or(not(q),r))),or(not(or(p,q)),or(p,r)))),
    inference(resolution,[],[f18,f13]) ).

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

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

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

fof(f66,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,[],[f39,f12]) ).

fof(f123,plain,
    theorem(or(not(or(not(q),or(p,r))),or(not(or(p,q)),or(p,r)))),
    inference(resolution,[],[f50,f4]) ).

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

fof(f141,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,[],[f66,f3]) ).

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

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

fof(f314,plain,
    ! [X0,X1] :
      ( theorem(or(X0,or(X1,X1)))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f131,f18]) ).

fof(f330,plain,
    ! [X2,X0,X1] :
      ( theorem(or(or(not(X0),X1),or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f144,f18]) ).

fof(f349,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,[],[f141,f18]) ).

fof(f354,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,[],[f141,f10]) ).

fof(f656,plain,
    ! [X0] : theorem(or(not(or(not(or(X0,q)),or(X0,or(p,r)))),or(not(or(p,q)),or(p,r)))),
    inference(resolution,[],[f213,f5]) ).

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

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

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

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

fof(f1787,plain,
    theorem(or(not(or(p,or(p,r))),or(p,r))),
    inference(resolution,[],[f656,f22]) ).

fof(f3314,plain,
    ! [X0,X1] : ~ theorem(or(not(X0),or(X0,X1))),
    inference(resolution,[],[f1038,f1119]) ).

fof(f6977,plain,
    theorem(or(not(or(or(p,r),p)),or(p,r))),
    inference(resolution,[],[f1787,f1111]) ).

fof(f23518,plain,
    theorem(or(not(p),or(p,r))),
    inference(resolution,[],[f6977,f773]) ).

fof(f23538,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f23518,f3314]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL223-1 : TPTP v9.3.1. Released v1.1.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.37  % Computer : n012.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 15:27:50 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.41  Running first-order model finding
% 0.12/0.41  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  % (2515009)Will run a generic schedule for satisfiability detection.
% 1.69/0.80  % (2515015)% WARNING: option uhcvi not known.
% 1.69/0.80  % (2515017)dis+10_1_sil=32000:sp=arity:random_seed=3073735798:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.69/0.80  % (2515018)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=335254779:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.69/0.80  % (2515020)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2100618404:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.69/0.80  % (2515014)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=368118788_2999 on theBenchmark for (2999ds/0Mi)
% 1.69/0.80  % (2515016)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=782474800:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.69/0.80  % (2515015)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2392829149:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.69/0.80  % (2515019)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4122286863:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 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  % (2515018)Instruction limit reached! 
% 1.69/0.80  % (2515018)------------------------------
% 1.69/0.80  % (2515018)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515018)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515018)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515018)Termination reason: Instruction limit
% 1.69/0.80  % (2515018)Termination phase: Saturation
% 1.69/0.80  % (2515018)Time elapsed: 0.044 s
% 1.69/0.80  % (2515018)Peak memory usage: 11 MB
% 1.69/0.80  % (2515018)Instructions burned: 117 (million)
% 1.69/0.80  % (2515017)Instruction limit reached! 
% 1.69/0.80  % (2515017)------------------------------
% 1.69/0.80  % (2515017)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515017)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515017)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515017)Termination reason: Instruction limit
% 1.69/0.80  % (2515017)Termination phase: Saturation
% 1.69/0.80  % (2515017)Time elapsed: 0.049 s
% 1.69/0.80  % (2515017)Peak memory usage: 11 MB
% 1.69/0.80  % (2515017)Instructions burned: 104 (million)
% 1.69/0.80  % (2515019)Instruction limit reached! 
% 1.69/0.80  % (2515019)------------------------------
% 1.69/0.80  % (2515019)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515019)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515019)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515019)Termination reason: Instruction limit
% 1.69/0.80  % (2515019)Termination phase: Saturation
% 1.69/0.80  % (2515019)Time elapsed: 0.074 s
% 1.69/0.80  % (2515019)Peak memory usage: 12 MB
% 1.69/0.80  % (2515019)Instructions burned: 132 (million)
% 1.69/0.80  % (2515029)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3619026534:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 1.69/0.80  % (2515020)Instruction limit reached! 
% 1.69/0.80  % (2515020)------------------------------
% 1.69/0.80  % (2515020)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515020)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515020)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515020)Termination reason: Instruction limit
% 1.69/0.80  % (2515020)Termination phase: Saturation
% 1.69/0.80  % (2515020)Time elapsed: 0.078 s
% 1.69/0.80  % (2515020)Peak memory usage: 12 MB
% 1.69/0.80  % (2515020)Instructions burned: 161 (million)
% 1.69/0.80  % (2515028)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=889656689: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  % (2515030)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=1426626537:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.69/0.80  % (2515032)ott-21_1_sil=16000:fs=off:random_seed=1583068179:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.69/0.80  % TRYING [4]
% 1.69/0.80  % (2515029)Instruction limit reached! 
% 1.69/0.80  % (2515029)------------------------------
% 1.69/0.80  % (2515029)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515029)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515029)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515029)Termination reason: Instruction limit
% 1.69/0.80  % (2515029)Termination phase: Saturation
% 1.69/0.80  % (2515029)Time elapsed: 0.070 s
% 1.69/0.80  % (2515029)Peak memory usage: 12 MB
% 1.69/0.80  % (2515029)Instructions burned: 132 (million)
% 1.69/0.80  % (2515036)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=3199722305:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 1.69/0.80  % (2515032)Instruction limit reached! 
% 1.69/0.80  % (2515032)------------------------------
% 1.69/0.80  % (2515032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515032)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515032)Termination reason: Instruction limit
% 1.69/0.80  % (2515032)Termination phase: Saturation
% 1.69/0.80  % (2515032)Time elapsed: 0.083 s
% 1.69/0.80  % (2515032)Peak memory usage: 11 MB
% 1.69/0.80  % (2515032)Instructions burned: 181 (million)
% 1.69/0.80  % (2515038)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=3624371296:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 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  % (2515015) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2515009-2515015"...
% 1.69/0.80  % (2515015)...printing done.
% 1.69/0.80  % (2515015)Refutation found. Thanks to Tanya!
% 1.69/0.80  % SZS status Unsatisfiable for theBenchmark
% 1.69/0.80  % SZS output start Proof for theBenchmark
% See solution above
% 1.69/0.80  % (2515015)------------------------------
% 1.69/0.80  % (2515015)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.69/0.80  % (2515015)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.69/0.80  % (2515015)CaDiCaL version: 2.1.3
% 1.69/0.80  % (2515015)Termination reason: Refutation
% 1.69/0.80  % (2515015)Time elapsed: 0.331 s
% 1.69/0.80  % (2515015)Peak memory usage: 15 MB
% 1.69/0.80  % (2515015)Instructions burned: 628 (million)
% 1.69/0.80  % (2515009)Success in time 0.379 s
% 1.69/0.80  % Vampire exiting
%------------------------------------------------------------------------------