↑ 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  : LCL306-3 : TPTP v9.3.1. Released v2.3.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:58:20 AM UTC 2026

% Result   : Unsatisfiable 1.62s 0.76s
% Output   : Refutation 1.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   42 (  29 unt;   0 def)
%            Number of atoms       :   59 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   40 (  23   ~;  17   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   4 avg)
%            Maximal term depth    :    8 (   2 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   74 (  74   !;   0   ?)

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

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

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

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

fof(f5,axiom,
    ! [X2,X0,X1] : axiom(implies(implies(X0,X1),implies(or(X2,X0),or(X2,X1)))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

fof(f6,axiom,
    ! [X0,X1] : implies(X0,X1) = or(not(X0),X1),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',implies_definition) ).

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

fof(f8,axiom,
    ! [X0,X1] :
      ( theorem(X0)
      | ~ theorem(implies(X1,X0))
      | ~ theorem(X1) ),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-0.ax',rule_2) ).

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-1.ax',and_defn) ).

fof(f10,axiom,
    ! [X0,X1] : equivalent(X0,X1) = and(implies(X0,X1),implies(X1,X0)),
    file('/export/starexec/sandbox/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(implies(not(p),equivalent(q,or(p,q)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this) ).

fof(f12,plain,
    ! [X0,X1] : equivalent(X0,X1) = not(or(not(or(not(X0),X1)),not(or(not(X1),X0)))),
    inference(definition_unfolding,[],[f10,f9,f6,f6]) ).

fof(f13,plain,
    ! [X0] : axiom(or(not(or(X0,X0)),X0)),
    inference(definition_unfolding,[],[f1,f6]) ).

fof(f14,plain,
    ! [X0,X1] : axiom(or(not(X0),or(X1,X0))),
    inference(definition_unfolding,[],[f2,f6]) ).

fof(f15,plain,
    ! [X0,X1] : axiom(or(not(or(X0,X1)),or(X1,X0))),
    inference(definition_unfolding,[],[f3,f6]) ).

fof(f16,plain,
    ! [X2,X0,X1] : axiom(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(definition_unfolding,[],[f4,f6]) ).

fof(f17,plain,
    ! [X2,X0,X1] : axiom(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(definition_unfolding,[],[f5,f6,f6,f6]) ).

fof(f18,plain,
    ! [X0,X1] :
      ( ~ theorem(or(not(X1),X0))
      | theorem(X0)
      | ~ theorem(X1) ),
    inference(definition_unfolding,[],[f8,f6]) ).

fof(f19,plain,
    ~ theorem(or(not(not(p)),not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))))),
    inference(definition_unfolding,[],[f11,f6,f12]) ).

fof(f20,plain,
    ! [X0] : theorem(or(not(or(X0,X0)),X0)),
    inference(resolution,[],[f13,f7]) ).

fof(f21,plain,
    ! [X0,X1] : theorem(or(not(X0),or(X1,X0))),
    inference(resolution,[],[f14,f7]) ).

fof(f22,plain,
    ! [X0,X1] : theorem(or(not(or(X0,X1)),or(X1,X0))),
    inference(resolution,[],[f15,f7]) ).

fof(f23,plain,
    ! [X0] :
      ( ~ theorem(or(X0,X0))
      | theorem(X0) ),
    inference(resolution,[],[f18,f20]) ).

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

fof(f74,plain,
    ! [X2,X0,X1] : theorem(or(not(or(X0,or(X1,X2))),or(X1,or(X0,X2)))),
    inference(resolution,[],[f16,f7]) ).

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

fof(f79,plain,
    ! [X0,X1] : theorem(or(X0,or(not(X1),X1))),
    inference(resolution,[],[f75,f21]) ).

fof(f85,plain,
    ! [X0] : theorem(or(not(X0),X0)),
    inference(resolution,[],[f79,f23]) ).

fof(f121,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f28,f85]) ).

fof(f275,plain,
    ! [X2,X0,X1] : theorem(or(not(or(not(X0),X1)),or(not(or(X2,X0)),or(X2,X1)))),
    inference(resolution,[],[f17,f7]) ).

fof(f311,plain,
    ! [X0,X1] : theorem(or(X0,or(not(or(X0,X1)),X1))),
    inference(resolution,[],[f75,f85]) ).

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

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

fof(f1071,plain,
    ! [X2,X0,X1] :
      ( theorem(or(X2,or(not(or(X2,X0)),X1)))
      | ~ theorem(or(not(X0),X1)) ),
    inference(resolution,[],[f658,f75]) ).

fof(f1662,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f1070,f121]) ).

fof(f1764,plain,
    ! [X0,X1] :
      ( theorem(or(not(not(X1)),X0))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f1662,f28]) ).

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

fof(f1859,plain,
    ~ theorem(or(not(or(not(or(not(q),or(p,q))),not(or(not(or(p,q)),q)))),p)),
    inference(resolution,[],[f1764,f19]) ).

fof(f6516,plain,
    ( ~ theorem(or(not(not(or(not(or(p,q)),q))),p))
    | ~ theorem(or(not(q),or(p,q))) ),
    inference(resolution,[],[f1835,f1859]) ).

fof(f6549,plain,
    ~ theorem(or(not(not(or(not(or(p,q)),q))),p)),
    inference(forward_subsumption_resolution,[],[f6516,f21]) ).

fof(f6550,plain,
    ~ theorem(or(p,or(not(or(p,q)),q))),
    inference(resolution,[],[f6549,f1764]) ).

fof(f6556,plain,
    $false,
    inference(forward_subsumption_resolution,[],[f6550,f311]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL306-3 : TPTP v9.3.1. Released v2.3.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:33: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.62/0.76  % (3215149)Will run a generic schedule for satisfiability detection.
% 1.62/0.76  % (3215155)% WARNING: option uhcvi not known.
% 1.62/0.76  % (3215155)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2015189763:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.62/0.76  % (3215154)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2908559953_2999 on theBenchmark for (2999ds/0Mi)
% 1.62/0.76  % (3215156)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3116180597:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.62/0.76  % (3215157)dis+10_1_sil=32000:sp=arity:random_seed=1391677736:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.62/0.76  % (3215158)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3308183876:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.62/0.76  % TRYING [1]
% 1.62/0.76  % TRYING [2]
% 1.62/0.76  % TRYING [3]
% 1.62/0.76  % (3215159)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1106791504:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.62/0.76  % (3215160)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=695873748:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.62/0.76  % TRYING [4]
% 1.62/0.76  % (3215158)Instruction limit reached! 
% 1.62/0.76  % (3215158)------------------------------
% 1.62/0.76  % (3215158)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215158)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215158)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215158)Termination reason: Instruction limit
% 1.62/0.76  % (3215158)Termination phase: Saturation
% 1.62/0.76  % (3215158)Time elapsed: 0.054 s
% 1.62/0.76  % (3215158)Peak memory usage: 11 MB
% 1.62/0.76  % (3215158)Instructions burned: 116 (million)
% 1.62/0.76  % (3215157)Instruction limit reached! 
% 1.62/0.76  % (3215157)------------------------------
% 1.62/0.76  % (3215157)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215157)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215157)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215157)Termination reason: Instruction limit
% 1.62/0.76  % (3215157)Termination phase: Saturation
% 1.62/0.76  % (3215157)Time elapsed: 0.065 s
% 1.62/0.76  % (3215157)Peak memory usage: 12 MB
% 1.62/0.76  % (3215157)Instructions burned: 105 (million)
% 1.62/0.76  % (3215168)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=375644919:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.62/0.76  % TRYING [1]
% 1.62/0.76  % TRYING [2]
% 1.62/0.76  % TRYING [3]
% 1.62/0.76  % (3215169)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2576345067:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.62/0.76  % (3215159)Instruction limit reached! 
% 1.62/0.76  % (3215159)------------------------------
% 1.62/0.76  % (3215159)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215159)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215159)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215159)Termination reason: Instruction limit
% 1.62/0.76  % (3215159)Termination phase: Saturation
% 1.62/0.76  % (3215159)Time elapsed: 0.087 s
% 1.62/0.76  % (3215159)Peak memory usage: 14 MB
% 1.62/0.76  % (3215159)Instructions burned: 132 (million)
% 1.62/0.76  % TRYING [4]
% 1.62/0.76  % (3215160)Instruction limit reached! 
% 1.62/0.76  % (3215160)------------------------------
% 1.62/0.76  % (3215160)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215160)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215160)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215160)Termination reason: Instruction limit
% 1.62/0.76  % (3215160)Termination phase: Saturation
% 1.62/0.76  % (3215160)Time elapsed: 0.100 s
% 1.62/0.76  % (3215160)Peak memory usage: 12 MB
% 1.62/0.76  % (3215160)Instructions burned: 160 (million)
% 1.62/0.76  % (3215181)ott-21_1_sil=16000:fs=off:random_seed=2627627427:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.62/0.76  % (3215180)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=803810020:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.62/0.76  % (3215169)Instruction limit reached! 
% 1.62/0.76  % (3215169)------------------------------
% 1.62/0.76  % (3215169)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215169)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215169)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215169)Termination reason: Instruction limit
% 1.62/0.76  % (3215169)Termination phase: Saturation
% 1.62/0.76  % (3215169)Time elapsed: 0.119 s
% 1.62/0.76  % (3215169)Peak memory usage: 12 MB
% 1.62/0.76  % (3215169)Instructions burned: 131 (million)
% 1.62/0.76  % (3215184)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=289026531:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.62/0.76  % TRYING [5]
% 1.62/0.76  % (3215181)Instruction limit reached! 
% 1.62/0.76  % (3215181)------------------------------
% 1.62/0.76  % (3215181)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215181)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215181)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215181)Termination reason: Instruction limit
% 1.62/0.76  % (3215181)Termination phase: Saturation
% 1.62/0.76  % (3215181)Time elapsed: 0.116 s
% 1.62/0.76  % (3215181)Peak memory usage: 12 MB
% 1.62/0.76  % (3215181)Instructions burned: 181 (million)
% 1.62/0.76  % (3215186)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=4085644131:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.62/0.76  % TRYING [1]
% 1.62/0.76  % TRYING [2]
% 1.62/0.76  % (3215180) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3215149-3215180"...
% 1.62/0.76  % (3215180)...printing done.
% 1.62/0.76  % TRYING [3]
% 1.62/0.76  % (3215180)Refutation found. Thanks to Tanya!
% 1.62/0.76  % SZS status Unsatisfiable for theBenchmark
% 1.62/0.76  % SZS output start Proof for theBenchmark
% See solution above
% 1.62/0.76  % (3215180)------------------------------
% 1.62/0.76  % (3215180)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.62/0.76  % (3215180)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.62/0.76  % (3215180)CaDiCaL version: 2.1.3
% 1.62/0.76  % (3215180)Termination reason: Refutation
% 1.62/0.76  % (3215180)Time elapsed: 0.145 s
% 1.62/0.76  % (3215180)Peak memory usage: 13 MB
% 1.62/0.76  % (3215180)Instructions burned: 178 (million)
% 1.62/0.76  % (3215149)Success in time 0.325 s
% 1.62/0.76  % Vampire exiting
%------------------------------------------------------------------------------