↑ Up

Vampire-SAT---5.0.1.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Vampire-SAT---5.0.1
% Problem  : SCT123+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT

% Computer : n007.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:33 PM UTC 2026

% Result   : Theorem 0.82s 0.62s
% Output   : Refutation 0.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  13 unt;   0 def)
%            Number of atoms       :   33 (   4 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   22 (  11   ~;   7   |;   1   &)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-5 aty)
%            Number of variables   :   53 (  52   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f10,axiom,
    ! [X0,X1,X2] :
      ( hBOOL(hAPP(hAPP(c_member(X2),X1),X0))
    <=> hBOOL(hAPP(X0,X1)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_mem__def) ).

fof(f110,axiom,
    c_Arrow__Order__Mirabelle_OProf = c_FuncSet_OPi(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_HOL_Obool)),c_COMBK(tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,c_Arrow__Order__Mirabelle_OLin)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_Prof__def) ).

fof(f112,axiom,
    ! [X0,X1,X2,X3,X4] :
      ( ! [X5] :
          ( hBOOL(hAPP(hAPP(c_member(X4),X5),X3))
         => hBOOL(hAPP(hAPP(c_member(X2),hAPP(X1,X5)),X0)) )
     => hBOOL(hAPP(hAPP(c_member(tc_fun(X4,X2)),X1),c_FuncSet_OPi(X4,X2,X3,c_COMBK(tc_fun(X2,tc_HOL_Obool),X4,X0)))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_funcsetI) ).

fof(f520,axiom,
    ! [X0,X1,X2,X3] : hAPP(c_COMBK(X3,X2,X1),X0) = X1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',help_c__COMBK__1) ).

fof(f528,axiom,
    hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),v_L),c_Arrow__Order__Mirabelle_OLin)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(f529,conjecture,
    hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),c_COMBK(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,v_L)),c_Arrow__Order__Mirabelle_OProf)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

fof(f530,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),c_COMBK(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,v_L)),c_Arrow__Order__Mirabelle_OProf)),
    inference(negated_conjecture,[status(cth)],[f529]) ).

fof(f532,plain,
    ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),c_COMBK(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,v_L)),c_Arrow__Order__Mirabelle_OProf)),
    inference(flattening,[],[f530]) ).

fof(f631,plain,
    ! [X0,X1,X2,X3,X4] :
      ( hBOOL(hAPP(hAPP(c_member(tc_fun(X4,X2)),X1),c_FuncSet_OPi(X4,X2,X3,c_COMBK(tc_fun(X2,tc_HOL_Obool),X4,X0))))
      | ? [X5] :
          ( ~ hBOOL(hAPP(hAPP(c_member(X2),hAPP(X1,X5)),X0))
          & hBOOL(hAPP(hAPP(c_member(X4),X5),X3)) ) ),
    inference(ennf_transformation,[],[f112]) ).

fof(f985,plain,
    ! [X2,X0,X1] :
      ( hBOOL(hAPP(hAPP(c_member(X2),X1),X0))
      | ~ hBOOL(hAPP(X0,X1)) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f986,plain,
    ! [X2,X0,X1] :
      ( ~ hBOOL(hAPP(hAPP(c_member(X2),X1),X0))
      | hBOOL(hAPP(X0,X1)) ),
    inference(cnf_transformation,[],[f10]) ).

fof(f1173,plain,
    c_Arrow__Order__Mirabelle_OProf = c_FuncSet_OPi(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),c_Orderings_Otop__class_Otop(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_HOL_Obool)),c_COMBK(tc_fun(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,c_Arrow__Order__Mirabelle_OLin)),
    inference(cnf_transformation,[],[f110]) ).

fof(f1177,plain,
    ! [X2,X3,X0,X1,X4] :
      ( ~ hBOOL(hAPP(hAPP(c_member(X2),hAPP(X1,sK27(X0,X1,X2,X3,X4))),X0))
      | hBOOL(hAPP(hAPP(c_member(tc_fun(X4,X2)),X1),c_FuncSet_OPi(X4,X2,X3,c_COMBK(tc_fun(X2,tc_HOL_Obool),X4,X0)))) ),
    inference(cnf_transformation,[],[f631]) ).

fof(f1723,plain,
    ! [X2,X3,X0,X1] : hAPP(c_COMBK(X3,X2,X1),X0) = X1,
    inference(cnf_transformation,[],[f520]) ).

fof(f1731,plain,
    hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),v_L),c_Arrow__Order__Mirabelle_OLin)),
    inference(cnf_transformation,[],[f528]) ).

fof(f1732,plain,
    ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_Arrow__Order__Mirabelle_Oindi,tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool))),c_COMBK(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,v_L)),c_Arrow__Order__Mirabelle_OProf)),
    inference(cnf_transformation,[],[f532]) ).

fof(f1888,plain,
    ~ hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,c_COMBK(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool),tc_Arrow__Order__Mirabelle_Oindi,v_L))),
    inference(resolution,[],[f985,f1732]) ).

fof(f1919,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( hBOOL(hAPP(hAPP(c_member(tc_fun(X6,X1)),c_COMBK(X2,X3,X0)),c_FuncSet_OPi(X6,X1,X5,c_COMBK(tc_fun(X1,tc_HOL_Obool),X6,X4))))
      | ~ hBOOL(hAPP(hAPP(c_member(X1),X0),X4)) ),
    inference(superposition,[],[f1177,f1723]) ).

fof(f1996,plain,
    ! [X2,X3,X0,X1,X6,X4,X5] :
      ( hBOOL(hAPP(c_FuncSet_OPi(X3,X0,X4,c_COMBK(tc_fun(X0,tc_HOL_Obool),X3,X2)),c_COMBK(X5,X6,X1)))
      | ~ hBOOL(hAPP(hAPP(c_member(X0),X1),X2)) ),
    inference(resolution,[],[f1919,f986]) ).

fof(f2006,plain,
    ! [X2,X0,X1] :
      ( ~ hBOOL(hAPP(hAPP(c_member(tc_fun(tc_prod(tc_Arrow__Order__Mirabelle_Oalt,tc_Arrow__Order__Mirabelle_Oalt),tc_HOL_Obool)),X2),c_Arrow__Order__Mirabelle_OLin))
      | hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,c_COMBK(X0,X1,X2))) ),
    inference(superposition,[],[f1996,f1173]) ).

fof(f2009,plain,
    ! [X0,X1] : hBOOL(hAPP(c_Arrow__Order__Mirabelle_OProf,c_COMBK(X0,X1,v_L))),
    inference(resolution,[],[f2006,f1731]) ).

fof(f2013,plain,
    $false,
    inference(resolution,[],[f2009,f1888]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SCT123+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.06  % Command  : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.37  % Computer : n007.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sun Sep 27 23:43:40 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.10/0.40  Running first-order model finding
% 0.10/0.40  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
% 0.82/0.62  % (1898022)Will run a generic schedule for satisfiability detection.
% 0.82/0.62  % (1898031)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2173539053:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.82/0.62  % (1898028)% WARNING: option uhcvi not known.
% 0.82/0.62  % (1898027)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3041554862_2999 on theBenchmark for (2999ds/0Mi)
% 0.82/0.62  % (1898028)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1127953000:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.82/0.62  % (1898029)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3195105621:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.82/0.62  % (1898030)dis+10_1_sil=32000:sp=arity:random_seed=4248842128:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.82/0.62  % (1898032)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=224352819:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.82/0.62  % (1898033)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=780815659:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.82/0.62  % (1898031)Instruction limit reached! 
% 0.82/0.62  % (1898031)------------------------------
% 0.82/0.62  % (1898031)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.62  % (1898031)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.62  % (1898031)CaDiCaL version: 2.1.3
% 0.82/0.62  % (1898031)Termination reason: Instruction limit
% 0.82/0.62  % (1898031)Termination phase: Saturation
% 0.82/0.62  % (1898031)Time elapsed: 0.030 s
% 0.82/0.62  % (1898031)Peak memory usage: 13 MB
% 0.82/0.62  % (1898031)Instructions burned: 119 (million)
% 0.82/0.62  % (1898041)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1998862500:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.82/0.62  % (1898030)Instruction limit reached! 
% 0.82/0.62  % (1898030)------------------------------
% 0.82/0.62  % (1898030)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.62  % (1898030)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.62  % (1898030)CaDiCaL version: 2.1.3
% 0.82/0.62  % (1898030)Termination reason: Instruction limit
% 0.82/0.62  % (1898030)Termination phase: Saturation
% 0.82/0.62  % (1898030)Time elapsed: 0.057 s
% 0.82/0.62  % (1898030)Peak memory usage: 13 MB
% 0.82/0.62  % (1898030)Instructions burned: 107 (million)
% 0.82/0.62  % (1898032)Instruction limit reached! 
% 0.82/0.62  % (1898032)------------------------------
% 0.82/0.62  % (1898032)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.62  % (1898032)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.62  % (1898032)CaDiCaL version: 2.1.3
% 0.82/0.62  % (1898032)Termination reason: Instruction limit
% 0.82/0.62  % (1898032)Termination phase: Saturation
% 0.82/0.62  % (1898032)Time elapsed: 0.070 s
% 0.82/0.62  % (1898032)Peak memory usage: 14 MB
% 0.82/0.62  % (1898032)Instructions burned: 132 (million)
% 0.82/0.62  % (1898043)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=874511372:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 0.82/0.62  % (1898033)Instruction limit reached! 
% 0.82/0.62  % (1898033)------------------------------
% 0.82/0.62  % (1898033)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.62  % (1898033)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.62  % (1898033)CaDiCaL version: 2.1.3
% 0.82/0.62  % (1898033)Termination reason: Instruction limit
% 0.82/0.62  % (1898033)Termination phase: Saturation
% 0.82/0.62  % (1898033)Time elapsed: 0.089 s
% 0.82/0.62  % (1898033)Peak memory usage: 14 MB
% 0.82/0.62  % (1898033)Instructions burned: 160 (million)
% 0.82/0.62  % (1898044)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=770029901:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.82/0.62  % (1898047)ott-21_1_sil=16000:fs=off:random_seed=950432464:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.82/0.62  % (1898044) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-1898022-1898044"...
% 0.82/0.62  % (1898044)...printing done.
% 0.82/0.62  % (1898044)Refutation found. Thanks to Tanya!
% 0.82/0.62  % SZS status Theorem for theBenchmark
% 0.82/0.62  % SZS output start Proof for theBenchmark
% See solution above
% 0.82/0.62  % (1898044)------------------------------
% 0.82/0.62  % (1898044)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.82/0.62  % (1898044)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.82/0.62  % (1898044)CaDiCaL version: 2.1.3
% 0.82/0.62  % (1898044)Termination reason: Refutation
% 0.82/0.62  % (1898044)Time elapsed: 0.046 s
% 0.82/0.62  % (1898044)Peak memory usage: 14 MB
% 0.82/0.62  % (1898044)Instructions burned: 91 (million)
% 0.82/0.62  % (1898022)Success in time 0.207 s
% 0.82/0.62  % Vampire exiting
%------------------------------------------------------------------------------