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

% Computer : n006.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:18 AM UTC 2026

% Result   : Unsatisfiable 1.44s 0.69s
% Output   : Refutation 1.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :   13
% Syntax   : Number of formulae    :   58 (  31 unt;   2 def)
%            Number of atoms       :   90 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   65 (  33   ~;  30   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :   10 (   2 avg)
%            Number of predicates  :    6 (   4 usr;   3 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-2 aty)
%            Number of variables   :   74 (   0 sgn  74   !;   0   ?)

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

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

fof(f3,axiom,
    ! [X0,X1] : axiom(implies(or(X0,X1),or(X1,X0))),
    file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-0.ax',axiom_1_6) ).

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

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

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

fof(f9,axiom,
    ! [X0,X1] : and(X0,X1) = not(or(not(X0),not(X1))),
    file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LCL004-2.ax',equivalent_defn) ).

fof(f11,negated_conjecture,
    ~ theorem(equivalent(not(implies(p,q)),and(p,not(q)))),
    file('/export/starexec/sandbox2/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(not(or(not(or(not(not(or(not(p),q))),not(or(not(p),not(not(q)))))),not(or(not(not(or(not(p),not(not(q))))),not(or(not(p),q))))))),
    inference(definition_unfolding,[],[f11,f12,f6,f9]) ).

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(f27,plain,
    ! [X0,X1] :
      ( ~ theorem(or(X1,X0))
      | theorem(or(X0,X1)) ),
    inference(resolution,[],[f22,f18]) ).

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

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

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

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

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

fof(f111,plain,
    ! [X0] : theorem(or(X0,not(X0))),
    inference(resolution,[],[f27,f76]) ).

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

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

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

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

fof(f261,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),not(or(not(p),not(not(q))))))
    | ~ theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(p),q)))) ),
    inference(resolution,[],[f151,f19]) ).

fof(f264,definition,
    ( spl0_5
  <=> theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(p),q)))) ),
    introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).

fof(f266,plain,
    ( ~ theorem(or(not(not(or(not(p),not(not(q))))),not(or(not(p),q))))
    | spl0_5 ),
    inference(avatar_component_clause,[],[f264]) ).

fof(f268,definition,
    ( spl0_6
  <=> theorem(or(not(not(or(not(p),q))),not(or(not(p),not(not(q)))))) ),
    introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).

fof(f270,plain,
    ( ~ theorem(or(not(not(or(not(p),q))),not(or(not(p),not(not(q))))))
    | spl0_6 ),
    inference(avatar_component_clause,[],[f268]) ).

fof(f271,plain,
    ( ~ spl0_5
    | ~ spl0_6 ),
    inference(avatar_split_clause,[],[f261,f268,f264]) ).

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

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

fof(f1664,plain,
    ! [X0,X1] :
      ( theorem(or(X0,not(not(X1))))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f893,f111]) ).

fof(f1761,plain,
    ! [X0,X1] :
      ( theorem(or(not(not(X1)),X0))
      | ~ theorem(or(X0,X1)) ),
    inference(resolution,[],[f1664,f27]) ).

fof(f1844,plain,
    ( ~ theorem(or(not(or(not(p),q)),or(not(p),not(not(q)))))
    | spl0_5 ),
    inference(resolution,[],[f1761,f266]) ).

fof(f1871,plain,
    ( ~ theorem(or(not(q),not(not(q))))
    | spl0_5 ),
    inference(resolution,[],[f1844,f600]) ).

fof(f1880,plain,
    ( $false
    | spl0_5 ),
    inference(forward_subsumption_resolution,[],[f1871,f111]) ).

fof(f1881,plain,
    spl0_5,
    inference(avatar_contradiction_clause,[],[f1880]) ).

fof(f1928,plain,
    ( ~ theorem(or(not(or(not(p),not(not(q)))),or(not(p),q)))
    | spl0_6 ),
    inference(resolution,[],[f270,f1761]) ).

fof(f1935,plain,
    ( ~ theorem(or(not(not(not(q))),q))
    | spl0_6 ),
    inference(resolution,[],[f1928,f600]) ).

fof(f1945,plain,
    ( ~ theorem(or(q,not(q)))
    | spl0_6 ),
    inference(resolution,[],[f1935,f1761]) ).

fof(f1949,plain,
    ( $false
    | spl0_6 ),
    inference(forward_subsumption_resolution,[],[f1945,f111]) ).

fof(f1950,plain,
    spl0_6,
    inference(avatar_contradiction_clause,[],[f1949]) ).

cnf(s12,plain,
    ( ~ spl0_5
    | ~ spl0_6 ),
    inference(sat_conversion,[],[f271]) ).

cnf(s13,plain,
    spl0_5,
    inference(sat_conversion,[],[f1881]) ).

cnf(s20,plain,
    spl0_6,
    inference(sat_conversion,[],[f1950]) ).

cnf(s21,plain,
    $false,
    inference(rat,[],[s12,s20,s13]) ).

fof(f1951,plain,
    $false,
    inference(avatar_sat_refutation,[],[s21]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL295-3 : TPTP v9.3.1. Released v2.3.0.
% 0.00/0.05  % Command  : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37  % Computer : n006.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 27 15:33:11 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.15/0.42  Running first-order model finding
% 0.15/0.42  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
% 1.44/0.69  % (3111178)Will run a generic schedule for satisfiability detection.
% 1.44/0.69  % (3111185)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=242302630:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.44/0.69  % (3111184)% WARNING: option uhcvi not known.
% 1.44/0.69  % (3111184)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2441221662:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.44/0.69  % (3111183)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=866950166_2999 on theBenchmark for (2999ds/0Mi)
% 1.44/0.69  % (3111187)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1123362039:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.44/0.69  % (3111188)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4126230847:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.44/0.69  % (3111189)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=269045234:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.44/0.69  % TRYING [1]
% 1.44/0.69  % TRYING [2]
% 1.44/0.69  % TRYING [3]
% 1.44/0.69  % (3111186)dis+10_1_sil=32000:sp=arity:random_seed=2690268953:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.44/0.69  % TRYING [4]
% 1.44/0.69  % (3111187)Instruction limit reached! 
% 1.44/0.69  % (3111187)------------------------------
% 1.44/0.69  % (3111187)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.44/0.69  % (3111187)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.44/0.69  % (3111187)CaDiCaL version: 2.1.3
% 1.44/0.69  % (3111187)Termination reason: Instruction limit
% 1.44/0.69  % (3111187)Termination phase: Saturation
% 1.44/0.69  % (3111187)Time elapsed: 0.086 s
% 1.44/0.69  % (3111187)Peak memory usage: 11 MB
% 1.44/0.69  % (3111187)Instructions burned: 117 (million)
% 1.44/0.69  % (3111204)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2297077831:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.44/0.69  % TRYING [1]
% 1.44/0.69  % TRYING [2]
% 1.44/0.69  % TRYING [3]
% 1.44/0.69  % (3111188)Instruction limit reached! 
% 1.44/0.69  % (3111188)------------------------------
% 1.44/0.69  % (3111188)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.44/0.69  % (3111188)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.44/0.69  % (3111188)CaDiCaL version: 2.1.3
% 1.44/0.69  % (3111188)Termination reason: Instruction limit
% 1.44/0.69  % (3111188)Termination phase: Saturation
% 1.44/0.69  % (3111188)Time elapsed: 0.128 s
% 1.44/0.69  % (3111188)Peak memory usage: 13 MB
% 1.44/0.69  % (3111188)Instructions burned: 132 (million)
% 1.44/0.69  % (3111189)Instruction limit reached! 
% 1.44/0.69  % (3111189)------------------------------
% 1.44/0.69  % (3111189)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.44/0.69  % (3111189)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.44/0.69  % (3111189)CaDiCaL version: 2.1.3
% 1.44/0.69  % (3111189)Termination reason: Instruction limit
% 1.44/0.69  % (3111189)Termination phase: Saturation
% 1.44/0.69  % (3111189)Time elapsed: 0.136 s
% 1.44/0.69  % (3111189)Peak memory usage: 12 MB
% 1.44/0.69  % (3111189)Instructions burned: 159 (million)
% 1.44/0.69  % TRYING [4]
% 1.44/0.69  % (3111186)Instruction limit reached! 
% 1.44/0.69  % (3111186)------------------------------
% 1.44/0.69  % (3111186)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.44/0.69  % (3111186)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.44/0.69  % (3111186)CaDiCaL version: 2.1.3
% 1.44/0.69  % (3111186)Termination reason: Instruction limit
% 1.44/0.69  % (3111186)Termination phase: Saturation
% 1.44/0.69  % (3111186)Time elapsed: 0.138 s
% 1.44/0.69  % (3111186)Peak memory usage: 12 MB
% 1.44/0.69  % (3111186)Instructions burned: 106 (million)
% 1.44/0.69  % (3111207)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=953376362:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.44/0.69  % (3111209)ott-21_1_sil=16000:fs=off:random_seed=1083293400:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.44/0.69  % (3111208)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=1283080888:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.44/0.69  % (3111208) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3111178-3111208"...
% 1.44/0.69  % (3111208)...printing done.
% 1.44/0.69  % (3111208)Refutation found. Thanks to Tanya!
% 1.44/0.69  % SZS status Unsatisfiable for theBenchmark
% 1.44/0.69  % SZS output start Proof for theBenchmark
% See solution above
% 1.44/0.69  % (3111208)------------------------------
% 1.44/0.69  % (3111208)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.44/0.69  % (3111208)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.44/0.69  % (3111208)CaDiCaL version: 2.1.3
% 1.44/0.69  % (3111208)Termination reason: Refutation
% 1.44/0.69  % (3111208)Time elapsed: 0.053 s
% 1.44/0.69  % (3111208)Peak memory usage: 12 MB
% 1.44/0.69  % (3111208)Instructions burned: 53 (million)
% 1.44/0.69  % (3111178)Success in time 0.263 s
% 1.44/0.69  % Vampire exiting
%------------------------------------------------------------------------------