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

% Computer : n009.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 12:37:23 PM UTC 2026

% Result   : Unsatisfiable 1.03s 0.65s
% Output   : Refutation 1.03s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   11
% Syntax   : Number of formulae    :   37 (  11 unt;   2 def)
%            Number of atoms       :   75 (   8 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   65 (  27   ~;  36   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   3 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-4 aty)
%            Number of variables   :   24 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f634,axiom,
    ! [X2,X3,X0,X1,X4] :
      ( ~ c_in(c_Pair(X0,X4,X2,X2),X3,tc_prod(X2,X2))
      | ~ c_in(c_Pair(X4,X1,X2,X2),X3,tc_prod(X2,X2))
      | c_in(c_Pair(X0,X1,X2,X2),X3,tc_prod(X2,X2))
      | ~ c_Relation_Otrans(X3,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_trans__def_0) ).

fof(f636,axiom,
    ! [X2,X0,X1] :
      ( ~ hBOOL(hAPP(X1,X0))
      | c_in(X0,X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_1) ).

fof(f637,axiom,
    ! [X2,X0,X1] :
      ( ~ c_in(X1,X0,X2)
      | hBOOL(hAPP(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_mem__def_0) ).

fof(f640,negated_conjecture,
    c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).

fof(f641,negated_conjecture,
    c_Relation_Otrans(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).

fof(f642,negated_conjecture,
    ! [X0] : ~ c_in(c_Pair(X0,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_4) ).

fof(f643,negated_conjecture,
    ~ c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_5) ).

fof(f644,negated_conjecture,
    ! [X2,X0,X1] :
      ( c_in(c_Pair(X0,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | c_in(c_Pair(X1,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | X1 = X0 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_6) ).

fof(f645,plain,
    ! [X2,X0,X1] :
      ( c_in(c_Pair(X1,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | c_in(c_Pair(X0,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,X2),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | X0 = X1 ),
    inference(reorient_equations,[],[f644]) ).

fof(f648,negated_conjecture,
    ! [X0,X1] :
      ( ~ c_in(c_Pair(X0,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | c_in(c_Pair(X0,X1,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | X0 = X1 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_8) ).

fof(f743,plain,
    ( c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | v_a = v_b ),
    inference(resolution,[],[f645,f643]) ).

fof(f751,definition,
    ( spl0_1
  <=> v_a = v_b ),
    introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).

fof(f752,plain,
    ( v_a != v_b
    | spl0_1 ),
    inference(avatar_component_clause,[],[f751]) ).

fof(f753,plain,
    ( v_a = v_b
    | ~ spl0_1 ),
    inference(avatar_component_clause,[],[f751]) ).

fof(f755,definition,
    ( spl0_2
  <=> c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
    introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).

fof(f757,plain,
    ( c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),hAPP(v_P,v_i),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ spl0_2 ),
    inference(avatar_component_clause,[],[f755]) ).

fof(f759,plain,
    ( spl0_1
    | spl0_2 ),
    inference(avatar_split_clause,[],[f743,f755,f751]) ).

fof(f761,plain,
    ( c_in(c_Pair(v_a,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | ~ spl0_1 ),
    inference(superposition,[],[f640,f753]) ).

fof(f762,plain,
    ( $false
    | ~ spl0_1 ),
    inference(forward_subsumption_resolution,[],[f761,f642]) ).

fof(f763,plain,
    ~ spl0_1,
    inference(avatar_contradiction_clause,[],[f762]) ).

fof(f764,plain,
    ( c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | v_a = v_b
    | ~ spl0_2 ),
    inference(resolution,[],[f757,f648]) ).

fof(f765,plain,
    ( c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f764,f752]) ).

fof(f1201,plain,
    hBOOL(hAPP(v_F(v_P),c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))),
    inference(resolution,[],[f637,f640]) ).

fof(f1204,plain,
    ( hBOOL(hAPP(v_F(v_P),c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)))
    | spl0_1
    | ~ spl0_2 ),
    inference(resolution,[],[f637,f765]) ).

fof(f1258,plain,
    ! [X0] : c_in(c_Pair(v_a,v_b,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),X0),
    inference(resolution,[],[f1201,f636]) ).

fof(f1261,plain,
    ( ! [X0] : c_in(c_Pair(v_b,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),X0)
    | spl0_1
    | ~ spl0_2 ),
    inference(resolution,[],[f1204,f636]) ).

fof(f1599,plain,
    ! [X0] :
      ( ~ c_in(c_Pair(v_b,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | c_in(c_Pair(v_a,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | ~ c_Relation_Otrans(v_F(v_P),tc_Arrow__Order__Mirabelle_Oalt) ),
    inference(resolution,[],[f634,f1258]) ).

fof(f1621,plain,
    ! [X0] :
      ( ~ c_in(c_Pair(v_b,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
      | c_in(c_Pair(v_a,X0,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt)) ),
    inference(forward_subsumption_resolution,[],[f1599,f641]) ).

fof(f1636,plain,
    ( c_in(c_Pair(v_a,v_a,tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),v_F(v_P),tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt))
    | spl0_1
    | ~ spl0_2 ),
    inference(resolution,[],[f1621,f1261]) ).

fof(f1640,plain,
    ( $false
    | spl0_1
    | ~ spl0_2 ),
    inference(forward_subsumption_resolution,[],[f1636,f642]) ).

fof(f1641,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(avatar_contradiction_clause,[],[f1640]) ).

cnf(s2,plain,
    ( spl0_1
    | spl0_2 ),
    inference(sat_conversion,[],[f759]) ).

cnf(s3,plain,
    ~ spl0_1,
    inference(sat_conversion,[],[f763]) ).

cnf(s4,plain,
    ( spl0_1
    | ~ spl0_2 ),
    inference(sat_conversion,[],[f1641]) ).

cnf(s5,plain,
    ~ spl0_2,
    inference(rat,[],[s4,s3]) ).

cnf(s6,plain,
    $false,
    inference(rat,[],[s2,s5,s3]) ).

fof(f1642,plain,
    $false,
    inference(avatar_sat_refutation,[],[s6]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SCT023-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.12/0.38  % Computer : n009.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 23:30:17 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.03/0.65  % (2526578)Will run a generic schedule for satisfiability detection.
% 1.03/0.65  % (2526589)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2011041576:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.03/0.65  % (2526584)% WARNING: option uhcvi not known.
% 1.03/0.65  % (2526584)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=913021806:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.03/0.65  % (2526583)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2654450647_2999 on theBenchmark for (2999ds/0Mi)
% 1.03/0.65  % (2526585)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1016107896:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.03/0.65  % (2526586)dis+10_1_sil=32000:sp=arity:random_seed=2659389694:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.03/0.65  % (2526587)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3855082916:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.03/0.65  % (2526588)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1779509027:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.03/0.65  % (2526589)Instruction limit reached! 
% 1.03/0.65  % (2526589)------------------------------
% 1.03/0.65  % (2526589)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.65  % (2526589)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.65  % (2526589)CaDiCaL version: 2.1.3
% 1.03/0.65  % (2526589)Termination reason: Instruction limit
% 1.03/0.65  % (2526589)Termination phase: Saturation
% 1.03/0.65  % (2526589)Time elapsed: 0.054 s
% 1.03/0.65  % (2526589)Peak memory usage: 13 MB
% 1.03/0.65  % (2526589)Instructions burned: 167 (million)
% 1.03/0.65  % (2526597)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=4234274247:i=714:nm=2_2998 on theBenchmark for (2998ds/714Mi)
% 1.03/0.65  % (2526586)Instruction limit reached! 
% 1.03/0.65  % (2526586)------------------------------
% 1.03/0.65  % (2526586)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.65  % (2526586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.65  % (2526586)CaDiCaL version: 2.1.3
% 1.03/0.65  % (2526586)Termination reason: Instruction limit
% 1.03/0.65  % (2526586)Termination phase: Saturation
% 1.03/0.65  % (2526586)Time elapsed: 0.067 s
% 1.03/0.65  % (2526586)Peak memory usage: 12 MB
% 1.03/0.65  % (2526586)Instructions burned: 104 (million)
% 1.03/0.65  % (2526587)Instruction limit reached! 
% 1.03/0.65  % (2526587)------------------------------
% 1.03/0.65  % (2526587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.65  % (2526587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.65  % (2526587)CaDiCaL version: 2.1.3
% 1.03/0.65  % (2526587)Termination reason: Instruction limit
% 1.03/0.65  % (2526587)Termination phase: Saturation
% 1.03/0.65  % (2526587)Time elapsed: 0.079 s
% 1.03/0.65  % (2526587)Peak memory usage: 13 MB
% 1.03/0.65  % (2526587)Instructions burned: 117 (million)
% 1.03/0.65  % (2526588)Instruction limit reached! 
% 1.03/0.65  % (2526588)------------------------------
% 1.03/0.65  % (2526588)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.65  % (2526588)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.65  % (2526588)CaDiCaL version: 2.1.3
% 1.03/0.65  % (2526588)Termination reason: Instruction limit
% 1.03/0.65  % (2526588)Termination phase: Saturation
% 1.03/0.65  % (2526588)Time elapsed: 0.083 s
% 1.03/0.65  % (2526588)Peak memory usage: 13 MB
% 1.03/0.65  % (2526588)Instructions burned: 131 (million)
% 1.03/0.65  % (2526599)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1969626411:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.03/0.65  % (2526600)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=1490870069:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.03/0.65  % (2526601)ott-21_1_sil=16000:fs=off:random_seed=3115900894:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.03/0.65  % TRYING [1]
% 1.03/0.65  % TRYING [2]
% 1.03/0.65  % (2526600) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-2526578-2526600"...
% 1.03/0.65  % TRYING [1]
% 1.03/0.65  % (2526600)...printing done.
% 1.03/0.65  % (2526600)Refutation found. Thanks to Tanya!
% 1.03/0.65  % SZS status Unsatisfiable for theBenchmark
% 1.03/0.65  % SZS output start Proof for theBenchmark
% See solution above
% 1.03/0.65  % (2526600)------------------------------
% 1.03/0.65  % (2526600)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.03/0.65  % (2526600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.03/0.65  % (2526600)CaDiCaL version: 2.1.3
% 1.03/0.65  % (2526600)Termination reason: Refutation
% 1.03/0.65  % (2526600)Time elapsed: 0.054 s
% 1.03/0.65  % (2526600)Peak memory usage: 14 MB
% 1.03/0.65  % (2526600)Instructions burned: 91 (million)
% 1.03/0.65  % (2526578)Success in time 0.221 s
% 1.03/0.65  % Vampire exiting
%------------------------------------------------------------------------------